{"$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":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"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":"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":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED1","name":"Handler temporal coupling","shortDescription":{"text":"Handler temporal coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/ED1"},{"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":"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":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"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":"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":"FirstRun.FirstRun (cyclomatic 165): FirstRun.FirstRun has cyclomatic complexity 165 (threshold 15). Of this number, 119 points are the body\u0027s own statements and 46 belong to 6 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":"apps/desktop/src/features/onboarding/FirstRun.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d305a650b88091a3e5051ed43f3d6623e3040eac0a770c304de6990ab6bee91"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateWorkflow.UpdateWorkflow (cyclomatic 124): UpdateWorkflow.UpdateWorkflow has cyclomatic complexity 124 (threshold 15). Of this number, 115 points are the body\u0027s own statements and 9 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":"apps/desktop/src/features/settings/UpdateWorkflow.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3501e7ade029cd74854d6193211385a6a7d651247fc6fcdc753a450cc8f105d"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::environment::run_inner (cyclomatic 120): webcodex_cli::environment::run_inner has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"51eae2d3b85a74e97e4992398111b276431df71bbf6cd017393e1bffab0e7475"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagnosticsPanel.DiagnosticsContents (cyclomatic 107): DiagnosticsPanel.DiagnosticsContents has cyclomatic complexity 107 (threshold 15). Of this number, 57 points are the body\u0027s own statements and 50 belong to 15 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":"apps/desktop/src/features/settings/DiagnosticsPanel.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6fd4e137a197a4a0d1d196c5ea29c52cf0aeb7d20dd6d60c4aa4e111d3a0d7"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::environment::parse (cyclomatic 95): webcodex_cli::environment::parse 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":"crates/webcodex-cli/src/environment.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a5866342d9dece6fb41671fc0a385d50bfefa41e53050262f0193ff0867b99"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPanel.SettingsView (cyclomatic 93): SettingsPanel.SettingsView has cyclomatic complexity 93 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 50 belong to 15 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":"apps/desktop/src/features/settings/SettingsPanel.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee2b7951464deb435929aaaadf5aedaea64735249d64d60a750d8238df01911"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::dispatch_computer_request_for_instance (cyclomatic 92): ToolRuntime::dispatch_computer_request_for_instance has cyclomatic complexity 92 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e06a0d163c859de85724f379670e2be50181c00075e304351a9e9ee1914917"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerCapacityPanel.RunnerCapacitySettings (cyclomatic 86): RunnerCapacityPanel.RunnerCapacitySettings has cyclomatic complexity 86 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 44 belong to 10 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":"apps/desktop/src/features/settings/RunnerCapacityPanel.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abaef1c9edb0964b6fadcc015792903c58819be795795606fae6c1f253ae67e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::fake_mcp_gateway::main (cyclomatic 85): webcodex_runner::webcodex_runner::fake_mcp_gateway::main has cyclomatic complexity 85 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8a5ac54f61d46c8a961f31a524e2b1f49e838f2e5f58046182078e467ebe77"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::run (cyclomatic 83): webcodex_cli::run has cyclomatic complexity 83 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff88f68369511ad0f146ba7cc562faf7e821fc7bfd87975f09694adbec8ffe1e"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityPanel.ActivityPanel (cyclomatic 79): ActivityPanel.ActivityPanel has cyclomatic complexity 79 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 34 belong to 12 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":"apps/desktop/src/features/activity/ActivityPanel.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94ead537ac1402a13bd01f262e6ac68f1b2e211ef68fa26329cde390cab930a"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimePanel.RuntimePanelContent (cyclomatic 76): RuntimePanel.RuntimePanelContent has cyclomatic complexity 76 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 37 belong to 10 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":"apps/desktop/src/features/settings/RuntimePanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b74cdf627f91129f0545312239b144f7e63a7b62102135611365c4e47a2e6e"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::git_diff_page_for_source (cyclomatic 75): ToolRuntime::git_diff_page_for_source has cyclomatic complexity 75 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79168511ac1c18370f4b3ed1b8cc0ee751525ab10b208ad539931d90d9b4c0b"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_lsp::fake_server::run (cyclomatic 74): webcodex_lsp::fake_server::run has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edae96385ba75528ed32ddf45957d3c6b6932b23b796b019da616d3740fbcb1"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::projects::managed_worktree::handle_prepare_managed_worktree_operation (cyclomatic 73): webcodex_runner::webcodex_runner::projects::managed_worktree::handle_prepare_managed_worktree_operation has cyclomatic complexity 73 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c54900be38a03749f1a463ee16c978a08b5b3efde638ccf27685e1849a68ab"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceContext.WorkspaceProvider (cyclomatic 72): WorkspaceContext.WorkspaceProvider has cyclomatic complexity 72 (threshold 15). Most of this is not in the body itself: 13 of the 72 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 136, 182, 117, \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":"apps/desktop/src/features/workspace/WorkspaceContext.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a90aeafdba0464aa9cabdab46d9a5f0a9802a4f2dbf96e048ee0d874b2f5485"}},{"ruleId":"D1","level":"warning","message":{"text":"Dr.parseDefaultProperties (cyclomatic 71): Dr.parseDefaultProperties 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":"src/mcp_docx_app.html"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0bfa309aa49ef5ae8c6cae727c19b638c8a466b628bdc87b4d2cfdb82e97fa"}},{"ruleId":"D1","level":"warning","message":{"text":"vi.render (cyclomatic 71): vi.render has cyclomatic complexity 71 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 22 belong to 8 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7177651ada1e51ae8e2ea0a9524de33605bedd3663d5a5de0af031051deb57"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_goal_plan_app.html.validContinuity (cyclomatic 70): mcp_goal_plan_app.html.validContinuity has cyclomatic complexity 70 (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":"src/mcp_goal_plan_app.html"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0cb04c55c7fd4f8ef82c6696284ec3ea99cfed14448bec296e245e98d65862"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::fake_plugin::main (cyclomatic 69): webcodex_runner::webcodex_runner::fake_plugin::main has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7653eba16439ec0b3bb62c1b53ef9b0b5d94225489ab32caa5a1882de117e1b9"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner_registry::reconciliation::validate_snapshot (cyclomatic 68): webcodex_runner_registry::reconciliation::validate_snapshot has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5fc6316cdfb4c06a96e109cbb65d2c3bec9af1e8c93162e3b410f62911a0a0"}},{"ruleId":"D1","level":"warning","message":{"text":"CodingAgentManager::run_turn (cyclomatic 66): CodingAgentManager::run_turn has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/run.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8128ea59091d7c1fa89980e3194fa6bac31ee6849ed84df1c4df159086028fe2"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_lsp::fake_server::write_result (cyclomatic 65): webcodex_lsp::fake_server::write_result has cyclomatic complexity 65 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff68ac2f6b77be3a0387f849b0baf60c0ce5d45eec758f854447d701fe0da22"}},{"ruleId":"D1","level":"warning","message":{"text":"useDesktopWorkspace.useDesktopWorkspace (cyclomatic 65): useDesktopWorkspace.useDesktopWorkspace has cyclomatic complexity 65 (threshold 15). Most of this is not in the body itself: 7 of the 65 points are its own statements and the rest belongs to 13 function literals inside it that branch (lines 109, 59, 209, \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":"apps/desktop/src/hooks/useDesktopWorkspace.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d84bf9c882ddc8749787e4ac754bc83330fa365dd65e1e0aed1a30ad94e9688"}},{"ruleId":"D1","level":"warning","message":{"text":"fill-batch.reconcileFill (cyclomatic 65): fill-batch.reconcileFill has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/campus-application/src/fill-batch.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfcbbb8e349d37eec4755f55371d81aaad944a4a96640e299bbc656b9000be5"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_goal_plan_app.html.validPlan (cyclomatic 65): mcp_goal_plan_app.html.validPlan has cyclomatic complexity 65 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_goal_plan_app.html"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00ce778570898e0f232897b110b9dd44a8708ba0b23ee9fbdc794a1a8e05aa3"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::git::show_changes::parse_show_changes_output_with_observation (cyclomatic 64): webcodex::tool_runtime::git::show_changes::parse_show_changes_output_with_observation has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ff3d3e156d03be242772938589334cf8a9fb329b8c62ba471c34211fbc20bf"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerRegistry::update_job_checked (cyclomatic 63): RunnerRegistry::update_job_checked 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc82194a56b1c0d35d9e79de9390d4d2c577d54f9817c702347af3abdae0bb24"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::mcp_post (cyclomatic 63): webcodex::mcp::mcp_post 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"51462f76b0f4ba2611a126dc83f72e32e9da43b6a7965a5aec9c9880b118326d"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::parse_connect (cyclomatic 62): webcodex_cli::parse_connect has cyclomatic complexity 62 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"14421916f504f62d844816856513fd7b2355200e860750d65f549c467a598bcf"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::runner_operation::decode_operation (cyclomatic 61): webcodex_core::runner_operation::decode_operation has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"88695771fb141e677b4e0a8eff315f641495cdb8d0cc8a9aff7ae0c28c426faf"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionPanel.ConnectionPanel (cyclomatic 61): ConnectionPanel.ConnectionPanel has cyclomatic complexity 61 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 20 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":"apps/desktop/src/features/connection/ConnectionPanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"421c470db446337a3f51eb43557a1b8fe6b5e36107afe058b83fbaed2eb04993"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_result_app.html.renderGitReview (cyclomatic 61): mcp_result_app.html.renderGitReview has cyclomatic complexity 61 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 42 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":"src/mcp_result_app.html"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7becca0220bee431c1e353ace25f2c9b308da194f899e54f17b6bcbe262325f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::projects::lifecycle::handle_project_operation (cyclomatic 60): webcodex_runner::webcodex_runner::projects::lifecycle::handle_project_operation has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"220c4e27a6af051921ee0dabe025415c826c6e1f0444b2e9d8d3e61d43105c2e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::validation_success_projection::sparsify_structured_validation_success_evidence (cyclomatic 60): webcodex::tool_runtime::validation_success_projection::sparsify_structured_validation_success_evidence has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/validation_success_projection.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f33e6b58ed15642fd492de9bb022ac0c037d0ada87b8b475a042c60d42334a"}},{"ruleId":"D1","level":"warning","message":{"text":"CloudflareConnectionCard.CloudflareConnectionCard (cyclomatic 60): CloudflareConnectionCard.CloudflareConnectionCard has cyclomatic complexity 60 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 18 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":"apps/desktop/src/features/connection/CloudflareConnectionCard.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5c639e94b3ab80669034b29ffba3869f859fb4482430a22029e131e7499e0e"}},{"ruleId":"D1","level":"warning","message":{"text":"AboutPanel.AboutPanelContent (cyclomatic 59): AboutPanel.AboutPanelContent has cyclomatic complexity 59 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 21 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":"apps/desktop/src/features/settings/AboutPanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f9e4b628609af1c46e1488d85f78d8c2a2f260fbd2bbece080e46ca1d6d498"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionEditor.ConnectionEditor (cyclomatic 59): ConnectionEditor.ConnectionEditor has cyclomatic complexity 59 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 15 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":"apps/desktop/src/features/connection/ConnectionEditor.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"06438b993bec2140eef14992121c689ee4d005848ca0172d9091ed816ae37c5b"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerRegistry::poll_checked (cyclomatic 58): RunnerRegistry::poll_checked 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":"crates/webcodex-runner-registry/src/polling.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df95b3ea9a313245eb93a60735fb8a06a6e73bef11465caee68f796fb37f5a3"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner_registry::validation::validate_file_request (cyclomatic 57): webcodex_runner_registry::validation::validate_file_request has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd059192a992e8368ca42278a7c86ca6d501e7fff420d448e8e54b56751ac6a2"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerFileAccess.RunnerFileAccess (cyclomatic 57): RunnerFileAccess.RunnerFileAccess has cyclomatic complexity 57 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 32 belong to 6 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":"apps/desktop/src/features/settings/RunnerFileAccess.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdcb36c2c41b6386835a2e598d4121883e8ee9cc565433a892276890ffbc593"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadinessBanner.ReadinessBanner (cyclomatic 56): ReadinessBanner.ReadinessBanner has cyclomatic complexity 56 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 7 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":"apps/desktop/src/features/dashboard/ReadinessBanner.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"daffe3730a4f321641f46669ed8dabe25aa880267bd0d43995e2e8a2f6f86824"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionCard.ConnectionCard (cyclomatic 56): ConnectionCard.ConnectionCard has cyclomatic complexity 56 (threshold 15). Of this number, 48 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":"apps/desktop/src/features/connection/ConnectionCard.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"932638ff6fe482581fa6569a81cbe0e5bbd5ad7cc6fce264c73cb0aeac5b45a1"}},{"ruleId":"D1","level":"warning","message":{"text":"native-config.inspectNativeConfig (cyclomatic 56): native-config.inspectNativeConfig has cyclomatic complexity 56 (threshold 15). Of this number, 52 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":"plugins/agent-browser/src/native-config.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"875d2dc709eade27c8728ccccacd2b2e2ea6ec553ac86ab4af5d14a11f32b88d"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.loadWorkbench (cyclomatic 56): mcp_workbench_app.html.loadWorkbench has cyclomatic complexity 56 (threshold 15). Of this number, 54 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":"src/mcp_workbench_app.html"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad177da4060fa4376963371ecb2681c60e63368d011272518c0a97af12f5eee"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeSurface::admit (cyclomatic 55): RuntimeSurface::admit has cyclomatic complexity 55 (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":"src/mcp/tools/call/surface.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66e5266cb4265c35350b319abdcd2cac1d105543f56c44ee2daed5a596aaba5"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::dispatch_browser_request (cyclomatic 55): ToolRuntime::dispatch_browser_request has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37527db0e769f26414e0986528a11952904f57b9898f32aecdcd9d053ac46df"}},{"ruleId":"D1","level":"warning","message":{"text":"ParsedCall::prepare (cyclomatic 53): ParsedCall::prepare 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":"src/mcp/tools/call.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22f9c9623ac0f9d63ce50d2af20dc3d49791a5515b913ccb4de3fa628f84f1f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workspace::project_overview::validate_project_overview (cyclomatic 50): webcodex_workspace::project_overview::validate_project_overview has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_overview.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fc2b4a1c442ef01860e6bc41ad3df4b59e5179c6ed48c716bf1dd69c0da970"}},{"ruleId":"D1","level":"warning","message":{"text":"ShellJobValidationMetadata::is_valid (cyclomatic 49): ShellJobValidationMetadata::is_valid has cyclomatic complexity 49 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0a69233a020e1cb206aee131e3347ae9a87efa8374684cfb51a06846b8df31"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::patches::edit_plan (cyclomatic 49): webcodex_runner::webcodex_runner::patches::edit_plan 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":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda7b88fdff11d251c9abf61b945565196b1fe3a89e379de3c9abcfed5ca6e9f"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::govern_dispatch (cyclomatic 49): ToolRuntime::govern_dispatch 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":"src/tool_runtime/dispatch/governance.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"777b9a11871556506de43d165313b33b840ee98977ab87cebc55dd3659623ec5"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::apply_text_edits (cyclomatic 49): ToolRuntime::apply_text_edits 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":"src/tool_runtime/files/mutations/text_edits.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"337ba46a5bf09be44e54cb34d85a886de947bec180ee69788f4c8aa816c3d58e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::oauth_http::shared_key_bridge::oauth_shared_key_client_provision (cyclomatic 49): webcodex::oauth_http::shared_key_bridge::oauth_shared_key_client_provision has cyclomatic complexity 49 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/shared_key_bridge.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6af447947ca9ea5d05dedb4cc43dce4bd8f67e05c5012f7848744860254b7b"}},{"ruleId":"D1","level":"warning","message":{"text":"l.beginGroup (cyclomatic 49): l.beginGroup has cyclomatic complexity 49 (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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"1844af882061263301071be91209aedd42e5efda4b2cf9617736705687b3503e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::patches::handle_apply_text_edits_file_request (cyclomatic 48): webcodex_runner::webcodex_runner::patches::handle_apply_text_edits_file_request has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"2015a8efcb45b3d12927d075d3c82b091f6b954e76d54ed16897cf79589e925a"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::text_edits_result::validate_apply_text_edits_success_metadata (cyclomatic 48): webcodex::tool_runtime::files::mutations::text_edits_result::validate_apply_text_edits_success_metadata has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/text_edits_result.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a1ec0701f574d439ba1bd4efb765f3b55db37b356b9bdee254feb874da5273"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_agent_continuation_app.html.projectionSemanticFailure (cyclomatic 48): mcp_agent_continuation_app.html.projectionSemanticFailure has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_agent_continuation_app.html"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"695822e4c503c707271346fc0df42cca7c99a2d96d59abc1cf8c2fa248ad6f61"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::closeout_facts::evaluate_closeout (cyclomatic 47): webcodex::tool_runtime::closeout_facts::evaluate_closeout has cyclomatic complexity 47 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/closeout_facts.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6a68686385851fa2feabcfaf828aedd7314170c0632d07a714a4d5cca6ea09"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_result_app.html.renderValidationSummary (cyclomatic 47): mcp_result_app.html.renderValidationSummary has cyclomatic complexity 47 (threshold 15). Most of this is not in the body itself: 15 of the 47 points are its own statements and the rest belongs to one function literal inside it that branches (line 235). 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":"src/mcp_result_app.html"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fcf84980558cadb412fee77c97fb0ec8c5ed90cf459e788d8356131f05a947"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.workCard (cyclomatic 47): mcp_workbench_app.html.workCard has cyclomatic complexity 47 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 10 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":"src/mcp_workbench_app.html"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7daec3d9375ebb358fa00ba18b46f72025353ff84b90b53960c353096e4fae"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::dispatch::dispatch_request_with_outcome (cyclomatic 46): webcodex_runner::webcodex_runner::dispatch::dispatch_request_with_outcome 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":"crates/webcodex-runner/src/webcodex_runner/dispatch.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"367f7eb6024cf7c23b5aa452877e98d3e383b6db51f39377861c9b937e25c8c5"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::dispatch_browser_tool (cyclomatic 46): ToolRuntime::dispatch_browser_tool 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":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e3d83f5277a5351eae292ee27e1cefcd090cb8e4ebedef737700c40283fd97"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::discovery::compact_tool (cyclomatic 46): webcodex::mcp::discovery::compact_tool 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":"src/mcp/discovery.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b299115f92292700b2d6592c35dc5609cb9c2f8da30a6d9297178414c5e23d"}},{"ruleId":"D1","level":"warning","message":{"text":"ManagedInstructionsPanel.ManagedInstructionsPanel (cyclomatic 46): ManagedInstructionsPanel.ManagedInstructionsPanel has cyclomatic complexity 46 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 25 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/extensions/ManagedInstructionsPanel.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e2446b4478e4a3a7903129f7b5cf777a3c368b65c0677cd2b42e665203cc67"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.updateControls (cyclomatic 46): mcp_workbench_app.html.updateControls has cyclomatic complexity 46 (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":"src/mcp_workbench_app.html"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"230f8624a5c1420dd4b85480a4aa7f341280e12e8aa915b4441b3987a82ef4b3"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::apply_patch_shared::parse_codex_patch (cyclomatic 45): webcodex_core::apply_patch_shared::parse_codex_patch has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_patch_shared.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"0550efbc061aafbc5b80f66c1382007c67c605665aa1d030a6caad3970f0626e"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEnvironment::configure_cloudflare_tunnel_profile (cyclomatic 45): NativeEnvironment::configure_cloudflare_tunnel_profile has cyclomatic complexity 45 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e6a96b93bc553a439c192776c89284b61188be18202eda44a8907ce8181ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::job_manager::admission::validate_runner_job_context_operation (cyclomatic 45): webcodex_runner::webcodex_runner::job_manager::admission::validate_runner_job_context_operation has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f5b3d00628e5f7d6b921c51c653277d8fe31b468fc9f31609d28c0ad892cec"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerRegistry::complete_checked (cyclomatic 44): RunnerRegistry::complete_checked has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/polling.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"994bc29e6806930e526e0e821f7f08c6a0d989e773eee3230ff7637c95e23648"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin.analyzeNodes (cyclomatic 44): plugin.analyzeNodes has cyclomatic complexity 44 (threshold 15). Of this number, 43 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":"plugins/campus-application/src/plugin.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef32cda7c5d663f5937facd23848bf2c9732e8af9da3a63546ff5c7d23d46cf"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::dispatch_file_tool (cyclomatic 43): ToolRuntime::dispatch_file_tool 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":"src/tool_runtime/file_tools.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a25c2540c7ab0ffa9b8fb385f8b223095dd87c93fd61bd64c303385571c2174"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::project_entry_share::share (cyclomatic 43): webcodex::project_entry_share::share has cyclomatic complexity 43 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_share.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bac6a5826ef7ade3eebcf88629b72d0f5dd2bf7e22d5ec92f891986c380b2ab"}},{"ruleId":"D1","level":"warning","message":{"text":"ComputerPermissions.ComputerPermissions (cyclomatic 43): ComputerPermissions.ComputerPermissions has cyclomatic complexity 43 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 21 belong to 8 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/settings/ComputerPermissions.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"083aa840336a3dbb1c553bc81ce3e8aff97ff02e5366835c24c43925e448f2ce"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::detached_job::platform::unix::run_accepted_payload (cyclomatic 42): webcodex_runner::webcodex_runner::detached_job::platform::unix::run_accepted_payload has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3845e68b3a7c5e1e22d5445194ffee5e738147c61f8a5cbae487bb5f2c3dd7"}},{"ruleId":"D1","level":"warning","message":{"text":"Knowledge.refresh (cyclomatic 42): Knowledge.refresh has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/project-knowledge/knowledge.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8292aad7e27a4f88eba0f2a8dec37081a0a2f1bba357153ba90b21f2d18a0bd"}},{"ruleId":"D1","level":"warning","message":{"text":"l.showText (cyclomatic 42): l.showText has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"6572d373a5a85f65aa748584446598a42e7fdc5655b3cf50498a37a878d4900d"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_result_app.html.renderPresentation (cyclomatic 42): mcp_result_app.html.renderPresentation has cyclomatic complexity 42 (threshold 15). Of this number, 40 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":"src/mcp_result_app.html"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7c58a4ae71c3da24e59760316a4fcb858a1c13ecf26eccbd44cb1c9a5cac63"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::detached_job::platform::windows::run_accepted_payload (cyclomatic 41): webcodex_runner::webcodex_runner::detached_job::platform::windows::run_accepted_payload has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed8b2bb87cd663b6dcf422587bb8ea794802c8fc84a23366cd61e509d1ced73"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::transport::stream::serve_registered_stream (cyclomatic 41): webcodex_runner::webcodex_runner::transport::stream::serve_registered_stream has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/stream.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5adf2624fc22d50a1023cb8e186aa2c9f3e38b3fb42a533891f6cde6d9994e"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeResponse::finish (cyclomatic 41): RuntimeResponse::finish 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":"src/mcp/tools/call/response.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f793c072ff41c01dd28b89f9592bc8b6a59c98b5a767ea0e5eb8b94a20e379b"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::current_window_activity (cyclomatic 41): ToolRuntime::current_window_activity 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":"src/tool_runtime/current_window_activity.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94c7ec99978eb743b3b78fefbe64c899a78693ff49e62e012ea00dad2b879ab"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectsPanel.ProjectsPanel (cyclomatic 41): ProjectsPanel.ProjectsPanel 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. This shape REPEATS in the file: one other method here (ProjectsPanel.ProjectsPanel::unregisterSelected) 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":"apps/desktop/src/features/projects/ProjectsPanel.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91af787c9be6385185d95d2f2867a709cc3836f13bbe651e0c8b4424bf0ee84"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopCore::configure_local_setup (cyclomatic 40): DesktopCore::configure_local_setup 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":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed20c170ecb8eb88ef3fb4cf3facb9ecae63cfcc4360e811a15e49fe87d414e"}},{"ruleId":"D1","level":"warning","message":{"text":"JobManager::start_prepared_shell_job (cyclomatic 40): JobManager::start_prepared_shell_job has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eff5168349c7210a7ae1c5d1629397c6205626def7522dc3ad3ec15facd3b46"}},{"ruleId":"D1","level":"warning","message":{"text":"JobManager::start_ssh_shell_job (cyclomatic 40): JobManager::start_ssh_shell_job has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/ssh.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8086d80a929745c9bc3f2ec63e39076eb0dbb12c70d139aa5ecc8e78f1b543"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::shell::execution::execute_configured_command_impl (cyclomatic 40): webcodex_runner::webcodex_runner::shell::execution::execute_configured_command_impl has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/execution.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce780a9436543f6cf1c55c837f8785a34e3b66a744f274ac81e1268057ea71d"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerRegistry::apply_project_inventory_page_checked (cyclomatic 40): RunnerRegistry::apply_project_inventory_page_checked has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/project_inventory.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68fb038e94fbe9451dd8abdef0374fd16219a4bdd929fecdd13d940bb870381"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::job_convergence_record (cyclomatic 40): ToolRuntime::job_convergence_record 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":"src/tool_runtime/model_ergonomics_telemetry/job_convergence.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac53c29e1430bdfdda68a1394bb932809b9ace875a307f756aa1e1dc41a56f18"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::startup_brief::enforce_hard_size_limit (cyclomatic 40): webcodex::tool_runtime::startup_brief::enforce_hard_size_limit 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":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f5a682c57fccbaa65ea7ec52e6d11461d3fa19f7d934ffef3e1330a226dc2c"}},{"ruleId":"D1","level":"warning","message":{"text":"control (cyclomatic 40): control 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":"extensions/browser-bridge/worker.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e316136e99872454cff78c7c25152622ab1ddc5627cc98de0e5af515e771f3e"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionRuntimes::monitor (cyclomatic 39): ConnectionRuntimes::monitor 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":"apps/desktop/src-tauri/src/connections.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a26f9db00ce75d4d0c5e382adffa1acf29a47bbd4f13b0f1ccbddb6d15d3c95"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::unified_update::source::verify_source_manifest_for_flavor (cyclomatic 39): webcodex_environment::unified_update::source::verify_source_manifest_for_flavor has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/source.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1d046019c54899e9cac499c0f65fa8d01ace3dc661a77d01dd8457c32254b2"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::transport::polling::run_polling_session (cyclomatic 39): webcodex_runner::webcodex_runner::transport::polling::run_polling_session has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/polling.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51e72048617f9c9fc8d4d606a1d4cbd8e599d3f15680dee7011ace5bd375629"}},{"ruleId":"D1","level":"warning","message":{"text":"AdminProjectLifecycleService::mutate_authorized_core (cyclomatic 39): AdminProjectLifecycleService::mutate_authorized_core 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":"src/admin_project_lifecycle.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"005658b479d9ca52b3a1ae6e0023337978bd8cf8efffc4249caa882178ab984f"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::dispatch_computer_control_action (cyclomatic 39): ToolRuntime::dispatch_computer_control_action 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":"src/tool_runtime/computer_tools/control.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0ac66ce842eef6b2bbd234effffd8f29f635fc9f9d92015ef62492d57b0c29"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.renderWorkbench (cyclomatic 39): mcp_workbench_app.html.renderWorkbench has cyclomatic complexity 39 (threshold 15). Of this number, 38 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":"src/mcp_workbench_app.html"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8795653b8bb597ddb40fbc7e7c52534206341687da4309e658f02a1a2c5615d"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState::local_update_status (cyclomatic 38): AppState::local_update_status 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":"apps/desktop/src-tauri/src/state/updates/view.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de6ac0719af0cd15c9fccc1bfc9af62c84da15f87a0adf160663818224dd766"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::parse_runner_install_service_with_identity (cyclomatic 38): webcodex_cli::parse_runner_install_service_with_identity 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":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"64451f3521706483556a37a66140b1ddb456e00244c958e1455e5aec0bfdf6d3"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::plugin::preflight_plugin_schema_node (cyclomatic 38): webcodex_core::plugin::preflight_plugin_schema_node has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/plugin.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d294ed7c5aff92f2bd3a9fda13ebb66111977e7d44c91dd0136e186003b85f2"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEnvironment::reconcile (cyclomatic 38): NativeEnvironment::reconcile has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11d620da31a52c03577a85481df5a90602c9e293888856074ee0e77d0db0990"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::migration::migrate_legacy_environment (cyclomatic 38): webcodex_environment::migration::migrate_legacy_environment has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2069fd80d2660a9d8dece46d4b664139cbebbd8ae3569e98296a7e4131ad4920"}},{"ruleId":"D1","level":"warning","message":{"text":"JobManager::start_shell_job (cyclomatic 38): JobManager::start_shell_job has cyclomatic complexity 38 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/local_shell.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f78a3bfffc05834d3c4047a1058ba1865044f6689cc1647837467dd3e000a8a"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::inspection::ooxml_mime_from_file (cyclomatic 38): webcodex_runner::webcodex_runner::artifacts::inspection::ooxml_mime_from_file has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8343fe36083d94eb4dd4f8c642eee2dd6e2b5c91d506f3d4ad3a1de753fdff"}},{"ruleId":"D1","level":"warning","message":{"text":"PendingDispatchFence::synchronous_rejection (cyclomatic 38): PendingDispatchFence::synchronous_rejection has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/dispatch_fence.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95ee98db7c1e21131adedc5a14fc9b6430154cb038ca21a2cbf3418433f9ed8"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::observe_jobs_for_auth (cyclomatic 38): ToolRuntime::observe_jobs_for_auth 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":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"4007275d057d26086116aebdf9aeec55500409c153d4d38c23624d098f4e5faf"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::project_entry_share::parse_share_options (cyclomatic 38): webcodex::project_entry_share::parse_share_options has cyclomatic complexity 38 (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":"src/project_entry_share.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99fde2cc8a1b4d290bd7df67741543745142d36f90d39ac995934714dbab3bf"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_computer_app.html.renderToolResult (cyclomatic 38): mcp_computer_app.html.renderToolResult has cyclomatic complexity 38 (threshold 15). Of this number, 36 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":"src/mcp_computer_app.html"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"32008fa4284904dfb066a2cc4bc2bc315437b1c5e68ae3ed1581a2b22b140504"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_spreadsheet_app.html.load (cyclomatic 38): mcp_spreadsheet_app.html.load 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":"src/mcp_spreadsheet_app.html"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a166ade0fa51983a558b4c8c720b0d4773f0ebf834397d18057dd95b3fe6d2"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.renderExecutors (cyclomatic 38): mcp_workbench_app.html.renderExecutors has cyclomatic complexity 38 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 10 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":"src/mcp_workbench_app.html"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3b006ba33c4616d7d5ef17d4c5ed4fdc318c758a3fd219889cc7a30b96ac72"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::connect::oauth::run_oauth_connect (cyclomatic 37): webcodex_cli::webcodex_cli::connect::oauth::run_oauth_connect has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"1036c0d3a7eadde4c31e49fcefac1d5051f2f13a904248dd0dbc07aec2ea718f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::browser::handle_browser_operation (cyclomatic 37): webcodex_runner::webcodex_runner::browser::handle_browser_operation 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":"crates/webcodex-runner/src/webcodex_runner/browser.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81cef858427cb748091a16e8cbc272a234dbf18ada9708b91e068d17cf0a454"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_format::format_candidates_with_deadline (cyclomatic 37): webcodex_runner::webcodex_runner::project_format::format_candidates_with_deadline has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_format.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dace2b8ab0536e5c83b1bd43020b9699c93458d2ed81d738cfa6b38cb974cbc"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerRegistry::register_session (cyclomatic 37): RunnerRegistry::register_session has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a632c5fc37e67cbe51373d9c26a9be2dde3521041cd6c2b440022004786eac8"}},{"ruleId":"D1","level":"warning","message":{"text":"AuthMiddleware::handle (cyclomatic 37): AuthMiddleware::handle 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":"src/auth/middleware.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a8d57a0e6d176e1dd0959b412364c8c8a59fac48308b4b785a8c781bd3b806"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::git_review_summary_for_scope (cyclomatic 37): ToolRuntime::git_review_summary_for_scope 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":"src/tool_runtime/git_review.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0090fe927fd5b08eed818c6830ef286c9ccb33ec57e220673ed2374a6da2820"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::run_shell_with_contract_for_resource (cyclomatic 37): ToolRuntime::run_shell_with_contract_for_resource has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/shell.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"76125f1858fef1bebcc2abce7020aee977bbd954ee7b47a0f7e52457d509097b"}},{"ruleId":"D1","level":"warning","message":{"text":"CodingAgentsPanel.CodingAgentsPanel (cyclomatic 37): CodingAgentsPanel.CodingAgentsPanel has cyclomatic complexity 37 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 21 belong to 9 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":"apps/desktop/src/features/extensions/CodingAgentsPanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb37f94d158144c1cfd9ec0dc855fa418ef7f4f9670a33fdd562baf7fe43808"}},{"ruleId":"D1","level":"warning","message":{"text":"App.DesktopApp (cyclomatic 37): App.DesktopApp has cyclomatic complexity 37 (threshold 15). Of this number, 36 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":"apps/desktop/src/App.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5ef44dc025c01bedeee8f6ea983ebc4b3b907d1f45c319237943766841517c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::parse_login (cyclomatic 36): webcodex_cli::parse_login has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbc8d410a9dbe7564c0c728115cd4420d759b64aed4c73e64ef334239da31ec"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::controller::run_controller_command (cyclomatic 36): webcodex_cli::webcodex_cli::controller::run_controller_command has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a50204c3b126f7fc10a018ecf3e4b326f474ccfdb92344f871af5bfd7048dd"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::transfer_resolved_project_artifact (cyclomatic 36): ToolRuntime::transfer_resolved_project_artifact 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":"src/tool_runtime/artifact_transfer.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b97894374c96d7d3d00c5740587859b4afffbfcb6c333b0d761856d811deff"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::start_coding_workflow (cyclomatic 36): ToolRuntime::start_coding_workflow has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_task/startup.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"82753fa5b452a28e55aad0ae0564ea9bddc9fb853fc1fb4dc94ef2e5d8682310"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::text_edits_result::sanitize_apply_text_edits_model_recovery (cyclomatic 36): webcodex::tool_runtime::files::mutations::text_edits_result::sanitize_apply_text_edits_model_recovery 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":"src/tool_runtime/files/mutations/text_edits_result.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"25820ad62fdf99fa3718cfcd8e6c4a1668aa888c7a4be0bbb1e518368a3d7b06"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_result_app.html.renderGitChanges (cyclomatic 36): mcp_result_app.html.renderGitChanges has cyclomatic complexity 36 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 8 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":"src/mcp_result_app.html"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66e8896a741b3f4451a0855605fc52125e8d98d405992408c5f6ac8a2358dce"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::cli_action (cyclomatic 35): webcodex_cli::cli_action has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9eb735ffc366e34acc7223b6d3d078acdd0a60cb587e336a610f66a30e90a4"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::coding_agent::validate_coding_agent_run_snapshot (cyclomatic 35): webcodex_core::coding_agent::validate_coding_agent_run_snapshot has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74dbfb5ce9aad0fa5824e5118e6efa23ab779f4246bb912c5c6e107b10891b6"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEnvironment::apply (cyclomatic 35): NativeEnvironment::apply has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b03be27ccc910f3f3624aa04b17954569a71f4a3884b99fc2ed7c48301ad30"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerRegistry::enqueue_computer_checked (cyclomatic 35): RunnerRegistry::enqueue_computer_checked has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"a553bec318eae2fcda83aa8fa92367f499a9f6c275bca698aeac4c4e86829990"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::finish_coding_task (cyclomatic 35): ToolRuntime::finish_coding_task has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_task/closeout.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c449417272fb9f6fbe6bb21e032a5bae06308c37d97e12c536433cf7f91d98"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::enrich_workbench_execution (cyclomatic 35): ToolRuntime::enrich_workbench_execution 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":"src/tool_runtime/workbench_execution.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f31cba74ef7917a09ca5124273294ee73ca4bb286166dc28ba8e4eed98762d"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::patch_result::validated_apply_patch_match_rejection (cyclomatic 35): webcodex::tool_runtime::files::mutations::patch_result::validated_apply_patch_match_rejection has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/patch_result.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7da65bb46f6265c46283cdd133801c5e3b2f1d8c95bef31481e2fc1d5d95c55"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::observe_jobs::sparse_success_item (cyclomatic 35): webcodex::tool_runtime::observe_jobs::sparse_success_item 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":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf48ec896c3de619b5bfc406c2178fd51baa903c6a9f0a2fd24b9a6d2a024f81"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::upgrade::verify_upgrade_candidate (cyclomatic 34): webcodex_environment::upgrade::verify_upgrade_candidate has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"19881d5227236118dcfe9b469f804f6f425437c6d227095e87e34c3ac1ae85ba"}},{"ruleId":"D1","level":"warning","message":{"text":"JobStartPlan::admission_requirements (cyclomatic 34): JobStartPlan::admission_requirements has cyclomatic complexity 34 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates/start.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd83687ed75bd39e78f3caba0db933503fd8e4503ee01047fecb008eb6c9511"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::session_handoff_observation (cyclomatic 34): ToolRuntime::session_handoff_observation 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":"src/tool_runtime/handoff.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf19a061bfccecd5a9ccca368c2f00c06db9964938333fa636f5e3924553e892"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::submit_workbench_work (cyclomatic 34): ToolRuntime::submit_workbench_work 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":"src/tool_runtime/workbench_execution.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"526fef7e67a843a870f73308ac430e250826799379feaab64bce7ceb40a66faf"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::coding_task::projection::project_work_on_project_output_inner (cyclomatic 34): webcodex::tool_runtime::coding_task::projection::project_work_on_project_output_inner 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":"src/tool_runtime/coding_task/projection.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca0b2bba2c2632b1d4fdbfa9bb17ebf1d07a3a2d9ec2dec1e5c3192f3c2ee1b"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectRows.ProjectRow (cyclomatic 34): ProjectRows.ProjectRow has cyclomatic complexity 34 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 10 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":"apps/desktop/src/features/projects/ProjectRows.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0544783376264fa799d7430e00c91a472cd338e1bf451c4439b6184e5de45beb"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeConsolePanel.RuntimeConsolePanel (cyclomatic 34): RuntimeConsolePanel.RuntimeConsolePanel has cyclomatic complexity 34 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 10 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/console/RuntimeConsolePanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c4467e5663789d7cf88064c6b2821d906289da1274a0e8780093e14154e8f2"}},{"ruleId":"D1","level":"warning","message":{"text":"execute (cyclomatic 34): execute has cyclomatic complexity 34 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 1 belongs 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":"plugins/agent-environment/src/bridge.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c849e530af470e59c5871005bff366e89390f26a8f87bfff0ef3ced6aa22ef1"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::runner_operation::decode_job_operation (cyclomatic 33): webcodex_core::runner_operation::decode_job_operation has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a09f006b26a55ba867e049f7a4a1e23841b2f74158c7baf3326cb5307285d1c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_begin (cyclomatic 33): webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_begin has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f99cfd0987709123e6e3df727575f7377e46d170554c94c4a7f4c038cedb0a"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::goal_activity_observation_at (cyclomatic 33): ToolRuntime::goal_activity_observation_at 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":"src/tool_runtime/goal.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25fe0a34313131405526d62d2b46927a3afb20c95979793bbd1e96eae2f2bb9"}},{"ruleId":"D1","level":"warning","message":{"text":"install.fetchToFile (cyclomatic 33): install.fetchToFile has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 7 of the 33 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 551, 506, 486, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/webcodex/install.js"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb19eaa259ba2b1e40ea417a542701edc7fa4e5a5361f8af36f5cc524bfc765"}},{"ruleId":"D1","level":"warning","message":{"text":"fill-batch.operation (cyclomatic 33): fill-batch.operation has cyclomatic complexity 33 (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":"plugins/campus-application/src/fill-batch.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c505f55bc55ceed864d8011a7d25dedf683d8a1c46b0dd4ad42a1558f58120"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::plugin::plugin_schema_matches (cyclomatic 32): webcodex_core::plugin::plugin_schema_matches has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/plugin.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e19006fca43a88bad8d00b9c2a4fbb4f2e465dab84919c12b14169d67d0987"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::runner_operation::encode_operation (cyclomatic 32): webcodex_core::runner_operation::encode_operation 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. This is NOT this file\u0027s highest cyclomatic complexity: RunnerOperation::wire_kind (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d7437ee87b7709daddfe1e1c2b63d9575a12d9bfd4e4fd80d9007fccb42430"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::validation_identity::structured_validation_target_identity (cyclomatic 32): webcodex_core::validation_identity::structured_validation_target_identity has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_identity.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9778f9645b8d7f315dc6118139d71e2869737969c2d7872c9b2242f0080e9cb"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEnvironment::upgrade_rollback_with_target (cyclomatic 32): NativeEnvironment::upgrade_rollback_with_target has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"570f3ca579c2dcb79feeb6d1b851264015a16fb02a105d1b396f4d5dd75c0f72"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::config::validate_acp_config (cyclomatic 32): webcodex_runner::webcodex_runner::config::validate_acp_config has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1ae47a61f2c27fb11d9f0f1f94cbb513271c4efe6e6a3fa82c9aeeae9a0895"}},{"ruleId":"D1","level":"warning","message":{"text":"PersistedSessionRecord::into_record (cyclomatic 32): PersistedSessionRecord::into_record has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/persistence.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbfa0720f9fbcedb5624682f5b77c854afd4ac583e49e12d1e3117e1585edf6"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::cli::text::native::workspace (cyclomatic 32): webcodex::mcp::cli::text::native::workspace 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":"src/mcp/cli/text/native.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"885fa71e249be6f88c2bc7fba5ccbba9798e264e55116d52cae3380f6967db8a"}},{"ruleId":"D1","level":"warning","message":{"text":"Adapter.handle (cyclomatic 32): Adapter.handle has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/model_gateway/adapter.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e72f875d315128b0552d2b215e959733fcda83164a3696f03cc6c93f91fd27"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeBackend.run (cyclomatic 32): NativeBackend.run 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":"plugins/agent-browser/src/backend.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d23344ba12873d22583cb783d43a141c10166ba51259e3678ede84a61f62259"}},{"ruleId":"D1","level":"warning","message":{"text":"form-cache.deriveMappings (cyclomatic 32): form-cache.deriveMappings has cyclomatic complexity 32 (threshold 15). Of this number, 29 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":"plugins/campus-application/src/form-cache.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"691f8e3aad5247d3f9b4ca4d6c9ce141ea2d35b6a8927283bbbc0e13ab2f8c1b"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.loadDirectory (cyclomatic 32): mcp_workbench_app.html.loadDirectory 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":"src/mcp_workbench_app.html"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35ce5f5fef54fde065d6b2f9a63c5645040fb8396aba3513a44cda117b6f301"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_code_mode::runtime::execute_with_termination_mode_inner (cyclomatic 31): webcodex_code_mode::runtime::execute_with_termination_mode_inner has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-code-mode/src/runtime.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de2176d8058d8d9c510674b56b011cbc5f4b412a977ebcf59c719f1870ac712"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEnvironment::configure_tunnel_profile_under_lock (cyclomatic 31): NativeEnvironment::configure_tunnel_profile_under_lock has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ebf297eb62466154e04760454dbc309c3497010eacee0e7a72e661c2cdb9ea"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSupervisor::request_with_timeout_and_encoding_inner (cyclomatic 31): LspSupervisor::request_with_timeout_and_encoding_inner has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"716c8d7960bb25b50fef8aab439dac725053c83c79aa77f56aa0b95ce37d7603"}},{"ruleId":"D1","level":"warning","message":{"text":"TunnelClient::poller (cyclomatic 31): TunnelClient::poller has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/poller.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1ff3ad73f9dec27ed0852fcd43ead8571660bed0e14a3cb3fe101266c8c43e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::files::handle_skill_read_file_request (cyclomatic 31): webcodex_runner::webcodex_runner::files::handle_skill_read_file_request has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/files.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"4950190c3932795feb8b7d9f0ca76d26f4998ba580ab0a6f9aff43ea66e405cd"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::projects::registration::handle_resolve_or_register_project_operation (cyclomatic 31): webcodex_runner::webcodex_runner::projects::registration::handle_resolve_or_register_project_operation has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/registration.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb85c11f36bd2d91da2e60733ad7d503a59fa70e1ecb53627a75e8b54e23a81b"}},{"ruleId":"D1","level":"warning","message":{"text":"Database::post_conversation_message (cyclomatic 31): Database::post_conversation_message has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"838315d711c8e40b1ccedf526364425f2da22e3fb64e22711bac338c930e07b1"}},{"ruleId":"D1","level":"warning","message":{"text":"Database::read_goal_stall_continuity (cyclomatic 31): Database::read_goal_stall_continuity has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal_stall.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6197e61ac75219471e8a0186602c14e67ddd9991ba0342a46bac68f6042bc0a"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginToolCall::validate (cyclomatic 31): PluginToolCall::validate has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/input_types.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bdb019efa80f890bbbb88c2ffd64eb2a1cce7fe65972658f215a766216d646"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_tool_runtime_contracts::tool_audit::execution_identity::canonical_cargo_validation_target (cyclomatic 31): webcodex_tool_runtime_contracts::tool_audit::execution_identity::canonical_cargo_validation_target has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/execution_identity.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fbd1b47eda9acee9acee19a11cac7854d4d652c51707b2b4df87da142c3798"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::search_webcodex_resources (cyclomatic 31): ToolRuntime::search_webcodex_resources 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":"src/tool_runtime/resource_references.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"2595c69da9117391ff922a3298f726e5ed2b5f158bb3620eb8403fdd9fa39196"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin.handle_frame (cyclomatic 31): plugin.handle_frame 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":"plugins/project-knowledge/plugin.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60247dcb8c3befbd04775a1ab794aadf59979c5c98d9ab8334a28e3a6537a71"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerDevices.RunnerDevices (cyclomatic 31): RunnerDevices.RunnerDevices has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 3 of the 31 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 23, 12, 17). 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":"apps/desktop/src/features/projects/RunnerDevices.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c6776c564f764a41948101ba7f8dfc181266255bc7a7c194f6d4f037d6d792"}},{"ruleId":"D1","level":"warning","message":{"text":"AddDevice.DeviceInvitationDialog (cyclomatic 31): AddDevice.DeviceInvitationDialog has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 11 of the 31 points are its own statements and the rest belongs to 6 function items inside it that branch (create, copy, validCode, \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":"apps/desktop/src/features/projects/AddDevice.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a81c1d220c0d76ad98110cd5a887cd84c71f064cd39c90755b17b80bf91d6a"}},{"ruleId":"D1","level":"warning","message":{"text":"Rt.#a (cyclomatic 31): Rt.#a 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. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ead71c4fdb4f30843732476d29a50a8e77f7ecb9eeb12bd427d29de48dbd14"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.renderGoalPreview (cyclomatic 31): mcp_workbench_app.html.renderGoalPreview has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. 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":"src/mcp_workbench_app.html"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9577d4cd7802253c674a3e5bde6229afdbafaddedd31544e58059cbdad27c0"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopCore::configure_environment (cyclomatic 30): DesktopCore::configure_environment 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":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3ddbe6516d5a413b356b2231f217f723436eefe5ce906c1ddd33dbdc2edd6c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_browser::cdp::infer_control_container_labels::visit (cyclomatic 30): webcodex_browser::cdp::infer_control_container_labels::visit has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":3161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28f92e305d356167bf9ec415f67860d180b29248f4c0af47de6c1f9a245a605"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::project_build::canonical_project_build_process_with_manager (cyclomatic 30): webcodex_core::project_build::canonical_project_build_process_with_manager has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_build.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6f411ecbf17e0ae4c89d88a8ae7004d7a33607e7a8b44be69f1f6849a0a010"}},{"ruleId":"D1","level":"warning","message":{"text":"CodingAgentManager::initialize_session (cyclomatic 30): CodingAgentManager::initialize_session has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d76cc1e9f1eb1eb6f84876a7c8b448c2f902574d62bf4f60d5f1f8e084a837"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::inspection::ooxml_mime (cyclomatic 30): webcodex_runner::webcodex_runner::artifacts::inspection::ooxml_mime has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf6383583bafdc8ea3cd2c7daed5ec19071b2c97134dabbe4dce2855b1508f3"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::computer::handle_computer_operation_with_runtime (cyclomatic 30): webcodex_runner::webcodex_runner::computer::handle_computer_operation_with_runtime has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/computer.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6c07ca4ff729687f5493976acf0f1c37c9a8dd632d4202be6d6fc36452737d"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::projects::lifecycle::handle_project_lifecycle_operation (cyclomatic 30): webcodex_runner::webcodex_runner::projects::lifecycle::handle_project_lifecycle_operation has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"faba1d6e99e4a596d8c64d029cf28d44798da4693b907fecbb1023d4b27781e6"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::validation::execute::run_bounded (cyclomatic 30): webcodex_runner::webcodex_runner::validation::execute::run_bounded has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/execute.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cb829e583503b05604d686b7225e7aa77bd8dae146676a6d9ed455bb48b74e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_tool_contracts::registry::output_schemas::base_output_schema_for_tool (cyclomatic 30): webcodex_tool_contracts::registry::output_schemas::base_output_schema_for_tool has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0cfa0f6728fe5ca7867f95e520b3aced53a85bcc4b940a4f954f6388e9b08f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_tool_contracts::registry::output_schemas::jobs::output_schema_for_tool (cyclomatic 30): webcodex_tool_contracts::registry::output_schemas::jobs::output_schema_for_tool has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad74305ddac0579cf8b6a9a340387cb333d689854f098a11349c9a48f82639b"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_tool_runtime_contracts::tool_audit::result::canonical_execution_audit_result_for_tool (cyclomatic 30): webcodex_tool_runtime_contracts::tool_audit::result::canonical_execution_audit_result_for_tool has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/result.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7824deed0af7a8e354cd235d2a531a92ef534e9edb5ce8c6b0e5fd95e0a82a3"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workspace::project_overview::build_project_overview (cyclomatic 30): webcodex_workspace::project_overview::build_project_overview has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_overview.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3457a3e6a32e855e8c98e138a285735ffe18829b96c97504504ec7fce267de5d"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::dispatch_computer_observation (cyclomatic 30): ToolRuntime::dispatch_computer_observation 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":"src/tool_runtime/computer_tools/observe.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"99723fb8dfcc01fda31dfb7ca34f2065ff6168a2d8bd3491c8216b9be2ce29fe"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::goal_plan_recheck_attention_with_clock (cyclomatic 30): ToolRuntime::goal_plan_recheck_attention_with_clock has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/goal.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"4108287e63f46931383744a762c3213354d9d112eccf458057da75ac1fae12df"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::handle_mcp_request_for_surface (cyclomatic 30): webcodex::mcp::handle_mcp_request_for_surface 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":"src/mcp.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"132498c848fac142c88457a13422da3b4a4354189164e9f53f7b8f4c2b689b4c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::cli::text::project_response (cyclomatic 30): webcodex::mcp::cli::text::project_response 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":"src/mcp/cli/text.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6357e087e9c0e47c800246763711ccf87142fc00c186253f9320e3c826fdb9f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::git::show_changes::set_show_changes_verdict (cyclomatic 30): webcodex::tool_runtime::git::show_changes::set_show_changes_verdict has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb000d507a75e6e202e1205d4618499ec6804f4c884908570f909d0191dccd8b"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowActivityDetail.WindowActivityDetail (cyclomatic 30): WindowActivityDetail.WindowActivityDetail has cyclomatic complexity 30 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 12 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/activity/WindowActivityDetail.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8dc3dd72179a71ca7547cec29c31a0e8e24a66826e6a7099b08bd51ae5a032"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowSessionDetail.WorkflowSessionDetail (cyclomatic 30): WorkflowSessionDetail.WorkflowSessionDetail has cyclomatic complexity 30 (threshold 15). Of this number, 19 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":"apps/desktop/src/features/activity/WorkflowSessionDetail.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef79ecc97760cbc9f05591b08972984dd47dd1f3fd3b13bb2cdd38848ae99e56"}},{"ruleId":"D1","level":"warning","message":{"text":"Ve._bindResetFormAction (cyclomatic 30): Ve._bindResetFormAction has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 12 of the 30 points are its own statements and the rest belongs to one function literal inside it that branches (line 690). 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. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ce1b104be9bce9c959a31fa48791b12d98c6dd27b03271e60fd31a4083ba16"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.saveGoal (cyclomatic 30): mcp_workbench_app.html.saveGoal has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23724e05d502618a8933e74b83330b6cfd83224c9874380b7e8ea319a15d51b"}},{"ruleId":"D1","level":"warning","message":{"text":"State::receive (cyclomatic 29): State::receive has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/bridge.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53c56b182c4cc222c6c34fc7c135a7e7c541560ed0e2e818d2ea0a67001228b"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::project::run_project_activate (cyclomatic 29): webcodex_cli::webcodex_cli::project::run_project_activate has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b1bb9c9993af21efca4768584072114898f2a16a5f86b47f342d0d9c3f18bd"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEnvironment::doctor (cyclomatic 29): NativeEnvironment::doctor has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"312076bec8b02c0176f5fa779ccd080135ab2770b1c43bb8aa53065639832160"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::parse (cyclomatic 29): Config::parse has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/bin/webcodex-tunnel/config.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05d64355a9b54e533e1978d75fbc7e1227c30ebd93b5510bb8836899a5bc0b4"}},{"ruleId":"D1","level":"warning","message":{"text":"SkillStore::install (cyclomatic 29): SkillStore::install has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"029bbde203a08fe085d38402b0f09d4592a4329ba9316a1044fd0ba9d9290d0c"}},{"ruleId":"D1","level":"warning","message":{"text":"OAuth2Verifier::verify_for_ingress_sync (cyclomatic 29): OAuth2Verifier::verify_for_ingress_sync 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":"src/auth/tokens.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"8902722aa33aec4411643f67f5db21a46afc8e740ce691fea77c4c99ff6df8ed"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::resolve_coding_startup_project (cyclomatic 29): ToolRuntime::resolve_coding_startup_project 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":"src/tool_runtime/coding_task/project.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02f8bbae52943e2a500d07e13b8fd341bc9c82b07967de11124eb9f706834aa"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::read_project_artifact (cyclomatic 29): ToolRuntime::read_project_artifact 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":"src/tool_runtime/files/artifacts.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"af242a535b0605dda3122153aa0f7882d26cf8669db5af7104186e2a10336fbd"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::authorize_runner_tool (cyclomatic 29): ToolRuntime::authorize_runner_tool 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":"src/tool_runtime/runner_authorization.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d724c79bffa9c9903201e2602e64bcdccb6dc093c8a1b8fead196711acb1ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::cli::text::native::execution (cyclomatic 29): webcodex::mcp::cli::text::native::execution 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":"src/mcp/cli/text/native.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce518097ff02d4933a21d424fced4d5f734ac3d46d0d29b70b5baccb627780b"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::acceptance_evidence::acceptance_evidence (cyclomatic 29): webcodex::tool_runtime::acceptance_evidence::acceptance_evidence has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/acceptance_evidence.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"049863b1bcc51eadcccbe260876fa5ee15fff13be442a46a3aa4d980d70cdba4"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::jobs::validation_job_result_with_policy (cyclomatic 29): webcodex::tool_runtime::jobs::validation_job_result_with_policy 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":"src/tool_runtime/jobs.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"044c633a5426bf9a75348dce106a46b29e5c30542c877904916b926833d85184"}},{"ruleId":"D1","level":"warning","message":{"text":"CodingAgentEditor.CodingAgentEditor (cyclomatic 29): CodingAgentEditor.CodingAgentEditor has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 8 of the 29 points are its own statements and the rest belongs to 5 function items inside it that branch (submit, a function literal at line 52, chooseExecutable, \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":"apps/desktop/src/features/extensions/CodingAgentEditor.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c15fa4842af9f00da1565c3d7227e79f691ac582a444d3980dc20aa5126dd2"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_result_app.html.renderValidationRun (cyclomatic 29): mcp_result_app.html.renderValidationRun has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 10 of the 29 points are its own statements and the rest belongs to one function literal inside it that branches (line 179). 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":"src/mcp_result_app.html"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"004f0c6ea522b50e8e43be86f4b9bcb986ea52801c885a3bb08ca383ab586546"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.loadList (cyclomatic 29): mcp_workbench_app.html.loadList has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67109b753b78505892e76229fc5a50e5507de926020b46406bf314cedb1c1de"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::controller::parse_controller_command (cyclomatic 28): webcodex_cli::webcodex_cli::controller::parse_controller_command has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f58b04cde7ff735d466fec36fb7d6a95db3f1087214b704c2e1f2fcb6999c4f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_computer::platform::windows::accessibility::uia_control_role (cyclomatic 28): webcodex_computer::platform::windows::accessibility::uia_control_role has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/accessibility.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"300e8340d398ad252ad98694e42d94a9c5423c78d0fe64f756b76bd99d2895e2"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::inventory::inspect_environment_paths (cyclomatic 28): webcodex_environment::inventory::inspect_environment_paths has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/inventory.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c1a21d5aff3e26e9730efc6eed1b194be1a7954ed66b145691c8dcc0a01aa3"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::tunnel_recovery::recover (cyclomatic 28): webcodex_environment::tunnel_recovery::recover has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel_recovery.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e59448697ebf1dc0109eb48c901b31bbfd80e3c69096daea2e68089ecf5939"}},{"ruleId":"D1","level":"warning","message":{"text":"JobManager::start_structured_job (cyclomatic 28): JobManager::start_structured_job has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/process.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbfc94f8c755a65512b2b4b569c6eeaa323b0d622edfbc36f8469c660629d9b"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner_registry::job_updates::validate_validation_progress (cyclomatic 28): webcodex_runner_registry::job_updates::validate_validation_progress has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2653c7b04808a031790e6d265510f6539001dec1c17a0dc8046402b4596290"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner_registry::validation::validate_project_summary (cyclomatic 28): webcodex_runner_registry::validation::validate_project_summary has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"859f1b54ca58724bb93d6305de977abd879f4a6d09135d2a99bbd754ddb7c5fd"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolCall::from_tool_name_with_normalization (cyclomatic 28): ToolCall::from_tool_name_with_normalization 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 is NOT this file\u0027s highest cyclomatic complexity: ToolCall::tool_name (cyclomatic 194) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/parsing.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a64532c701172f5b0eab2c9dac2b17abf5bd069e64ef7b8970780bad9fe0c1"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::work_result_files (cyclomatic 28): ToolRuntime::work_result_files 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":"src/tool_runtime/changes.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e6e8e89698a8d4c1a1f651f5460ec5c4084e2ad092ef50b90ee706971e97c2"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::run_process_with_contract_mode (cyclomatic 28): ToolRuntime::run_process_with_contract_mode has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/process.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"449cff2decf172ca0fe3ca27c9bd56f1baca34123a9fa40d8540fe9e470b5ca9"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::read_workbench_state (cyclomatic 28): ToolRuntime::read_workbench_state 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":"src/tool_runtime/workbench_state.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb9b662a5577001e8286a49f5233afc3acfcd107c3f0f0936fe612a402ee004"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::model_surface::project_suggested_tool_calls_in_value_node (cyclomatic 28): webcodex::model_surface::project_suggested_tool_calls_in_value_node 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":"src/model_surface.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"620012c45ba43f80dddbe7ad98ed4bb16be4f4d2405ec557f4366da939b689da"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::computer_tools::snapshot_receipts::validate_snapshot (cyclomatic 28): webcodex::tool_runtime::computer_tools::snapshot_receipts::validate_snapshot has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/snapshot_receipts.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2df3449bb32a4bde08df8f145f866b652ad40b9972627b11bfee13f5de8ae2"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::patch_result::validate_apply_patch_success_metadata (cyclomatic 28): webcodex::tool_runtime::files::mutations::patch_result::validate_apply_patch_success_metadata 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":"src/tool_runtime/files/mutations/patch_result.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"603077051d2c36c2ba9e369c21f8f67a02ae74c1afe63c6f940127339b46fd32"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::goal::goal_continuity_observation (cyclomatic 28): webcodex::tool_runtime::goal::goal_continuity_observation has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/goal.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d9246b8852ba4f43800bb5571804d82443df7e63681a537d69f9292f7c48ec"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::jobs::detected_job_summary_with_activity (cyclomatic 28): webcodex::tool_runtime::jobs::detected_job_summary_with_activity has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/jobs.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bcbe701558bb4b534f62b1b3f243b91d957c4f882d00e115cd0746dc192778"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::observe_jobs::sparsify_observe_jobs_model_result (cyclomatic 28): webcodex::tool_runtime::observe_jobs::sparsify_observe_jobs_model_result has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cbed011862a753b1b271391474c3c61ec1c10907505efe6ea6f730ba77e60e"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_agent_continuation_app.html.recoverExpiredEndpoint (cyclomatic 28): mcp_agent_continuation_app.html.recoverExpiredEndpoint 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":"src/mcp_agent_continuation_app.html"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0573bfb5afed2e64f6170f732faa1e41c8fac6f8e817acf5f5185f699599e5f"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_job_terminal_continuation_app.html.reconcile (cyclomatic 28): mcp_job_terminal_continuation_app.html.reconcile 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":"src/mcp_job_terminal_continuation_app.html"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7ffb2bd17f4b6458dfe72642a8882f21bad1bb59f1b0f9730cc8a09afb61ba"}},{"ruleId":"D1","level":"warning","message":{"text":"Be.create (cyclomatic 28): Be.create 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. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e7f1902dd0b2eecf8bf3eafd7f1fa440d80420e2d7c05c9805af682239a499"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_browser::cdp::clickable::admit_clickable_cards (cyclomatic 27): webcodex_browser::cdp::clickable::admit_clickable_cards has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/clickable.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"023eb674522d82f0da84e3390a935e0119d389c8fe3bd630c58357f3cbdeab8d"}},{"ruleId":"D1","level":"warning","message":{"text":"RetainedJobReceipt::validate (cyclomatic 27): RetainedJobReceipt::validate has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_job_receipt.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d334a31c4e057466a694ddc81ec3c4154feefa12647ea013820f56560095122"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEnvironment::control_tunnel_with_observation (cyclomatic 27): NativeEnvironment::control_tunnel_with_observation has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb4369e515fbfe2702bd4c9246e95fb9e9aa4f24382c64f700bc10fec16088c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::parse_runner_args (cyclomatic 27): webcodex_runner::parse_runner_args has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/main.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece7955513b56d4302393349c10a7925082f61e4a943a134fcd26a2055d87256"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact (cyclomatic 27): webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1eacf5035ed956598a166170484b28b1db5eb01fd1fe30149dcf0590aba6b31"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_chunk (cyclomatic 27): webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_chunk has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"581c4919b0aa92bc455c62dec3ae2f32bc861b7a2800b3db4933c429035e692c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::runner_session::dispatch_inbound (cyclomatic 27): webcodex::runner_session::dispatch_inbound 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":"src/runner_session.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a55defa828c5da3de09d1f3fd311f07441942a574e02e8b16993573726134f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::text_edits::validate_apply_text_edit (cyclomatic 27): webcodex::tool_runtime::files::mutations::text_edits::validate_apply_text_edit 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":"src/tool_runtime/files/mutations/text_edits.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a877570e9d4f82f7b298693ddbc0154e120929a8ea5083fdeca03008a93ab5"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::text_edits::validate_apply_file_change (cyclomatic 27): webcodex::tool_runtime::files::mutations::text_edits::validate_apply_file_change 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":"src/tool_runtime/files/mutations/text_edits.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"898dcbb3d968fd16666dd4830f7ffce04dcef466321f8c059e5d16c174245f2f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::upgrade_http::maintenance (cyclomatic 27): webcodex::upgrade_http::maintenance 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":"src/upgrade_http.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d01baacbb94eea8e103f32310b0c9ac9fffe028f55f2b8972270a56550c4d9d"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionPathsEditor.ExtensionPathsEditor (cyclomatic 27): ExtensionPathsEditor.ExtensionPathsEditor has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 11 of the 27 points are its own statements and the rest belongs to 6 function items inside it that branch (browse, a function literal at line 54, a function literal at line 48, \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":"apps/desktop/src/features/extensions/ExtensionPathsEditor.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a124709ea75671b57e5eac6bd7677335d1b6a32087c1beea82d87614e87ee365"}},{"ruleId":"D1","level":"warning","message":{"text":"McpProvidersPanel.McpProvidersPanel (cyclomatic 27): McpProvidersPanel.McpProvidersPanel has cyclomatic complexity 27 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 10 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":"apps/desktop/src/features/extensions/McpProvidersPanel.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d99522da25c5557f2542578ecdfbb5b56d390c7d30b551e0f2dccac8ecdd98"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimePanel.BinaryFacts (cyclomatic 27): RuntimePanel.BinaryFacts has cyclomatic complexity 27 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/settings/RuntimePanel.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e484328229e782b7f4e8d7df50bef9e79f7864007ed1c2511f4bca940316c8f"}},{"ruleId":"D1","level":"warning","message":{"text":"location-values.resolveChoicePath (cyclomatic 27): location-values.resolveChoicePath has cyclomatic complexity 27 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/campus-application/src/location-values.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0089b21148731c0121c5b27fadc431a7c6f52b10e6a33f5d218ef216a7bbbd23"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_agent_continuation_app.html.reconcile (cyclomatic 27): mcp_agent_continuation_app.html.reconcile 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":"src/mcp_agent_continuation_app.html"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"73886f45a43da91a671b360b32dd6a6c5632376a0336afb66259350972799ce4"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_job_terminal_continuation_app.html.prepareAndDispatch (cyclomatic 27): mcp_job_terminal_continuation_app.html.prepareAndDispatch has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_job_terminal_continuation_app.html"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f013b309ddf64a0a4294d07c61449c2304d291511cf3904d945a60cd313ed6e2"}},{"ruleId":"D1","level":"warning","message":{"text":"l.updateMode (cyclomatic 27): l.updateMode has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae97d040fa2b952ad2c132b10843b23ba495ef46757e05b01a01c2bc8138ffc"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.loadProjects (cyclomatic 27): mcp_workbench_app.html.loadProjects has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2df11e12c6887c176fa10a2aa963cb167c089239d9d257fc1ace65ed5f588d2"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.loadOverview (cyclomatic 27): mcp_workbench_app.html.loadOverview 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":"src/mcp_workbench_app.html"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca94959c1fbfe31e4c12df772d0c71328e3b6498e40c444b3c70fd75731726f"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 27): (anonymous) has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 4 of the 27 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 83, 93, 94, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/browser-bridge/worker.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"407095731f63bfdbc83111816122a1313e883a371c7d8fa33bc62930546f7860"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_browser::cdp::apply_dom_capabilities (cyclomatic 26): webcodex_browser::cdp::apply_dom_capabilities has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"06714f5022dde80cf11fb7500cd5ba6806b45640c686dc5411d4c16afecebb1d"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::parse_project_subcommand (cyclomatic 26): webcodex_cli::parse_project_subcommand has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f2173bd5af1b01da4ef036e26a494a0f84225151749eec9cf46b20cd9becb6"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::environment::cloudflare::validate_input (cyclomatic 26): webcodex_cli::environment::cloudflare::validate_input has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/cloudflare.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"33dd3c348c6f563837df8cee4f84e86414e60a9c8264c26cc04359a7e92ff6e0"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::controller::validate_config (cyclomatic 26): webcodex_cli::webcodex_cli::controller::validate_config has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d85180dd71c479970189c1dbf304da77321fddc54757e32c97d9ea89bdfd58f"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEnvironment::upgrade_prepare_with_options (cyclomatic 26): NativeEnvironment::upgrade_prepare_with_options has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"876ef9d4d29f907f5abf7d4c186b515687b6e609a9eb76f9869d1be154da9b11"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_openai_tunnel::run_transitions::check_intents (cyclomatic 26): webcodex_openai_tunnel::run_transitions::check_intents has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_transitions.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab95aaeb16de6af5140f91d5abcf3fc02cf83b1d426370049b014ccf2e77dd8"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderConnection::request (cyclomatic 26): ProviderConnection::request has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a636591ab5c126faaaae77e6895e3bb520ba72431f9e029771ef082f62e147"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::fake_claude_mcp::main (cyclomatic 26): webcodex_runner::webcodex_runner::fake_claude_mcp::main has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_claude_mcp.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e548f6336c378f01dc85e6ba2f3ba5faceb184af6d9953b7b42faaad74f2b9a"}},{"ruleId":"D1","level":"warning","message":{"text":"JobStartPlan::new (cyclomatic 26): JobStartPlan::new has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates/start.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0dc52fd665902dc26ab9df4efa74aaafdffe30c6ab065b1df00af107f20820"}},{"ruleId":"D1","level":"warning","message":{"text":"Database::create_agent_wait (cyclomatic 26): Database::create_agent_wait has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wait.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"63afa332dc0d638bc06bbc19d6b60a533a1594c8e3a19a2c169dc4071334057a"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workflow_session::handoff_brief::build_handoff_brief (cyclomatic 26): webcodex_workflow_session::handoff_brief::build_handoff_brief has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dda97da93ca4ede48475d011ecd7ae1fad330ae2169ddfea104bf42b0a9712"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedRuntimeCall::prepare (cyclomatic 26): PreparedRuntimeCall::prepare 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":"src/mcp/tools/call.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3df3aa964961289f3d3592c727cf08522439827e177ce6ccc1380c90554049"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::cli::text::native::render (cyclomatic 26): webcodex::mcp::cli::text::native::render has cyclomatic complexity 26 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 6 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":"src/mcp/cli/text/native.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ef1db0d96b3f611abc1797475b0f700246090d15766b53e5375063577f6036"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::tools::mcp_tools_list_payload_with_exposure (cyclomatic 26): webcodex::mcp::tools::mcp_tools_list_payload_with_exposure 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":"src/mcp/tools.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c9c4d51407f9d5bba601bf60f90d96f5947b6903d4528c99b3216ab05f0acc"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::tools::call::specialized::ssh_resource (cyclomatic 26): webcodex::mcp::tools::call::specialized::ssh_resource 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":"src/mcp/tools/call/specialized.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efe5c1355af670fdcb8015fcd6f3aeef6266df8188dc19b9daa69b1e5abaf52"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::surface::sparsify_tool_manifest_model_result (cyclomatic 26): webcodex::tool_runtime::surface::sparsify_tool_manifest_model_result 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":"src/tool_runtime/surface.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d71c7938174ddabffb5899e353289a534872c79513f1e0bdf55351382060398"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionsPanel.ExtensionsPanel (cyclomatic 26): ExtensionsPanel.ExtensionsPanel has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 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":"apps/desktop/src/features/extensions/ExtensionsPanel.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"035038a87635cc2de098eea217ebf0fb9a6ce5211889f800289265128ce8fa35"}},{"ruleId":"D1","level":"warning","message":{"text":"useRuntimeUpdates.useRuntimeUpdates.refreshLocal (cyclomatic 26): useRuntimeUpdates.useRuntimeUpdates.refreshLocal has cyclomatic complexity 26 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 12 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":"apps/desktop/src/hooks/useRuntimeUpdates.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe92ceef53b898caf03c61ae7e2fadc7886c8b36191ce7e0f657dfab4ea65a6"}},{"ruleId":"D1","level":"warning","message":{"text":"l.setGState (cyclomatic 26): l.setGState has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"3670ff8b4df8d82bcc0883e66c1b90d829fac975fd21db3771348d29b0fb6291"}},{"ruleId":"D1","level":"warning","message":{"text":"Mi.render (cyclomatic 26): Mi.render has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 12 of the 26 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 691, o, a function literal at line 691, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b10621b4fa2fd8f36a51014492c83b8a03f20ccfd5ddeee9df00664d3640f5d"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.preview (cyclomatic 26): mcp_workbench_app.html.preview has cyclomatic complexity 26 (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":"src/mcp_workbench_app.html"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"009ef6d2b14469952f3ecffb2fa7c1548cb449e55a32d7a70ae793cc25cbb20a"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::parse_cli_runner_init (cyclomatic 25): webcodex_cli::parse_cli_runner_init has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"baeb9f31c8cd63fa14bc3d7ada1cd199f1ac4a1ac3c905e47206ef54d3b850fc"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::runner_protocol::job::is_canonical_cargo_flags (cyclomatic 25): webcodex_core::runner_protocol::job::is_canonical_cargo_flags has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba4ad42880a9426da547f4ca07045458a517d3f3e034269c2f34cc824501c81"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateManager::status_view_for_target (cyclomatic 25): UpdateManager::status_view_for_target has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/view.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae640ef056b5829fb6fc98f3f84ac10c53e5e1735e623cf204d839f782924dc"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::upgrade::parse_desktop_payload (cyclomatic 25): webcodex_environment::upgrade::parse_desktop_payload has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c18544c72584bb50eae6332f452ecf46b1b0d77abeed671bdbe971f00b16727"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::upgrade::restore_programs_from_journal (cyclomatic 25): webcodex_environment::upgrade::restore_programs_from_journal has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a3a94c9c813e7d1683f64f97a55cc1591e87a567b4de1f681951c11e676635"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_openai_tunnel::bin::webcodex-tunnel::main::execute (cyclomatic 25): webcodex_openai_tunnel::bin::webcodex-tunnel::main::execute has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/bin/webcodex-tunnel/main.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"393eb5ca86eb26a2f8f5040f970b5bf63223c069cbc7962fb010a68f4abd6a26"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_tool_contracts::schema_generation::normalize_host_schema_inner (cyclomatic 25): webcodex_tool_contracts::schema_generation::normalize_host_schema_inner has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/schema_generation.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4542d1dc858faad76883712634388438e0ad4781340b5c57e3e90e17c32f48"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workflow_session::continuation::compare_scopes (cyclomatic 25): webcodex_workflow_session::continuation::compare_scopes has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/continuation.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"769998bd22d8990dab0aab7041b6a2c28a6541754670fc312e7e81ea145a0b0d"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workflow_session::task_context::task_context_value (cyclomatic 25): webcodex_workflow_session::task_context::task_context_value has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/task_context.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e69055d94d0241b93e0e0403c23be8a08cf423ff276f80ec046df69dfa0260"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workspace::project_recipe::workspace_member_witnesses (cyclomatic 25): webcodex_workspace::project_recipe::workspace_member_witnesses has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e01d6ef9083e7000d56a05793607c9022ece44052d801bf2694bbc352af329"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedInvocation::prepare (cyclomatic 25): PreparedInvocation::prepare 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":"src/tool_runtime/kernel/recording.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5528e024937ad9c7d017404ee4024cffa8de13354f04820eebb58d5cce9638"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::call_agent_lsp (cyclomatic 25): ToolRuntime::call_agent_lsp 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":"src/tool_runtime/lsp_tools.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e71f76c5e302dbd1379a0556d44b3b07cc35159d6e5335f670a6385eecf2d8"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::dispatch_runner_config_tool (cyclomatic 25): ToolRuntime::dispatch_runner_config_tool 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":"src/tool_runtime/runner_config.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"21225a3563aea3c8c48fc1b17c5e167d4a14f0582320f4bf9420072552821157"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::skill_read_file (cyclomatic 25): ToolRuntime::skill_read_file 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":"src/tool_runtime/skills.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39ca6e48ce17c3b6cc803774f0fcef0130a617c0952e21d283bf64a13ad9dd7"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::materialize_validation_job_candidates (cyclomatic 25): ToolRuntime::materialize_validation_job_candidates 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":"src/tool_runtime/validation_events.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde03a879087b4b8dac7b79c051b4988e9105e9ec1cb5a38946926f4ae1b6e1c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::cloudflare_ingress::cloudflare_control_handler (cyclomatic 25): webcodex::cloudflare_ingress::cloudflare_control_handler has cyclomatic complexity 25 (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":"src/cloudflare_ingress.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"e335a32d561def1509527ae0f7e37f672a336fcf8aebd6b1db6ab74e1794f90f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::cli::text::compact::jobs (cyclomatic 25): webcodex::mcp::cli::text::compact::jobs 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":"src/mcp/cli/text/compact.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2318e1bc0685c24a473d4ee5b69688e04d7c20b02efd3f314e2745183e7a576"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::runner_session::run_runner_session_with_pump (cyclomatic 25): webcodex::runner_session::run_runner_session_with_pump 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":"src/runner_session.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca706871696cbce24d2a55cb36c952813f88e491c8aa39062e99cffbb2f9d8c6"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::runtime_console_http::window_queries::window_for_auth_inner (cyclomatic 25): webcodex::runtime_console_http::window_queries::window_for_auth_inner has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime_console_http/window_queries.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8784bb7625c0065190bb62b57b7478702effc448dd06bda096bdd1729eca62f"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserRuntimeStatus.BrowserRuntimeStatus (cyclomatic 25): BrowserRuntimeStatus.BrowserRuntimeStatus has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 35, 29, 43, \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":"apps/desktop/src/features/dashboard/BrowserRuntimeStatus.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c2e0ec95f494d53a10e479081f01fef034c3f6a14ba1cd6e12943ea81a8522"}},{"ruleId":"D1","level":"warning","message":{"text":"AddLocalProject.AddLocalProject (cyclomatic 25): AddLocalProject.AddLocalProject has cyclomatic complexity 25 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 11 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/projects/AddLocalProject.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0c3ad394a11f3a303ba6f176bacf763413de7acddfe2cdc8054b22012ce80d"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalServicesPanel.LocalServiceControls (cyclomatic 25): LocalServicesPanel.LocalServiceControls 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 items inside it that branch (a function literal at line 36, act, a function literal at line 36). 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":"apps/desktop/src/features/settings/LocalServicesPanel.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce12187d152f9324080535cce70388141584089c01deb7db880068d153242c3"}},{"ruleId":"D1","level":"warning","message":{"text":"worker.chrome.runtime.onMessage.addListener() (cyclomatic 25): worker.chrome.runtime.onMessage.addListener() 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 2 function literals inside it that branch (lines 83, 93). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/browser-bridge/worker.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa48ee51941a5eaadef0f69b538caf6be043e49a79690a0ac70532e11d52dec2"}},{"ruleId":"D1","level":"warning","message":{"text":"install.noProxyMatches (cyclomatic 25): install.noProxyMatches 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":"npm/webcodex/install.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c20c5b2f58e7e9d61c9ce6b3d5f838131659d9e17f5b957cc27c9b47c28752a"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::parse_runner_status_with_identity (cyclomatic 24): webcodex_cli::parse_runner_status_with_identity has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2320}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b05db94a4f6a8f46ce50fc1142770e63454beeb48d993608115b74ae84ea10"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::parse_server_install_service (cyclomatic 24): webcodex_cli::parse_server_install_service has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2418}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e01cea1ca8326574bbe9930e0856363a492e8d896aea8534bca060457ee49f"}},{"ruleId":"D1","level":"warning","message":{"text":"ShellJobValidationStep::is_canonical_with_project_workspace (cyclomatic 24): ShellJobValidationStep::is_canonical_with_project_workspace has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37d080363934b226532513586486e4b3495191fde084d6d84fcbefafa4d828e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::coding_agent::validate_response_for_request (cyclomatic 24): webcodex_core::coding_agent::validate_response_for_request has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ac127248e56fa309e6ded75bde93264ce43762a8c771741b26a4e482ce9677"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::runner_operation::encode_job_operation (cyclomatic 24): webcodex_core::runner_operation::encode_job_operation has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: RunnerOperation::wire_kind (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c089feabd3c86e39af0872c5b3e956d71b30beb5c239744d17f6efbfbfaf3125"}},{"ruleId":"D1","level":"warning","message":{"text":"PersistentShellManager::exec (cyclomatic 24): PersistentShellManager::exec has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/execution.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50301836a451001eb5ac4a3edb308f7d04805851beec853a8aa4f851e1d758f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::config::validate_mcp_gateway_config (cyclomatic 24): webcodex_runner::webcodex_runner::config::validate_mcp_gateway_config has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e80cd7402b5aa71eba770d55136f12203abd0be6bb0c229ada2ec9a03e75df"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::transport::quic::quic_session (cyclomatic 24): webcodex_runner::webcodex_runner::transport::quic::quic_session has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/quic.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e141384ce736c31458df5df5f117f51fbfe5ab61a3a5badc03ec247f49dfce6"}},{"ruleId":"D1","level":"warning","message":{"text":"Database::record_goal_workflow_stalled_diagnosed (cyclomatic 24): Database::record_goal_workflow_stalled_diagnosed has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal_stall.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"53dc8b6d308c7db15e6c6abb939118a0da2492246d69eb289a741947100b9dd6"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_tool_contracts::tool_call::parsing::safe_argument_error (cyclomatic 24): webcodex_tool_contracts::tool_call::parsing::safe_argument_error has cyclomatic complexity 24 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ToolCall::tool_name (cyclomatic 194) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/parsing.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57155b3fab0c585d5f3765163c5f6314e77e35911cad68e57c1eb38e874b739"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionStore::ensure_coding_session_with_git_baseline (cyclomatic 24): SessionStore::ensure_coding_session_with_git_baseline has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"937056c375a187959cc4a9839b3c0b194e3e14074ffd0ef79981fadf4b0d37f5"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionStore::record_validation_job_terminal (cyclomatic 24): SessionStore::record_validation_job_terminal has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f615f390714be778375f6e06eb238f3e4fe0b2d43d08f6109d26e1584e8de9"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionStoreInner::complete_message (cyclomatic 24): SessionStoreInner::complete_message has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e653057f09b287fd0eb265d9d111e663b6bd985f24d422f7c8cfeef104df63"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workspace::project_recipe::project_cargo_all_packages_provenance_files (cyclomatic 24): webcodex_workspace::project_recipe::project_cargo_all_packages_provenance_files has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b8e822f80ffd99d3aaa70a04b03e18ea7458d6cbf2f5fc1e89154c727c5f52"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::presentation::git::show_changes_presentation (cyclomatic 24): webcodex::mcp::presentation::git::show_changes_presentation 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":"src/mcp/presentation/git.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbe182dfacf9b49abd26278927d9c8971f37c30a16af7ac48bb8ea63bc46998"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::model_surface::project_suggested_tool_call_schema_node (cyclomatic 24): webcodex::model_surface::project_suggested_tool_call_schema_node 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":"src/model_surface.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ccdd764b146916761e1274bd6cd92ebaf95e6dc449a38acb0f4dbd869a4344"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::helpers::decode_git_quoted_path (cyclomatic 24): webcodex::tool_runtime::helpers::decode_git_quoted_path 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":"src/tool_runtime/helpers.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6feb881b1bfad168cb8276f642d68f67353b2ca4a69c10eb22a557acc877a9"}},{"ruleId":"D1","level":"warning","message":{"text":"session_recovery.validate_registry (cyclomatic 24): session_recovery.validate_registry 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":"integrations/codex/session_recovery.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbe93fa1095fbd2923af94927e31bd32e358a9cc1e44e6853815144d2c2186f"}},{"ruleId":"D1","level":"warning","message":{"text":"install.extractTarGz (cyclomatic 24): install.extractTarGz 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":"npm/webcodex/install.js"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65eac82ee5084ef8e175686f6394bcda2756bae67ce3aa79a91e1583f7100af"}},{"ruleId":"D1","level":"warning","message":{"text":"upload-source.resolveUploadLocation (cyclomatic 24): upload-source.resolveUploadLocation 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":"plugins/campus-application/src/upload-source.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c35911f17cede24899529f4370c0495ff0da11629a331070fe7c0993b7d44c"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_goal_plan_app.html.validActivity (cyclomatic 24): mcp_goal_plan_app.html.validActivity has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_goal_plan_app.html"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"71eb78d7a89f60e5485ab48bc76e459a3aec87723c113df93167f4d86971821e"}},{"ruleId":"D1","level":"warning","message":{"text":"l.paintChar (cyclomatic 24): l.paintChar has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"86de673c32d5a6b30503628a56ecbc69d5e6498a3d9d6d5bdaaf07ccb6224b70"}},{"ruleId":"D1","level":"warning","message":{"text":"l.isVisible (cyclomatic 24): l.isVisible 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. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"b339c9b8173760db6cbd19b2b0112d661eba09e5a3ee2079ea7f12117b067ea8"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_desktop::webcodex::settings::acp::reconcile_document (cyclomatic 23): webcodex_desktop::webcodex::settings::acp::reconcile_document 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":"apps/desktop/src-tauri/src/webcodex/settings/acp.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8c3d07a7a17fd50e2305fe8c8058695e303a05084df2fc3c7a8512502774e7"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_desktop::webcodex::settings::mcp::reconcile_document (cyclomatic 23): webcodex_desktop::webcodex::settings::mcp::reconcile_document 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":"apps/desktop/src-tauri/src/webcodex/settings/mcp.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f6a4de5dec8657426159df92768a7edc3aaf0bfe221d8ed7e387928453f0b2"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserSupervisor::batch (cyclomatic 23): BrowserSupervisor::batch has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf66f18f939a53e9c5d900f78e2101b4f26dfd12b6ad42d2f7669218dd618d7"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::environment::update::run_at (cyclomatic 23): webcodex_cli::environment::update::run_at has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/update.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"536ec97c71a7f78b11159a0e13e080df0b8b48045b0d0b374bf388e3fc337fab"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_computer::platform::macos::applications::mac_application_candidate_at_path (cyclomatic 23): webcodex_computer::platform::macos::applications::mac_application_candidate_at_path has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/applications.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea37f36ac7e4066d3e85b34ec2982dcb0533ef9da11a5ab776823bcf7e270c81"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::plugin::diagnose_invalid_tools (cyclomatic 23): webcodex_core::plugin::diagnose_invalid_tools has cyclomatic complexity 23 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/plugin.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cf57ff013aa53fd86641c0faa5f620c083ab248660f5e22615034c6464a51a"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::unified_update::installer::apply_verified_installer (cyclomatic 23): webcodex_environment::unified_update::installer::apply_verified_installer has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/installer.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"4407980cce1929c238595737b01b6e3771c820582fb6070abbf47b15224f1754"}},{"ruleId":"D1","level":"warning","message":{"text":"CodingAgentManager::apply_pre_prompt_config_option (cyclomatic 23): CodingAgentManager::apply_pre_prompt_config_option has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf379b049d5c99ebad781b9d072f864ad83d699fd267c0b5aa0d9c7d61da16c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact_metadata (cyclomatic 23): webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact_metadata has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"04500d0a7c0d68adc1f7cca772cf21435b2c341bb496a11b93d3eb7c229aa31b"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_finish (cyclomatic 23): webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_finish has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"470c9e797a87c996650605f0daf7ecde57097d30020079474b57303f1719bdf5"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::projects::managed_worktree::resume_managed_worktree (cyclomatic 23): webcodex_runner::webcodex_runner::projects::managed_worktree::resume_managed_worktree has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc92102d26b9d6b00d1544d1e9c76662dc3aedd7e07825100e4d607daedab30"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectTextEditInput::validate (cyclomatic 23): ProjectTextEditInput::validate has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_inputs.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"26602d60ce56e7cd96756b9142e795116789df451f4304cbab9a1b2545bc1d09"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workflow_session::events::classify_failure_expectation (cyclomatic 23): webcodex_workflow_session::events::classify_failure_expectation has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"365098971747f3d53e38d76607773861d54cc6e87c710f5a1bad2d02f0a3f77e"}},{"ruleId":"D1","level":"warning","message":{"text":"Budget::copy (cyclomatic 23): Budget::copy 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":"src/tool_request_trace/diagnostics.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87e9a2a4d3fa0cf00d0d5d61e8825ffcaa03961bd9c185bcdd853b8e61d343d"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::save_computer_snapshot_artifact (cyclomatic 23): ToolRuntime::save_computer_snapshot_artifact 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":"src/tool_runtime/computer_tools/snapshots.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"86674ea940a3d9686d9887ec86061f0e8e8b30fa45cd70c5b9a50a1807e7244b"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::run_job_for_auth_with_contract_with_ssh_resource (cyclomatic 23): ToolRuntime::run_job_for_auth_with_contract_with_ssh_resource 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":"src/tool_runtime/jobs.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04cbff5339c5b7ea040cca8d787d2a340ea7ae2c133b72da8334a458adc4cf8"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::call_tool_with_context_inner (cyclomatic 23): ToolRuntime::call_tool_with_context_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":"src/tool_runtime/kernel.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3afabd0879ddfeea8292b73e01d5c00b1b98b2d8de958794329a1117c828b11"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::project_format (cyclomatic 23): ToolRuntime::project_format 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":"src/tool_runtime/project_format.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc29778d0f802290abef1a40ad974ba1fc5bfc209d58f328c97e1163eb97f72d"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::resolve_project_input_for_auth (cyclomatic 23): ToolRuntime::resolve_project_input_for_auth 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":"src/tool_runtime/project_resolution.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"73edb1fafeea8c1cd09a0a4c0c486acf1fac08b8d001d4b39a75940188a9fea8"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::coding_agent::live_acp_bound_violation (cyclomatic 23): webcodex::tool_runtime::coding_agent::live_acp_bound_violation 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":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47c10ce337e38c549ca7f58f761c5522010ce94c401ad47d7945ac2a8ea996a"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::patch_result::valid_apply_patch_failure_match_diagnostic (cyclomatic 23): webcodex::tool_runtime::files::mutations::patch_result::valid_apply_patch_failure_match_diagnostic has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/patch_result.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bd6cbc4191dd20f2fd1e71909f310328a2653bc580c8a50428eda36786b47e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::patch_result::validate_apply_patch_edit_summary (cyclomatic 23): webcodex::tool_runtime::files::mutations::patch_result::validate_apply_patch_edit_summary has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/patch_result.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0d74a976b48282b082668ee2d9b5682f987cb93af9b72fc06b2a9c4f7e0b70"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::git::diff_hunks::git_diff_hunks_recovery_value (cyclomatic 23): webcodex::tool_runtime::git::diff_hunks::git_diff_hunks_recovery_value has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"acafbb18f32e0d054b2609823ca3438a5174dbc2f953fa18ff4926cfc72528d9"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::git::diff_hunks::parse_git_diff_hunks (cyclomatic 23): webcodex::tool_runtime::git::diff_hunks::parse_git_diff_hunks 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":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"093f22a2d5db9cea9591eaf34154223372ee8515ace88314e83420aa74a3c519"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::kernel::admission::check_protocol_capabilities (cyclomatic 23): webcodex::tool_runtime::kernel::admission::check_protocol_capabilities has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/kernel/admission.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d31b5098812efee51db495c5d73468ebc9bd51bbe3e85c66dc8f7d268456a7b"}},{"ruleId":"D1","level":"warning","message":{"text":"read_handoff.read_handoff (cyclomatic 23): read_handoff.read_handoff has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/codex/read_handoff.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"214f18b8bd7e80e33c15c84fd12c913e6660654912ec5d72b9ee7a1cc725698a"}},{"ruleId":"D1","level":"warning","message":{"text":"Knowledge.rebuild (cyclomatic 23): Knowledge.rebuild 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":"plugins/project-knowledge/knowledge.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"463d1b7f8248c392edc52fe0e01b1df6a23d11a863ca33124f37db9c4a6e8964"}},{"ruleId":"D1","level":"warning","message":{"text":"presentation.desktopErrorPresentation (cyclomatic 23): presentation.desktopErrorPresentation has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/presentation.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40c7bd3129e45d82e003b05165b7817828304a52074e3156517543bc4ffd721"}},{"ruleId":"D1","level":"warning","message":{"text":"McpProviderEditor.McpProviderEditor (cyclomatic 23): McpProviderEditor.McpProviderEditor 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 5 function items inside it that branch (submit, a function literal at line 28, a function literal at line 49, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/extensions/McpProviderEditor.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ccb332dd67f61660d0c62db44cd0159f36dc0173180d29177118aee9753988"}},{"ruleId":"D1","level":"warning","message":{"text":"install.startNetworkRequest (cyclomatic 23): install.startNetworkRequest 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":"npm/webcodex/install.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abe7972d6baf026e060bd999dd80c48d597780f020b44b02e1b5b41def1283f"}},{"ruleId":"D1","level":"warning","message":{"text":"config.loadConfig (cyclomatic 23): config.loadConfig 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":"plugins/agent-browser/src/config.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05b2bbda90e09062b147e37131e037a39262df4a529f6ae025fe65c52e56c56"}},{"ruleId":"D1","level":"warning","message":{"text":"form-cache.matchSectionField (cyclomatic 23): form-cache.matchSectionField 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":"plugins/campus-application/src/form-cache.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9e0aae6d0b7d0f5453f53135714039d47ed5b1767b791e496bff17552fb5e4"}},{"ruleId":"D1","level":"warning","message":{"text":"context.parsePorcelainStatus (cyclomatic 23): context.parsePorcelainStatus 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":"plugins/repo-context/src/context.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ee96313a496279eec207c586fda3722f8c3fdc6015318d85870b6f34b251cc"}},{"ruleId":"D1","level":"warning","message":{"text":"Dr.parseDrawingWrapper (cyclomatic 23): Dr.parseDrawingWrapper has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: Ir.renderElement (cyclomatic 60) 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":"src/mcp_docx_app.html"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"f116a68ce6f90e69b3e417b3f81d921ba76679f57b2b87dc6a69c9280f2a23b7"}},{"ruleId":"D1","level":"warning","message":{"text":"us.setAttributes (cyclomatic 23): us.setAttributes has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"3460b7b37bb775ceb3fc641bb298d73a411a9f4d0ebcab52ec3e9a041252a46f"}},{"ruleId":"D1","level":"warning","message":{"text":"Re.toDateObject (cyclomatic 23): Re.toDateObject has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4318f337eabb3ce9c8794f0f1871cca6358da6f3c834531512d9c3bc4acfb83"}},{"ruleId":"D1","level":"warning","message":{"text":"l._createMaskCanvas (cyclomatic 23): l._createMaskCanvas has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"f904f248767f3aab49cd12ef6479133224452bf21245482d46ad44c4042133ae"}},{"ruleId":"D1","level":"warning","message":{"text":"l._createContainer (cyclomatic 23): l._createContainer has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"2105a88ddbd3d33d09f147c84e851f6fef33f2fcf59b851e1d2d24043493114b"}},{"ruleId":"D1","level":"warning","message":{"text":"l.#l (cyclomatic 23): l.#l has cyclomatic complexity 23 (threshold 15). 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, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74aa25e0cd2193decea9c9ca4a43bdaeafc70bfbe720b24751c6bc8e1e5526a"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.validWorkbench (cyclomatic 23): mcp_workbench_app.html.validWorkbench has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0391f62324bc1453cf34e98c28a0f21a3e5d9691a340fe242a8a93e19c088c2"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.useSelectedContext (cyclomatic 23): mcp_workbench_app.html.useSelectedContext has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 6 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1017, 1033). 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":"src/mcp_workbench_app.html"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"7354960fe7585ef29a64f47a891ad0e55b3fa18bdde225b97fc2d8dd2e9e1fb1"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_desktop::webcodex::cli::run_bounded_until (cyclomatic 22): webcodex_desktop::webcodex::cli::run_bounded_until 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":"apps/desktop/src-tauri/src/webcodex/cli.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f647d061c363451005e17c948104031994b7f20017c149462724fa3f357491a"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_admin::commands::build_admin_request (cyclomatic 22): webcodex_admin::commands::build_admin_request has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda1efcaaea348620f54c78ffea00a41a24b14db01143c07c067ad795981780d"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::mcp_config::render (cyclomatic 22): webcodex_cli::webcodex_cli::mcp_config::render has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/mcp_config.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"83791880bd69c3930504807880e737b343e33bc02be4563bedb69254d707dd11"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::coding_agent::validate_request (cyclomatic 22): webcodex_core::coding_agent::validate_request has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de803503c3619c8c2a9dc8c2eedd863ed27dc72b2875f32272e0a4d5a96f75a"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::plugin::validate_check_report (cyclomatic 22): webcodex_core::plugin::validate_check_report has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/plugin.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc7a12844a5b08db5e765b55ec42f508cbdfe2774da2b462f0fca70aad4a10a"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::project_listing::glob_match_segment (cyclomatic 22): webcodex_core::project_listing::glob_match_segment has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_listing.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb65280fc6d916b691fa5568c11b17b2917e1f78517bd7615a104e10421f1383"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEnvironment::ensure_project_authority (cyclomatic 22): NativeEnvironment::ensure_project_authority has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native/project_addition.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"636fc3f52f503c7baaef1301499d8a2489909b1e9f04721a6ba1410dbf17542e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_lsp::fake_server::maybe_publish_diagnostics (cyclomatic 22): webcodex_lsp::fake_server::maybe_publish_diagnostics has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9bdb56a4f939e2f2174180fd7e375e859ec3623928da9e40b6b22ab73a20c8"}},{"ruleId":"D1","level":"warning","message":{"text":"JobManager::record_update (cyclomatic 22): JobManager::record_update has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d6322598c22d08b7b7f4613a9aa2d1432298e328b3efd14b215338ec3c76b5"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderConnection::request (cyclomatic 22): ProviderConnection::request has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"81da663398669a2ab77d2f7477163d3ff5664f1be1fb5c14f60f4bcdb8185d91"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_build::plan (cyclomatic 22): webcodex_runner::webcodex_runner::project_build::plan has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1741ece93db29d67a256fe8ddf8926faf287fe512a390ca38f1927597f9bf0ab"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_format::commit_candidates_with_hook (cyclomatic 22): webcodex_runner::webcodex_runner::project_format::commit_candidates_with_hook has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_format.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc2f3bd044bfa83d423efc34c19bf1e7275cb18f68b0ccdccca697042cd0af5"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::shell::scripts::select_script_interpreter (cyclomatic 22): webcodex_runner::webcodex_runner::shell::scripts::select_script_interpreter has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f24919c17c333c8572837a03dca294c80e772a1a6d6d0c0ea0ff79fc058607"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::ssh::run_piped_ssh_command (cyclomatic 22): webcodex_runner::webcodex_runner::ssh::run_piped_ssh_command has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c31780e78d161546edcd697f194a1e29960e7b1b4a0462c6e60079258f81fad"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::transport::bootstrap::run_runner (cyclomatic 22): webcodex_runner::webcodex_runner::transport::bootstrap::run_runner has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/bootstrap.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"72608d463ca02e08c7946d1a8c19f1b962685afffa258a4f3b2f2695c0d3a41d"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::validation::project::plan (cyclomatic 22): webcodex_runner::webcodex_runner::validation::project::plan has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/project.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa65e21e99b8abe6c15258701d220b63d359645e3822ee5f0e5163f3ba370c9"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerRegistry::job_log_with_paging_for_auth (cyclomatic 22): RunnerRegistry::job_log_with_paging_for_auth has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a63176b03289eb24406c6124ef89b5cc03c12561b36cb58b7329a796629b6e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_tool_runtime_contracts::tool_audit::result::computer_observation_result_audit (cyclomatic 22): webcodex_tool_runtime_contracts::tool_audit::result::computer_observation_result_audit has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/result.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"702d575374e6c798bda47f324e2f423381b35dbd63862d2d257b92005c5cd711"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workflow_session::console::console_interaction_summary (cyclomatic 22): webcodex_workflow_session::console::console_interaction_summary has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/console.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9670a3830f5ecdf5908165529f2d53cb95cbec85dfd8d916b714f525f5bd71d"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::dispatch_skills_authorized (cyclomatic 22): ToolRuntime::dispatch_skills_authorized 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":"src/tool_runtime/dispatch/skills.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48ef2dfbe85f470749bd5f65247a8550d5170623528dd484cbb45b7811d2801"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::dispatch_lsp_tool (cyclomatic 22): ToolRuntime::dispatch_lsp_tool has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/lsp_tools.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fffde6582b1924fec6243401e875fe71e8a70c34efcc4868c60b2e50965f0b"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::open_webcodex_workbench (cyclomatic 22): ToolRuntime::open_webcodex_workbench 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":"src/tool_runtime/resource_references.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"026a8550df590c8b4bf8147679edd3689db36fce42cb2bde22be5fd12f4a3132"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::read_webcodex_resource (cyclomatic 22): ToolRuntime::read_webcodex_resource 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":"src/tool_runtime/resource_references.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7998fcfd968989f6a84886980147bd158afd727271c1ff12a8f5e41fcd4083d"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::project_validate (cyclomatic 22): ToolRuntime::project_validate 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":"src/tool_runtime/validation.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eed75546479f24b458907dee47da7d8e347b53f372fa90c3692f3aa2ddd7c9a"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::validation_terminal_result (cyclomatic 22): ToolRuntime::validation_terminal_result 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":"src/tool_runtime/validation.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"46031e329c5c221e712050c3c5cf0ec58f4bddc89109df61c422724d11ed8dc0"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowActivityRegistry::finish (cyclomatic 22): WindowActivityRegistry::finish 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":"src/tool_runtime/window_activity.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc045636839fe2807bce2bc5e34f7c152e00f42d422eb0ebeeaf93c821ea884d"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::server_tunnels::run_profile (cyclomatic 22): webcodex::server_tunnels::run_profile 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":"src/server_tunnels.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e709d23329bed10fbb95ef67c62f8f2eb11d88d4a118866b96a7d85b7870d1"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::computer_tools::accessibility::validate_computer_element_state (cyclomatic 22): webcodex::tool_runtime::computer_tools::accessibility::validate_computer_element_state 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":"src/tool_runtime/computer_tools/accessibility.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5264e91d3783d1a5a8f64ed52ffa37eb65cb2ac0938f5a23b91f1cbf809880"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::computer_tools::responses::validate_computer_response (cyclomatic 22): webcodex::tool_runtime::computer_tools::responses::validate_computer_response 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":"src/tool_runtime/computer_tools/responses.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"83426f0fb1667760b22e8f6bbc1d6a4df827786a092df9ec02d9ca801662a088"}},{"ruleId":"D1","level":"warning","message":{"text":"Adapter.request (cyclomatic 22): Adapter.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":"integrations/model_gateway/adapter.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56ff52ba0fb7567cab02a6c020ae0bbae4ab38f5c14dacb6dc6751719a4ee78"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigurationDataPanel.ConfigurationDataPanel::renderEntry (cyclomatic 22): ConfigurationDataPanel.ConfigurationDataPanel::renderEntry 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":"apps/desktop/src/features/settings/ConfigurationDataPanel.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da03ab76da77ac1064419cf34ea84f1191ce820c29582756cab68e0d59c9781"}},{"ruleId":"D1","level":"warning","message":{"text":"desktop-window-behavior.installDesktopWindowBehavior (cyclomatic 22): desktop-window-behavior.installDesktopWindowBehavior 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 2 function items inside it that branch (onKeyDown, onContextMenu). 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":"apps/desktop/src/lib/desktop-window-behavior.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfbf7f9506922398800e09d89721b6c18ff87d00149d4dde1b842013dbbaecc"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_agent_continuation_app.html.bindSemanticFailure (cyclomatic 22): mcp_agent_continuation_app.html.bindSemanticFailure 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":"src/mcp_agent_continuation_app.html"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b05bcfc44159ffa8364794764a7f0237931f1d15f2e52985c45f8713cbb5b3"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_agent_continuation_app.html.acceptToolInput (cyclomatic 22): mcp_agent_continuation_app.html.acceptToolInput 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":"src/mcp_agent_continuation_app.html"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8f48a71f72568b4db832fced7b0b33ec31e1f5c116cb4df922edcaf2cb69a4"}},{"ruleId":"D1","level":"warning","message":{"text":"chooseMonth (cyclomatic 22): chooseMonth 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 12 function items inside it that branch (a function literal at line 172, a function literal at line 153, a function literal at line 158, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/widgets/date.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b833beba7788799ff8b90aab28291445bc0e9e7c6294af2a1d567b3a57e9019d"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopCore::start_quick_share (cyclomatic 21): DesktopCore::start_quick_share has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"f799fef240038368f6282d6772e1e41428abff15d2ffac3ba8cf20e5b9de3a3f"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopCore::switch_runtime_transaction (cyclomatic 21): DesktopCore::switch_runtime_transaction 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":"apps/desktop/src-tauri/src/state/runtime_shell.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35a3ccbbe8924cd1b10a0862eabcfa23d198e10b66ef4cfd03f0c463613c8ef"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::controller_tui::run (cyclomatic 21): webcodex_cli::webcodex_cli::controller_tui::run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_tui.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb36665cb6eab42426b0fb96159cbc9722545a2a4e138e3d4d527a1f6b58ccc0"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectValidationRequest::validate (cyclomatic 21): ProjectValidationRequest::validate has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_validation.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82e6101313ffe1de6aead750a88ba46cf525e5afb2d230d33361df4d1f6fafb"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::audit_preview::process_preview (cyclomatic 21): webcodex_core::audit_preview::process_preview has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/audit_preview.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fd9e4f9310af4fa0cd8c487470d642674d6065e4b6305b1cfe4606467fe2e1"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::mcp_gateway::validate_tool_result (cyclomatic 21): webcodex_core::mcp_gateway::validate_tool_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":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"370d65eadb167be98cb52f77086389e5f4e02e685b38fdc51176be28dda04672"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::native::service_spec (cyclomatic 21): webcodex_environment::native::service_spec has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e81f3306ee66eea2e4ee133e5f594081583e54550a4b90262b1d3db842281f5"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::patches::handle_write_project_file_request (cyclomatic 21): webcodex_runner::webcodex_runner::patches::handle_write_project_file_request has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1d50f84c2c2227efffe1cdc89d482dfdbbe2880a5162c178127ad9499a98f0"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_build::rust::artifact_paths (cyclomatic 21): webcodex_runner::webcodex_runner::project_build::rust::artifact_paths has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build/rust.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02d44a114423b51c9cb3a3e316fa51a3241756b82d1c8ae872d6850c7616e40"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner_registry::reconciliation::validate_context (cyclomatic 21): webcodex_runner_registry::reconciliation::validate_context has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"655e22b9ae8c293668ac9291f4d1aa172ffb853e50850db173de501051425136"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_tool_runtime_contracts::tool_audit::request::typed_agent_task_request_audit (cyclomatic 21): webcodex_tool_runtime_contracts::tool_audit::request::typed_agent_task_request_audit has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41c894526c26661bc3eb03e94f8edddd876d1bdb0234a389d14d1ee12bddd57"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workflow_session::task_context::stall_diagnostic (cyclomatic 21): webcodex_workflow_session::task_context::stall_diagnostic has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/task_context.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"671171f17dede26afe0353f6df4f9c8a6134b8ac15e830ec5e849e5c294ad491"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::accept_artifact_handoff (cyclomatic 21): ToolRuntime::accept_artifact_handoff 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":"src/tool_runtime/artifact_transfer.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d242f3653891674a8cc8d3c5b1722167f9f9592b565d1c630182a31c97114f5"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::coding_agent_observe (cyclomatic 21): ToolRuntime::coding_agent_observe has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"034aeed35b92c05ac27551c12fabb4e9167e1a1f2d7edb48aa10d6547e15d9e3"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::query_runner_inventory (cyclomatic 21): ToolRuntime::query_runner_inventory 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":"src/tool_runtime/runtime_info.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"904b409734623c51017ddd64cc94d8779f523c04901a56e98dbbbda23fe64076"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::result_projection::sparsify_complete_read_success (cyclomatic 21): webcodex::tool_runtime::result_projection::sparsify_complete_read_success 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":"src/tool_runtime/result_projection.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26d17088fbe45a9db85b2e55441923920afc7b088a506f245ac181923adec4b"}},{"ruleId":"D1","level":"warning","message":{"text":"Adapter.event (cyclomatic 21): Adapter.event has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/model_gateway/adapter.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c387711dc909d6bf7e5425d2db4a99a4047b3327bbe1f3983218b3abf602cd"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectsPanel.ProjectsPanel::unregisterSelected (cyclomatic 21): ProjectsPanel.ProjectsPanel::unregisterSelected 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. This shape REPEATS in the file: one other method here (ProjectsPanel.ProjectsPanel) 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":"apps/desktop/src/features/projects/ProjectsPanel.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4027bbee23494e6d3887ea120c625b157159134b2e2cf48ec9aedd4b13938de"}},{"ruleId":"D1","level":"warning","message":{"text":"CloudflareConnectionCard.OAuthHandoff (cyclomatic 21): CloudflareConnectionCard.OAuthHandoff has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 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":"apps/desktop/src/features/connection/CloudflareConnectionCard.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"09eeb8d88a5051419526cab692c14efa64a14bef4acf8c7c6e85019f7448664a"}},{"ruleId":"D1","level":"warning","message":{"text":"wrapper.captureProtectedNpmEnvironment (cyclomatic 21): wrapper.captureProtectedNpmEnvironment 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":"npm/webcodex/bin/wrapper.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b37d210179e0da58b262da4275a10f122ae6a6092b30c15ceb08aec00eb3e4"}},{"ruleId":"D1","level":"warning","message":{"text":"fill-batch.createFillBatch (cyclomatic 21): fill-batch.createFillBatch has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/campus-application/src/fill-batch.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58fc8ff80e9fa720fac6b59d0c6dcc295069c0b871463677920f5a7963c7b07"}},{"ruleId":"D1","level":"warning","message":{"text":"l.executeOperatorList (cyclomatic 21): l.executeOperatorList 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. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1703cbe0957880ded03206b03a87b34fd99b1b649df2b5f608d665ee0705183"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.renderReferences (cyclomatic 21): mcp_workbench_app.html.renderReferences has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"56dbb6cdbf30b7fff43b51303e3b4ec9c2c0f6bd4e9a0d04d37959d595b38358"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_desktop::tray::build_menu (cyclomatic 20): webcodex_desktop::tray::build_menu 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":"apps/desktop/src-tauri/src/tray.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf32f9504703b26d50c1dd7a0da02b96ede888c2080758e7e6a6a086eef2fa0"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::runner_service::render_runner_readiness_summary (cyclomatic 20): webcodex_cli::webcodex_cli::runner_service::render_runner_readiness_summary has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/runner_service.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff461cc50d746d4b5a0e7a03dfa62d235932e13b7b6e934a4b45b906b6242df"}},{"ruleId":"D1","level":"warning","message":{"text":"ShellJobStructuredExecutionMetadata::is_valid (cyclomatic 20): ShellJobStructuredExecutionMetadata::is_valid has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"535d04e667373dc707e3339bfb083453f8c62fc4ceace04d7144a5f7cf6e97de"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerConfigOperationResponse::validate (cyclomatic 20): RunnerConfigOperationResponse::validate has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe94d140fa10bf32a9169dbe9cfe652c8c1f1982cb59bb9d1c2648a4c50793c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::validation_evidence::parse_go_test_diagnostics (cyclomatic 20): webcodex_core::validation_evidence::parse_go_test_diagnostics has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a12e87391c14f948a2f34c34991464f5ee7ca22a77a8166f0d474bede2b2f1"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEnvironment::complete_upgrade_preparation (cyclomatic 20): NativeEnvironment::complete_upgrade_preparation has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12359bd136f88388d386a5aba78330d83b73ea770897a7844efa893deb0a720"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::service::validate_spec (cyclomatic 20): webcodex_environment::service::validate_spec has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/mod.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fabd522b00458cf8ccefbea91d1df3565606cb60deee33f9438cd231840356"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::upgrade::freeze_installer_upgrade (cyclomatic 20): webcodex_environment::upgrade::freeze_installer_upgrade has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8ed45a503da584e5f73725222365495cb15c7b7983b331c0800f6c15bf7185"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSupervisor::get_or_start (cyclomatic 20): LspSupervisor::get_or_start has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"c733d020e958fd3176878393078c88c6596382dcbc76fe0f0b808aa395385e18"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_lsp::navigation::call_hierarchy (cyclomatic 20): webcodex_lsp::navigation::call_hierarchy has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: webcodex_lsp::navigation::symbol_kind_name (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"d770b11ed76d8ae2e2847dd83941ee941ce2a4b7ca48b7d360ceedf066705ae9"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_openai_tunnel::run_fence::check_archives (cyclomatic 20): webcodex_openai_tunnel::run_fence::check_archives has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aee4ec8d228a85168cd13746d12ba6b951cf8f7a34b0cef084e1ac30e885748"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::main (cyclomatic 20): webcodex_runner::main has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/main.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6464df294993328f05bdb2ee900565e04399df62405e6c0124655458a77003b0"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::patches::handle_apply_patch_file_request (cyclomatic 20): webcodex_runner::webcodex_runner::patches::handle_apply_patch_file_request has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f9339484e26f3dc790dc38d1a1094c158abaa7e03d1343510feff8fc64859f"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerRegistry::enqueue_project_file_mutation (cyclomatic 20): RunnerRegistry::enqueue_project_file_mutation has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"928a6a52cff13805b1f94b22c3712855647ab704a1c6f5f155a7d22f7640fc0c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner_registry::reconciliation::preflight_inventory_locked (cyclomatic 20): webcodex_runner_registry::reconciliation::preflight_inventory_locked has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbb4f8ef3ace12d5d7789a83c12d6c88436d349e1674d693d65c8c01181f9fa"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workflow_session::handoff_brief::project_validation (cyclomatic 20): webcodex_workflow_session::handoff_brief::project_validation has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5dd9c70d80edb2a4ae86a275f7be6b8763ae7afa084b0f1d0518f102ba4ce2"}},{"ruleId":"D1","level":"warning","message":{"text":"PostRecordResponse::finish (cyclomatic 20): PostRecordResponse::finish 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":"src/tool_runtime/kernel/postprocess.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae886e01078b325486b418cb349fd60f227af14f63ec70cba7ed476d8315990"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::reconcile_agent_task_coding_run (cyclomatic 20): ToolRuntime::reconcile_agent_task_coding_run has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/agent_task.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc6c8cc715ef9acedb4d3ce8c1389d396b9425c599dafd12892b1f2b5dc5892"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::run_skill_resource (cyclomatic 20): ToolRuntime::run_skill_resource 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":"src/tool_runtime/skills.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7cf838b6c8f60beb1ca8aac6f91590a5c4e11dc76f5b566bc6a050ed345892"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::oauth_http::managed_authorize::oauth_authorize (cyclomatic 20): webcodex::oauth_http::managed_authorize::oauth_authorize 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":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"77085ddedbc4bcaa781de516a7a86f9dd2c500882d55bfec0e81697b032d0269"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::oauth_http::shared_key_bridge::validate_bridge_authorize_request (cyclomatic 20): webcodex::oauth_http::shared_key_bridge::validate_bridge_authorize_request has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/shared_key_bridge.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57973d068044bf313c769909247ea65f2a5d581138e4fefb32f501570907f69"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserController.snapshot (cyclomatic 20): BrowserController.snapshot has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/agent-browser/src/browser.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcf40442756fddd9e4bb36cbabdeb325c56a5b35aece041a6fed63a0a030fbf"}},{"ruleId":"D1","level":"warning","message":{"text":"resume.resolveResumeValue (cyclomatic 20): resume.resolveResumeValue has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/campus-application/src/resume.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63b4cc647f013fc8e83c1bb99d1a4194ce0e4211d8df431d2ebf3c0b7c4bad9"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin.supportFor (cyclomatic 20): plugin.supportFor has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/campus-application/src/plugin.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fe13ec94be18b34365cdf4b9513988f64ea35c4eba9c53332eb5fa03625ce9"}},{"ruleId":"D1","level":"warning","message":{"text":"domain.resolveAuthorizedTarget (cyclomatic 20): domain.resolveAuthorizedTarget has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/safe-delete/domain.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdb28184a6f648e0c1fbef9999ef6e525895d1a072dff6493b17105d1610030"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_agent_continuation_app.html.toolResultShape (cyclomatic 20): mcp_agent_continuation_app.html.toolResultShape 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":"src/mcp_agent_continuation_app.html"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a09140552f145c873593f1aaacf82163df431d792b44895f66c0c1b66b7246"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_goal_plan_app.html.poll (cyclomatic 20): mcp_goal_plan_app.html.poll has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_goal_plan_app.html"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df898fce9b395a5f14d9ad2a0dacf52322785ebc883e2183f541456f4faa068"}},{"ruleId":"D1","level":"warning","message":{"text":"us.render (cyclomatic 20): us.render has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0dd82df3c3fe52a3f79e2c2142212e5f8ad10ff48c3fda82acf6c1be199c61"}},{"ruleId":"D1","level":"warning","message":{"text":"It.#f (cyclomatic 20): It.#f has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5eb63f2af758fae11a902f4f81d906c6a236badac7e99782b4f72cf7463eaed"}},{"ruleId":"D1","level":"warning","message":{"text":"l.disable (cyclomatic 20): l.disable has cyclomatic complexity 20 (threshold 15). Of this number, 14 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. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa25deea198e8b4e03f662cc85c9f4b71919764305e4aab4cc954f042e5e4962"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_result_app.html.appendJobDetails (cyclomatic 20): mcp_result_app.html.appendJobDetails 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":"src/mcp_result_app.html"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ab378a5c62ccefc14be683ed5a42b70c1b99cbd950ddce3448d245ca0d433b"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.applyLaunch (cyclomatic 20): mcp_workbench_app.html.applyLaunch 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":"src/mcp_workbench_app.html"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac45daa95a5c32696dd382fc08edaf047a577df54d3d34baba7f6e385706003a"}},{"ruleId":"D1","level":"warning","message":{"text":"command (cyclomatic 20): command has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/browser-bridge/worker.js"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e91201ce3ec3572f82f5ad1b185e7ad248648a4fb8a746b277bc635ccecb6f"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopCore::refresh_runtime_status (cyclomatic 19): DesktopCore::refresh_runtime_status 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":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a399f76606981e7a1a8499f9e7bb1abfbe4bb757479557c0b5bf2eceab7fe4"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopCore::apply_environment_record (cyclomatic 19): DesktopCore::apply_environment_record 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":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"f892874073ade806ec78f0dcd568af26fe0585003a815525a76440337f598a66"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_desktop::tray::handle_menu_event (cyclomatic 19): webcodex_desktop::tray::handle_menu_event 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":"apps/desktop/src-tauri/src/tray.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"1588f44a27e22cadbc35810c04f9b498aae2004e5a1a579dca784ecd7546ca5a"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_desktop::updates::install::native::macos::launch (cyclomatic 19): webcodex_desktop::updates::install::native::macos::launch 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":"apps/desktop/src-tauri/src/updates/install/native.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7c35b826fcef238b883cb83beff1b0ca3d20e2ff308907033fdd63b4010168"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_browser::cdp::walk_dom_controls (cyclomatic 19): webcodex_browser::cdp::walk_dom_controls has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8f7fd372d38d45c32c7f60921212fe1de785753f98b77ae5b6696a0913ec44"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::environment::update::parse (cyclomatic 19): webcodex_cli::environment::update::parse has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/update.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a9a10ad5a3fa21adc5430555ce24febf4e004f9a48b54f2d38f0e84e927ce5"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::connect::shared_key_oauth::finish_shared_key_oauth_connect (cyclomatic 19): webcodex_cli::webcodex_cli::connect::shared_key_oauth::finish_shared_key_oauth_connect has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"b435f75fc756e63524c6c5cd0367f6aded81ecdc4c21f48fa1164336180a8627"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::runner_service::run_runner_status (cyclomatic 19): webcodex_cli::webcodex_cli::runner_service::run_runner_status has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/runner_service.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f92dc8c7c56c4a99b996f8b5996fd64e353da74eeec0d63c24309791804f4f"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectInstructionsSnapshot::retain_unavailable_scopes (cyclomatic 19): ProjectInstructionsSnapshot::retain_unavailable_scopes has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_instructions.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef14db8d018f5eacdd3f4503d187d9119cb503275c34316f47e457d2a4486a2"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::coding_agent::validate_live_acp_diagnostic (cyclomatic 19): webcodex_core::coding_agent::validate_live_acp_diagnostic has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b52e7e1d01a1f1c624c01403e8e87f50a73e1643860f62709129fe8fd3c99d"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::runner_protocol::job::normalize_go_package (cyclomatic 19): webcodex_core::runner_protocol::job::normalize_go_package has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41f1acc97efff20cef51a7917958e20d465112d3d1ead3b8d029ecfa445d550"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::validation_evidence::pytest_summary_line (cyclomatic 19): webcodex_core::validation_evidence::pytest_summary_line has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cc8c37fd54bb5fad41fbbb6c6b5bc596a563c55e62d1d9cbf2aca504c1dbbc"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateManager::run_locked (cyclomatic 19): UpdateManager::run_locked has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/download.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"c890584e61f23bbc5841d7ab81a0559ac90ab2ab92fd9a4b5d42880e01f5e55f"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateManager::install_locked (cyclomatic 19): UpdateManager::install_locked has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/install.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f8592aa9111821fc57497deba4019ca80281a8ce2a3cabbc71ab4cd7588243"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::cloudflare_tunnel::complete_cloudflare_profile_cleanup (cyclomatic 19): webcodex_environment::cloudflare_tunnel::complete_cloudflare_profile_cleanup has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fc794fcc912b6da65117f6612f2f766401c56a880a8345a6683ca691acb967"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::service::linux::install (cyclomatic 19): webcodex_environment::service::linux::install has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"401c548496eaffd38f73fdff152fd10a7f60edf2b7a15bdc73720b3bd30fa524"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::upgrade::native_executable_architecture (cyclomatic 19): webcodex_environment::upgrade::native_executable_architecture has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2913}}}],"partialFingerprints":{"codehealthFindingId/v1":"75adaa2567cb9def53c257171ae7d5241e658130e7f5178fed1610144b23d1f1"}},{"ruleId":"D1","level":"warning","message":{"text":"Receipts::open_inner (cyclomatic 19): Receipts::open_inner has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_receipts.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9bdc09628d9e7d64ecb92faec0fdda61db4345a8f048f3e514f6626ddb4545"}},{"ruleId":"D1","level":"warning","message":{"text":"CodingAgentManager::run_live_acp_probe (cyclomatic 19): CodingAgentManager::run_live_acp_probe has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/diagnose.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9a2247d2f1fbfa168cf247d9757034f89780837cc3a2e6b6f053753a68fa1a"}},{"ruleId":"D1","level":"warning","message":{"text":"JobManager::start_detached_process_job (cyclomatic 19): JobManager::start_detached_process_job has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/detached.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ceaf5dc759b25eaa44996a49d903955f511bec2599b34097f7d5b9a79e4460"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact_export_chunk (cyclomatic 19): webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact_export_chunk has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db3665db1e16fd008be9f97f7d9cd59a189f4dc8d233e9a9a3000272fcd9a9e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::files::handle_skill_list_packages_request (cyclomatic 19): webcodex_runner::webcodex_runner::files::handle_skill_list_packages_request has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/files.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"5135247dfae3f4fe6afbc0ca24d9d775eb7e78ca1167e75c11f5070a467dd127"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::job_manager::delivery::spawn_job_update_delivery_worker (cyclomatic 19): webcodex_runner::webcodex_runner::job_manager::delivery::spawn_job_update_delivery_worker has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/delivery.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8550e4639e82513d98b022330f630151bbb6fbc206f1661223070b1901e919d"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::job_manager::detached::validate_detached_recovery_context (cyclomatic 19): webcodex_runner::webcodex_runner::job_manager::detached::validate_detached_recovery_context has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/detached.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bceaa43f6bf6d8f32fe00fd5f044dce3e4df6030e53d986818609d1d137a4ad"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::patches::execute_planned_file_changes (cyclomatic 19): webcodex_runner::webcodex_runner::patches::execute_planned_file_changes has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"715f92c407554a95f01a48b1e8f3271f1832462b45807d57d974df703b42693c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::plugin::prepare_provider (cyclomatic 19): webcodex_runner::webcodex_runner::plugin::prepare_provider has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1747753d36401a577fb1e30ed0b63daa48a394f271620574bd5770b92b040da6"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_build::rust::run_rust_build (cyclomatic 19): webcodex_runner::webcodex_runner::project_build::rust::run_rust_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":"crates/webcodex-runner/src/webcodex_runner/project_build/rust.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"def8b5eca0b4045d494ea6d68eb98bfd4afe0ee4f925e49d6634cd401e1a89d8"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::validation::pyright::run_pyright_with_program (cyclomatic 19): webcodex_runner::webcodex_runner::validation::pyright::run_pyright_with_program has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/pyright.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfd25d60835a6b3b8ff620ca1c9d94920051d9c18017ce3f444c3be2c9ceabc"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workflow_session::audit::session_input_summary_for_tool (cyclomatic 19): webcodex_workflow_session::audit::session_input_summary_for_tool has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/audit.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e7a37b60e1e6fd276c9dc2604e5965cb0bd5de8a021e163e8de7579e126570"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workflow_session::persistence::database::write_row (cyclomatic 19): webcodex_workflow_session::persistence::database::write_row has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/persistence/database.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5052fbc6b04ebe1a53595a3877c5a6ea22d514ccfa6edc7ea19b05ead495f181"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::dispatch_cargo_tool (cyclomatic 19): ToolRuntime::dispatch_cargo_tool has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/cargo_tools.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f4743dda13973fea01e77dfa941252f64c750477bb3c2fb3204e3540e22c65"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::dispatch_computer_control (cyclomatic 19): ToolRuntime::dispatch_computer_control 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":"src/tool_runtime/computer_tools/post_observation.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"136ec6c67c9b87d3b89b36a0acd58513303fd83b0b7900044beae026c6055384"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::import_one_conversation_file (cyclomatic 19): ToolRuntime::import_one_conversation_file 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":"src/tool_runtime/conversation_import.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38773a623abf4f0b6105b0c710a6c93bfb252abbbb0e3e062323324d125c5a5"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::list_project_tracked_files (cyclomatic 19): ToolRuntime::list_project_tracked_files 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":"src/tool_runtime/files/inspection.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e60431ffdc236332f44e902713bcab757fea557e3587edd7c9f79ffdc6b1cd"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::apply_patch (cyclomatic 19): ToolRuntime::apply_patch 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":"src/tool_runtime/files/mutations/patch.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd05bf3f66c683bfd896f9b981ecde782587676af74879af214c3192da799e2"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::wait_for_job_terminal (cyclomatic 19): ToolRuntime::wait_for_job_terminal 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":"src/tool_runtime/job_terminal_wait.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc60c5f00e9ad54f52238ba4984240f376f770439fff6ca8bdcad457e84074c"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::job_log_with_paging_for_auth (cyclomatic 19): ToolRuntime::job_log_with_paging_for_auth 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":"src/tool_runtime/jobs.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d476ff9529a290343d07738e7e329a57326bec036b3a94afc7a7403810dfcf7"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::resolve_workspace (cyclomatic 19): ToolRuntime::resolve_workspace 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":"src/tool_runtime/projects/maintenance.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"12015594c7810d2150d7c858c9d1049fe3c810d7200971bd3b14e18f523e1b18"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::run_server_with_shutdown (cyclomatic 19): webcodex::run_server_with_shutdown 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":"src/lib.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c16aee16ec1ebc017cd288e28be84ef1b3e791d74042c5c9fc489ce19df391"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::oauth_http::shared_key_bridge::oauth_authorize_bridge (cyclomatic 19): webcodex::oauth_http::shared_key_bridge::oauth_authorize_bridge 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":"src/oauth_http/shared_key_bridge.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26c5ab86438d14223a1eaa8f83c5572d9e01a36513d8e1c6b194ec7e72c4e57"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::runtime_console_http::goals::goal_detail_for_auth (cyclomatic 19): webcodex::runtime_console_http::goals::goal_detail_for_auth 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":"src/runtime_console_http/goals.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"077e24af045618b649915c2576b146bbae6ec95d8df1fb65608965b2d7f42efc"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::computer_tools::accessibility::validate_accessibility_node (cyclomatic 19): webcodex::tool_runtime::computer_tools::accessibility::validate_accessibility_node has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/accessibility.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb24fa79d70b127e1a25260a1097ae9ce9963a2eadb269865608efa09bfb0a7"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::execution_control::job_control (cyclomatic 19): webcodex::tool_runtime::execution_control::job_control 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":"src/tool_runtime/execution_control.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f612dc8f23b11faaf1992d94a27cf6c984780f7ea17ee09041e98755cb38ef7e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::git::diff_hunks::decode_git_diff_hunks_v2_continuation (cyclomatic 19): webcodex::tool_runtime::git::diff_hunks::decode_git_diff_hunks_v2_continuation 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":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c8855cc27f0eb5dfb0a790aea48dd74232144c3ae2f214a4d2285d6fa6efa4"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::git::show_changes::show_changes_transport_safe (cyclomatic 19): webcodex::tool_runtime::git::show_changes::show_changes_transport_safe 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":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda8ffcaa544180e06d1509d580fcbc6254b328b731f7ac6f483012605d200b0"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::result_projection::sparsify_search_output_for_model (cyclomatic 19): webcodex::tool_runtime::result_projection::sparsify_search_output_for_model has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/result_projection.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cd4be992aaefeea8f34b043ac1ebde85bada1f97ca72d28e8199ef26fbe1de"}},{"ruleId":"D1","level":"warning","message":{"text":"Knowledge.search (cyclomatic 19): Knowledge.search has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/project-knowledge/knowledge.py"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d54a9977c3c32e0f3b7e472a79b97741ac8bca3f666df2bdfd5ca7a9704f099"}},{"ruleId":"D1","level":"warning","message":{"text":"PowerShellInstallGuidance.PowerShellGuidanceControls (cyclomatic 19): PowerShellInstallGuidance.PowerShellGuidanceControls has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (recheck, openGuide). 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":"apps/desktop/src/features/settings/PowerShellInstallGuidance.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32dfcdd3266ea80fbecedbd856e8c4af51300cf177b8539a110a0aefdd05618"}},{"ruleId":"D1","level":"warning","message":{"text":"TunnelConfigDiagnostics.TunnelConfigDiagnostics (cyclomatic 19): TunnelConfigDiagnostics.TunnelConfigDiagnostics has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 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":"apps/desktop/src/features/connection/TunnelConfigDiagnostics.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad1c869acca1841bde68b91c525437df196ba91e470dc44efdd9326b1f3ac9f"}},{"ruleId":"D1","level":"warning","message":{"text":"choice-controls.planChoiceGroup (cyclomatic 19): choice-controls.planChoiceGroup has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 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":"plugins/campus-application/src/choice-controls.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3a7b1d5e70684a5cfe0ef03d27d7990663f09edb9d1240457433b60ce87976"}},{"ruleId":"D1","level":"warning","message":{"text":"domain.moveToFreedesktopTrash (cyclomatic 19): domain.moveToFreedesktopTrash has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/safe-delete/domain.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e410650f4d53e7c92bd89dc38c7ad944e3836cbb52ba3656691d18a2afd3f53"}},{"ruleId":"D1","level":"warning","message":{"text":"us.setupStorage (cyclomatic 19): us.setupStorage has cyclomatic complexity 19 (threshold 15). Of this number, 17 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. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b8befd210564d1f052a2f82fe43c8f4ba03b9e545d6547591c501aacffebf8"}},{"ruleId":"D1","level":"warning","message":{"text":"ps.#P (cyclomatic 19): ps.#P 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: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c383b3da1d872708478af1dd59b007682857832fe5c7ee938052a7d66869c1"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopCore::persistent_tunnel_profile_action (cyclomatic 18): DesktopCore::persistent_tunnel_profile_action 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":"apps/desktop/src-tauri/src/state/connections.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"33aad962c525bd7cfad2a3fb9dc0b942e8abb0faf807a02e41ca46f50e956c4c"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopCore::migrate_environment (cyclomatic 18): DesktopCore::migrate_environment 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":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a897cf8db7e1b4178989fcdb4c08603fc2cf4719d019e9c83dcf9d9347ac4b0"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState::cloudflare_connection (cyclomatic 18): AppState::cloudflare_connection 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":"apps/desktop/src-tauri/src/state/cloudflare_connections.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c163141bb77d507f66979b299223bba48da967970b1b1652adf7fec1686a6485"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_desktop::state::environment::validate_legacy_runner_layout (cyclomatic 18): webcodex_desktop::state::environment::validate_legacy_runner_layout 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":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2b803316a7c2aedb4ccabb6e16d3ca50f48e18cbdd96ef0ee39b5556544cd7"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::ops::run_ops_command (cyclomatic 18): webcodex_cli::webcodex_cli::ops::run_ops_command has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/ops.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"423a8266893cb05b6a5795b5d46b43a846371aec067944c3961b929e22591705"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::ops::ops_smoke_preflight_report (cyclomatic 18): webcodex_cli::webcodex_cli::ops::ops_smoke_preflight_report has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/ops.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3d3f00a3f125674e433c9ad7ae469d1b5c3bdbc2542a922cc4462b9838364e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_code_mode::runtime::run_runtime (cyclomatic 18): webcodex_code_mode::runtime::run_runtime has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-code-mode/src/runtime.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"2634babf9659854fa57d46db2882c7cae025d89deaf93e85945a54b3db475a91"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::job_observation::project_log_stream (cyclomatic 18): webcodex_core::job_observation::project_log_stream has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/job_observation.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01eca3971e5f73b7fc17962e7b7aee03f13ebb3c7dc44ee509f1f2444658e7c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::runner_operation::validate_file_payload (cyclomatic 18): webcodex_core::runner_operation::validate_file_payload has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: RunnerOperation::wire_kind (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45e3a72982d14c60a9e12914831d69f8e2ecc350a9f8503707ecd1e53858577"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEnvironment::remove_tunnel_fenced (cyclomatic 18): NativeEnvironment::remove_tunnel_fenced has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e530a369688a574aa1d51b206b9aaef57b2771d7a00c12c1c7d5ca4ed3a8b7"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::migration::validate_import (cyclomatic 18): webcodex_environment::migration::validate_import has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8e86c562163d3af4bcc1366c2ad3a5e11d654c08e7d8364bf2453efd28b2af"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::privilege::apply (cyclomatic 18): webcodex_environment::privilege::apply has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c06401c935382be5d8bb919daa4b33fad438b46964c3d932bffab7a1b74ec3c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::upload::sweep_artifact_upload_directory (cyclomatic 18): webcodex_runner::webcodex_runner::artifacts::upload::sweep_artifact_upload_directory has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e2c9fe6f8ac9f967747f4a047aaac1011ceed7e946e344fc49d5fbe3de68d6"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::upload::recover_artifact_upload_reservations (cyclomatic 18): webcodex_runner::webcodex_runner::artifacts::upload::recover_artifact_upload_reservations has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"200329a6ceecdb2f943c9f868a755ae04213f5c1a8a3c9bfada9827f4814631e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::config::load_config_with_server_url (cyclomatic 18): webcodex_runner::webcodex_runner::config::load_config_with_server_url has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b8a8b0629b20bedf26ff0a4fce3daac89f98c0c57039bbcddb28c151fd57c3"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::detached_job::model::validate_record (cyclomatic 18): webcodex_runner::webcodex_runner::detached_job::model::validate_record has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/model.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da4bbb1130f235cc851255a8d50df31ed43df0ffe1121295901a9aa51cc77d6"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_format::plan (cyclomatic 18): webcodex_runner::webcodex_runner::project_format::plan has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_format.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a550eeca55b2cca357e0b88e82991936852697bd5059b27e2d0e60d85e7d82d1"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::projects::lifecycle::update_allow_patch_locked (cyclomatic 18): webcodex_runner::webcodex_runner::projects::lifecycle::update_allow_patch_locked has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab228ea8de0529c6622aa60d6d6ec3bfad7a9acc90eaa3623788697ad69c4aa3"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerRegistry::begin_maintenance (cyclomatic 18): RunnerRegistry::begin_maintenance has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/maintenance.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b90804d112f9d6591f81927ba77a452288b79fd7152035c107a5f5540a3970e"}},{"ruleId":"D1","level":"warning","message":{"text":"Database::update_goal_at (cyclomatic 18): Database::update_goal_at has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2eb2c195a5b1c6013ff6e6ba930d797419f261deaff50fcfd5b0cf9b5062b5"}},{"ruleId":"D1","level":"warning","message":{"text":"ApplyFileChangeInput::deserialize (cyclomatic 18): ApplyFileChangeInput::deserialize has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_inputs.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"745f818adbde061247602415eaccdef5d67f4fb57c409e52347107b0262a18dc"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workflow_session::events::validation_output_summary_for_tool_result (cyclomatic 18): webcodex_workflow_session::events::validation_output_summary_for_tool_result has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f1a01e83aa3ba2597ba701ac496bc5c2ca5d79d91f1416f3b16f431dfea3a0"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workspace::project_context::fallback_manifest_paths (cyclomatic 18): webcodex_workspace::project_context::fallback_manifest_paths has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_context.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db3df69cf4babe81222dab5fa251b5b23baf36f913945973955b01857949009"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workspace::project_overview::classify_key_file (cyclomatic 18): webcodex_workspace::project_overview::classify_key_file has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_overview.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dd5b7485bf59d3cf2bb45a37b2695cc5f0befc1cb68c9ea64bedd1f3a09668"}},{"ruleId":"D1","level":"warning","message":{"text":"CanonicalOrchestrationHost::invoke_tool (cyclomatic 18): CanonicalOrchestrationHost::invoke_tool 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":"src/tool_runtime/orchestration_host.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3616d3efd4885c5c3fce9ce6a7c12ea0af03e7fd080fc95c967a2d7ea4be37b"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::wait_for_job_readiness (cyclomatic 18): ToolRuntime::wait_for_job_readiness 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":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67d4383ad396044d21ba608eb060192cbc060137f6a7cf75776fbaa248c7c00"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::review_changes (cyclomatic 18): ToolRuntime::review_changes 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":"src/tool_runtime/review_changes.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c021b572084d46a9fd4a6066b4e64cad980a9b78d825d819186224b9217821b4"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::probe_semantic_navigation_for_startup (cyclomatic 18): ToolRuntime::probe_semantic_navigation_for_startup 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":"src/tool_runtime/semantic_navigation.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"919b55a40179097a844aa4fc0283b03d58692e4da7f94eabf0bf29959e82b1cb"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::authorize_session_target (cyclomatic 18): ToolRuntime::authorize_session_target 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":"src/tool_runtime/session_tools.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec54f47ed14eec35436c1be434f860cad61edf4fecff222b720facdeadb73d1"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::append_terminal_generic_job_validation_events (cyclomatic 18): ToolRuntime::append_terminal_generic_job_validation_events 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":"src/tool_runtime/validation_events.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4fe96c6ac1762e46ed69ab4a4cc24daee4d818f8acdc7b5a124d90ef7bde35"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::action_audit_sessions::compute_stats (cyclomatic 18): webcodex::action_audit_sessions::compute_stats 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":"src/action_audit_sessions.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0b7d6f6d7f29fc326c9dc079861a64bba0306bbaa2d7af43cb2c3c7117c3c7"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::resources::mcp_native_image_tool_result (cyclomatic 18): webcodex::mcp::resources::mcp_native_image_tool_result 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":"src/mcp/resources.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d5220f648f9933bdc49c80f10d5f1601c22e92a8cdee4a987ceb3dcc7117a7"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::tools::add_stateless_workflow_recorder_metadata (cyclomatic 18): webcodex::mcp::tools::add_stateless_workflow_recorder_metadata has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"688943ed02cd7309095163297241f2bd165173a3c85b8d25fcd0f6508135e665"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::tools::mcp_tool_parts_json (cyclomatic 18): webcodex::mcp::tools::mcp_tool_parts_json 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":"src/mcp/tools.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"507f2a30f8114b201a7c7d5c64643b97685ee0898111d1a3dbe11a84782388aa"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::model_ergonomics_telemetry::edit_facts (cyclomatic 18): webcodex::tool_runtime::model_ergonomics_telemetry::edit_facts 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":"src/tool_runtime/model_ergonomics_telemetry.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e69d4ac9e39a6aef9aba58f4099b7bdf98cc17dac3889f15d03fceae1a5b7d"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::startup_brief::workspace_projection (cyclomatic 18): webcodex::tool_runtime::startup_brief::workspace_projection 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":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f580f96e11e34217aa0c9cde77cc404d39b3ac6571fa49f82490d7e850eda42"}},{"ruleId":"D1","level":"warning","message":{"text":"common.optionsIn (cyclomatic 18): common.optionsIn has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 201). 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":"crates/webcodex-browser/src/cdp/widgets/common.js"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f122094974079fc5d12a1bc052e7631d5137bd4cd0d81f7bcc6596de8a8c3ac"}},{"ruleId":"D1","level":"warning","message":{"text":"wrapper.runNative (cyclomatic 18): wrapper.runNative has cyclomatic complexity 18 (threshold 15). Of this number, 12 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":"npm/webcodex/bin/wrapper.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49f2ae11286b766006d995fc22c20db8b20fe42c7dfcb4201a748e515c55ef1"}},{"ruleId":"D1","level":"warning","message":{"text":"l.#z (cyclomatic 18): l.#z has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"7775c2e3fb071cea193b5b45a941e63c6daaa2ca46cb145dc8cca3578307bf1b"}},{"ruleId":"D1","level":"warning","message":{"text":"l.editorDivPaste (cyclomatic 18): l.editorDivPaste 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: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"8770b99a59262e87a7bb5389402bb2ee6712201e6a18ee24800d588aac4a56c9"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_result_app.html.addGitFile (cyclomatic 18): mcp_result_app.html.addGitFile 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":"src/mcp_result_app.html"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2147476d151622c92437f78a895a03bba148d0d07b0536d28aaf981d53529170"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_result_app.html.jobState (cyclomatic 18): mcp_result_app.html.jobState 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":"src/mcp_result_app.html"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e3a5ee9a413099e70e877a23ef36688e862c7a0e4ad3865005e39826c6f6ae"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.openGoal (cyclomatic 18): mcp_workbench_app.html.openGoal 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":"src/mcp_workbench_app.html"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"1078df21c716e04c4efb5b5f9130e58caf0c937c9365c92fe61e95336a7dcfbd"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_desktop::state::operation_completion::reconcile_after_operation_failure (cyclomatic 17): webcodex_desktop::state::operation_completion::reconcile_after_operation_failure 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":"apps/desktop/src-tauri/src/state/operation_completion.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8de525c3d940751afaa1ff6d20ff6127f80a5478b2a60d2bef3283e3a16825"}},{"ruleId":"D1","level":"warning","message":{"text":"CdpBackend::wait_for_stable (cyclomatic 17): CdpBackend::wait_for_stable has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeebd626203f525dffb82b8666773ce3607d06dd35db6dc805b341870a0bdfee"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_browser::profiles::windows::private_path (cyclomatic 17): webcodex_browser::profiles::windows::private_path has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/profiles/windows.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a119d3b4a31ade94db5ffc2103fe6821d79bf030b0ccb23178a75c6a025f1deb"}},{"ruleId":"D1","level":"warning","message":{"text":"ControllerRuntime::reap_and_recover (cyclomatic 17): ControllerRuntime::reap_and_recover has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85eb928887a9ac75183f6f46d2b29e5a05ff99cfba0b7874ca1dbe64e739fa6"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::parse_logout (cyclomatic 17): webcodex_cli::parse_logout 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: webcodex_cli::parse_server_subcommand (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcbb29fa459ed95e43fbcfb6fc0e780e22146428cc725a675918b4bf1a4c26f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::environment::update::encode (cyclomatic 17): webcodex_cli::environment::update::encode has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/update.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a522d9b9b8355c9f8391a24bb70a653f884a296cd92b0cb56ed99e06628efcd"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::connect::shared_key_oauth::provision_client (cyclomatic 17): webcodex_cli::webcodex_cli::connect::shared_key_oauth::provision_client has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"565eb4ec105f611575cdfa5b56c3f98628f4267723055d1a0268104609933d3b"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::login::render_login_result (cyclomatic 17): webcodex_cli::webcodex_cli::login::render_login_result has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"33df4538d627d29537227e0ad988fbb9dd9b9995062baa8dd2412591ab3ab19e"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_computer::platform::windows::accessibility::control (cyclomatic 17): webcodex_computer::platform::windows::accessibility::control has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/accessibility.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd47344d22219514510aeb1dcffec94d291f8b17ff78bf82a8920c79efefe823"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectBuildRequest::validate (cyclomatic 17): ProjectBuildRequest::validate has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_build.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"95468a5b6fdd8904b74ff947848fa63b99c59c56b713c7eaf12d9dd5d6cad075"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::runner_protocol::validate_script_request (cyclomatic 17): webcodex_core::runner_protocol::validate_script_request has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol.rs"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab24b80f5dfe906ec2c3b9811b85ec1146560c7add4f67e32864ba586f328f5"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::validation_evidence::node_native_test_summary (cyclomatic 17): webcodex_core::validation_evidence::node_native_test_summary has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"da45cf7c55f64832a5d5769b47713701841c579f70e072f4b87f432cb53bb3f0"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEnvironment::remove_project (cyclomatic 17): NativeEnvironment::remove_project has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"285416390c059a7f6a001a0aeeb622e1970fbd2eb157a30215d4392c65c36866"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::native::validate_request_with_preserved_listen (cyclomatic 17): webcodex_environment::native::validate_request_with_preserved_listen has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc3baea572fa4ecc022c2b16ba8c4bfa437c3e0217f4a6787a0373d83798004"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::service::windows::validate_credential (cyclomatic 17): webcodex_environment::service::windows::validate_credential has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/windows.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"4184579862437c09224d126bf16a02099637d8ec28796e7d87a734d8168ab45f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::upgrade::verify_prepared_installation_for (cyclomatic 17): webcodex_environment::upgrade::verify_prepared_installation_for has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5d5e46c6b13b7a8c5086b9ed99bf9347702cdc7721ebdb3732300950fea0c5"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::upgrade::desktop_tree::digest_named (cyclomatic 17): webcodex_environment::upgrade::desktop_tree::digest_named has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9232b42112a4186bb9b7fa763079569559dc419277bd65b35b3efeb9e75ea3f"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSupervisor::document_diagnostics (cyclomatic 17): LspSupervisor::document_diagnostics 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: LspError::fmt (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"099da4ebf84274a1a5bb14d15ac20785f27e10111c6ad7543081e3dc5581e22c"}},{"ruleId":"D1","level":"warning","message":{"text":"TunnelClient::forward (cyclomatic 17): TunnelClient::forward has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/mcp_http.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88aef804230da1c9edc11e25fa26c6bcd0dc7213d756cfb7d6d7dc24f532ba9"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_openai_tunnel::run_fence::read (cyclomatic 17): webcodex_openai_tunnel::run_fence::read has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddc6caf5948f46642fd11105ae71cf522f38cf8f521b20e0710e1d6cad2c483"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_persistent_shell::unix::readers::spawn_control_reader (cyclomatic 17): webcodex_persistent_shell::unix::readers::spawn_control_reader has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix/readers.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7051b28f8754769017ddcb73467a88b7b78bb80ec723cf4713176b1ce1fae5d5"}},{"ruleId":"D1","level":"warning","message":{"text":"CodingAgentManager::start (cyclomatic 17): CodingAgentManager::start has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0ae1f9836cf22ae13f7d8b1410707ed321839250d8b7f0cc7d799ab73a4118"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteShellTransport::wait_for_completion (cyclomatic 17): RemoteShellTransport::wait_for_completion has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/remote_shell.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e387be2d3154050b4293fda2a227f806124e2c39041d01329fcd9f46094c2f"}},{"ruleId":"D1","level":"warning","message":{"text":"RegisteredStream::finish (cyclomatic 17): RegisteredStream::finish has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/stream.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85d8f2ce3d946e3bcffe83c36cb67f4b07a5fccb6b97eeaca534adabcacedfd"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::inspection::ooxml_content_type_mime (cyclomatic 17): webcodex_runner::webcodex_runner::artifacts::inspection::ooxml_content_type_mime has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fc346355e4ba799172803d3d24fa4b04e4367b53b24f590826b6b6f4a91803"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::patches::apply_change (cyclomatic 17): webcodex_runner::webcodex_runner::patches::apply_change has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"53917610b8d8c2163dff0f28b21143ce059535d5d183858b7d8de45ccef588ce"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_build::rust::selected_packages (cyclomatic 17): webcodex_runner::webcodex_runner::project_build::rust::selected_packages has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build/rust.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"745fefe3375a2a8e36eb857d3bd095b216db853774f8612fa3cb2eacf6ef2903"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::skill_store::snapshot_installed_package (cyclomatic 17): webcodex_runner::webcodex_runner::skill_store::snapshot_installed_package 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":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"151170959944ea8c227bc50338e44e5df641d92d78b66328e984d3d6feae8e21"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::transport::poll_dispatch::handle_one_poll (cyclomatic 17): webcodex_runner::webcodex_runner::transport::poll_dispatch::handle_one_poll has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/poll_dispatch.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb00b16530eccc70b1d7f26023d653afb43b323d619649e75e2546bdf6afb9f"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerRegistry::enqueue_run_with_ssh_typed (cyclomatic 17): RunnerRegistry::enqueue_run_with_ssh_typed has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: RunnerRegistry::enqueue_browser (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"1625308674e1f814f9b04bc130275fe1bd6cecd6bd31135c684ca618a76acdcc"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerRegistry::reconcile_disconnect_checked (cyclomatic 17): RunnerRegistry::reconcile_disconnect_checked has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc535ad374910b4be39950c996776ea85168f543f6747340cff342ebb893ff0"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner_registry::job_updates::validate_job_activity (cyclomatic 17): webcodex_runner_registry::job_updates::validate_job_activity has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"1512c6beb89558a164bdf75fb1f6b754797db770d7f61eef6878bf6ec991f780"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner_registry::reconciliation::reconcile_inventory_locked (cyclomatic 17): webcodex_runner_registry::reconciliation::reconcile_inventory_locked has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e48ee88f9437f8c495cbeb9304e1905302dfc92b61153f29e4557d95bd67393"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner_registry::runners::validate_coding_agent_registration (cyclomatic 17): webcodex_runner_registry::runners::validate_coding_agent_registration has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2586bb7bbb380d2324d7b23406afd5fd7210893e06937fcef4b43142e1c078d1"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workflow_session::console::build_overview (cyclomatic 17): webcodex_workflow_session::console::build_overview has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/console.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e2aecf101399e01b20f9991a44a9d5c8236d709e0d805bf93b048b79ec03ca"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workspace::workspace_checkpoint::status_summary (cyclomatic 17): webcodex_workspace::workspace_checkpoint::status_summary has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/workspace_checkpoint.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc5175580d15478a6e786071efa27e5bedc8de41e9323a35de28f013ec44c55"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workspace::workspace_checkpoint::collect_untracked (cyclomatic 17): webcodex_workspace::workspace_checkpoint::collect_untracked has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/workspace_checkpoint.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dc4f86272c91d36961377a2f5f9ac906caac945e97ad23b097bb73bff9320c"}},{"ruleId":"D1","level":"warning","message":{"text":"CloudflareControl::provision_oauth (cyclomatic 17): CloudflareControl::provision_oauth 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":"src/cloudflare_ingress.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd06213432b6134abea23d8a238833fffbb90c1d551e26be4b0620820bc9a08"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::frozen_changes_file_content (cyclomatic 17): ToolRuntime::frozen_changes_file_content 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":"src/tool_runtime/changes.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"367b9c8856f2d68ee0b1e37d5205776c7bb82e9a2d11c95b3c1fcb182025cee8"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::reconcile_run (cyclomatic 17): ToolRuntime::reconcile_run has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81f9d8a17190ab0eda74da57dd793f0a224da4855ddfbfb94d785b49aa71952"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::external_observation_tool (cyclomatic 17): ToolRuntime::external_observation_tool 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":"src/tool_runtime/external_observations.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce283377d9393c3059fdff5ef8daa9325434e9635a2a81a1a7d9b8c3f9dc3fc4"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::workspace_hygiene_check (cyclomatic 17): ToolRuntime::workspace_hygiene_check 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":"src/tool_runtime/hygiene.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"75915ed8df1982062117219056108e62620c2b8e4966a3dca75d6ccb4a08f9d6"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::read_files_planned_resolved (cyclomatic 17): ToolRuntime::read_files_planned_resolved 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":"src/tool_runtime/read_files.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c240bce9147f34d2b136a477b854b4051be026ba159b58cf63bf723fe49d946"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::cli::text::native::edits (cyclomatic 17): webcodex::mcp::cli::text::native::edits 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":"src/mcp/cli/text/native.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d971b435f22255c31a7ba392b3c5310276b61084f35149cd0cf388afe6d8c4"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::http_metadata::validate_http_protocol (cyclomatic 17): webcodex::mcp::http_metadata::validate_http_protocol 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":"src/mcp/http_metadata.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbcac9a178078d27a899dccebf02fa6a615d11fb8b3fc3eddb0bc414e877531"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::presentation::git::git_review_presentation (cyclomatic 17): webcodex::mcp::presentation::git::git_review_presentation 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":"src/mcp/presentation/git.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"14366e22678c16e13d0c6e376f454e3e99e4caf4125cec936e01c9756eeb5656"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::tools::call::specialized::plugin (cyclomatic 17): webcodex::mcp::tools::call::specialized::plugin 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":"src/mcp/tools/call/specialized.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccbcfa6bb93e6ab3bc16272c7931631efa8c2aeecc136e2f57966ffcc4b5e42"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::computer_tools::snapshot_receipts::validate_display_snapshot (cyclomatic 17): webcodex::tool_runtime::computer_tools::snapshot_receipts::validate_display_snapshot 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":"src/tool_runtime/computer_tools/snapshot_receipts.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab258c12b320e110911c878810b7de4b75425ef4ffb44b6bb92388cb6c73d9a"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::patch::analyze_unified_diff (cyclomatic 17): webcodex::tool_runtime::patch::analyze_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":"src/tool_runtime/patch.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e879572cfe9f2485b4658e0ec6f14e903120ac7bef1d98fb35033fb6bb877de"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::process::classify_process_failure (cyclomatic 17): webcodex::tool_runtime::process::classify_process_failure 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":"src/tool_runtime/process.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4ffe2d117476b516d3063e5ba8fc20097fd34875f8c17b4619064b1316bd3c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::startup_brief::startup_verdict (cyclomatic 17): webcodex::tool_runtime::startup_brief::startup_verdict 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":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4c176c5f903ecb9bcfe1277815f5c357f7ccd6bc56f4f76a8924093fe4e25f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::work_result::work_result_workspace (cyclomatic 17): webcodex::tool_runtime::work_result::work_result_workspace 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":"src/tool_runtime/work_result.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79f716bbc063783a8b47529df9b490119c69b4cfd823c3e510954abb1f6aa02"}},{"ruleId":"D1","level":"warning","message":{"text":"experience_proposals.validate_candidate (cyclomatic 17): experience_proposals.validate_candidate has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/codex/experience_proposals.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc601da4e770a958e77545e18027d1846a86e2cc5b0e62e3fb27e9ebae76d1bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Knowledge.source (cyclomatic 17): Knowledge.source 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":"plugins/project-knowledge/knowledge.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e09e9ac77b42faf8bbe833964730bff6ff096bc80a01549ca2d9dc3b7811ced"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerCapabilityAuthorization.AuthorizationFlow::authorize (cyclomatic 17): RunnerCapabilityAuthorization.AuthorizationFlow::authorize has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (RunnerCapabilityAuthorization.AuthorizationFlow) 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":"apps/desktop/src/features/extensions/RunnerCapabilityAuthorization.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc593d059bb07af34c0934ee3c7a847b52688e3aaa5357dacf82dc14001f9e8f"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerCapabilityAuthorization.AuthorizationFlow (cyclomatic 17): RunnerCapabilityAuthorization.AuthorizationFlow has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (RunnerCapabilityAuthorization.AuthorizationFlow::authorize) 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":"apps/desktop/src/features/extensions/RunnerCapabilityAuthorization.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc7842672a94ebdc1e7afa72b1e9184c8bc9253c3a3efeeb216522d9aea7dcf"}},{"ruleId":"D1","level":"warning","message":{"text":"SshResourcesPanel.SshResourcesPanel::observe (cyclomatic 17): SshResourcesPanel.SshResourcesPanel::observe 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 shape REPEATS in the file: one other method here (SshResourcesPanel.SshResourcesPanel) 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":"apps/desktop/src/features/extensions/SshResourcesPanel.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be2de15e40c13f48fc03f8d7d918c7b92552821292dcfae7f908154611643a1"}},{"ruleId":"D1","level":"warning","message":{"text":"SshResourcesPanel.SshResourcesPanel (cyclomatic 17): SshResourcesPanel.SshResourcesPanel 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 shape REPEATS in the file: one other method here (SshResourcesPanel.SshResourcesPanel::observe) 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":"apps/desktop/src/features/extensions/SshResourcesPanel.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f64767b0e4954d3a2b6e996ef839ad34312806ca35251f7d5bac21025bf2768"}},{"ruleId":"D1","level":"warning","message":{"text":"set_value.default (cyclomatic 17): set_value.default has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/set_value.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7570b19c6363f60f57483222d093716b54a96114bcdc455de069cef1cd56a772"}},{"ruleId":"D1","level":"warning","message":{"text":"common.linkedRoots (cyclomatic 17): common.linkedRoots has cyclomatic complexity 17 (threshold 15). 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 129). 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":"crates/webcodex-browser/src/cdp/widgets/common.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0821072a5d9d35585e0a67ac50a539cc707906e03196015192c30edc36b2d54"}},{"ruleId":"D1","level":"warning","message":{"text":"context.parseCargoMetadata (cyclomatic 17): context.parseCargoMetadata 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":"plugins/repo-context/src/context.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae7583e64d4ca91c8abb2345e7ea13951157d5f871b68c2a4743a05f942c56a"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_agent_continuation_app.html.validWaitProjection (cyclomatic 17): mcp_agent_continuation_app.html.validWaitProjection has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_agent_continuation_app.html"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"51257e6b3dffa0a5dc7c8e080ec31f6d6d62a0f7ab4646e86fbaab7e7144e5de"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_agent_continuation_app.html.bind (cyclomatic 17): mcp_agent_continuation_app.html.bind has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_agent_continuation_app.html"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cc46503de861ffb57997b4785dfca88585318493546145729917123b14834b"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_agent_continuation_app.html.maybeStartBinding (cyclomatic 17): mcp_agent_continuation_app.html.maybeStartBinding 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":"src/mcp_agent_continuation_app.html"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ebe3e866461f2fbbeeedeabe13a9950565bc990f8b7aaf995393248c656aae"}},{"ruleId":"D1","level":"warning","message":{"text":"Mn.recordCharacterBBox (cyclomatic 17): Mn.recordCharacterBBox has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d546db7a9912fcfdb72946af620db08e4cc93ab907ace3b322a5efecec579d"}},{"ruleId":"D1","level":"warning","message":{"text":"l.render (cyclomatic 17): l.render 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: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"209e6b34a3349295a71b0322d34dfe4a292c2ea82c8e6b01da7eb7854ecf6d15"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_result_app.html.validationRunState (cyclomatic 17): mcp_result_app.html.validationRunState 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":"src/mcp_result_app.html"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df9abec36acfcfa842aeca801c55022a4a41b3f675c135f23a759eb4a6227f1"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.loadSessions (cyclomatic 17): mcp_workbench_app.html.loadSessions has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac23d8b798fcf4f7308fbcd38afe60aae86b275646d81e784d5b776edb676fa"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.renderAvailability (cyclomatic 17): mcp_workbench_app.html.renderAvailability 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":"src/mcp_workbench_app.html"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"67df99529a68dea3114de5da7ff0cb3c76da007f78f50daade6119a28ddbe535"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.openTodo (cyclomatic 17): mcp_workbench_app.html.openTodo has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"723d54e7279a785206e4657112935ee74bc249002b13add3136656a11f76f613"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.addReferenceNow (cyclomatic 17): mcp_workbench_app.html.addReferenceNow 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":"src/mcp_workbench_app.html"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"466a7560aacc9859f403293d5e8da0cf2c7430ce6d819c3e5a46f0b11e887ddc"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.syncContext (cyclomatic 17): mcp_workbench_app.html.syncContext 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, 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":"src/mcp_workbench_app.html"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6722a97ca0ee81fd508030a5dc7d14ede295913cb1a218989e934cdea855e88"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.acceptResult (cyclomatic 17): mcp_workbench_app.html.acceptResult 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":"src/mcp_workbench_app.html"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"9440bbfcbfc7a323e64db4912830e8ad9ab8fa58b47f1ddebca04c206aca9c6d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 17): (anonymous) has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/set_value.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfd6e46794fb79f5ce68f66084750ca326beccdae20030563f9472995ab1d31"}},{"ruleId":"D1","level":"warning","message":{"text":"TrayProjection::from_snapshot (cyclomatic 16): TrayProjection::from_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/tray.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"810f8041e12070f42f25376b04065eb943301da60c822ee139790e37b62cec49"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_desktop::mcp_providers::validate_profile (cyclomatic 16): webcodex_desktop::mcp_providers::validate_profile 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":"apps/desktop/src-tauri/src/mcp_providers.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12097fb2a724b1467dc095cb902c5bf4e9576a10d709d9a4e96994f9ce68779"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_desktop::project_inventory::unregister_batch (cyclomatic 16): webcodex_desktop::project_inventory::unregister_batch has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/project_inventory.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37c375a426a7c60fada0daa81628d092cbe2a44e8c627fe298c966b6828b45c"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserSupervisor::snapshot_query (cyclomatic 16): BrowserSupervisor::snapshot_query has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"8024f3f57738433aa37ea98fd9f993ab8c3ac8c8f5276eab137e4331c234e1ef"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_browser::cdp::clickable::safe_content (cyclomatic 16): webcodex_browser::cdp::clickable::safe_content has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/clickable.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9fdc1bf9449d32399bfe46c6b6930f37f6cb3017bd3505d49684703eec6ea9"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSkillRequest::validate (cyclomatic 16): RunnerSkillRequest::validate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_skill.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ef5c410081a56338310ce349b65c05914083c7e251df4de63e27bb9a6b3702"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::apply_patch_shared::seek_sequence (cyclomatic 16): webcodex_core::apply_patch_shared::seek_sequence has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_patch_shared.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"6925cbc611a93d10044f84666b37a0c8fc8c88e4e2e26baad1f1744db292634f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::lsp_bridge::redact_absolute_paths (cyclomatic 16): webcodex_core::lsp_bridge::redact_absolute_paths has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 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":"crates/webcodex-core/src/lsp_bridge.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"df54ec1aa82a22355787b65e58e721ad73e04aea40a8c3cc28048c1a4a4aebc9"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_core::workflow_session_contract::validate_model_facing_result_expectation (cyclomatic 16): webcodex_core::workflow_session_contract::validate_model_facing_result_expectation has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/workflow_session_contract.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"32aad61a481607df9ac6c42195f37e36249adc27fadcabd7a65adb8f452c1cc6"}},{"ruleId":"D1","level":"warning","message":{"text":"UnifiedInstallerManifest::parse_value (cyclomatic 16): UnifiedInstallerManifest::parse_value has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fedd2d69c3e1f8bb7d4d198f1c45babad16cff9b501fe174311dbdb3d1c3ac9"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_environment::migration::inspect_import (cyclomatic 16): webcodex_environment::migration::inspect_import has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"946e4347eb71a9d0dd5afbea7e96bada64478c1945822bdf873a2aead35ffd7f"}},{"ruleId":"D1","level":"warning","message":{"text":"RunFence::acquire_restartable (cyclomatic 16): RunFence::acquire_restartable has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6e985a37e986c2ddc82bdb274ae850ec4141e477d8cf6ed476b1af58b87868"}},{"ruleId":"D1","level":"warning","message":{"text":"ShellProcess::wait_for_completion (cyclomatic 16): ShellProcess::wait_for_completion has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b46cfce29653a8d16c65f320e00244b3cd70a6bc3a2863dc4b36bd531c0a6a"}},{"ruleId":"D1","level":"warning","message":{"text":"InputChannel::with_writer (cyclomatic 16): InputChannel::with_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":"crates/webcodex-runner/src/webcodex_runner/job_manager/input.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1618c2942a087a2a103b2b807b93aed56e58ad70f071805845ca764d7a2ba235"}},{"ruleId":"D1","level":"warning","message":{"text":"JobManager::enqueue (cyclomatic 16): JobManager::enqueue has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1175f9495fd2032d2e083bf6552c5d506f5eb26fdc2375a89d1abcef6364209a"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::handle_save_project_artifact (cyclomatic 16): webcodex_runner::webcodex_runner::artifacts::handle_save_project_artifact has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"34269da5c41a3e55b3b9acce728161bdae716c200acc499e08ac2fb437fef302"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::config::validate_plugin_config (cyclomatic 16): webcodex_runner::webcodex_runner::config::validate_plugin_config has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a799af6ce5383217232461e4af58fd238f35de23157f3a9d9f28e7e9fa9b5f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::shell::process_tree::terminate_child_process_tree_until (cyclomatic 16): webcodex_runner::webcodex_runner::shell::process_tree::terminate_child_process_tree_until has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/process_tree.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"131d02564563cbdbf56f60ef4ae92752bbd60e210aadb87f41b25520b29a6798"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::validation::execute::terminate_validation_child (cyclomatic 16): webcodex_runner::webcodex_runner::validation::execute::terminate_validation_child has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/execute.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7893a28d9894c9b3695f1a29eabd6d3a02cce3b1965ca7614bd990038179a6e3"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerRegistry::job_attention_snapshot_locked (cyclomatic 16): RunnerRegistry::job_attention_snapshot_locked has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1002e97ebca1af5fcb20c57533cbcde716ae99c1bab1c6230df7edc5be37301"}},{"ruleId":"D1","level":"warning","message":{"text":"Database::consume_agent_wake_with_now (cyclomatic 16): Database::consume_agent_wake_with_now has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c8c347e0174a83f6124ed668c72c27209af1bdc0e751bc251a0044000a81f1"}},{"ruleId":"D1","level":"warning","message":{"text":"Database::recover_expired_mcp_app_endpoint (cyclomatic 16): Database::recover_expired_mcp_app_endpoint has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde1b32bab49664e7a5204fa42c27d6edf796ca1a0d2a364a3d8fb8b888921d1"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionStore::resolve_ack_ref (cyclomatic 16): SessionStore::resolve_ack_ref has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/messages.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bccfd330434dca41ea8c78fe62f5bea70508e9581e2145e0e1ce0f5c0950288"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workflow_session::console::group_exploration_activity (cyclomatic 16): webcodex_workflow_session::console::group_exploration_activity has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/console.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2932fd51dcf9503002ac3287d5c00e98a031290a36f1fc8357cb3f2e38bdd98"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workflow_session::events::classify_error_message (cyclomatic 16): webcodex_workflow_session::events::classify_error_message has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ed97a779b6375888861d965a311ce394be5fe8028362d4be99678f9fc95202"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex_workflow_session::events::push_lsp_result_paths (cyclomatic 16): webcodex_workflow_session::events::push_lsp_result_paths has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f45866b150cc3dfbdcd8d9a44a68cbe3fa08163148b5b41069dde52e763b104"}},{"ruleId":"D1","level":"warning","message":{"text":"ControlExecution::validate (cyclomatic 16): ControlExecution::validate 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":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7fa6a65d16fbc02907cd4d79ca229e0354150263489e99f1b2439ddb492c75"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::work_on_project (cyclomatic 16): ToolRuntime::work_on_project 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":"src/tool_runtime/coding_task/startup.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef53dd07c268474e45fba1ce4d67757175d6f3f55e9230dca4a906dbbe076a12"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::write_project_file (cyclomatic 16): ToolRuntime::write_project_file 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":"src/tool_runtime/files/mutations/write.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce0867e029b63a7d261475f35ff98c4f3b300d57b0d5c7fbc33ff22836615a3"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::git_commit_paths (cyclomatic 16): ToolRuntime::git_commit_paths 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":"src/tool_runtime/git/mutations.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9aed372a62bcf0e6ce6ee086ca6eb1d5b58c2ddb43eb5f768dd6530966eb48f"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::apply_unified_diff (cyclomatic 16): ToolRuntime::apply_unified_diff 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":"src/tool_runtime/patch.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"056231356392c383d88c389a05d96538f9151ad5439e1149c1722e6f835bfc0f"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::post_peer_message_tool (cyclomatic 16): ToolRuntime::post_peer_message_tool 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":"src/tool_runtime/peer_collaboration.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c917f7d7f7e7f1a79166e0ee986241626aa5809a82168b67a0e82fcc54aba4"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::project_build (cyclomatic 16): ToolRuntime::project_build 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":"src/tool_runtime/project_build.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f7b459bac2d333be6aacc2888ccbbb2c259320f3a7ef8c47ab8ae9f3a7efb4"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::prepare_managed_worktree (cyclomatic 16): ToolRuntime::prepare_managed_worktree 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":"src/tool_runtime/projects.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"419282a8c9c63ea741c6e708349324fd57f72fa033ac1732616567ad3c6c47ee"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::load_runner_instruction_files (cyclomatic 16): ToolRuntime::load_runner_instruction_files 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":"src/tool_runtime/runner_instructions.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d858d367706b1077e8092301caf3a2ef2c5f03000c7c6f4a9daa4ef8bd2de4e"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::run_script_with_contract_for_resource (cyclomatic 16): ToolRuntime::run_script_with_contract_for_resource 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":"src/tool_runtime/script.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f7d3ac87aa3d05b032ce9ee43ddcc3c29ee1e8acbb3e9ffe1336fd3e79e884"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::runner_skill_request (cyclomatic 16): ToolRuntime::runner_skill_request 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":"src/tool_runtime/skills.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69f6eb5b8a9969bf813c8531a095890b74342c44b21ca0e2d17f67d74a2d9b8"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRuntime::post_window_operator_message_with_options_for_principal (cyclomatic 16): ToolRuntime::post_window_operator_message_with_options_for_principal 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":"src/tool_runtime/window_collaboration.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9238a32a9db60623bb72a1f0bc90d5f145201776554123b67615cffb68ee213e"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionShellRegistry::apply_result (cyclomatic 16): SessionShellRegistry::apply_result 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":"src/tool_runtime/session_shell.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9931511a50c151ef52c33f01ac8fc364b5b5439eb0861056281a3ae3225335"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::cloudflare_host::run_cloudflare_tunnel_with_stop (cyclomatic 16): webcodex::cloudflare_host::run_cloudflare_tunnel_with_stop 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":"src/cloudflare_host.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"08aede6c969e5de8ea3b119a35f9078ca259ffda02e8f193599e49bbebde00d0"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::config::sanitize_quic_runtime_error (cyclomatic 16): webcodex::config::sanitize_quic_runtime_error 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":"src/config.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd60569ca9fe5bfc496dc5456316c0c8e36abbfd9e8473efc6d2b7380c99f8c"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::cli::project_manifest (cyclomatic 16): webcodex::mcp::cli::project_manifest 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 (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":"src/mcp/cli.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23712210f80fa2c73243778e79b99ed5c8aa7f445c1d005a16c28c3cc65f0f7"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::cli::text::render_manifest (cyclomatic 16): webcodex::mcp::cli::text::render_manifest 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":"src/mcp/cli/text.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7857faadf44ccab94e9c93853d9e65930511ccfcfe80dd9d4557ec47a738a6"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::mcp::resources::handle_read (cyclomatic 16): webcodex::mcp::resources::handle_read 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":"src/mcp/resources.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bcd529129f432027fc694b4a0935f4b50e10f987ea8c6254a4f46c20ac7f3f"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::route_metadata::audit_class_for_runtime_tool (cyclomatic 16): webcodex::route_metadata::audit_class_for_runtime_tool 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":"src/route_metadata.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f1a09723e9ceb12ef8ceb256b1c4c573f53ddffed4762ddd8735d3d5c92256"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::read_files::enforce_final_model_facing_hard_cap (cyclomatic 16): webcodex::tool_runtime::read_files::enforce_final_model_facing_hard_cap 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":"src/tool_runtime/read_files.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"568ab02d1e165aab62dcb42d38080c66bb83d39620084c40216b731e824de54d"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::result_projection::sparsify_search_success_for_model (cyclomatic 16): webcodex::tool_runtime::result_projection::sparsify_search_success_for_model 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":"src/tool_runtime/result_projection.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"04416361be6f86dad9e956edceeeb9def2920b4a122cf2d0ac13065b424499c4"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::window_activity_projection::project_window_loop_timings (cyclomatic 16): webcodex::tool_runtime::window_activity_projection::project_window_loop_timings 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":"src/tool_runtime/window_activity_projection.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fa7e637a90ea69254f7b33b9a844ebf0c909a9e1f36752a7fd79886d241901"}},{"ruleId":"D1","level":"warning","message":{"text":"webcodex::tool_runtime::work_result::semantic_activity_label (cyclomatic 16): webcodex::tool_runtime::work_result::semantic_activity_label 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":"src/tool_runtime/work_result.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86b5c45b5de3149e45b2ce01f6a4e413dd51822dce6832685c903880a213b67"}},{"ruleId":"D1","level":"warning","message":{"text":"platform_security._windows_private_acl (cyclomatic 16): platform_security._windows_private_acl has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/codex/platform_security.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36b806ac041c5ab4dbb644756832b54f79c621f762e7f1fe108fa1ab5e421df"}},{"ruleId":"D1","level":"warning","message":{"text":"read_handoff._valid_goal_detail (cyclomatic 16): read_handoff._valid_goal_detail has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/codex/read_handoff.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"16685c7835993be64c0913663b82e088035099deedfd44871e25ea247eb9c5c1"}},{"ruleId":"D1","level":"warning","message":{"text":"QuickShareSetup.QuickShareSetup (cyclomatic 16): QuickShareSetup.QuickShareSetup has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 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":"apps/desktop/src/features/onboarding/QuickShareSetup.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bec302ea6f63d5ef0a77f79224c1b30a51c7202c60cea14e89d266aad8440da"}},{"ruleId":"D1","level":"warning","message":{"text":"wrapper.resolveWindowsNpmCli (cyclomatic 16): wrapper.resolveWindowsNpmCli 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":"npm/webcodex/bin/wrapper.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8434fc50e1fc0fe71bfc4f59cd47d8059fd87044e89923230deee391bd736fe9"}},{"ruleId":"D1","level":"warning","message":{"text":"Ir.splitBySection (cyclomatic 16): Ir.splitBySection 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: Ir.renderElement (cyclomatic 60) 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":"src/mcp_docx_app.html"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0d28f6b7593b6370150a04459e98c1c47660c188ce0c41075ad4d1a8c7a679"}},{"ruleId":"D1","level":"warning","message":{"text":"l.#ot (cyclomatic 16): l.#ot 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, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc510411fa076d70093bf11a506b8fdf7da21c1c963b83e91df06a4e96b63591"}},{"ruleId":"D1","level":"warning","message":{"text":"l.#c (cyclomatic 16): l.#c 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: fi.setupMessageHandler (cyclomatic 35) 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":"src/mcp_pdf_app.html"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"cace2516bdb3a5fe6b587807cb776ff2155013b964b6f0b3ba4eaef46ea1406d"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_workbench_app.html.submitWork (cyclomatic 16): mcp_workbench_app.html.submitWork 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":"src/mcp_workbench_app.html"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3e57fec82b3df66dccdde3dc506e502cd9299ca101d0a6c4fe17411dbee7c9"}},{"ruleId":"D1","level":"warning","message":{"text":"assignPart (cyclomatic 16): assignPart has cyclomatic complexity 16 (threshold 15). Of this number, 15 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":"crates/webcodex-browser/src/cdp/widgets/date.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d3a8db7317de1d9206c9d694f9394f59e6b3b6e678060b809695557bd5aae9"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::environment::run_inner (cognitive 189): webcodex_cli::environment::run_inner has cognitive complexity 189 (threshold 15). Drivers by points: if/else 80 (144 pts), match/switch 11 (25 pts), boolean chains 18, loops 1 (2 pts) (nesting depth added 79). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a775ddf58f2cc27a7d9bb90ec276a189d5c6b4933791f0afb6014dd417e812c"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateWorkflow.UpdateWorkflow (cognitive 183): UpdateWorkflow.UpdateWorkflow has cognitive complexity 183 (threshold 15). Drivers by points: ternaries 27 (140 pts), boolean chains 41, if/else 2 (nesting depth added 113). Of this number, 182 points are the body\u0027s own statements and 1 belongs to 4 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":"apps/desktop/src/features/settings/UpdateWorkflow.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"257dc80fe64a03371e1449567e6b50b91f227e823c92620761a0b90c5d743723"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::fake_plugin::main (cognitive 146): webcodex_runner::webcodex_runner::fake_plugin::main has cognitive complexity 146 (threshold 15). Drivers by points: if/else 49 (112 pts), loops 6 (17 pts), match/switch 4 (11 pts), boolean chains 6 (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"27dca22a61439b19701e930b48ffb8c940c29f45059fc4a605287f72e56e915b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::fake_mcp_gateway::main (cognitive 143): webcodex_runner::webcodex_runner::fake_mcp_gateway::main has cognitive complexity 143 (threshold 15). Drivers by points: if/else 47 (103 pts), loops 5 (17 pts), boolean chains 12, match/switch 4 (11 pts) (nesting depth added 75). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e585b74c221f4f9c4ed2638f8bbccba1e9551a6f362a8d24497403c6f20041"}},{"ruleId":"D2","level":"warning","message":{"text":"CodingAgentManager::run_turn (cognitive 131): CodingAgentManager::run_turn has cognitive complexity 131 (threshold 15). Drivers by points: if/else 36 (98 pts), match/switch 12 (20 pts), loops 4 (7 pts), boolean chains 6 (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/run.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5100a77d67d35911a1408c72f88a9938d5e641b661e813d68941492052ac94ee"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerRegistry::poll_checked (cognitive 128): RunnerRegistry::poll_checked has cognitive complexity 128 (threshold 15). Drivers by points: if/else 49 (116 pts), match/switch 2 (6 pts), boolean chains 5, loops 1 (nesting depth added 71). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/polling.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8992c94f3727e6a15df1d5e30b7627c5dc7191a03e324b176445ab656f1a9ae"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_lsp::fake_server::run (cognitive 127): webcodex_lsp::fake_server::run has cognitive complexity 127 (threshold 15). Drivers by points: if/else 35 (97 pts), match/switch 5 (14 pts), loops 4 (10 pts), boolean chains 6 (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"804efb0784b7ff55ded6111f328bb9454056c16609f7b50702044df92ff202a7"}},{"ruleId":"D2","level":"warning","message":{"text":"FirstRun.FirstRun (cognitive 124): FirstRun.FirstRun has cognitive complexity 124 (threshold 15). Drivers by points: boolean chains 70, ternaries 26 (32 pts), if/else 16 (20 pts), error handling 2 (nesting depth added 10). Of this number, 84 points are the body\u0027s own statements and 40 belong to 6 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":"apps/desktop/src/features/onboarding/FirstRun.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26fbaa4379978666b3bfa78307a13abaf26087528f147d6e778d2ec7419251a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::run (cognitive 120): webcodex_cli::run has cognitive complexity 120 (threshold 15). Drivers by points: if/else 22 (59 pts), match/switch 30 (59 pts), boolean chains 2 (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":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6394996069c8a7d1060e7c027d6fb85a7682ffe93d04fb44f43a556db7853e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::transport::polling::run_polling_session (cognitive 115): webcodex_runner::webcodex_runner::transport::polling::run_polling_session has cognitive complexity 115 (threshold 15). Drivers by points: if/else 26 (82 pts), match/switch 9 (27 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/polling.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04f49f88a92fcd7933337b04bfe6ac88917b851551bfa9baa0ff549dff9fb92"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::patches::handle_apply_text_edits_file_request (cognitive 112): webcodex_runner::webcodex_runner::patches::handle_apply_text_edits_file_request has cognitive complexity 112 (threshold 15). Drivers by points: if/else 21 (65 pts), match/switch 12 (35 pts), boolean chains 11, loops 1 (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc429c089c8c8b1540f5e0fe58d8122712148c80ad206e7c2c1b8a6079cb88b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::apply_patch_shared::parse_codex_patch (cognitive 102): webcodex_core::apply_patch_shared::parse_codex_patch has cognitive complexity 102 (threshold 15). Drivers by points: if/else 26 (78 pts), boolean chains 10, loops 5 (10 pts), match/switch 1 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_patch_shared.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cad51a1856c9cc2e8f94e4bab97f61408f0ead488df1c9650aa02cb83d1a7bf"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::enrich_workbench_execution (cognitive 100): ToolRuntime::enrich_workbench_execution has cognitive complexity 100 (threshold 15). Drivers by points: if/else 25 (80 pts), loops 3 (11 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 66). 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":"src/tool_runtime/workbench_execution.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fead06289b7b2249ebecc1890cb481ec20aaf01687d3afbd8518f071857abb20"}},{"ruleId":"D2","level":"warning","message":{"text":"ParsedCall::prepare (cognitive 95): ParsedCall::prepare has cognitive complexity 95 (threshold 15). Drivers by points: if/else 41 (79 pts), boolean chains 8, match/switch 5 (8 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":"src/mcp/tools/call.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dcec6cbeb78d518607b883d8533c7fc8004cf6677539e205c9b612a154d5a6"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::git_diff_page_for_source (cognitive 95): ToolRuntime::git_diff_page_for_source has cognitive complexity 95 (threshold 15). Drivers by points: if/else 45 (52 pts), boolean chains 23, match/switch 14 (20 pts) (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":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"d194b710cd61fe9d6256e99b2bd4bbec27f05478f6692c28d6b416acf96a2cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"TunnelClient::poller (cognitive 93): TunnelClient::poller has cognitive complexity 93 (threshold 15). Drivers by points: if/else 17 (57 pts), match/switch 4 (18 pts), loops 6 (15 pts), boolean chains 3 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/poller.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5a9643dec9109a0953ba8aec2241a5565aabca729124ef9c10325258956b88"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_browser::cdp::infer_control_container_labels::visit (cognitive 91): webcodex_browser::cdp::infer_control_container_labels::visit has cognitive complexity 91 (threshold 15). Drivers by points: if/else 21 (65 pts), loops 5 (21 pts), boolean chains 5 (nesting depth added 60). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":3161}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea7024c23a174e9120977f6da7cfa6087de277ffd4f9bace18ba6e1eb020c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerRegistry::update_job_checked (cognitive 88): RunnerRegistry::update_job_checked has cognitive complexity 88 (threshold 15). Drivers by points: if/else 52 (70 pts), boolean chains 18 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0771f96e38fb20f43dee50266fdd91486fbe2a8ef384cee9a0d62499ac515d"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::read_workbench_state (cognitive 88): ToolRuntime::read_workbench_state has cognitive complexity 88 (threshold 15). Drivers by points: if/else 29 (66 pts), loops 2 (10 pts), match/switch 4 (10 pts), boolean chains 2 (nesting depth added 51). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/workbench_state.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae6e099abfe135a12b058f47eb86cfd0a2224cc585685054da3bc1fa758e275"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::mcp_post (cognitive 87): webcodex::mcp::mcp_post has cognitive complexity 87 (threshold 15). Drivers by points: if/else 45 (64 pts), match/switch 10 (14 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8296ba56339a5feedf04450805ddcbb22dbdf8556b42a73bce71e8f00b1fdda"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::startup_brief::enforce_hard_size_limit (cognitive 87): webcodex::tool_runtime::startup_brief::enforce_hard_size_limit has cognitive complexity 87 (threshold 15). Drivers by points: if/else 29 (72 pts), loops 10 (15 pts) (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":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bc84ceaba3092c909fd1cd56956d3fcb3e6f96f70642826697bd496593e80d"}},{"ruleId":"D2","level":"warning","message":{"text":"JobManager::start_prepared_shell_job (cognitive 86): JobManager::start_prepared_shell_job has cognitive complexity 86 (threshold 15). Drivers by points: if/else 34 (63 pts), match/switch 5 (13 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35926589327831fd9289a2d5e31540edcfed60eb281998ff580f36cce1419d4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::projects::lifecycle::handle_project_operation (cognitive 86): webcodex_runner::webcodex_runner::projects::lifecycle::handle_project_operation has cognitive complexity 86 (threshold 15). Drivers by points: if/else 39 (56 pts), match/switch 16 (25 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7fdd8862901014e948a76e618ed6297b17e4569e614bc55cb22891f247e1d0"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::projects::managed_worktree::handle_prepare_managed_worktree_operation (cognitive 86): webcodex_runner::webcodex_runner::projects::managed_worktree::handle_prepare_managed_worktree_operation has cognitive complexity 86 (threshold 15). Drivers by points: match/switch 26 (37 pts), if/else 27 (35 pts), boolean chains 12, loops 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"a139cc3a762c56e6470386d6233ca0b38ddaf6d091a467fec9d0fb29fb80e988"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::job_convergence_record (cognitive 86): ToolRuntime::job_convergence_record has cognitive complexity 86 (threshold 15). Drivers by points: if/else 25 (63 pts), loops 4 (11 pts), boolean chains 10, match/switch 1 (2 pts) (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":"src/tool_runtime/model_ergonomics_telemetry/job_convergence.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3317efdf788b8b4e164bde286cb755ffc116cfc1b55b9f430c3d9985abd20a38"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::text_edits_result::validate_apply_text_edits_success_metadata (cognitive 86): webcodex::tool_runtime::files::mutations::text_edits_result::validate_apply_text_edits_success_metadata has cognitive complexity 86 (threshold 15). Drivers by points: if/else 26 (62 pts), boolean chains 17, match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/text_edits_result.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f75aaee40ef7012d8ef82cde5121500e85c7dca3419f3c3a0f5085ecaea9bf"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPanel.SettingsView (cognitive 86): SettingsPanel.SettingsView has cognitive complexity 86 (threshold 15). Drivers by points: boolean chains 32, if/else 25 (29 pts), ternaries 12 (21 pts), error handling 4 (nesting depth added 13). Of this number, 41 points are the body\u0027s own statements and 45 belong to 15 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":"apps/desktop/src/features/settings/SettingsPanel.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"95906f5668d4a9baa57976c28c821da024bcad2c296873a909a266b9fba13c56"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsPanel.DiagnosticsContents (cognitive 85): DiagnosticsPanel.DiagnosticsContents has cognitive complexity 85 (threshold 15). Drivers by points: boolean chains 42, if/else 24 (30 pts), ternaries 7 (11 pts), error handling 2 (nesting depth added 10). Of this number, 39 points are the body\u0027s own statements and 46 belong to 15 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":"apps/desktop/src/features/settings/DiagnosticsPanel.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1b1fb5761866c30af714dfc3b531817ae32739fb1b8914254e66e88354b5c7"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::local_update_status (cognitive 84): AppState::local_update_status has cognitive complexity 84 (threshold 15). Drivers by points: if/else 23 (47 pts), match/switch 6 (23 pts), loops 2 (8 pts), boolean chains 6 (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":"apps/desktop/src-tauri/src/state/updates/view.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba00d9e4016f08394ae1ca9b16d725da69b4276cb59781eb243f7816f06d1206"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::govern_dispatch (cognitive 84): ToolRuntime::govern_dispatch has cognitive complexity 84 (threshold 15). Drivers by points: if/else 47 (73 pts), match/switch 4 (8 pts), boolean chains 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/dispatch/governance.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f42353178faa42e81f66be3d7192f739deaf947f6f9ecea5ab6df8610f6163"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_result_app.html.renderGitReview (cognitive 84): mcp_result_app.html.renderGitReview has cognitive complexity 84 (threshold 15). Drivers by points: ternaries 29 (57 pts), boolean chains 14, if/else 12 (13 pts) (nesting depth added 29). Most of this is not in the body itself: 14 of the 84 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 576, 602). 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":"src/mcp_result_app.html"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3190899ab916c762ab8c5dc62dc652028b9b7b59d18f0d3970faadf97714cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner_registry::reconciliation::validate_snapshot (cognitive 81): webcodex_runner_registry::reconciliation::validate_snapshot has cognitive complexity 81 (threshold 15). Drivers by points: if/else 28 (46 pts), boolean chains 26, match/switch 4 (9 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2c441f3b7ee06fb7edba36e88437c711643b1598237e0946dd5167d42abf51"}},{"ruleId":"D2","level":"warning","message":{"text":"Knowledge.refresh (cognitive 81): Knowledge.refresh has cognitive complexity 81 (threshold 15). Drivers by points: if/else 22 (50 pts), boolean chains 10, ternaries 2 (8 pts), error handling 4 (7 pts), loops 4 (6 pts) (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/project-knowledge/knowledge.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"15790a09da0bc13e165a8345e3ecd7ad3acaefd4fd98a2f7d859fe270cb19fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionRuntimes::monitor (cognitive 80): ConnectionRuntimes::monitor has cognitive complexity 80 (threshold 15). Drivers by points: if/else 30 (68 pts), boolean chains 7, match/switch 2 (4 pts), loops 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/connections.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70891ba0a24defb599bbd6bb4404402618b7d49a86cf8ea6aae2baa4bf7a536"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerRegistry::complete_checked (cognitive 80): RunnerRegistry::complete_checked has cognitive complexity 80 (threshold 15). Drivers by points: if/else 40 (65 pts), boolean chains 9, match/switch 3 (6 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/polling.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe9882fa5725b2013f2dcddfd1a95ba0749b17814ba57a537bdd2b78383f39c"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthMiddleware::handle (cognitive 80): AuthMiddleware::handle has cognitive complexity 80 (threshold 15). Drivers by points: if/else 31 (74 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/middleware.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"707f55b668501bb046bbd645b6173e1c0e0a69881ed945030ad8dcc738c5e1b9"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::patches::edit_plan (cognitive 79): webcodex_runner::webcodex_runner::patches::edit_plan has cognitive complexity 79 (threshold 15). Drivers by points: if/else 24 (54 pts), loops 6 (11 pts), boolean chains 7, match/switch 4 (7 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6e9b73bd084b1f3b0b176bbe71efc18b507986490e01c3c79885833d204973"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::git::show_changes::parse_show_changes_output_with_observation (cognitive 78): webcodex::tool_runtime::git::show_changes::parse_show_changes_output_with_observation has cognitive complexity 78 (threshold 15). Drivers by points: if/else 41 (59 pts), boolean chains 9, match/switch 4 (7 pts), loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb3ecdbbc1b97cab2a3d47fab1bad5b18a1383195a75642bcabc88a39fee9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEnvironment::upgrade_rollback_with_target (cognitive 77): NativeEnvironment::upgrade_rollback_with_target has cognitive complexity 77 (threshold 15). Drivers by points: if/else 20 (61 pts), boolean chains 8, loops 4 (8 pts) (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4509b5e89943432ef74daf577f8ef911c90f0fbd3f6b445e1fd5448758266f"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceContext.WorkspaceProvider (cognitive 77): WorkspaceContext.WorkspaceProvider has cognitive complexity 77 (threshold 15). Drivers by points: ternaries 19 (31 pts), boolean chains 29, if/else 16 (17 pts) (nesting depth added 13). Most of this is not in the body itself: 11 of the 77 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 182, 136, 117, \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":"apps/desktop/src/features/workspace/WorkspaceContext.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c7a1b6b37f0828c82571925276217156aea892d324fa862d2684f9352bda80"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::resolve_coding_startup_project (cognitive 75): ToolRuntime::resolve_coding_startup_project has cognitive complexity 75 (threshold 15). Drivers by points: if/else 26 (66 pts), match/switch 4 (9 pts) (nesting depth added 45). 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":"src/tool_runtime/coding_task/project.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df70cd6a3a4b4213463355f2f7e04f9ff490ac8baf020df8fb0a59c28429bf3"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin.analyzeNodes (cognitive 75): plugin.analyzeNodes has cognitive complexity 75 (threshold 15). Drivers by points: if/else 17 (40 pts), ternaries 6 (18 pts), boolean chains 11, loops 4 (6 pts) (nesting depth added 37). Of this number, 74 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":"plugins/campus-application/src/plugin.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4b88ca19112095d53d272aa6667af1eb9162b4c1b5bec26f8eaec98eefdb43"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeSurface::admit (cognitive 74): RuntimeSurface::admit has cognitive complexity 74 (threshold 15). Drivers by points: boolean chains 36, if/else 16 (31 pts), match/switch 3 (7 pts) (nesting depth added 19). 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":"src/mcp/tools/call/surface.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9798fe8403013a8499179af0141c9680292f2a46b5b0ebdcef26ac1feee2575c"}},{"ruleId":"D2","level":"warning","message":{"text":"fill-batch.reconcileFill (cognitive 74): fill-batch.reconcileFill has cognitive complexity 74 (threshold 15). Drivers by points: ternaries 13 (42 pts), if/else 11 (17 pts), boolean chains 14, loops 1 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/campus-application/src/fill-batch.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"da21ce4bd4bbc72c3b5f086ef69ee7974e035f280cedf5e5db9939b3dd48a371"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::dispatch_computer_request_for_instance (cognitive 72): ToolRuntime::dispatch_computer_request_for_instance has cognitive complexity 72 (threshold 15). Drivers by points: if/else 42 (54 pts), boolean chains 11, match/switch 6, loops 1 (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef1575ed30ed8ff9d3d7d0ef699a5a2aa3cce2f23806586cb9c4caa37566ab8"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::validation_success_projection::sparsify_structured_validation_success_evidence (cognitive 72): webcodex::tool_runtime::validation_success_projection::sparsify_structured_validation_success_evidence has cognitive complexity 72 (threshold 15). Drivers by points: if/else 31 (46 pts), boolean chains 23, match/switch 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/validation_success_projection.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16a79c31993359e1a4ebe8bdd9ed0923076c4128e7f4f845a6c286640a20f96"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner_registry::validation::validate_file_request (cognitive 71): webcodex_runner_registry::validation::validate_file_request has cognitive complexity 71 (threshold 15). Drivers by points: if/else 35 (55 pts), boolean chains 12, match/switch 3 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4b9a6278f1dbbe969de51c7f3050d1298d2c103b6b851ed4ceb23f59b819b2"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimePanel.RuntimePanelContent (cognitive 71): RuntimePanel.RuntimePanelContent has cognitive complexity 71 (threshold 15). Drivers by points: boolean chains 30, if/else 21 (23 pts), ternaries 9 (16 pts), error handling 2 (nesting depth added 9). Of this number, 37 points are the body\u0027s own statements and 34 belong to 10 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":"apps/desktop/src/features/settings/RuntimePanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f18f64cc0200cf73f57279a86873f500421e3181c4a28374dc7e5cc0912722"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_overview::validate_project_overview (cognitive 69): webcodex_workspace::project_overview::validate_project_overview has cognitive complexity 69 (threshold 15). Drivers by points: if/else 38 (57 pts), loops 8 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_overview.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b2024905283b0f0c979ef3f3dee220ea269d1d94c95bcc91c9851efc4d19e9"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::dispatch_browser_request (cognitive 69): ToolRuntime::dispatch_browser_request has cognitive complexity 69 (threshold 15). Drivers by points: if/else 36 (52 pts), boolean chains 8, match/switch 6, loops 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7879ce6454c9af204152652340544f06719bf6d5915a8355fad9a854b2059dd"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::plugin::preflight_plugin_schema_node (cognitive 68): webcodex_core::plugin::preflight_plugin_schema_node has cognitive complexity 68 (threshold 15). Drivers by points: if/else 25 (51 pts), loops 4 (8 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/plugin.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a747daaa023df1db5f2e981c6c6157189717cc79c1d4538b3be3df719b2853"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::apply_text_edits (cognitive 68): ToolRuntime::apply_text_edits has cognitive complexity 68 (threshold 15). Drivers by points: if/else 20 (37 pts), match/switch 8 (15 pts), loops 7 (9 pts), boolean chains 7 (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":"src/tool_runtime/files/mutations/text_edits.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"73df696efe0a6ba6f24160ad8081a47bfca9dbde64254edde7603097d5073420"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::shell::execution::execute_configured_command_impl (cognitive 67): webcodex_runner::webcodex_runner::shell::execution::execute_configured_command_impl has cognitive complexity 67 (threshold 15). Drivers by points: if/else 23 (44 pts), match/switch 10 (15 pts), boolean chains 7, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/execution.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8c1d5891b70ba91fffb5742ea2d319aac0dbf4aa7ecc641890643a0b95e21e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::controller::run_controller_command (cognitive 66): webcodex_cli::webcodex_cli::controller::run_controller_command has cognitive complexity 66 (threshold 15). Drivers by points: if/else 22 (54 pts), match/switch 2 (6 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 39). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"2876f8ca912962c6b6887481470c3419d513787e01957b3d47cc5c4ab45b22a7"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerCapacityPanel.RunnerCapacitySettings (cognitive 66): RunnerCapacityPanel.RunnerCapacitySettings has cognitive complexity 66 (threshold 15). Drivers by points: boolean chains 35, if/else 18 (20 pts), ternaries 9 (10 pts), error handling 1 (nesting depth added 3). Of this number, 27 points are the body\u0027s own statements and 39 belong to 10 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":"apps/desktop/src/features/settings/RunnerCapacityPanel.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7a8d81530fb8ee5862b4d83e4fa085e6e03d6384c97db4ea7ab71777faac5b"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::search_webcodex_resources (cognitive 64): ToolRuntime::search_webcodex_resources has cognitive complexity 64 (threshold 15). Drivers by points: if/else 22 (50 pts), match/switch 4 (9 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/resource_references.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"799659efed70993c2c48dd93ad1d546a564a6e848eb31985b71fa98759cd0914"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::materialize_validation_job_candidates (cognitive 64): ToolRuntime::materialize_validation_job_candidates has cognitive complexity 64 (threshold 15). Drivers by points: if/else 22 (53 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/validation_events.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacab5663c6a9b47754252b6f1ca21457a237053209b41291b2b0b987670deaa"}},{"ruleId":"D2","level":"warning","message":{"text":"native-config.inspectNativeConfig (cognitive 64): native-config.inspectNativeConfig has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 16, ternaries 13 (15 pts), error handling 3 (5 pts), loops 3 (nesting depth added 11). Of this number, 59 points are the body\u0027s own statements and 5 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/agent-browser/src/native-config.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9d3a237c4729e82ced026eb73893f90fbbbd14d5933fd3ea50d22357a8faa5"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEnvironment::doctor (cognitive 63): NativeEnvironment::doctor has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (40 pts), match/switch 5 (14 pts), boolean chains 5, loops 2 (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":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b5b6b8440d55894b7c73b63b57c5d752169752c010b8383a63f3485f6146b0"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::project_entry_share::share (cognitive 63): webcodex::project_entry_share::share has cognitive complexity 63 (threshold 15). Drivers by points: if/else 28 (37 pts), match/switch 14 (23 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_share.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40fda37c3e3653709a5ed49bad36149e22c1e40811a191e5d5a78e4c5d5e0f4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::migration::migrate_legacy_environment (cognitive 62): webcodex_environment::migration::migrate_legacy_environment has cognitive complexity 62 (threshold 15). Drivers by points: if/else 26 (48 pts), boolean chains 7, loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68e5b0bea10a8562b0fb378050d8b59be275f2262fbd0617938def695f06b88"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::transfer_resolved_project_artifact (cognitive 62): ToolRuntime::transfer_resolved_project_artifact has cognitive complexity 62 (threshold 15). Drivers by points: if/else 26 (43 pts), match/switch 7 (14 pts), boolean chains 4, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/artifact_transfer.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9a05144e59aa36de1da0c3ed078b520fdcc989a539a09e4fd82653b11530c8"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_result_app.html.renderValidationSummary (cognitive 62): mcp_result_app.html.renderValidationSummary has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 27 (44 pts), boolean chains 12, if/else 6 (nesting depth added 17). Most of this is not in the body itself: 13 of the 62 points are its own statements and the rest belongs to one function literal inside it that branches (line 235). 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":"src/mcp_result_app.html"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed033bd2b258c2c790c0d21c800eb75299546447903ce70e324da0696d02c587"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.loadWorkbench (cognitive 62): mcp_workbench_app.html.loadWorkbench has cognitive complexity 62 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 15, ternaries 6, error handling 2 (4 pts) (nesting depth added 22). Of this number, 60 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":"src/mcp_workbench_app.html"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcee5e70ea21989e185aecaacf883bef084e181d99d365bf0f3fb5c926180a17"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopCore::configure_local_setup (cognitive 61): DesktopCore::configure_local_setup has cognitive complexity 61 (threshold 15). Drivers by points: if/else 33 (44 pts), match/switch 9 (13 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"2236da91a751e6cae88e716463397c401b34667e35528b4c63118d4069385c34"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_code_mode::runtime::execute_with_termination_mode_inner (cognitive 61): webcodex_code_mode::runtime::execute_with_termination_mode_inner has cognitive complexity 61 (threshold 15). Drivers by points: if/else 14 (43 pts), match/switch 6 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-code-mode/src/runtime.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5388b1cd3a1fa7611f08d9a7acb6e7db44514fb7d16e43a3cc51e154fe8d90"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_overview::build_project_overview (cognitive 61): webcodex_workspace::project_overview::build_project_overview has cognitive complexity 61 (threshold 15). Drivers by points: if/else 22 (43 pts), match/switch 5 (13 pts), loops 3 (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":"crates/webcodex-workspace/src/project_overview.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2404d0e7c2ba58eb2b453ea1625ed309e048456c3b8f6b3eb3aebcc628ccf7"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_goal_plan_app.html.validPlan (cognitive 61): mcp_goal_plan_app.html.validPlan has cognitive complexity 61 (threshold 15). Drivers by points: if/else 29 (38 pts), boolean chains 21, loops 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_goal_plan_app.html"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ed3ad3a26d7a04ce2223448313c6a4202db2a131212126737bc007a3ff5490"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::environment::parse (cognitive 60): webcodex_cli::environment::parse has cognitive complexity 60 (threshold 15). Drivers by points: boolean chains 27, if/else 23 (27 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"57caf17793be32342d04dbf2db30573a832011344323403d77031cf5c81eb824"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::transport::stream::serve_registered_stream (cognitive 60): webcodex_runner::webcodex_runner::transport::stream::serve_registered_stream has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (39 pts), match/switch 9 (18 pts), boolean chains 2, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/stream.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"2197db3470e6210c8189e9b12b29711c4ab3dcbd03703951c0fcfa3878536390"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::validation::execute::run_bounded (cognitive 60): webcodex_runner::webcodex_runner::validation::execute::run_bounded has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (39 pts), loops 4 (10 pts), match/switch 5 (10 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":"crates/webcodex-runner/src/webcodex_runner/validation/execute.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d8f2fc84773face9e9461e5aff629519010fc0495a75b3b872014b1c8747d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadinessBanner.ReadinessBanner (cognitive 60): ReadinessBanner.ReadinessBanner has cognitive complexity 60 (threshold 15). Drivers by points: ternaries 14 (29 pts), boolean chains 24, if/else 4, error handling 2 (3 pts) (nesting depth added 16). Of this number, 52 points are the body\u0027s own statements and 8 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":"apps/desktop/src/features/dashboard/ReadinessBanner.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34fb1732a07716d5e36d5342bf6e88505df3fd23316ce4efdaf5f4452c415c6"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionCard.ConnectionCard (cognitive 60): ConnectionCard.ConnectionCard has cognitive complexity 60 (threshold 15). Drivers by points: ternaries 15 (32 pts), boolean chains 21, if/else 6 (7 pts) (nesting depth added 18). Of this number, 56 points are the body\u0027s own statements and 4 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":"apps/desktop/src/features/connection/ConnectionCard.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa9ca73e4446d99d45e604b8b6fb5d8c20e9501e01452d87e23809c50c97ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"JobManager::start_ssh_shell_job (cognitive 59): JobManager::start_ssh_shell_job has cognitive complexity 59 (threshold 15). Drivers by points: if/else 29 (43 pts), match/switch 6 (9 pts), boolean chains 4, 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":"crates/webcodex-runner/src/webcodex_runner/job_manager/ssh.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cb0537da88bbe1d395f3111aef41538855bbe012232921f417647a8e8eebe3"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeResponse::finish (cognitive 59): RuntimeResponse::finish has cognitive complexity 59 (threshold 15). Drivers by points: if/else 34 (49 pts), boolean chains 8, match/switch 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call/response.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc873635efea7ef655fd1d52d2ad8400ff06699f83873a813222f0a0f6f9901"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudflareConnectionCard.CloudflareConnectionCard (cognitive 59): CloudflareConnectionCard.CloudflareConnectionCard has cognitive complexity 59 (threshold 15). Drivers by points: boolean chains 25, ternaries 12 (22 pts), if/else 8 (10 pts), error handling 2 (nesting depth added 12). Of this number, 40 points are the body\u0027s own statements and 19 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":"apps/desktop/src/features/connection/CloudflareConnectionCard.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a40df1c92a94abd6661e57b09ff6eeb9a4f9512ab77aecdcc1067760bfee39"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::current_window_activity (cognitive 58): ToolRuntime::current_window_activity has cognitive complexity 58 (threshold 15). Drivers by points: if/else 31 (48 pts), loops 4, boolean chains 3, 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":"src/tool_runtime/current_window_activity.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ca7047664f9cc1a880cdf2b7db867660a780549ce88993b4f6e721ca77c5db"}},{"ruleId":"D2","level":"warning","message":{"text":"l.isVisible (cognitive 58): l.isVisible has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (43 pts), loops 4 (12 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdc87eb66bc585c7d355a7bc11a8d70e3cdc3fefc3749e1da8fccc9ed881e99"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::patches::execute_planned_file_changes (cognitive 57): webcodex_runner::webcodex_runner::patches::execute_planned_file_changes has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (41 pts), loops 5 (13 pts), match/switch 1 (3 pts) (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"19eeb3c574160a3a822a8529de5f906d3ebf3c39b9a20412568dadc1f31bbee2"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::goal_activity_observation_at (cognitive 57): ToolRuntime::goal_activity_observation_at has cognitive complexity 57 (threshold 15). Drivers by points: if/else 21 (40 pts), loops 5 (8 pts), boolean chains 5, match/switch 2 (4 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":"src/tool_runtime/goal.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b7cfde0cb5217fae366ff8a4cc672574b2b8237365ba06baee8c982f6ee83d"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::authorize_runner_tool (cognitive 57): ToolRuntime::authorize_runner_tool has cognitive complexity 57 (threshold 15). Drivers by points: if/else 26 (51 pts), loops 1 (3 pts), boolean chains 2, match/switch 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":"src/tool_runtime/runner_authorization.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a998e3f2245761efe04eda0b5bfb3abba68f7dd8226c1cdf0d5950f2d66c24"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::parse_connect (cognitive 56): webcodex_cli::parse_connect has cognitive complexity 56 (threshold 15). Drivers by points: if/else 24 (31 pts), match/switch 13 (21 pts), boolean chains 3, loops 1 (nesting depth added 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"801124fa7836677dad68df8d921b34de930959c88f50ae9f54aab3d9b869e692"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::runner_operation::decode_operation (cognitive 56): webcodex_core::runner_operation::decode_operation has cognitive complexity 56 (threshold 15). Drivers by points: if/else 21 (38 pts), boolean chains 17, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"055b248a38192bd292d25dfc8b5d1ce3c3a515325c65c9edcbc51fbbf129c795"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::unified_update::source::verify_source_manifest_for_flavor (cognitive 56): webcodex_environment::unified_update::source::verify_source_manifest_for_flavor has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 16, loops 3 (5 pts), match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/source.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2ae2ae9ad16efcb45091fccd095a9673962758dbf7c1c71deec3b0a0d93917"}},{"ruleId":"D2","level":"warning","message":{"text":"PendingDispatchFence::synchronous_rejection (cognitive 56): PendingDispatchFence::synchronous_rejection has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (42 pts), match/switch 5 (10 pts), boolean chains 4 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/dispatch_fence.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d32b0da876a8dcf5f805e1c108ba57bedeba58ecac3c0f1e70ca712147acfb"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::text::compact::jobs (cognitive 56): webcodex::mcp::cli::text::compact::jobs has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (47 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61faf1b7e077b7b14efe3d87ca3fa1c737eeef62295ba42e5452ce0502c80ab"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::oauth_http::shared_key_bridge::oauth_shared_key_client_provision (cognitive 56): webcodex::oauth_http::shared_key_bridge::oauth_shared_key_client_provision has cognitive complexity 56 (threshold 15). Drivers by points: if/else 30 (36 pts), boolean chains 14, match/switch 3 (6 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":"src/oauth_http/shared_key_bridge.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecf9c22291194c75f76bd6736476aa5d3b88acfd27565d792bf88288996b119"}},{"ruleId":"D2","level":"warning","message":{"text":"vi.render (cognitive 56): vi.render has cognitive complexity 56 (threshold 15). Drivers by points: boolean chains 39, if/else 5 (9 pts), loops 1 (4 pts), ternaries 1 (4 pts) (nesting depth added 10). Of this number, 51 points are the body\u0027s own statements and 5 belong to 8 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9edeecc8246c013c312b76d4088f466d3bcfd9eefcf84ac2d2c8827f31e71b"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_result_app.html.renderPresentation (cognitive 56): mcp_result_app.html.renderPresentation has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (34 pts), ternaries 9 (17 pts), boolean chains 5 (nesting depth added 23). Of this number, 54 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":"src/mcp_result_app.html"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"593883d6812d00fcc206ba13b6b1c53b61a678e15655943883705e3786039286"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::connect::oauth::run_oauth_connect (cognitive 55): webcodex_cli::webcodex_cli::connect::oauth::run_oauth_connect has cognitive complexity 55 (threshold 15). Drivers by points: if/else 27 (40 pts), match/switch 7 (12 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f360b89230d227faf3acca5f35beea0d4cb03f4db889a1da319069bbc5fd272"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEnvironment::reconcile (cognitive 55): NativeEnvironment::reconcile has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (37 pts), match/switch 6 (14 pts), boolean chains 4 (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0b94c0e3288107958d34007a0e443b8dfb7b5907e9bd01189f83c116d1e333"}},{"ruleId":"D2","level":"warning","message":{"text":"AdminProjectLifecycleService::mutate_authorized_core (cognitive 55): AdminProjectLifecycleService::mutate_authorized_core has cognitive complexity 55 (threshold 15). Drivers by points: if/else 35 (47 pts), boolean chains 7, 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":"src/admin_project_lifecycle.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f452756cc0c23cae43aded1cf42e435463e5afe184f3b45c7f9c90966ae3c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::observe_jobs_for_auth (cognitive 55): ToolRuntime::observe_jobs_for_auth has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (36 pts), match/switch 5 (8 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab6056f33ee59f9bf628f331c1904b5b98c41d5d4527e111e8bb2fa538b663c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::tools::mcp_tools_list_payload_with_exposure (cognitive 55): webcodex::mcp::tools::mcp_tools_list_payload_with_exposure has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 4 (9 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edc9c0a9c839760836987c77ba6e00d67ae6e37a0c7e35e026e5a4aabab4567"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionPanel.ConnectionPanel (cognitive 55): ConnectionPanel.ConnectionPanel has cognitive complexity 55 (threshold 15). Drivers by points: boolean chains 32, ternaries 8 (15 pts), if/else 5 (6 pts), error handling 2 (nesting depth added 8). Of this number, 35 points are the body\u0027s own statements and 20 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":"apps/desktop/src/features/connection/ConnectionPanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4173dce24d68b82e749ef78a5714f6eed64375fb97ed9d8b0aac9b7e713463"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_browser::cdp::apply_dom_capabilities (cognitive 54): webcodex_browser::cdp::apply_dom_capabilities has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (47 pts), loops 4, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3356323c4bd020264fcc9d56b275cbe8b687457d2b928e53ae0db1acdd9ef3b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::detached_job::platform::unix::run_accepted_payload (cognitive 54): webcodex_runner::webcodex_runner::detached_job::platform::unix::run_accepted_payload has cognitive complexity 54 (threshold 15). Drivers by points: if/else 23 (38 pts), match/switch 3 (7 pts), boolean chains 6, loops 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c622e8f83472b301cdfba237d75dcfbffa37b7c36bd44363047f58e41d07c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"useDesktopWorkspace.useDesktopWorkspace (cognitive 54): useDesktopWorkspace.useDesktopWorkspace has cognitive complexity 54 (threshold 15). Drivers by points: if/else 24 (29 pts), boolean chains 14, error handling 5 (7 pts), ternaries 4 (nesting depth added 7). Most of this is not in the body itself: 3 of the 54 points are its own statements and the rest belongs to 13 function literals inside it that branch (lines 109, 59, 198, \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":"apps/desktop/src/hooks/useDesktopWorkspace.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5763ecafdb4366fb72f59fee29ad6fcf0a400728baf2f65d5327dd06650bdbf2"}},{"ruleId":"D2","level":"warning","message":{"text":"AboutPanel.AboutPanelContent (cognitive 54): AboutPanel.AboutPanelContent has cognitive complexity 54 (threshold 15). Drivers by points: boolean chains 24, ternaries 9 (18 pts), if/else 10 (11 pts), error handling 1 (nesting depth added 10). Of this number, 36 points are the body\u0027s own statements and 18 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":"apps/desktop/src/features/settings/AboutPanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f73dc6ebbc3c2a4ec7c2ea51c53724b7c4a15f2594789cea05493f93ac0ec71"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::model_surface::project_suggested_tool_calls_in_value_node (cognitive 53): webcodex::model_surface::project_suggested_tool_calls_in_value_node has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 7 (13 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model_surface.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a7863f9f94b087e037cc6a8eaab36c2ac1d25eea13bb83beccd5f3d5518514"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEnvironment::apply (cognitive 52): NativeEnvironment::apply has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (39 pts), boolean chains 6, loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbcd7f6f42e699d6693e8175af485eb3742461cc3e5fc8d880937166bf34955"}},{"ruleId":"D2","level":"warning","message":{"text":"JobManager::start_shell_job (cognitive 52): JobManager::start_shell_job has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (27 pts), match/switch 6 (13 pts), boolean chains 11, loops 1 (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":"crates/webcodex-runner/src/webcodex_runner/job_manager/local_shell.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c05b238b1bfa6c0e59606f1663b02d89ddbfa08217b4e959feefcafdbec353"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_format::format_candidates_with_deadline (cognitive 52): webcodex_runner::webcodex_runner::project_format::format_candidates_with_deadline has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (38 pts), match/switch 4 (7 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":"crates/webcodex-runner/src/webcodex_runner/project_format.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c9adbc6655c8b797abebf719f8215752fad003e962c118f9227fd18e9848f2"}},{"ruleId":"D2","level":"warning","message":{"text":"PersistedSessionRecord::into_record (cognitive 52): PersistedSessionRecord::into_record has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (33 pts), boolean chains 11, loops 5 (8 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/persistence.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b54aca75e74f1354cf3454321ac986fba79632ab40f8bde86caaae76c766f5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_recipe::workspace_member_witnesses (cognitive 52): webcodex_workspace::project_recipe::workspace_member_witnesses has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (44 pts), loops 4 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c4f53f49e819dce274c03356eb77f2285d02f4f21fbf5a9e2e9e287daed94e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::surface::sparsify_tool_manifest_model_result (cognitive 52): webcodex::tool_runtime::surface::sparsify_tool_manifest_model_result has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (42 pts), loops 5 (10 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/surface.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c40058c912d04f625ddf2fd858c21d6e50be55dce07d2f19521751ed55c505"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEnvironment::configure_cloudflare_tunnel_profile (cognitive 51): NativeEnvironment::configure_cloudflare_tunnel_profile has cognitive complexity 51 (threshold 15). Drivers by points: if/else 30 (34 pts), boolean chains 13, match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbb4423c647e2581af87f8aeb45ab86d366565809ff75311436f2440ecfe1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::job_manager::admission::validate_runner_job_context_operation (cognitive 51): webcodex_runner::webcodex_runner::job_manager::admission::validate_runner_job_context_operation has cognitive complexity 51 (threshold 15). Drivers by points: if/else 26 (38 pts), boolean chains 10, match/switch 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67fd85ee7fad4717d57b643b4d3a43936ec9b3505033e91787bbe3f67fb708d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_tool_contracts::schema_generation::normalize_host_schema_inner (cognitive 51): webcodex_tool_contracts::schema_generation::normalize_host_schema_inner has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 4 (11 pts), boolean chains 3, match/switch 1 (nesting depth added 28). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/schema_generation.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56e8a4f71a598138cd0dce4bcdcb42aee936954e7d117ebca8dbe3ed5849058"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_goal_plan_app.html.validContinuity (cognitive 51): mcp_goal_plan_app.html.validContinuity has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 24, loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_goal_plan_app.html"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6060e18944975f2f91e1897c9caab21c40e4ae6972256d2ada25231e4db5128f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::detached_job::platform::windows::run_accepted_payload (cognitive 50): webcodex_runner::webcodex_runner::detached_job::platform::windows::run_accepted_payload has cognitive complexity 50 (threshold 15). Drivers by points: if/else 21 (33 pts), match/switch 4 (9 pts), boolean chains 5, loops 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3cb6fb0b2c9963126aa9e1ddc4615fce4f433a5738fcfc9af418d5c0b17642"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerRegistry::apply_project_inventory_page_checked (cognitive 50): RunnerRegistry::apply_project_inventory_page_checked has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (33 pts), boolean chains 14, loops 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/project_inventory.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d1e52a0d38beae30c40c60284495013661ffd41cf3e7d3ad127e92e08186de"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::run_shell_with_contract_for_resource (cognitive 50): ToolRuntime::run_shell_with_contract_for_resource has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (25 pts), match/switch 10 (15 pts), boolean chains 10 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/shell.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7351a9d75b0bc3d13244f21cd14a7f9cda85361f2d8c033bf0bc3ffd518c2e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::git::diff_hunks::parse_git_diff_hunks (cognitive 50): webcodex::tool_runtime::git::diff_hunks::parse_git_diff_hunks has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (48 pts), boolean chains 1, loops 1 (nesting depth added 25). 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":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cf6dec6d480c3a4b91ffe62396ec529204c171dae91373b2cac745e840d998"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityPanel.ActivityPanel (cognitive 50): ActivityPanel.ActivityPanel has cognitive complexity 50 (threshold 15). Drivers by points: boolean chains 40, ternaries 5 (6 pts), if/else 4 (nesting depth added 1). Of this number, 34 points are the body\u0027s own statements and 16 belong to 12 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":"apps/desktop/src/features/activity/ActivityPanel.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abfa3d5e33bbe08a223adaa84fafe9a0bd5caa70d348362d631d3090fdc3693"}},{"ruleId":"D2","level":"warning","message":{"text":"l.executeOperatorList (cognitive 50): l.executeOperatorList has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (31 pts), ternaries 3 (10 pts), loops 2 (5 pts), boolean chains 4 (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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86a882756d37e5dffff8df52e72201532f92423d9a6978f8c7fe7c5fe9563a7"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEnvironment::upgrade_prepare_with_options (cognitive 49): NativeEnvironment::upgrade_prepare_with_options has cognitive complexity 49 (threshold 15). Drivers by points: if/else 29 (45 pts), loops 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf198fde087cf74e329880357f034be5adde7498bd7bc19d5152478b7726f4e"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::git_review_summary_for_scope (cognitive 49): ToolRuntime::git_review_summary_for_scope has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (28 pts), boolean chains 10, loops 5 (8 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":"src/tool_runtime/git_review.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"6436856c4a78f5faacdacead106878473ed1d8f38f4cc68044835ebf33ee4ec3"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::tools::call::specialized::ssh_resource (cognitive 49): webcodex::mcp::tools::call::specialized::ssh_resource has cognitive complexity 49 (threshold 15). Drivers by points: if/else 27 (45 pts), match/switch 4 (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":"src/mcp/tools/call/specialized.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b76787cea39d565320b68cf4eb9498be89189246b65d66dc668b4e11eadf27e"}},{"ruleId":"D2","level":"warning","message":{"text":"form-cache.deriveMappings (cognitive 49): form-cache.deriveMappings has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (24 pts), ternaries 6 (13 pts), boolean chains 8, loops 3 (4 pts) (nesting depth added 21). Of this number, 44 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":"plugins/campus-application/src/form-cache.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b06d8b7e9f039d93c9379abdb78743a0546d49b4b69ceb6428497cfa87a664"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEnvironment::configure_tunnel_profile_under_lock (cognitive 48): NativeEnvironment::configure_tunnel_profile_under_lock has cognitive complexity 48 (threshold 15). Drivers by points: if/else 31 (41 pts), boolean chains 6, match/switch 1 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc2162218e9b84b08eb2534cf38b851ce322f2163c46a86cd915d3b06100fd3"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedRuntimeCall::prepare (cognitive 48): PreparedRuntimeCall::prepare has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (39 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edeeca3c060e3eb06f2536f0935f5de51e131019e9794ff6fd7eefdc846c11e"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::finish_coding_task (cognitive 48): ToolRuntime::finish_coding_task has cognitive complexity 48 (threshold 15). Drivers by points: if/else 32 (35 pts), match/switch 5 (8 pts), boolean chains 4, 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":"src/tool_runtime/coding_task/closeout.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ccbee3a61a290a0cf35797f400f7afe51ea0d08de7fbf50c89fac6e169201b"}},{"ruleId":"D2","level":"warning","message":{"text":"Adapter.request (cognitive 48): Adapter.request has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (42 pts), loops 2 (4 pts), boolean chains 1, ternaries 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":"integrations/model_gateway/adapter.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f937625be1cff4b47f1051ef5bf50ca692a796454f9ce4c3d1c55eb6e6fec3bb"}},{"ruleId":"D2","level":"warning","message":{"text":"l.showText (cognitive 48): l.showText has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 18, loops 2 (3 pts), ternaries 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"841d351e7d778911b9feafb42321873bb401f6d868ed0f64488d92d15cb5c4a7"}},{"ruleId":"D2","level":"warning","message":{"text":"control (cognitive 48): control has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (25 pts), error handling 4 (11 pts), boolean chains 7, other 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":"extensions/browser-bridge/worker.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baf381a42ecee2b5c6f317b6f23cf4d707575cd014a447b9bf80e8e732f509b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::webcodex::settings::mcp::reconcile_document (cognitive 47): webcodex_desktop::webcodex::settings::mcp::reconcile_document has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (33 pts), loops 6 (12 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/settings/mcp.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01e90cf39b9ea605cf3f68b7c2b95960b956c7da81441796359eb9b47882a6f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::config::validate_acp_config (cognitive 47): webcodex_runner::webcodex_runner::config::validate_acp_config has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (32 pts), loops 5 (8 pts), boolean chains 7 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc03f4a83eb7544a8fae8d84863ae19345beafcf1149a7702f88f2a52b5ce73"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::patches::handle_apply_patch_file_request (cognitive 47): webcodex_runner::webcodex_runner::patches::handle_apply_patch_file_request has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 8 (18 pts), boolean chains 2, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdc37a99971d29d8147fa221d32a1880d738b4a937c8da33911717c764ed01b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_tool_runtime_contracts::tool_audit::result::canonical_execution_audit_result_for_tool (cognitive 47): webcodex_tool_runtime_contracts::tool_audit::result::canonical_execution_audit_result_for_tool has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (36 pts), loops 5 (8 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/result.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcb91a25ab98e9aeede419d7f2faa6fc5a8773de32cbad1c9948c0d582772a5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::events::classify_failure_expectation (cognitive 47): webcodex_workflow_session::events::classify_failure_expectation has cognitive complexity 47 (threshold 15). Drivers by points: if/else 29 (46 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf9e7b88a1d81bdf9c1ec489feee9cf6087becf0b848afa9106c860af8c883c"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::start_coding_workflow (cognitive 47): ToolRuntime::start_coding_workflow has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (30 pts), match/switch 12 (14 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_task/startup.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"316901d0c0d3be6dc7ea7b7dc7c91d662eb0ba88cb6ef9cd34dea5d3ea87552c"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin.handle_frame (cognitive 47): plugin.handle_frame has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 9, error handling 3 (5 pts), loops 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":"plugins/project-knowledge/plugin.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2e2cce6bce6b6002e948201439602d6e871df9c068b4cde395752d8ab9e425"}},{"ruleId":"D2","level":"warning","message":{"text":"Rt.#a (cognitive 47): Rt.#a has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 7 (12 pts), boolean chains 8, ternaries 2 (7 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b885ae2d8be60761cd4bfa46eb30e23d3e2f2322a370454bfdc1b4fa6b9286"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::project_build::canonical_project_build_process_with_manager (cognitive 46): webcodex_core::project_build::canonical_project_build_process_with_manager has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (32 pts), loops 3 (9 pts), boolean chains 4, 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":"crates/webcodex-core/src/project_build.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bd7f3c18d27f5d897318f34ecd835e378760c67a71cdedd5b71c10e6392253"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSupervisor::request_with_timeout_and_encoding_inner (cognitive 46): LspSupervisor::request_with_timeout_and_encoding_inner has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (28 pts), boolean chains 10, match/switch 3 (7 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"befbb5a7134098b4b2cb370310c31494eceb0e2eb440357fa2eeb44c3dbe429c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::inspection::ooxml_mime_from_file (cognitive 46): webcodex_runner::webcodex_runner::artifacts::inspection::ooxml_mime_from_file has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 8, match/switch 3 (4 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e1e23eea0f44b12b23f0bf02cdbee5e6804fbe96fa9a33d94f96fad53fef96"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_begin (cognitive 46): webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_begin has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (32 pts), match/switch 9 (10 pts), boolean chains 3, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"20028a08eb69f4fa7e39b0e83d450c2aa3adc9eca6bdb9ef7fba436b6c75e486"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_recipe::project_cargo_all_packages_provenance_files (cognitive 46): webcodex_workspace::project_recipe::project_cargo_all_packages_provenance_files has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 4 (7 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e24f339cb88ac7200ce077ee5601b1c2759bfe82cffa03cb9d9a0e1c78625c2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::runtime_console_http::goals::goal_detail_for_auth (cognitive 46): webcodex::runtime_console_http::goals::goal_detail_for_auth has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (36 pts), loops 5 (8 pts), match/switch 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime_console_http/goals.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd67be46ceb2cd532eb75fbae84429e4d7f2afb017ce62b194b057f30cfddae"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::closeout_facts::evaluate_closeout (cognitive 46): webcodex::tool_runtime::closeout_facts::evaluate_closeout has cognitive complexity 46 (threshold 15). Drivers by points: if/else 31 (35 pts), boolean chains 5, match/switch 4 (5 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/closeout_facts.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96a424b31c3277301dd9e243c3d047b5d2e380a77d8cf0beeff737c5b3d361f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::text_edits_result::sanitize_apply_text_edits_model_recovery (cognitive 46): webcodex::tool_runtime::files::mutations::text_edits_result::sanitize_apply_text_edits_model_recovery has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (38 pts), boolean chains 4, loops 1 (2 pts), match/switch 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/text_edits_result.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b627e19b3040d54f17371c1ec5a10d547df414f6b3c0e49f876a7373f02fa40f"}},{"ruleId":"D2","level":"warning","message":{"text":"CodingAgentManager::apply_pre_prompt_config_option (cognitive 45): CodingAgentManager::apply_pre_prompt_config_option has cognitive complexity 45 (threshold 15). Drivers by points: if/else 30 (42 pts), match/switch 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c9ef62e7923d56c2b12a934bebcf58c6a69b572377592e0d09d008f3259fbd"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::job_manager::delivery::spawn_job_update_delivery_worker (cognitive 45): webcodex_runner::webcodex_runner::job_manager::delivery::spawn_job_update_delivery_worker has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (41 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/delivery.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e1872853520462aafc2acf9f6ef95d063553fae4e39d8439ced7afab406d99"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerRegistry::job_log_with_paging_for_auth (cognitive 45): RunnerRegistry::job_log_with_paging_for_auth has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 5, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"a114dbcef2fe6a1660290ee7d120a8a186254517de4caa995d6facd7e0da9c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerRegistry::register_session (cognitive 45): RunnerRegistry::register_session has cognitive complexity 45 (threshold 15). Drivers by points: if/else 25 (34 pts), boolean chains 7, loops 1 (3 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdd30d16ac55d63157d0db566b4909ce2e1c78ae0f56c8bca5de3eff6abd050"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_tool_runtime_contracts::tool_audit::execution_identity::canonical_cargo_validation_target (cognitive 45): webcodex_tool_runtime_contracts::tool_audit::execution_identity::canonical_cargo_validation_target has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 5 (11 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/execution_identity.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a509ec82f3513db33343b0fdd039de06be8e2218d0c55736e2925938ad00f415"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowActivityRegistry::finish (cognitive 45): WindowActivityRegistry::finish has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (40 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/window_activity.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"624e2472128da7650e0786c493fce34699608b9a61277ea35f4fc9d5be49e86f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::window_activity_projection::project_window_loop_timings (cognitive 45): webcodex::tool_runtime::window_activity_projection::project_window_loop_timings has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (43 pts), boolean chains 1, loops 1 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/window_activity_projection.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e56264de988bac12dceac16afa88133707a49acfc0822711d6fb23477f9065"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedInstructionsPanel.ManagedInstructionsPanel (cognitive 45): ManagedInstructionsPanel.ManagedInstructionsPanel has cognitive complexity 45 (threshold 15). Drivers by points: boolean chains 19, if/else 14 (19 pts), error handling 4 (6 pts), ternaries 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 29 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":"apps/desktop/src/features/extensions/ManagedInstructionsPanel.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bbb096fae9eba007fd49cf8b0baceaa5103268da7a2a6be1405703ad29726c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::coding_agent::validate_coding_agent_run_snapshot (cognitive 44): webcodex_core::coding_agent::validate_coding_agent_run_snapshot has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 11, match/switch 3 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"17873f2447e1dd898d80e0fb43ed083c808fdc0569566a91b0ad4ff2b9ca1019"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSupervisor::get_or_start (cognitive 44): LspSupervisor::get_or_start has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (35 pts), match/switch 2 (5 pts), boolean chains 2, loops 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":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1d6939d524c244758b73728759dabc24529daa600d10ebeba25f43165ffd50"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::dispatch_computer_control_action (cognitive 44): ToolRuntime::dispatch_computer_control_action has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 9, match/switch 3 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/control.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3559c2383f3af6d864efdda1d9b99a7686a0bd4c9f4e85baa295fce82408cfdf"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::text::native::workspace (cognitive 44): webcodex::mcp::cli::text::native::workspace has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (31 pts), boolean chains 5, loops 4 (5 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":"src/mcp/cli/text/native.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73667161a0c36214e4bd66a08fba7ed27784b650c2e3ab52292d2e5de0bad0e"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigurationDataPanel.ConfigurationDataPanel (cognitive 44): ConfigurationDataPanel.ConfigurationDataPanel has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 25, if/else 8 (10 pts), ternaries 7, error handling 2 (nesting depth added 2). Most of this is not in the body itself: 9 of the 44 points are its own statements and the rest belongs to 5 function items inside it that branch (renderEntry, refresh, act, \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":"apps/desktop/src/features/settings/ConfigurationDataPanel.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2574458399c50f446f3416fcfe2fb44801f3314560ef4668bb65637dcb4dc66"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_job_terminal_continuation_app.html.reconcile (cognitive 44): mcp_job_terminal_continuation_app.html.reconcile has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 5, error handling 3 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_job_terminal_continuation_app.html"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98da41ed3c74fa2881e566eed1319dff38f5b025911dcbd3b6fcbd3be87c47b"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.renderWorkbench (cognitive 44): mcp_workbench_app.html.renderWorkbench has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 16, ternaries 4 (14 pts), if/else 6 (11 pts), loops 2 (3 pts) (nesting depth added 16). Of this number, 43 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":"src/mcp_workbench_app.html"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce86d2633ad03bf286e1516b4ef072d0c317169a5fb4c77d9f2326f47aeb4b3"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopCore::configure_environment (cognitive 43): DesktopCore::configure_environment has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 8, 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":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf286dca8dc0ec561e3975e9a4e3b629147fedb0587d5e91bc69629f77d633a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::webcodex::settings::acp::reconcile_document (cognitive 43): webcodex_desktop::webcodex::settings::acp::reconcile_document has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (29 pts), loops 6 (12 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":"apps/desktop/src-tauri/src/webcodex/settings/acp.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c567f1f50d467468b44a923b6507920bbdf2c087b4221484b56361f88a73d5d0"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::runner_operation::decode_job_operation (cognitive 43): webcodex_core::runner_operation::decode_job_operation has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (35 pts), boolean chains 7, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb0889f725867570e5a1d948e4183e65c5aad6217a312210887c5265cca0747"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::runner_protocol::job::is_canonical_cargo_flags (cognitive 43): webcodex_core::runner_protocol::job::is_canonical_cargo_flags has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 3 (8 pts), boolean chains 6, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e37bfca36f858e1a08b956e4f80725b834e6674b1c1fb1f8292fe14a922580"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::session_handoff_observation (cognitive 43): ToolRuntime::session_handoff_observation has cognitive complexity 43 (threshold 15). Drivers by points: if/else 23 (29 pts), boolean chains 7, match/switch 5 (6 pts), loops 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/handoff.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"75986923739f8691955741711fe7bad224f812d5acf197188f9e0ada535c2c61"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::model_surface::project_suggested_tool_call_schema_node (cognitive 43): webcodex::model_surface::project_suggested_tool_call_schema_node has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 6 (10 pts), match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model_surface.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aac47cb3bc5e9314bd96a9118c072dc6f3fd282d42fa4f61e224d58176005b3"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::observe_jobs::sparse_success_item (cognitive 43): webcodex::tool_runtime::observe_jobs::sparse_success_item has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (23 pts), loops 6 (10 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c2e3d7ecdf02ea8d546f745b89597dcd1d80e98dbee2d9824ffcf06c1d9ecf"}},{"ruleId":"D2","level":"warning","message":{"text":"Adapter.handle (cognitive 43): Adapter.handle has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 11, error handling 2 (3 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/model_gateway/adapter.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"91af47b4868ad0490d1b641f038e11a42ae9a98efc6c2375fb2bee6c46f74708"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectsPanel.ProjectsPanel::unregisterSelected (cognitive 43): ProjectsPanel.ProjectsPanel::unregisterSelected has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 3 (7 pts), error handling 2 (5 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ProjectsPanel.ProjectsPanel) 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":"apps/desktop/src/features/projects/ProjectsPanel.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4bddefeee001874c59f2ebb5c76be880ab785f5d1e28e03e1401c2e226e2c5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::plugin::diagnose_invalid_tools (cognitive 42): webcodex_core::plugin::diagnose_invalid_tools has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 19). Of this number, 30 points are the body\u0027s own statements and 12 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/plugin.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f8eea106b886b0c468ba1eba760ddfa00fb95bfa5fda4ca17ddcdd565791cb"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::task_context::task_context_value (cognitive 42): webcodex_workflow_session::task_context::task_context_value has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 6 (10 pts), boolean chains 7 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/task_context.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91227d015418371cc54e8f28aa788a13c1878b6bf3ee5a1573ffde99df685d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::work_result_files (cognitive 42): ToolRuntime::work_result_files has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 11 (22 pts), if/else 9 (12 pts), boolean chains 8 (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":"src/tool_runtime/changes.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"17af94f11ecf7f51c2741c651266d8cfa0db090edca0265531837e851e6a8099"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::read_webcodex_resource (cognitive 42): ToolRuntime::read_webcodex_resource has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/resource_references.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b08c9fd7c1630189fe37b97ea5fa85c33a1c496a13cf942cddffeb8edee1ba"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::presentation::git::show_changes_presentation (cognitive 42): webcodex::mcp::presentation::git::show_changes_presentation has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 6 (11 pts), match/switch 1 (4 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":"src/mcp/presentation/git.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa3c0d0056c904488520adc9cf12fc52bee20284ea0c9cc2e94dac78b15d382"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::patch_result::validate_apply_patch_success_metadata (cognitive 42): webcodex::tool_runtime::files::mutations::patch_result::validate_apply_patch_success_metadata has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 6, match/switch 3 (6 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/patch_result.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"c867d9077fafcdbb8909e20aa3d3b58f95e724ef15525a93e4eedf1eb00b4742"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionEditor.ConnectionEditor (cognitive 42): ConnectionEditor.ConnectionEditor has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 31, ternaries 6, if/else 4, error handling 1. Of this number, 30 points are the body\u0027s own statements and 12 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":"apps/desktop/src/features/connection/ConnectionEditor.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"82174e64bff6a00de99c9d8b0cb12abd5c33c95d04980c6790111a741afb4a9e"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerFileAccess.RunnerFileAccess (cognitive 42): RunnerFileAccess.RunnerFileAccess has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 17, error handling 3, ternaries 2 (nesting depth added 3). Most of this is not in the body itself: 15 of the 42 points are its own statements and the rest belongs to 6 function items inside it that branch (write, add, begin, \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":"apps/desktop/src/features/settings/RunnerFileAccess.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8804f9ae628b49aabaccdaabb419e56e67fd01bca9d2ecc355751dfe2e6471e"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeBackend.run (cognitive 42): NativeBackend.run has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 10, ternaries 5 (7 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":"plugins/agent-browser/src/backend.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0088d6230e7c34b1b84925d6286fa47fcd6ee7be7c1496ab06602603ec80fc"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_agent_continuation_app.html.projectionSemanticFailure (cognitive 42): mcp_agent_continuation_app.html.projectionSemanticFailure has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 14 (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":"src/mcp_agent_continuation_app.html"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36b1252e4b4e37e06d248e9dbabf1379c3fe97e44e245729fbd40f22ca85053"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_agent_continuation_app.html.recoverExpiredEndpoint (cognitive 42): mcp_agent_continuation_app.html.recoverExpiredEndpoint has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 8, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_agent_continuation_app.html"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddf7e2669880252209025e068b9e84aad4ac3a965498543120f833b63ca72cc"}},{"ruleId":"D2","level":"warning","message":{"text":"ShellJobValidationMetadata::is_valid (cognitive 41): ShellJobValidationMetadata::is_valid has cognitive complexity 41 (threshold 15). Drivers by points: boolean chains 26, if/else 12 (14 pts), match/switch 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae2c172c2b4fe0638b7606a2898632a92e47270100467c223723f0d1cd1fef5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::plugin::plugin_schema_matches (cognitive 41): webcodex_core::plugin::plugin_schema_matches has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 3, loops 1 (2 pts), match/switch 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/plugin.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d90adc51281d9f49681ea225e5601ef5d9757de7ef9bacffdd2e0a00d935c52"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::upgrade::verify_upgrade_candidate (cognitive 41): webcodex_environment::upgrade::verify_upgrade_candidate has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 12, loops 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"be500ee3f80c4b127fd9b2f4ea67c7082b0c622a2738d60d5443d3c398ab5a1b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::dispatch::dispatch_request_with_outcome (cognitive 41): webcodex_runner::webcodex_runner::dispatch::dispatch_request_with_outcome has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 8 (16 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/dispatch.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a3c67fa577b7fdf615d63003d42f8dfe62eb7f1d327e9dab542108b76c1d94"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::call_agent_lsp (cognitive 41): ToolRuntime::call_agent_lsp has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 9 (15 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":"src/tool_runtime/lsp_tools.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b651b9718c344eb5f95f34d10621de1ea085408748506b8d3c46255a84ceb8d6"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::run_process_with_contract_mode (cognitive 41): ToolRuntime::run_process_with_contract_mode has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (25 pts), match/switch 11 (13 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/process.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bef8e3ddb6e24fe135a91c3ef38924baa3259605008dcc9538f1cdf12d293b"}},{"ruleId":"D2","level":"warning","message":{"text":"form-cache.matchSectionField (cognitive 41): form-cache.matchSectionField has cognitive complexity 41 (threshold 15). Drivers by points: if/else 22 (41 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":"plugins/campus-application/src/form-cache.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cb8b366d49c95be06cbd441679f30ffc858111871705d0c0341c3b04fc76c7"}},{"ruleId":"D2","level":"warning","message":{"text":"context.parsePorcelainStatus (cognitive 41): context.parsePorcelainStatus has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 10, 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":"plugins/repo-context/src/context.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9a4440aea83570a58044d3fc9339ab2211c3fde52fc252eb417d19083ddf50"}},{"ruleId":"D2","level":"warning","message":{"text":"noProxyMatches (cognitive 41): noProxyMatches has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 7, ternaries 2 (4 pts), error handling 1 (3 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/webcodex/install.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87d4a7bf623b1965965c75ffc10c2e77911c85e2d808cd4c14ffe93b7005fa4"}},{"ruleId":"D2","level":"warning","message":{"text":"State::receive (cognitive 40): State::receive has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 7, match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/bridge.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ec56da9ef933912ab61fec790c41d6a04f49a05b9c0dc90599147e64dc7b49"}},{"ruleId":"D2","level":"warning","message":{"text":"CdpBackend::wait_for_stable (cognitive 40): CdpBackend::wait_for_stable has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (37 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f58c79ba2e0fdcecefad9e08c83353dc0ed390a4d8076be283f609f86cd0039"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::inventory::inspect_environment_paths (cognitive 40): webcodex_environment::inventory::inspect_environment_paths has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (31 pts), loops 4 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/inventory.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de69211308355d5309c01676d60bcb7e53573481e6b0ce1f054207d1f7222fb"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::tunnel_recovery::recover (cognitive 40): webcodex_environment::tunnel_recovery::recover has cognitive complexity 40 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 7, loops 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel_recovery.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5d90e88c8d3bf886a2c66f6e43f3db09492d580b2c43a3faa1b62342ec4af2"}},{"ruleId":"D2","level":"warning","message":{"text":"CodingAgentManager::initialize_session (cognitive 40): CodingAgentManager::initialize_session has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (31 pts), loops 4, match/switch 3, boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"715853aeae42e9d59a3026748ca58fe84e5dc1da6edb6ea69701178003003d15"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::fake_claude_mcp::main (cognitive 40): webcodex_runner::webcodex_runner::fake_claude_mcp::main has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (29 pts), match/switch 3 (9 pts), boolean chains 1, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_claude_mcp.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"86845d934f2c49fa10800c51aca1d5c64243c7107c74c6fb09f74fb4df0ef4bf"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_context::fallback_manifest_paths (cognitive 40): webcodex_workspace::project_context::fallback_manifest_paths has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (35 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_context.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"f674df4cb93429ace7f9aa35094eac3d6ad104aa806b057c384502630ba40a03"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::submit_workbench_work (cognitive 40): ToolRuntime::submit_workbench_work has cognitive complexity 40 (threshold 15). Drivers by points: if/else 24 (29 pts), boolean chains 7, match/switch 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":"src/tool_runtime/workbench_execution.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad34b6f610f4c57848e10f0e28c348d4cb2d615ddcfe6e0f8608d59eeb686ac2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::text::project_response (cognitive 40): webcodex::mcp::cli::text::project_response has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (37 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 20). 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":"src/mcp/cli/text.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74d19702bc63d1827c9102e29f8477366be044d81913e9d5a223a3b52a060f0"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.workCard (cognitive 40): mcp_workbench_app.html.workCard has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 16, ternaries 2 (3 pts) (nesting depth added 9). Of this number, 31 points are the body\u0027s own statements and 9 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":"src/mcp_workbench_app.html"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbb7def01dd89bf00d5e533961fbddf17f7e2da442d184d1f3cdef1c6ad9727"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::parse_project_subcommand (cognitive 39): webcodex_cli::parse_project_subcommand has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 6 (13 pts), loops 2 (4 pts) (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f4f100881567c670d8fb434fddf7b8688dccc5a58255a2f18e4b3cdf832966"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::controller_tui::run (cognitive 39): webcodex_cli::webcodex_cli::controller_tui::run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 3 (5 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_tui.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee5e4d90baa8c12d4e4286ffea149263f6da62b61e650ca65c4896414ae678c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::validation_identity::structured_validation_target_identity (cognitive 39): webcodex_core::validation_identity::structured_validation_target_identity has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 6, match/switch 3 (4 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_identity.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c01c1ef7ab4fe1ccb81bde9584aade547593ff85c32a3019c5c4667aec45cd"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_build::rust::artifact_paths (cognitive 39): webcodex_runner::webcodex_runner::project_build::rust::artifact_paths has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 5, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build/rust.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e0d8e5c9c87f94a781a6e02831f5a931df8213b5f2e23a975819422e9d1a74"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::text::native::execution (cognitive 39): webcodex::mcp::cli::text::native::execution has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 7, loops 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":"src/mcp/cli/text/native.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f498fe4ce44406ed633f9f5351d792c3301a81edb64e0903eb34c4fd35ad5a3"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::tools::add_stateless_workflow_recorder_metadata (cognitive 39): webcodex::mcp::tools::add_stateless_workflow_recorder_metadata has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (10 pts), boolean chains 4 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f3a5f05c6e9b77a4b0ea752dae4e1e3c4864ece34f14e19f53d13b21f23cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::runtime_console_http::window_queries::window_for_auth_inner (cognitive 39): webcodex::runtime_console_http::window_queries::window_for_auth_inner has cognitive complexity 39 (threshold 15). Drivers by points: if/else 23 (29 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime_console_http/window_queries.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed541326ff7a148520b3b8eb23dc9bc7da872464fb59bc41c2925d42749ed0c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Knowledge.rebuild (cognitive 39): Knowledge.rebuild has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (23 pts), error handling 4 (7 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/project-knowledge/knowledge.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd7706968db2d97aecd8e031715b863ae036425118ef46764194d695920596b"}},{"ruleId":"D2","level":"warning","message":{"text":"execute (cognitive 39): execute has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 8 (15 pts), boolean chains 9, if/else 6 (8 pts), error handling 2 (3 pts), other 2, loops 1, match/switch 1 (nesting depth added 10). Of this number, 38 points are the body\u0027s own statements and 1 belongs 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":"plugins/agent-environment/src/bridge.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ef8a2655b9b2c180fe92ac8f74f8426115ec83c75a424e00d693bef50f9e60"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::upgrade::desktop_tree::digest_named (cognitive 38): webcodex_environment::upgrade::desktop_tree::digest_named has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"daef5c8449c0ba8d99e471300b79f9e73ae9d02967790169b0974476f85377c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::create_agent_wait (cognitive 38): Database::create_agent_wait has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 4, boolean chains 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":"crates/webcodex-store/src/agent_wait.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc3f193c811e1e9d09cc400dfddb8f8ec8b0caf8c6dc505966e5dc3b3bdbaa5"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolCall::from_tool_name_with_normalization (cognitive 38): ToolCall::from_tool_name_with_normalization has cognitive complexity 38 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 6 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/parsing.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"966ca193f1937b85aee524cdebca191c1a073148507c9f902fd9382c5f666995"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::dispatch_file_tool (cognitive 38): ToolRuntime::dispatch_file_tool has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 7 (9 pts), boolean chains 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/file_tools.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0827f75a573b0d4d9d98a360d474311cc6c81c5d4a3e63441d1a2a88b02ca203"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::read_project_artifact (cognitive 38): ToolRuntime::read_project_artifact has cognitive complexity 38 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 5, match/switch 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/artifacts.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d33b9f0367b9535d8c11753446a1b9a7cae90f66a6ab569b25279fd080d4175"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::text::render_manifest (cognitive 38): webcodex::mcp::cli::text::render_manifest has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 3 (9 pts) (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5549df9655557ecb3cc69b2aee73555a78f211830380c0def7196441e220f37e"}},{"ruleId":"D2","level":"warning","message":{"text":"session_recovery.validate_registry (cognitive 38): session_recovery.validate_registry has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 10, loops 5 (10 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":"integrations/codex/session_recovery.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"95820c88bfc889c2481bfcc51c704ef529596bec84f666618143a3593f67b6a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ComputerPermissions.ComputerPermissions (cognitive 38): ComputerPermissions.ComputerPermissions has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 15, ternaries 4, error handling 3 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 21 belong to 8 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/settings/ComputerPermissions.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d4fe3bab748ecb70bbb9a194c6d7921b15b68d4af138010b5258835978fc10"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerDevices.RunnerDevices (cognitive 38): RunnerDevices.RunnerDevices has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 14 (27 pts), boolean chains 9, if/else 2 (nesting depth added 13). Most of this is not in the body itself: 2 of the 38 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 23, 12, 17). 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":"apps/desktop/src/features/projects/RunnerDevices.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a86fffe50ca1cff494ee57ae0aea27f289244e4cc13b08d13ca9853297ff56"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::coding_agent::validate_response_for_request (cognitive 37): webcodex_core::coding_agent::validate_response_for_request has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 5, loops 2 (4 pts), 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":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14ec82602f1f9638e86458628637da3ef63785854e0700f1815d06ddfb1d216"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::upgrade::parse_desktop_payload (cognitive 37): webcodex_environment::upgrade::parse_desktop_payload has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"92373d31010c3876809ffed459b3a26ca8cf0d2a329dc642f79e745c21b7fa28"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillStore::install (cognitive 37): SkillStore::install has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 8 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"de17561087a2af91a7e1d83c0268f0717107bb906cf8b6a31b7ea59f1105a171"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::inspection::ooxml_mime (cognitive 37): webcodex_runner::webcodex_runner::artifacts::inspection::ooxml_mime has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 6, match/switch 2 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8503520e0d2f8e1bad7c6e9c048066005e877b3870971a2798c4db0215f0bb66"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::mcp_gateway::provider_stdout_reader (cognitive 37): webcodex_runner::webcodex_runner::mcp_gateway::provider_stdout_reader has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (25 pts), match/switch 3 (10 pts), boolean chains 1, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"45dd02a41b2f92fe5415645db048a22e1a5044471bb1963f835e40ca0c1046aa"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::projects::registration::handle_resolve_or_register_project_operation (cognitive 37): webcodex_runner::webcodex_runner::projects::registration::handle_resolve_or_register_project_operation has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 9, boolean chains 3, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/registration.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffc70c6d1574e455e60620ea6a083ebe18134a3ad12d6ac54129b2b91836454"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::post_conversation_message (cognitive 37): Database::post_conversation_message has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (25 pts), match/switch 7 (8 pts), boolean chains 2, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6057837baaa08b87dd48b0a2516747fdfaf7de2990242981e6e03806954b0e"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginToolCall::validate (cognitive 37): PluginToolCall::validate has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 8, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/input_types.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5551e125968ea8ad1c3eadd1c67577036fb61fa73393a48ec52e608da023553c"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::dispatch_browser_tool (cognitive 37): ToolRuntime::dispatch_browser_tool has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 5 (10 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 19). 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":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3ae438c134a933a42097112150c1cc636c8f2bad9782027f8b5134ca343bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::project_entry_share::parse_share_options (cognitive 37): webcodex::project_entry_share::parse_share_options has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 4 (9 pts), boolean chains 7, 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":"src/project_entry_share.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf253dfe6eb77d9115b3cbdbe73aa637d3decf90fe97054fc5384576b852347"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::jobs::detected_job_summary_with_activity (cognitive 37): webcodex::tool_runtime::jobs::detected_job_summary_with_activity has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/jobs.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dd4366a832e42d7bf2ed32fea4a3cc146d88885068b6bb58209101f09f8376"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchToFile (cognitive 37): fetchToFile has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 7, error handling 4 (5 pts), ternaries 2 (nesting depth added 4). Most of this is not in the body itself: 6 of the 37 points are its own statements and the rest belongs to 19 function items inside it that branch (a function literal at line 551, (anonymous)::fail, a function literal at line 606, \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":"npm/webcodex/install.js"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"6008f3c0a5c8dd9f613d6270cb71c2e0b7750cfcce04557ab4316c68cf0f37c6"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_computer::platform::windows::accessibility::control (cognitive 36): webcodex_computer::platform::windows::accessibility::control has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 2 (5 pts), loops 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/accessibility.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5138ee51e2a5bffc673d58ec30bee1807334f59f8daa562a200afe99fdc16e2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_persistent_shell::unix::readers::spawn_control_reader (cognitive 36): webcodex_persistent_shell::unix::readers::spawn_control_reader has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (21 pts), match/switch 3 (11 pts), loops 2 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix/readers.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"256917ff3eede899320c35580aab9d3aee3e8c2adbb6c323a00b37e482733e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::transport::quic::quic_session (cognitive 36): webcodex_runner::webcodex_runner::transport::quic::quic_session has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 5 (9 pts), loops 2, boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/quic.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf8cd45aee890aaf0f1907f3d49d97203eb77bd3d35a817394096f8f4093f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner_registry::requests::resolve_disconnected_sync_requests_locked (cognitive 36): webcodex_runner_registry::requests::resolve_disconnected_sync_requests_locked has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (34 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":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"53341242ca16b9d07a3fec2681a8dedd71cbcc30adf300f3eee7989d2f918383"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_tool_runtime_contracts::tool_audit::result::computer_observation_result_audit (cognitive 36): webcodex_tool_runtime_contracts::tool_audit::result::computer_observation_result_audit has cognitive complexity 36 (threshold 15). Drivers by points: loops 10 (21 pts), if/else 11 (14 pts), boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/result.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c044fa2b6da73f8dde35b51e9ae73e7722b099059e470f6dad551a03945673"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionStore::ensure_coding_session_with_git_baseline (cognitive 36): SessionStore::ensure_coding_session_with_git_baseline has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 6, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"1118f05ae2f714a4b3eaa0afa12050554da1953c7d5e2a16b89513df48fb6186"}},{"ruleId":"D2","level":"warning","message":{"text":"Budget::copy (cognitive 36): Budget::copy has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 6, loops 2 (4 pts), match/switch 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":"src/tool_request_trace/diagnostics.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bb59859272e2a90157513dc8060270f27512948d04bff307b4ca8991ce5063"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::reconcile_agent_task_coding_run (cognitive 36): ToolRuntime::reconcile_agent_task_coding_run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 7 (9 pts), loops 2 (8 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":"src/tool_runtime/agent_task.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"f404338ae311bdc4ecc43bb27e2dc01a26a62c8dc5baef3d50ffc19fada975f6"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::dispatch_computer_observation (cognitive 36): ToolRuntime::dispatch_computer_observation has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 4 (7 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/observe.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c39bf199b1f2e8faf575064039c4d5bd4cfbb05a781f80542f17d2bbf8e63e"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::call_tool_with_context_inner (cognitive 36): ToolRuntime::call_tool_with_context_inner has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (29 pts), match/switch 5 (6 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":"src/tool_runtime/kernel.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"582160560ce581fd4442a424d11b6976e63f809b5a94fdb5fc78699f7f6cf58f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::handle_mcp_request_for_surface (cognitive 36): webcodex::mcp::handle_mcp_request_for_surface has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 7, 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":"src/mcp.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b0a2943045dbf7744b453b31a126a9cce64f50b78f3ad0b119e35dc394c24a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::text::native::edits (cognitive 36): webcodex::mcp::cli::text::native::edits has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/native.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"75623f828f6f5e3bb78ad66c30c39f3262f15991f68b50eec5a5d9f5fcb9518b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::text::native::render (cognitive 36): webcodex::mcp::cli::text::native::render has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (nesting depth added 15). Of this number, 24 points are the body\u0027s own statements and 12 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":"src/mcp/cli/text/native.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5220fa6f7f270d98faf5b3951c7b25ecda9c316116caee0828dd37d9a028f4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::coding_task::projection::project_work_on_project_output_inner (cognitive 36): webcodex::tool_runtime::coding_task::projection::project_work_on_project_output_inner has cognitive complexity 36 (threshold 15). Drivers by points: if/else 30 (32 pts), boolean chains 3, 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":"src/tool_runtime/coding_task/projection.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6295bbb1fb5c17a35aeeb223a88c611b4b6ac55d9d8b1dbddbf2181d218a594"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::read_files::enforce_final_model_facing_hard_cap (cognitive 36): webcodex::tool_runtime::read_files::enforce_final_model_facing_hard_cap has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 2 (5 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":"src/tool_runtime/read_files.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"e365acb686f02d7dd70bbe751bcd5b2997574dbb7e37375268347684a6e4162b"}},{"ruleId":"D2","level":"warning","message":{"text":"l.disable (cognitive 36): l.disable has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 16). Of this number, 24 points are the body\u0027s own statements and 12 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":"src/mcp_pdf_app.html"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"a292d822556ba6657951d08442768f94d5d5d08c58ef029cdd133085ca7e68a4"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.renderExecutors (cognitive 36): mcp_workbench_app.html.renderExecutors has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 14, ternaries 10 (14 pts), if/else 4 (7 pts), loops 1 (nesting depth added 7). Of this number, 27 points are the body\u0027s own statements and 9 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":"src/mcp_workbench_app.html"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69fdbabb2a64f1b9a53b29eac3511bfa631cccac8f47722a4f7a71e3af3c919"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.renderGoalPreview (cognitive 36): mcp_workbench_app.html.renderGoalPreview has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 11, loops 4 (8 pts), ternaries 2 (4 pts) (nesting depth added 10). Of this number, 34 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":"src/mcp_workbench_app.html"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"d264e805b45b574caee589036bf3778527279ddfb28f13b63875df92b7f0be85"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_browser::cdp::clickable::admit_clickable_cards (cognitive 35): webcodex_browser::cdp::clickable::admit_clickable_cards has cognitive complexity 35 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 4, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/clickable.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4f777dfdaa837586d4066ded3aaaedb872afa499371964613fb49c12fd9155"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::audit_preview::process_preview (cognitive 35): webcodex_core::audit_preview::process_preview has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/audit_preview.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dc40da891b2e2ed89ca4199957391c58025082ba92c568568c0f0c98f66af8"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEnvironment::complete_upgrade_preparation (cognitive 35): NativeEnvironment::complete_upgrade_preparation has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d4c7d20df99505ec3aac07163e151749243ce5d51dac4d229ce14db34032eb"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::upgrade::restore_programs_from_journal (cognitive 35): webcodex_environment::upgrade::restore_programs_from_journal has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 8, loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc954d9e27679e8bf9e43c896be5d19968d0fd266243a215865f058b6deb8d2a"}},{"ruleId":"D2","level":"warning","message":{"text":"TunnelClient::forward (cognitive 35): TunnelClient::forward has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 4 (10 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/mcp_http.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd221b4cb8dee631c1bfe46cec8ab57951baa15a46fcb02820162873cc072779"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::config::validate_mcp_gateway_config (cognitive 35): webcodex_runner::webcodex_runner::config::validate_mcp_gateway_config has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ec74242a1a0d9acef31eb6d4510b365ad7c119d39f3a2f01f24be067ceb081"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::read_goal_stall_continuity (cognitive 35): Database::read_goal_stall_continuity has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 15 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal_stall.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"06568fc3b25f0ba78a2dea686cbf14d1537e03c863efe16585204be2fa9948e3"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedInvocation::prepare (cognitive 35): PreparedInvocation::prepare has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (28 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/kernel/recording.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadf162cb1f968385953517cf48d5e7523efc632909be459e0e7df7972b55380"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::text_edits::validate_apply_text_edit (cognitive 35): webcodex::tool_runtime::files::mutations::text_edits::validate_apply_text_edit has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (30 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":"src/tool_runtime/files/mutations/text_edits.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0a0becdc7bf516fb5fdcc939a25b94af8fcf0c628ddea5844954a08cd12ab5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::upgrade_http::maintenance (cognitive 35): webcodex::upgrade_http::maintenance has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 8 (16 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":"src/upgrade_http.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8117085be1d289b44846f7978b78e83ec1dbaf5752328fefe4ff49cdd06d87"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectsPanel.ProjectsPanel (cognitive 35): ProjectsPanel.ProjectsPanel has cognitive complexity 35 (threshold 15). Drivers by points: if/else 32 (51 pts), boolean chains 39, ternaries 11 (16 pts), error handling 5 (8 pts), loops 4 (8 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. This shape REPEATS in the file: one other method here (ProjectsPanel.ProjectsPanel::unregisterSelected) 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":"apps/desktop/src/features/projects/ProjectsPanel.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1043535da431969f5d93bd233764bbe341104f1092569bcf68f54d262fd94027"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_spreadsheet_app.html.load (cognitive 35): mcp_spreadsheet_app.html.load has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 9, loops 2 (3 pts), ternaries 1 (3 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_spreadsheet_app.html"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e33c597d982af9ad54c4908ead93ce4d51b00fdc727b8b893240bc13ac8c77"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::project::run_project_activate (cognitive 34): webcodex_cli::webcodex_cli::project::run_project_activate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 3 (5 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2106afadce898843d56a1aeeb1b8093bf14144238ddb1eb7c8be1acc2b2752"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateManager::status_view_for_target (cognitive 34): UpdateManager::status_view_for_target has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 5, loops 1 (3 pts), match/switch 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/view.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"24aa72bc9dca050627e20e3d9646489bc3f441fde09b02a76a4154afe56796d7"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_openai_tunnel::run_transitions::check_intents (cognitive 34): webcodex_openai_tunnel::run_transitions::check_intents has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 9, loops 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_transitions.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca1da224785e91df693d977cc1348fb573993155b5264bc2fe2658face0c40b"}},{"ruleId":"D2","level":"warning","message":{"text":"PersistentShellManager::exec (cognitive 34): PersistentShellManager::exec has cognitive complexity 34 (threshold 15). Drivers by points: if/else 22 (30 pts), match/switch 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/execution.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29434ba0b11383c0f1ed437fbb0a3101012b3912bfc83e537a8976067ba4688"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::inspection::ooxml_content_type_mime (cognitive 34): webcodex_runner::webcodex_runner::artifacts::inspection::ooxml_content_type_mime has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 2 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"36679a79f02546c354551c9bde109044d483eb07f6619c1bc3021dab75326ef6"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_tool_contracts::tool_call::parsing::safe_argument_error (cognitive 34): webcodex_tool_contracts::tool_call::parsing::safe_argument_error has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (23 pts), loops 3 (5 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 11). Of this number, 27 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/parsing.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"e720144cf4a7a96e534e30148f25306738a773be4c94cf2819058102360f1800"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::reconcile_run (cognitive 34): ToolRuntime::reconcile_run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 4 (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":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccfe5425c49c661d6adef16889f0b37d23073e574bfd13576eb60489aaf66ab"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::text::render_search (cognitive 34): webcodex::mcp::cli::text::render_search has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (12 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de38d8eb38c310862ad6465c9b2e981fc0adfbc929a0ae9dacd17e5512ff166"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::runner_session::run_runner_session_with_pump (cognitive 34): webcodex::runner_session::run_runner_session_with_pump has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runner_session.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57288480f82b35cc8beaccf3e78dd3af9799c49ee6f4a5235ed6824bd7111d2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::patch_result::validated_apply_patch_match_rejection (cognitive 34): webcodex::tool_runtime::files::mutations::patch_result::validated_apply_patch_match_rejection has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 11, match/switch 3 (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":"src/tool_runtime/files/mutations/patch_result.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1549b4f16124cdc5f3745e8621494dfecf6afc242219f5841b5e5179e24b05ac"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::jobs::validation_job_result_with_policy (cognitive 34): webcodex::tool_runtime::jobs::validation_job_result_with_policy has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 4 (8 pts), boolean chains 6 (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":"src/tool_runtime/jobs.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cd5ba1627590f7a721147f720301fabce00429b86c20f2ca2b1f5865a4401d"}},{"ruleId":"D2","level":"warning","message":{"text":"l.updateMode (cognitive 34): l.updateMode has cognitive complexity 34 (threshold 15). Drivers by points: loops 6 (15 pts), boolean chains 9, if/else 4 (7 pts), ternaries 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":"src/mcp_pdf_app.html"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"7390df51b480b93c4e402b2c2697b46f2b7f0e3b6f050314a965c89deae61792"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_result_app.html.renderValidationRun (cognitive 34): mcp_result_app.html.renderValidationRun has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 14 (18 pts), if/else 9 (13 pts), boolean chains 3 (nesting depth added 8). Most of this is not in the body itself: 12 of the 34 points are its own statements and the rest belongs to one function literal inside it that branches (line 179). 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":"src/mcp_result_app.html"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a725ecbdf132876a782aeebd7dc96448eb84e2fca17e07f806dd5a12e2954308"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_browser::cdp::cdp_call_on_websocket_until (cognitive 33): webcodex_browser::cdp::cdp_call_on_websocket_until has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":3800}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f005461c213c28cfae109ff9ddcd2136dee3bd1453141f0d09c2cd664fbca7"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::mcp_gateway::validate_tool_result (cognitive 33): webcodex_core::mcp_gateway::validate_tool_result has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, 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":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"3767765a7ab577deb08b723ef3146f7fea2d5c1df10ed1d1d665fa842ddd90d6"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEnvironment::ensure_project_authority (cognitive 33): NativeEnvironment::ensure_project_authority has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native/project_addition.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71f14eb4604ea37413449be37e4fd9c9edfa290361393e80cb69ee8557dda91"}},{"ruleId":"D2","level":"warning","message":{"text":"RegisteredStream::finish (cognitive 33): RegisteredStream::finish has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/stream.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eef236a344de3a6971cff6c939e66aae543ab6befb174c12bd448049c50f171"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::projects::lifecycle::handle_project_lifecycle_operation (cognitive 33): webcodex_runner::webcodex_runner::projects::lifecycle::handle_project_lifecycle_operation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 12 (15 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d010bf94de98e3de60e66ddd49b156bc7b2c2b7cea13371c68396c16d95726a"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuth2Verifier::verify_for_ingress_sync (cognitive 33): OAuth2Verifier::verify_for_ingress_sync has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 4, match/switch 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/tokens.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a4a13e7b134459078f6c320eee0ea098675f208df30a3248aded3a64f25fe6"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::goal_plan_recheck_attention_with_clock (cognitive 33): ToolRuntime::goal_plan_recheck_attention_with_clock has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (22 pts), match/switch 6, 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, 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":"src/tool_runtime/goal.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6656617491834ef66bdc89a87d1258422f681a56809ff64404ddabcaac0d480"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::skill_read_file (cognitive 33): ToolRuntime::skill_read_file has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (26 pts), match/switch 5 (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":"src/tool_runtime/skills.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd4813f9ba0edfd3507bc6bf04c9415f1ccb5c31f87d7cdb33df9c918f81d2c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::presentation::git::git_review_presentation (cognitive 33): webcodex::mcp::presentation::git::git_review_presentation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 6 (13 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":"src/mcp/presentation/git.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c12f089dbcc37be6d87ea3f63c35ab93c3a7757a6c19cfe70c0cdcbdce94f22"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::text_edits::validate_apply_file_change (cognitive 33): webcodex::tool_runtime::files::mutations::text_edits::validate_apply_file_change has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 8, loops 1 (2 pts), match/switch 2 (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":"src/tool_runtime/files/mutations/text_edits.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47b68f0341764cedab05c107df835ff1664846f54af2ac2c598c423802a6978"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::git::show_changes::set_show_changes_verdict (cognitive 33): webcodex::tool_runtime::git::show_changes::set_show_changes_verdict has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (24 pts), match/switch 3 (5 pts), boolean chains 4 (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":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a584367804527355f5bab7f7f08610ba99043ddb595044e319ef4f1688e6872c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::observe_jobs::sparsify_observe_jobs_model_result (cognitive 33): webcodex::tool_runtime::observe_jobs::sparsify_observe_jobs_model_result has cognitive complexity 33 (threshold 15). Drivers by points: if/else 21 (26 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33df5d6dd15f5cf813925bb3cd19d9cff3ce4db8777a4f415db28d5b9a04236"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::result_projection::sparsify_complete_read_success (cognitive 33): webcodex::tool_runtime::result_projection::sparsify_complete_read_success has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/result_projection.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"2680886e338858ac1b91f90d773213e329239b129de1ec61c188a8f333f04e94"}},{"ruleId":"D2","level":"warning","message":{"text":"CodingAgentsPanel.CodingAgentsPanel (cognitive 33): CodingAgentsPanel.CodingAgentsPanel has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 20, if/else 6, ternaries 4 (5 pts), error handling 2 (nesting depth added 1). Most of this is not in the body itself: 12 of the 33 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 58, restart, remove, \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":"apps/desktop/src/features/extensions/CodingAgentsPanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b35598166a479b3063f186516f5e77d108e6215395720c29734eaf8cc9583a"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectRows.ProjectRow (cognitive 33): ProjectRows.ProjectRow has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 10 (13 pts), boolean chains 10, if/else 8 (10 pts) (nesting depth added 5). Of this number, 21 points are the body\u0027s own statements and 12 belong to 5 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/projects/ProjectRows.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f899e6319cc237ef34769d5ca163c9dd1b11bf4664a07e4b3068054148d3cfb9"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEnvironment::control_tunnel_with_observation (cognitive 32): NativeEnvironment::control_tunnel_with_observation has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 11 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"95657e7805dc2647e4820f4a2a5a9facee2ad4dad46ca6bfde87cfbb0383c542"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::parse (cognitive 32): Config::parse has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (22 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/bin/webcodex-tunnel/config.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45d54ccb28f3d26c0ed9f66adc17baf329a6d795bc1c58511b23a74ba6574f8"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact (cognitive 32): webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (19 pts), match/switch 11 (12 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18384f3c776c08631e6161974de1fce1c3ae065f64d9b05c2cc0743625020d3"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::configured_skills::resolve_live_skill_by_id (cognitive 32): webcodex_runner::webcodex_runner::configured_skills::resolve_live_skill_by_id has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 4 (9 pts), 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":"crates/webcodex-runner/src/webcodex_runner/configured_skills.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7c97940f74c9f5582e98dbb9d44e84de9716742852c863d9e8d0d308448433"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner_registry::job_updates::validate_validation_progress (cognitive 32): webcodex_runner_registry::job_updates::validate_validation_progress has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 12 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e8add4b5d936824d6f0319860edde63f5b6953626bff23ea12cb555258ed37"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionStoreInner::complete_message (cognitive 32): SessionStoreInner::complete_message has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49a917a3d04be1000626c0aa43279a0b32fc38be8326a4321e2cba18ab4125f"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::wait_for_job_readiness (cognitive 32): ToolRuntime::wait_for_job_readiness has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 5 (9 pts), loops 4 (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":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4e098f2b1e406e52a4c87206d23f197e332a2d2c8184adab6d9a037fbc95f7"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::coding_agent::live_acp_bound_violation (cognitive 32): webcodex::tool_runtime::coding_agent::live_acp_bound_violation has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 8, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"24205790526a0c7d6c5db96ddffd64c74e9629e767c3bab759c1219a1ce124a8"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::computer_tools::snapshot_receipts::validate_snapshot (cognitive 32): webcodex::tool_runtime::computer_tools::snapshot_receipts::validate_snapshot has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 7, match/switch 3 (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":"src/tool_runtime/computer_tools/snapshot_receipts.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4a68ac3aeefa7c1a47994e1ff8c5375dc30491bf4bc0ac002418e4dab9e9f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Adapter.event (cognitive 32): Adapter.event has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/model_gateway/adapter.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d7ce7ecc80d928c84cd6d01cb5457ac56698d2ebcc11637143d49d37913a57"}},{"ruleId":"D2","level":"warning","message":{"text":"common.optionsIn (cognitive 32): common.optionsIn has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 16). Most of this is not in the body itself: 8 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 201). 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":"crates/webcodex-browser/src/cdp/widgets/common.js"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"143de6e506658db59ef9ea800df6ec625ac4901a5ff945747efd8b664f2d8c83"}},{"ruleId":"D2","level":"warning","message":{"text":"install.extractTarGz (cognitive 32): install.extractTarGz has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 7, error handling 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":"npm/webcodex/install.js"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"55045e73ce50b2b1c09bd805ff5f0f4f89d693df11d2656e86ba9656e7ec778d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 32): (anonymous) has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 8, error handling 1 (4 pts), loops 2 (4 pts), other 2 (nesting depth added 7). Most of this is not in the body itself: 3 of the 32 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 83, 93, 94, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/browser-bridge/worker.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e8db5231865015af8c7c5cc035c266749400ab4152f58ddca86a6021319047"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::coding_agent::validate_request (cognitive 31): webcodex_core::coding_agent::validate_request has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 7, loops 1 (2 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d4b9287612bd518062d0b59dd0432f41e915511b7716498a184149e7c230da"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_lsp::navigation::call_hierarchy (cognitive 31): webcodex_lsp::navigation::call_hierarchy has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 4 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0db770701e08dea7580d0c46941bf9d50a79048748994ac81446d932fffaa86"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_openai_tunnel::bin::webcodex-tunnel::main::execute (cognitive 31): webcodex_openai_tunnel::bin::webcodex-tunnel::main::execute has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 4 (5 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/bin/webcodex-tunnel/main.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4407cbb48215e08ad01c2b384d4e1ccbc058d14d41d786e95af2e48f2f089e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_format::commit_candidates_with_hook (cognitive 31): webcodex_runner::webcodex_runner::project_format::commit_candidates_with_hook has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 6, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_format.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6300c8f9afd1d1cfd1129de22e6a5c45ab8f51e5c01f3a37bf13808468727bd"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::ssh::run_piped_ssh_command (cognitive 31): webcodex_runner::webcodex_runner::ssh::run_piped_ssh_command has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (23 pts), match/switch 3 (4 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cd3f32a4f5eb7bec93c5524c92148ad74124614a5c44295c29bd37a8130fbb"}},{"ruleId":"D2","level":"warning","message":{"text":"JobStartPlan::admission_requirements (cognitive 31): JobStartPlan::admission_requirements has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 18, if/else 4 (5 pts), match/switch 4 (5 pts), loops 3 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates/start.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac271fd5fb542da16fdfc7e1a8d99896a5269ef1e4c690afa34fc149554773bb"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::open_webcodex_workbench (cognitive 31): ToolRuntime::open_webcodex_workbench has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (21 pts), match/switch 4 (6 pts), boolean chains 4 (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":"src/tool_runtime/resource_references.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8972bf9738da83133c7ef05bde37d5395ba71a137c04270ef16e01f77a7815"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::cloudflare_transport::read_bounded_lines (cognitive 31): webcodex::cloudflare_transport::read_bounded_lines has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cloudflare_transport.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0700249993a73b369a3be3a21e7634e596741e3870c39c129b74885d1a5f495"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::mcp_tool_job_audit_correlation (cognitive 31): webcodex::mcp::mcp_tool_job_audit_correlation has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (5 pts), match/switch 1 (5 pts) (nesting depth added 20). 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":"src/mcp.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fcfc70f340c5bb852f5be08693c5b3db52ad48b83bd83f7b4418159c5d9aec"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::server_tunnels::run_profile (cognitive 31): webcodex::server_tunnels::run_profile has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 8 (13 pts), boolean chains 2, loops 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":"src/server_tunnels.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da71cd87891b11de5472177b62daa51fbd1dd50b0901141f8e806d43575f86a"}},{"ruleId":"D2","level":"warning","message":{"text":"Knowledge.search (cognitive 31): Knowledge.search has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (6 pts), boolean chains 4, error handling 2 (4 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":"plugins/project-knowledge/knowledge.py"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"37517ca5e19d2ea076ee8953db6c829009c7e00933ec3a1d904403c6f8abc88a"}},{"ruleId":"D2","level":"warning","message":{"text":"choice-controls.planChoiceGroup (cognitive 31): choice-controls.planChoiceGroup has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 5 (15 pts), if/else 6 (9 pts), boolean chains 7 (nesting depth added 13). Of this number, 27 points are the body\u0027s own statements and 4 belong to 3 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":"plugins/campus-application/src/choice-controls.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b407eb8417173709924aab4a41c71ae37fbc8ff030d420043a40880d14abe844"}},{"ruleId":"D2","level":"warning","message":{"text":"us.setupStorage (cognitive 31): us.setupStorage has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 3 (9 pts), boolean chains 5, loops 1 (3 pts), match/switch 1 (nesting depth added 15). Of this number, 26 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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":"src/mcp_pdf_app.html"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"919dc80fd955861abd2c332eaca5e164bc70b6409df7877459f31c1bde7f2bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"l.beginGroup (cognitive 31): l.beginGroup has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 18, if/else 6 (10 pts), ternaries 3 (nesting depth added 4). 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"d270be18a8967b6c55bcd7a50546c6dfb25b6d6d6ce9c08a17dfd3ed20033744"}},{"ruleId":"D2","level":"warning","message":{"text":"CdpBackend::snapshot (cognitive 30): CdpBackend::snapshot has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfa3faa4dbbc4beee379dc2d84b9b9706600ce6818d367e91aa0771ca949939"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_browser::cdp::walk_dom_controls (cognitive 30): webcodex_browser::cdp::walk_dom_controls has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"870566b2bdd0e0f3e47d9ae0817fcecfcd208f17b3e7449641f9c1f11f79ab2b"}},{"ruleId":"D2","level":"warning","message":{"text":"ControllerRuntime::reap_and_recover (cognitive 30): ControllerRuntime::reap_and_recover has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"377511d70984aaaaf02a883454f2c8f6eb3fb4f306ddb09a6509dd61e3a626d1"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::apply_patch_shared::derive_codex_patch_update_with_matching_mode (cognitive 30): webcodex_core::apply_patch_shared::derive_codex_patch_update_with_matching_mode has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 2, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_patch_shared.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f128e2922ffe081c613df8ca70879507f72ef6ea6999725720665b8b430848f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::coding_agent::validate_live_acp_diagnostic (cognitive 30): webcodex_core::coding_agent::validate_live_acp_diagnostic has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 7, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"616c1838bd9bef739e92d5dd0d92913cb974daee9d7a6529240d3be2ea8d08e1"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::project_listing::glob_match_segment (cognitive 30): webcodex_core::project_listing::glob_match_segment has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 12, loops 5 (11 pts), if/else 5 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_listing.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88f5b2dc7c1d7b90863b4b4e327cf2bbd4ce5d5664c79997c22cf69cf9c16e8"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderConnection::request (cognitive 30): ProviderConnection::request has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 2 (4 pts), loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"06250467ca7d1c9c8ec74ed4969c3fa355a11ab5a0a829ad3bac86daded99343"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::validation::pyright::run_pyright_with_program (cognitive 30): webcodex_runner::webcodex_runner::validation::pyright::run_pyright_with_program has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 7 (12 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/pyright.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab02d1e6ad07a8ac69b22d858c19ed2fbd05f925cfac6c06856ab02ac931cac"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner_registry::reconciliation::reconcile_inventory_locked (cognitive 30): webcodex_runner_registry::reconciliation::reconcile_inventory_locked has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 4, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1b669dfab335078dc100cefac8b2691a8755463a3d5194f1fa7e6073fb638f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::console::group_exploration_activity (cognitive 30): webcodex_workflow_session::console::group_exploration_activity has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/console.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b8b5532a30529ec498e9f8a0dbe21a84d87fc00a878f468b3d5aa05d79696b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::console::console_interaction_summary (cognitive 30): webcodex_workflow_session::console::console_interaction_summary has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/console.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"713609a600acff5ccc3ec462856864397927e75a742a30dfa1d974ed63f044f3"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::authorize_session_target (cognitive 30): ToolRuntime::authorize_session_target has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_tools.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"291d3352410b2ea674aace5ab5f081838eae9a40cc9b4501d109692350ffb2e9"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::helpers::decode_git_quoted_path (cognitive 30): webcodex::tool_runtime::helpers::decode_git_quoted_path has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (6 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/helpers.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"79931200305bafb8d8a35993d5e1fcbd7cea6c77e82f096477c74ae22325e96d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::result_projection::sparsify_search_success_for_model (cognitive 30): webcodex::tool_runtime::result_projection::sparsify_search_success_for_model has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (8 pts), boolean chains 3, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/result_projection.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2673edc5280304ed2092c6fe4634983ef5812c08119831435652a303923fa1"}},{"ruleId":"D2","level":"warning","message":{"text":"worker.chrome.runtime.onMessage.addListener() (cognitive 30): worker.chrome.runtime.onMessage.addListener() has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 8, error handling 1 (4 pts), loops 2 (4 pts) (nesting depth added 7). Most of this is not in the body itself: 3 of the 30 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 83, 93). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/browser-bridge/worker.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b537208fb1869ac16b154a6b00427abb63d60cd20fa16252bff01b15704b818d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::controller::validate_config (cognitive 29): webcodex_cli::webcodex_cli::controller::validate_config has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 8, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"5535ce406ec44a18128be0fd6f2d7d695f064dbf31040f8e35e7e0b8e671dd37"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::validation_evidence::parse_go_test_diagnostics (cognitive 29): webcodex_core::validation_evidence::parse_go_test_diagnostics has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 3 (6 pts), loops 2, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cfbc2d9efab4f489a97a330d949afbc3a258449448666dff14ba109d797dcc"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_lsp::fake_server::write_result (cognitive 29): webcodex_lsp::fake_server::write_result has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 5, boolean chains 4, loops 1 (3 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd30f0137d66e7b5bca77d832ed1b8c54bb8878f3fcfc5492b6e5f8224cbaa28"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::parse_runner_args (cognitive 29): webcodex_runner::parse_runner_args has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/main.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9f22ab9aabb0e83cac725c21d41e09f4b6e8d6f27e9a3c4f28e3ce9c0f6f9f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::write_bytes_atomic_strict (cognitive 29): webcodex_runner::webcodex_runner::artifacts::write_bytes_atomic_strict has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cf04a9427f52855b6f3ca4b6ccc7500716490a369d7bd4beed7e676d106095"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::patches::apply_change (cognitive 29): webcodex_runner::webcodex_runner::patches::apply_change has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"627b74da6c2e7735d55bb615f33f87b3dacfe827cc79c72d115c59345617baf4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::transport::supervisor::supervise_stream_transports (cognitive 29): webcodex_runner::webcodex_runner::transport::supervisor::supervise_stream_transports has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 2 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/supervisor.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85992a0d393ba88006687296dcc07ed481cfeb3b26b8417c381b2c20e2c2b07"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner_registry::reconciliation::preflight_inventory_locked (cognitive 29): webcodex_runner_registry::reconciliation::preflight_inventory_locked has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 8, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaeeaa5effeffe1b0dbe2734461538ade0127b1dd350c9b06bf177a9135268a2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_tool_contracts::registry::output_schemas::base_output_schema_for_tool (cognitive 29): webcodex_tool_contracts::registry::output_schemas::base_output_schema_for_tool has cognitive complexity 29 (threshold 15). Drivers by points: if/else 29. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8fa3508670681c18c92e96ef90803b4c4d8ef8fec1aaae5866c3f0f0b0b2a8"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::events::changed_paths_for_tool (cognitive 29): webcodex_workflow_session::events::changed_paths_for_tool has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (12 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"855068f1db100ccbf3737cd8703cba43501398885b89405d45d4d6f7663a1cec"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::handoff_brief::build_handoff_brief (cognitive 29): webcodex_workflow_session::handoff_brief::build_handoff_brief has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 6, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12b880847614c4e5415a1be43b49a312adde41af5b2c6529a3acc0da6e9b329"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::task_context::stall_diagnostic (cognitive 29): webcodex_workflow_session::task_context::stall_diagnostic has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 8, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/task_context.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce447ea9b3cf4717799dc1162f1851c928ae5e1802aeda0b9a8d49a7391bed2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::workspace_checkpoint::collect_untracked (cognitive 29): webcodex_workspace::workspace_checkpoint::collect_untracked has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 4 (8 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/workspace_checkpoint.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df31e06d18a2b26651026bad652fbe0ea240256378836adbb2afac3cd6425ec"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::resolve_project_input_for_auth (cognitive 29): ToolRuntime::resolve_project_input_for_auth has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 4 (7 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/project_resolution.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"6033217de8cd603cec20a28fd872ab961775dc36e2ee5b9623d164157c6d8275"}},{"ruleId":"D2","level":"warning","message":{"text":"AddDevice.DeviceInvitationDialog (cognitive 29): AddDevice.DeviceInvitationDialog has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 8, ternaries 2 (4 pts), error handling 2 (nesting depth added 4). Most of this is not in the body itself: 7 of the 29 points are its own statements and the rest belongs to 6 function items inside it that branch (create, copy, validCode, \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":"apps/desktop/src/features/projects/AddDevice.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65bd98c2e8c11f4903b1ff844e5424c06b6b955981cb3a6ac56f5e7cdbc967a"}},{"ruleId":"D2","level":"warning","message":{"text":"location-values.resolveChoicePath (cognitive 29): location-values.resolveChoicePath has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 5 (9 pts), boolean chains 8 (nesting depth added 9). Of this number, 28 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":"plugins/campus-application/src/location-values.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"300a8c4ed213131659cba2baebbdc81e8096ab9a01dcf7025b11ef7b60bc8807"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_computer_app.html.renderToolResult (cognitive 29): mcp_computer_app.html.renderToolResult has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 15, ternaries 9 (10 pts), if/else 4 (nesting depth added 1). 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, 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":"src/mcp_computer_app.html"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1178595b6051f472e41f149140b9c7e7d641d4473b1ccae830060c97e5f57ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.renderAvailability (cognitive 29): mcp_workbench_app.html.renderAvailability has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 4 (8 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"e961ffc6b55496710f9b0df6dceee4f6ba93cdf6f640013fad20be1cf2794744"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopCore::switch_runtime_transaction (cognitive 28): DesktopCore::switch_runtime_transaction has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 5, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/runtime_shell.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2af7c6b80985bdcda52388b0728e0393652da9386056a168109d9dd6534d8c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::updates::install::native::macos::launch (cognitive 28): webcodex_desktop::updates::install::native::macos::launch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (25 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":"apps/desktop/src-tauri/src/updates/install/native.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"04987620d735a6e9c46bfc2bbed7ddc673cede4fc15e290ae0b3156a151401e6"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::parse_runner_install_service_with_identity (cognitive 28): webcodex_cli::parse_runner_install_service_with_identity has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 5 (6 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"35243086e5f5354efe865d0b8cf5b2c1a1520c6a10b0fb72b8302beed22e74b4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::controller_tui::pipe_reader (cognitive 28): webcodex_cli::webcodex_cli::controller_tui::pipe_reader has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_tui.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"caac56ba965613fece6ea4f855a6e8da58b1051c09e4c52c48949fffee726a50"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_computer::platform::windows::accessibility::uia_control_role (cognitive 28): webcodex_computer::platform::windows::accessibility::uia_control_role has cognitive complexity 28 (threshold 15). Drivers by points: if/else 25, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/accessibility.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"defe0881394a2bf2cc77866a940199d50dc9a5b2a3d0b32ec5d3d499d282eace"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::plugin::validate_check_report (cognitive 28): webcodex_core::plugin::validate_check_report has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 8, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/plugin.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e71b3a3e2e5899eb1f9bcaa1ca197e6a7fbe2588fb4057a474befceda763ba8"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::service::linux::install (cognitive 28): webcodex_environment::service::linux::install has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"abecc862e05ab87e1fa89ace7f671e20686d6774c4b5b543901fb98a20b29d51"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::unified_update::installer::apply_verified_installer (cognitive 28): webcodex_environment::unified_update::installer::apply_verified_installer has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 5, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/installer.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3ecba27fdf4f4ff00329bfc5bb32dd7d8f5efce8c4f875c5977c1992a3f28d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::upgrade::freeze_installer_upgrade (cognitive 28): webcodex_environment::upgrade::freeze_installer_upgrade has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 5, loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"4883abc2ad4ec1a9074b97023c2e058be649cb92840176e370d438d8cbc05565"}},{"ruleId":"D2","level":"warning","message":{"text":"JobManager::start_structured_job (cognitive 28): JobManager::start_structured_job has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 3 (5 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":"crates/webcodex-runner/src/webcodex_runner/job_manager/process.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"50588493559b07f77c4d95af7b9439d3df8edcdb29e4492e4ad269c6f4b3e1bc"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteShellTransport::wait_for_completion (cognitive 28): RemoteShellTransport::wait_for_completion has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/remote_shell.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cc76eadac61024aa02a569f01c42eec975b80d52461dd452f58f023f39ae59"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact_metadata (cognitive 28): webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact_metadata has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 10 (13 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"129102b1879364039d226abfb13d3b139c1838d69fa66016e4bc39c5e92f6c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::configured_skills::discover_with_trigger (cognitive 28): webcodex_runner::webcodex_runner::configured_skills::discover_with_trigger has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 4 (9 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/configured_skills.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4834d95770b9c7788bd6ebc315ad72cf720b6a5c88fbbf99cfb37e025ea44f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_build::plan (cognitive 28): webcodex_runner::webcodex_runner::project_build::plan 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":"crates/webcodex-runner/src/webcodex_runner/project_build.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91bd4b56d931fcff5114be58002ce03309e32a6352a60e3037dda4ec211cf4c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::shell::search::resolve_windows_internal_posix_interpreter (cognitive 28): webcodex_runner::webcodex_runner::shell::search::resolve_windows_internal_posix_interpreter has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/search.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f788fe145195008c965732e795dc6558290d908fbad5bdc96733e7b973e2688b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner_registry::validation::validate_project_summary (cognitive 28): webcodex_runner_registry::validation::validate_project_summary has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 15, if/else 12 (13 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"f256660effb1e0e2fdd850147dffdf95c3fccfb6b868fb131845b16922a381a5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::audit::session_input_summary_for_tool (cognitive 28): webcodex_workflow_session::audit::session_input_summary_for_tool has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 5 (13 pts), match/switch 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/audit.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c3e13b73f3a81f82b62cec60c82714a72940913817b6301bc20518f0b5ded9"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::persistence::database::write_row (cognitive 28): webcodex_workflow_session::persistence::database::write_row has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 3, boolean chains 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/persistence/database.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bd6da71cf94acddab3115d3d4947561c287ca9598eac27732b0b24c37473b9"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::run_job_for_auth_with_contract_with_ssh_resource (cognitive 28): ToolRuntime::run_job_for_auth_with_contract_with_ssh_resource has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 8 (12 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/jobs.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c934207d5491fe547dc41bc9b3a01f1bf2f84a3af5d2ff429401ade0f6ea800"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::review_changes (cognitive 28): ToolRuntime::review_changes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 6 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/review_changes.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d35619584e34ac508409028cea4b7f02b348d4fbbcba36da705a373cb0a7157"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::discovery::compact_tool (cognitive 28): webcodex::mcp::discovery::compact_tool has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 1 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/discovery.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d6d2bfa8dc314a5d76545b0a8e13000e0f1861e8e3d7cea6b67c0fb61e7bac"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::goal::goal_continuity_observation (cognitive 28): webcodex::tool_runtime::goal::goal_continuity_observation has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (20 pts), match/switch 5 (6 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":"src/tool_runtime/goal.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5e253baea59a9a347575ceccbc2440eef21c5b95870eb3b0c8ce1ebbe5c802"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::work_result::work_result_file_content (cognitive 28): webcodex::tool_runtime::work_result::work_result_file_content has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/work_result.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"712c3c13308a56f13d817e61b9a3c7e4e557179a73666968fe1f1cb3b89d5f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"l.paintChar (cognitive 28): l.paintChar has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 14, if/else 8 (14 pts) (nesting depth added 6). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6dfe84f98e081465033ba741d85079e1af7e27e7ff23c5a48bb24dae271d67"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.loadDirectory (cognitive 28): mcp_workbench_app.html.loadDirectory has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 7, ternaries 2 (3 pts), error handling 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":"src/mcp_workbench_app.html"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c822c4236a53ab9a6d6cc5bae1aeb1d745530e0ecd58da2c5828b599a9cb93"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopCore::apply_environment_record (cognitive 27): DesktopCore::apply_environment_record has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21 (23 pts), boolean chains 3, 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":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e933e5b2565697cb161cbdc2f1fbde6d83e8ab3945eb022937e07148d4713d1"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserSupervisor::batch (cognitive 27): BrowserSupervisor::batch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"c054a07d7ec4043c96860a6dc6f5850b274bdd13564ae5e8a475fb3770876a52"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::parse_login (cognitive 27): webcodex_cli::parse_login has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 11 (15 pts), if/else 6 (8 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ed873db7b55233dda62870757f4788e9ba6624862f8ff459b9bfe18efae2c3"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::parse_service_kind (cognitive 27): webcodex_cli::parse_service_kind has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"4826f9198bd9cb53346a148ec45b25f065b5811d7b41005e02ff1479898b4323"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::ops::ops_smoke_preflight_report (cognitive 27): webcodex_cli::webcodex_cli::ops::ops_smoke_preflight_report has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/ops.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a535939a30ea7f5823e5571e2d7cf570e1ca3db0eb69a1d4428cf625c2fb48a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::runner_service::run_runner_status (cognitive 27): webcodex_cli::webcodex_cli::runner_service::run_runner_status has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (22 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/runner_service.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3c71bcb0615b9356136908ae4d48818cd8569dab02c26d1b26e18b8eef3335"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEnvironment::remove_tunnel_fenced (cognitive 27): NativeEnvironment::remove_tunnel_fenced has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eab358dd248ae6fd213a6ab1c68aac9c4d370bc0b69f03f297131fc6cd94233"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::migration::inspect_import (cognitive 27): webcodex_environment::migration::inspect_import has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc041cfbb440997ea8dfd8b1f64ba1b723d0a05565a01c92c65bf846f914bcb"}},{"ruleId":"D2","level":"warning","message":{"text":"TunnelClient::sse (cognitive 27): TunnelClient::sse has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (19 pts), match/switch 1 (5 pts), 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":"crates/webcodex-openai-tunnel/src/mcp_http.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"95874c49dc7e18d4c8ae6df5f40ff3589507e5673330313e71905f49b4fa07fb"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::execution_io::spawn_reader (cognitive 27): webcodex_runner::webcodex_runner::execution_io::spawn_reader has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/execution_io.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c68fca86f67cc7a64411657c8841fb0af62a0175c2a86c4d22eb851c988ddf"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::files::handle_skill_read_file_request (cognitive 27): webcodex_runner::webcodex_runner::files::handle_skill_read_file_request has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 10 (11 pts), if/else 10, boolean chains 6 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/files.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab6c107fabaaf7bfd7feb0bdf34041f199f295118de50cc00daa5056e085410"}},{"ruleId":"D2","level":"warning","message":{"text":"JobStartPlan::new (cognitive 27): JobStartPlan::new has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, match/switch 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates/start.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31ee6209fbbdcafb7d0c3923040c327a37f7e5989996b292e0464ae97beb159"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::record_goal_workflow_stalled_diagnosed (cognitive 27): Database::record_goal_workflow_stalled_diagnosed has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 8, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal_stall.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"be76c0a6dd00281517279edb9019d0bc32c820f081866321978218fb0aae1b31"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::workspace_checkpoint::status_summary (cognitive 27): webcodex_workspace::workspace_checkpoint::status_summary has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/workspace_checkpoint.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"96edc195aeb7a92894141e323563ca7f3d92e02db477846cfd872909c1b8b2cb"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::wait_for_job_terminal (cognitive 27): ToolRuntime::wait_for_job_terminal has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 7 (10 pts), loops 1 (4 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":"src/tool_runtime/job_terminal_wait.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"910e5b2039475b131e485e11364a67a6034287a529662e5571990534ecf6df36"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::runner_skill_request (cognitive 27): ToolRuntime::runner_skill_request has cognitive complexity 27 (threshold 15). Drivers by points: if/else 20 (25 pts), boolean chains 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":"src/tool_runtime/skills.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cc51a0d1f0027b5bb7b64720c82fa90a58ffba1b6878b1696b17edbfc995da"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::append_terminal_generic_job_validation_events (cognitive 27): ToolRuntime::append_terminal_generic_job_validation_events has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/validation_events.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b9a15365dc9f651df3e78b6d2e0689220d8f72fd11c64f96200dca143eae58"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::text::compact::inventory (cognitive 27): webcodex::mcp::cli::text::compact::inventory has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (10 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":"src/mcp/cli/text/compact.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"03697fa445b17329b4b9eb4e8b0b5f0690e47fb807c1e28a5cc1d11b684c5d7c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::runner_session::dispatch_inbound (cognitive 27): webcodex::runner_session::dispatch_inbound has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 5 (10 pts), boolean chains 3 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runner_session.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3f7927e1fe52c91dc4a09c9d930256562ac2d661cf076560293d0a22582e19"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::patch::analyze_unified_diff (cognitive 27): webcodex::tool_runtime::patch::analyze_unified_diff has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (25 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":"src/tool_runtime/patch.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"3282397fa16246ab28bbbbedcea06e8ec0c1a1327857689049ed2b947627590c"}},{"ruleId":"D2","level":"warning","message":{"text":"us.setAttributes (cognitive 27): us.setAttributes has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 11, if/else 3 (7 pts), loops 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d8073407912405215105d3961c0f188624bcc4af49b688a9220caffd9a9899"}},{"ruleId":"D2","level":"warning","message":{"text":"l.#l (cognitive 27): l.#l has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 4 (9 pts), boolean chains 8 (nesting depth added 7). Most of this is not in the body itself: 12 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 692, 692). 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":"src/mcp_pdf_app.html"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"d010d181f9b4ca3960d934a26b818e3f0639b75b13a9eade3ea48ebdf23ce3ce"}},{"ruleId":"D2","level":"warning","message":{"text":"l.editorDivPaste (cognitive 27): l.editorDivPaste has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef560a29b1cb929188714901e9561759c42d63a07879a2f6db00292cf66506e"}},{"ruleId":"D2","level":"warning","message":{"text":"Rt.#l (cognitive 27): Rt.#l has cognitive complexity 27 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 2 (10 pts), boolean chains 2 (nesting depth added 16). 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":"src/mcp_pdf_app.html"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"2079582fa259ca1d2182ce9572d796d647d1d458da288109e58479bc41a07ec2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::tray::build_menu (cognitive 26): webcodex_desktop::tray::build_menu has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 4 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/tray.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d72c4212e883569d69f25f70a0081c93ca68ffcc30b045b7fd98bb02b79689"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::environment::render (cognitive 26): webcodex_cli::environment::render has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2967049a741aaed4d727b474116bbaf4f44fa417cdff927472b27115b82ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::environment::cloudflare::validate_input (cognitive 26): webcodex_cli::environment::cloudflare::validate_input has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 14, if/else 11 (12 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/cloudflare.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2247a83c3225d6f3793ad30eff68a7a60d59f0a944a0d07a25b70f3fb9dc631d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_computer::platform::macos::applications::enumerate_macos_applications (cognitive 26): webcodex_computer::platform::macos::applications::enumerate_macos_applications has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/applications.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a643ee3c712e12ba150dad24ea706e5a229bc6bdba24142628123ab95b5c46"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_openai_tunnel::command::request_headers (cognitive 26): webcodex_openai_tunnel::command::request_headers has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/command.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"78773ea2d9917bdabf7608d0a33b61818ad47ed80a8e62cac66ed9cd974b16f8"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::upload::recover_artifact_upload_reservations (cognitive 26): webcodex_runner::webcodex_runner::artifacts::upload::recover_artifact_upload_reservations has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8e74884278df62ec80bed3e73598a1858b735e99530cbde58ba09aa222fad4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::files::handle_delete_project_files_request (cognitive 26): webcodex_runner::webcodex_runner::files::handle_delete_project_files_request has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/files.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"317cb217783ef1f0023a51dacf69a3a93b796fec13c11292adbac0d826e7254e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::patches::handle_write_project_file_request (cognitive 26): webcodex_runner::webcodex_runner::patches::handle_write_project_file_request has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 7 (10 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf8338ca852bf1625e6444a0cbd629f6c4ef651ba17b31f112622717a551b21"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::plugin::prepare_provider (cognitive 26): webcodex_runner::webcodex_runner::plugin::prepare_provider has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 8 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"def04ad3765897ffbbd65f4b45ce528507c776632fc17ae2f39b0937262052fd"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_build::rust::run_rust_build (cognitive 26): webcodex_runner::webcodex_runner::project_build::rust::run_rust_build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 4 (8 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build/rust.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1a696cd435d0b531a7b652c14987a142ab3eaf83255e3f27b93e2cc98d2b39"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::transport::bootstrap::run_runner (cognitive 26): webcodex_runner::webcodex_runner::transport::bootstrap::run_runner has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 7 (9 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/bootstrap.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf3d417f9835e96e706f646250969abb98478a9e6c1a659f1860a2223e11327"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudflareOwner::run (cognitive 26): CloudflareOwner::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cloudflare_ingress.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d98ff82cf7a7978bbd2712747cbd9fa1682b220a676da5862dd75b0079a572"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::workspace_hygiene_check (cognitive 26): ToolRuntime::workspace_hygiene_check has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, loops 2 (3 pts), match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/hygiene.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"20abeaa5c881aebd0acd7d13c4dc5f6b2a7473041073d841049f27b4a23f1964"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::wait_for_observed_jobs (cognitive 26): ToolRuntime::wait_for_observed_jobs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 2 (3 pts), boolean chains 2, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1185ecb6e4de0aaa82ee2023ea9eb1e432b0399e15b223c466974be81d09b7a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::project_format (cognitive 26): ToolRuntime::project_format has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 8, boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/project_format.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79973d28c9485a23f00fc5f42b24f795713e2366cc1b7e8a21051edaf13d791"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::query_runner_inventory (cognitive 26): ToolRuntime::query_runner_inventory has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 4, loops 1 (2 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":"src/tool_runtime/runtime_info.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bf859d4f8b4830911d95556473f3b0d955769a4f432499227062194f842b67"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::validation_terminal_result (cognitive 26): ToolRuntime::validation_terminal_result has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/validation.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a36d9389f746bbb7b0a5cac051baeb9aad46aa8fe1a31bfe5a490d440474ed"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::run_server_with_shutdown (cognitive 26): webcodex::run_server_with_shutdown has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3, match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0362022a666f08c1efa2aafbfd6d9e12efe44cd7d94d55c0efdae013af85f4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::text::native::reads (cognitive 26): webcodex::mcp::cli::text::native::reads has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/native.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a995e15d99f509a88e38e85d7e263978d274e5c667216cedccadb05fa82aff92"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::acceptance_evidence::acceptance_evidence (cognitive 26): webcodex::tool_runtime::acceptance_evidence::acceptance_evidence has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, boolean chains 6, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/acceptance_evidence.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1269bc13b07e7ff7acd14570d08e9b0cdfa7352fd9a7a00f9df08e08fbfaddbf"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::git::diff_hunks::git_diff_hunks_recovery_value (cognitive 26): webcodex::tool_runtime::git::diff_hunks::git_diff_hunks_recovery_value has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 9, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"0779a5f7f83ba4ed95e50d0437ea63b90276b43562dd033123e530af3f97091a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionPathsEditor.ExtensionPathsEditor (cognitive 26): ExtensionPathsEditor.ExtensionPathsEditor has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 13, boolean chains 9, if/else 4. Most of this is not in the body itself: 10 of the 26 points are its own statements and the rest belongs to 6 function items inside it that branch (browse, a function literal at line 54, a function literal at line 48, \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":"apps/desktop/src/features/extensions/ExtensionPathsEditor.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bccebe7d91d4bf8c77d1b1f0b400b51858d8989e34a34946596447ce228f42"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeConsolePanel.RuntimeConsolePanel (cognitive 26): RuntimeConsolePanel.RuntimeConsolePanel has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 18, if/else 6 (7 pts), error handling 1 (nesting depth added 1). Of this number, 16 points are the body\u0027s own statements and 10 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/console/RuntimeConsolePanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c83ef52103c689b2976a8dc175b636c20f367532f1ace6fb7ae29e645a149c5"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_agent_continuation_app.html.reconcile (cognitive 26): mcp_agent_continuation_app.html.reconcile has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 6, error handling 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":"src/mcp_agent_continuation_app.html"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecb5267de0c9780946cf8f763532d71d9052c0cff4c9e94ae0a539e9128f075"}},{"ruleId":"D2","level":"warning","message":{"text":"Ir.splitBySection (cognitive 26): Ir.splitBySection has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 6, loops 2, ternaries 1 (2 pts) (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_docx_app.html"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"f429487595c8d88efb878e559bcbe78b02428b46f0453217f45a46d943672f54"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_result_app.html.renderGitChanges (cognitive 26): mcp_result_app.html.renderGitChanges has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 7, ternaries 4 (5 pts) (nesting depth added 3). Of this number, 21 points are the body\u0027s own statements and 5 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":"src/mcp_result_app.html"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f989635d78ea8a1cb15ddc82c32f8f9150c6179144e662226ef80384e2690e"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.envelope (cognitive 26): mcp_workbench_app.html.envelope has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (4 pts), boolean chains 3, error handling 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 13). Of this number, 24 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":"src/mcp_workbench_app.html"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c311e0ac736bfce184b124343181e6f59f1b55e28d2c7cf0d2a8790e8950f81"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_browser::cdp::index_dom_semantics::walk (cognitive 25): webcodex_browser::cdp::index_dom_semantics::walk has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":2569}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e70e0175b3ac4091c4d456f02abe34e21e4b014b6b7b5f1efe18a4de90ac5c4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_browser::profiles::windows::private_path (cognitive 25): webcodex_browser::profiles::windows::private_path has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/profiles/windows.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d3463ac21e662c29813a2b7771f3eb16b715699c46542bba599beadcb0950d"}},{"ruleId":"D2","level":"warning","message":{"text":"ControllerRuntime::poll_wsl2_start (cognitive 25): ControllerRuntime::poll_wsl2_start has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_wsl2_nat_startup.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06f2652994c4dd609311fd0c337f60a86b0ae22d8a2a64c223f6cfaecb63391"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::environment::update::run_at (cognitive 25): webcodex_cli::environment::update::run_at has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 5 (8 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/update.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d02a1cd6e0b1af87455ba24695254d4914db321970123fd5659b98f3e8f8c98"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::ops::run_ops_command (cognitive 25): webcodex_cli::webcodex_cli::ops::run_ops_command has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 11 (22 pts), if/else 2 (3 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/ops.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba52d9bb69b087c212ec0b7138a7c527074b7fa95d4a4e3c0d709e7466d97823"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::apply_patch_shared::seek_sequence (cognitive 25): webcodex_core::apply_patch_shared::seek_sequence has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_patch_shared.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8937688ee7c8ec84824e033fa5530c0d7ac7aa20ccb5795a9cf57ec3d567ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::job_observation::project_log_stream (cognitive 25): webcodex_core::job_observation::project_log_stream has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 9, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/job_observation.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b0a9cbae3cf6182a1664cf02fc1e423cfca7c680c6aa898903cbbcba682b23"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::runner_protocol::job::normalize_go_package (cognitive 25): webcodex_core::runner_protocol::job::normalize_go_package has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"3723d3244eb1f6e54d757788ca9badee5c20a057b09a6987b61ce228f8110d33"}},{"ruleId":"D2","level":"warning","message":{"text":"InputChannel::with_writer (cognitive 25): InputChannel::with_writer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/input.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"89807122464aa98e9ee78b1c6ffe9d73e6066a3254d580a4678f3d1eec6a0556"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::files::handle_skill_list_packages_request (cognitive 25): webcodex_runner::webcodex_runner::files::handle_skill_list_packages_request has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 7 (9 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/files.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"49493fd373373c34aebf12281f3440365bbb024dc7fe5e405ed0cac1bba6e58f"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerRegistry::job_attention_snapshot_locked (cognitive 25): RunnerRegistry::job_attention_snapshot_locked has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 5, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6ef01911052573fba35d412ff9bc4b9f098d9c2c3a05317f99888b31f5e95f"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerRegistry::reconcile_disconnect_checked (cognitive 25): RunnerRegistry::reconcile_disconnect_checked has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 5, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8191c04692242a8b43e997e5366b370f431418f6441266d45ccb4227fa1a004"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectTextEditInput::validate (cognitive 25): ProjectTextEditInput::validate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 8, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_inputs.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b047dbebf2a6fca1b4c8221490a683debe9d3fce0be16c2092f66fe77a5b678"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::events::push_lsp_result_paths (cognitive 25): webcodex_workflow_session::events::push_lsp_result_paths has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (12 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":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ef77b9239d6b262454efacc84e0a73edae39f812305529393f1c7a785b3dc8"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::cargo_fmt_with_context_inner (cognitive 25): ToolRuntime::cargo_fmt_with_context_inner has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 6 (12 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":"src/tool_runtime/cargo.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"af93bc6fb138e70a7877300456761ef68e26f0980fdf5e5979bc5d0996c5f036"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::observe_jobs::summarize_observe_jobs_result (cognitive 25): webcodex::tool_runtime::observe_jobs::summarize_observe_jobs_result has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7610af6933a43badaa472be22532565f056176cee5e3c7c0ece9f8f135eef78"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::surface::strip_code_mode_schema_noise (cognitive 25): webcodex::tool_runtime::surface::strip_code_mode_schema_noise has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (11 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/surface.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a4a7610fc8aac18bec6ae7915a3908fd3f6f355d18bc9d55e13bf095efc10c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::work_result::semantic_activity_label (cognitive 25): webcodex::tool_runtime::work_result::semantic_activity_label has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (24 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":"src/tool_runtime/work_result.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3104e8b7d8e80766eda3cf8c247c7b7aeeecda15def7c999c7e95508eb28bea"}},{"ruleId":"D2","level":"warning","message":{"text":"install.startNetworkRequest (cognitive 25): install.startNetworkRequest has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (14 pts), ternaries 5 (7 pts), boolean chains 4 (nesting depth added 3). Of this number, 19 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":"npm/webcodex/install.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc05ec1b23f8511427bd5363856506f784f39743cf30b8e91996fd342630cc94"}},{"ruleId":"D2","level":"warning","message":{"text":"resume.resolveResumeValue (cognitive 25): resume.resolveResumeValue has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, 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":"plugins/campus-application/src/resume.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"9477bbccfa4e29d59e03cc1eace83b66c19f7bef3b5af540bc054a6b098baed2"}},{"ruleId":"D2","level":"warning","message":{"text":"Vn.getPattern (cognitive 25): Vn.getPattern has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 6, ternaries 2 (3 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab8a120fa529999ea4a8f0bf3ee7150d48bb19aedbed28b3aa4b415363537eb"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.updateControls (cognitive 25): mcp_workbench_app.html.updateControls has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 24, loops 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd608240ffeecc94429253b75046a05f7e6aa9e2ad671cb429d6e1bd2d53dce"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.saveGoal (cognitive 25): mcp_workbench_app.html.saveGoal has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 9, ternaries 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"044dcde98b80ed1f44b631cccfaf7a65b034e2b5c2735ba86ce924cd5d19a18d"}},{"ruleId":"D2","level":"warning","message":{"text":"assignPart (cognitive 25): assignPart has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 10). Of this number, 23 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":"crates/webcodex-browser/src/cdp/widgets/date.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc32748eddf17266fe9ac7d1eee08b188c2d3868b8b2aac036be9f461e98486"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::parse_runner_status_with_identity (cognitive 24): webcodex_cli::parse_runner_status_with_identity has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), 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":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2320}}}],"partialFingerprints":{"codehealthFindingId/v1":"902e9aa4894745d3bec0cdd413cafa8563605f3ea74250bb9b3022eb0ce7b918"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::connect::shared_key_oauth::provision_client (cognitive 24): webcodex_cli::webcodex_cli::connect::shared_key_oauth::provision_client has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28dfdc75eecc59d629ed4145f772c011d2282503fc3ba3300ac016a677efb86"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_code_mode::runtime::run_runtime (cognitive 24): webcodex_code_mode::runtime::run_runtime has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-code-mode/src/runtime.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f67c7bd7210d77ebd3ae4cc396f736b76ba979c05671d791e788cc3dca8924"}},{"ruleId":"D2","level":"warning","message":{"text":"RetainedJobReceipt::validate (cognitive 24): RetainedJobReceipt::validate has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 14, if/else 7 (8 pts), loops 1, match/switch 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_job_receipt.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d38a7204f0f52f474ce40c4b8d2cca969e7a61cf321a9824da3a6ca31f255d8"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEnvironment::remove_project (cognitive 24): NativeEnvironment::remove_project has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d415517fca2af3f2ba2540f39141ad56f29e99dd39fa63c693572a5a65cf7b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::native::service_spec (cognitive 24): webcodex_environment::native::service_spec has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, match/switch 4 (6 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab215563bea6fb71cf147c85fa1433f3a9c2283f0cda60d9266c106709ace2b8"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::service::windows::validate_credential (cognitive 24): webcodex_environment::service::windows::validate_credential has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (22 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":"crates/webcodex-environment/src/service/windows.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"749216189a26b3efcddd7ba572040c196d2577c5de8bb96ee10d72d1da1ede75"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::upgrade::native_executable_architecture (cognitive 24): webcodex_environment::upgrade::native_executable_architecture has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (6 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":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2913}}}],"partialFingerprints":{"codehealthFindingId/v1":"166b4c7574045512660c611219928d194bf4077899fef4eb08a5c6ea071ceeb7"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_openai_tunnel::run_fence::check_archives (cognitive 24): webcodex_openai_tunnel::run_fence::check_archives has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 6, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f9b9d166f82e3bfd4e182f45cf5d2bd23c680570de8e2db3108f2750319333"}},{"ruleId":"D2","level":"warning","message":{"text":"ShellProcess::wait_for_completion (cognitive 24): ShellProcess::wait_for_completion has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96c4cc66d8a9b9c6bec6fd71d66377c9e4e257e58cb30a9b7a37f36f0ced62e"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsShellProcess::wait_for_completion (cognitive 24): WindowsShellProcess::wait_for_completion has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/windows.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad226b2be01c58dc7c4550e6556f609652c9244012d22a26eeccd6ed621c032e"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderConnection::request (cognitive 24): ProviderConnection::request has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (7 pts), loops 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9da21a6cca25a03bc95b1147928bd22fc9d342d55100ae8db31e0a92f6a56d4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::main (cognitive 24): webcodex_runner::main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 6 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/main.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"16804fb2bcb73306fcacd1287b5d809604b8aad59ccf54182f02e21ca3381e5c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::upload::sweep_artifact_upload_directory (cognitive 24): webcodex_runner::webcodex_runner::artifacts::upload::sweep_artifact_upload_directory has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (10 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7c91db9ae75c6adc266685bb2dd18f3b2a028a3bee923855027363f70f70ca"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_chunk (cognitive 24): webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_chunk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12, match/switch 12. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6124f0d87f15a3046ae2cbd4d495f5598543cf3e3fe162d3cf83bb5ed0e84c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::config::validate_runner_config_toml_shape (cognitive 24): webcodex_runner::webcodex_runner::config::validate_runner_config_toml_shape has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cf30c9de343dfe54d5477dcc129f6537a82a71e92bf05f08c411ea2fbb301c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::skill_store::snapshot_installed_package::visit (cognitive 24): webcodex_runner::webcodex_runner::skill_store::snapshot_installed_package::visit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"556cc82948566c5e6a7f34d6a328f8237357a1b1e662dcae827217d3ceab69c6"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::transport::poll_dispatch::handle_one_poll (cognitive 24): webcodex_runner::webcodex_runner::transport::poll_dispatch::handle_one_poll has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/poll_dispatch.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"890f15831f3525c2c863afcda51d98fb734e4ce57f1ec982b2874356012cf357"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceiptRegistryGuard::drop (cognitive 24): ReceiptRegistryGuard::drop has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/receipts.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f72371060bf53269e1b230058377240c86d8d8184a5ae0987648f906209511"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner_registry::runners::validate_coding_agent_registration (cognitive 24): webcodex_runner_registry::runners::validate_coding_agent_registration has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da72061cf76e48f872d78ee505f9bd8ef780bcf348b28dd9b6e60b83bd28204"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_tool_contracts::request_schema::normalize_closed_object_unions (cognitive 24): webcodex_tool_contracts::request_schema::normalize_closed_object_unions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (11 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":"crates/webcodex-tool-contracts/src/request_schema.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6193588d13589ad8ba10a65ad9db8a55e54f391104615bccfad854df6b1bd1ae"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_tool_runtime_contracts::tool_audit::request::typed_agent_task_request_audit (cognitive 24): webcodex_tool_runtime_contracts::tool_audit::request::typed_agent_task_request_audit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"5709e92f5f9480b940095e2081c667c1fb5abd10e6196b9f0955804322f493ce"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionStoreInner::compact_hot_sessions (cognitive 24): SessionStoreInner::compact_hot_sessions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store/residency.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a774c709f83f8c596fbfc020df2fa0d31f8540be294a1b13ed1300ce4b1b308c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::continuation::compare_scopes (cognitive 24): webcodex_workflow_session::continuation::compare_scopes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15, boolean chains 9. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/continuation.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e8b02652c9c03e8e8a34c009e0878f4aaa12a57af0c36c898a3f6fc179beb2"}},{"ruleId":"D2","level":"warning","message":{"text":"PostRecordResponse::finish (cognitive 24): PostRecordResponse::finish has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 4 (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":"src/tool_runtime/kernel/postprocess.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"79446c80cfb90d64cb521f512a0246c423eae62a4cc16d5249bb00af284fe192"}},{"ruleId":"D2","level":"warning","message":{"text":"CanonicalOrchestrationHost::invoke_tool (cognitive 24): CanonicalOrchestrationHost::invoke_tool has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 4, 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":"src/tool_runtime/orchestration_host.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"200f0ff900fba00df492b265b0e0dd0398fea817261ac1d00c92418d62dd579e"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::accept_artifact_handoff (cognitive 24): ToolRuntime::accept_artifact_handoff has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 7 (9 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/artifact_transfer.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"095d46f2c737766f3753c01239835545239ec25d7942b3e0235d3af039143ffe"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::coding_agent_observe (cognitive 24): ToolRuntime::coding_agent_observe has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 9 (12 pts), if/else 6 (10 pts), boolean chains 2 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5bd36e40b546e75ef1fcdc661357fe0bbca4ab82e3cbc518ed734b4e99d659"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::import_one_conversation_file (cognitive 24): ToolRuntime::import_one_conversation_file has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 3 (4 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":"src/tool_runtime/conversation_import.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d78383020d6ead2f0483ac3feefaafa8b7720c5dcaa2f5dda3cc60a72a5e53"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::job_log_with_paging_for_auth (cognitive 24): ToolRuntime::job_log_with_paging_for_auth has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 6, 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":"src/tool_runtime/jobs.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10dda1181f71860785eb7ea0ce2cecf0292f0c9ebb6de2216d76b1c6b7c2e70"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::search_project_texts_resolved_typed (cognitive 24): ToolRuntime::search_project_texts_resolved_typed has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 1, match/switch 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":"src/tool_runtime/search_project_texts.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87e2dd3024d8efbb8ed18e7cfae023d35bf63ece0e9d7c68b6b2c948f4caa39"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::cloudflare_ingress::cloudflare_control_handler (cognitive 24): webcodex::cloudflare_ingress::cloudflare_control_handler has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, match/switch 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cloudflare_ingress.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"949f6d69e87e1906a59f7f37c15373ab10308746a1e9e7e73b6b08b9019ef76c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::tools::handle_list_inner (cognitive 24): webcodex::mcp::tools::handle_list_inner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fd10b0f62ac8f7c83461798e69299ef57b9ffb08282d05a0ff371ec612d112"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::tools::call::specialized::plugin (cognitive 24): webcodex::mcp::tools::call::specialized::plugin has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (21 pts), match/switch 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":"src/mcp/tools/call/specialized.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb273db2a15bd15d83be6105407f4d6c1887b31e9f94c91eba9081ef4b7c227"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::oauth_http::managed_authorize::oauth_authorize (cognitive 24): webcodex::oauth_http::managed_authorize::oauth_authorize has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"6097a466855f50c4abb7d989c59e0b0e5756add238625dc963eb86c50e467e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::surface::collect_code_mode_output_fields (cognitive 24): webcodex::tool_runtime::surface::collect_code_mode_output_fields has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (5 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":"src/tool_runtime/surface.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bef8c4ed5e228742aef52dfa0c8bd292d11aa534ca53a4e99a645f9a2676bf"}},{"ruleId":"D2","level":"warning","message":{"text":"presentation.desktopErrorPresentation (cognitive 24): presentation.desktopErrorPresentation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 3, 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":"apps/desktop/src/i18n/presentation.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e543a29f4918a20f53f7cc164e9794903008018a67ec9c09edc3b264269830"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_agent_continuation_app.html.toolResultShape (cognitive 24): mcp_agent_continuation_app.html.toolResultShape has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 1 (3 pts), loops 1 (2 pts), ternaries 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":"src/mcp_agent_continuation_app.html"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e3373a49a816f6f33134be950b720f4e5a44347b3487b281314199685c218e"}},{"ruleId":"D2","level":"warning","message":{"text":"us.render (cognitive 24): us.render has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 6, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"109b91229c2f2325bff2c12ac3bc511e2608740bc47b96845feb74dfd73d8142"}},{"ruleId":"D2","level":"warning","message":{"text":"l.endGroup (cognitive 24): l.endGroup has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, ternaries 1 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3949bd298793d2762259955a93b4bbb24b9945efdf90f3fad8c3d00d9c343c"}},{"ruleId":"D2","level":"warning","message":{"text":"fi.extractPages (cognitive 24): fi.extractPages has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (5 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"18925890badc7d255d3083b08783b01858e3a25b6f4463b457ce55af8eb864e3"}},{"ruleId":"D2","level":"warning","message":{"text":"l.render (cognitive 24): l.render has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 7, 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":"src/mcp_pdf_app.html"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac6c62620b6b09bcd2b4c8ea5770f4f3c195aae7bc7c72cd83e31ed939823b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Ke.#c (cognitive 24): Ke.#c has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c52e15b98ff79f1757f8f0049b5a591d894a70a8c595a3c4f81ff1a0a8786d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_browser::cdp::walk_form_contexts (cognitive 23): webcodex_browser::cdp::walk_form_contexts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"971b1c99440716fefd99d2742c678db9ec525893b74c0942f9ce98f3afd55fd9"}},{"ruleId":"D2","level":"warning","message":{"text":"ServiceCommand::run (cognitive 23): ServiceCommand::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/commands.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcbdca7c36b210af1dbb39e7a770eed2f0610d84d508e98348d80354e4e858a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::login::render_login_result (cognitive 23): webcodex_cli::webcodex_cli::login::render_login_result has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa37057a43bedf7904ac9322ba5483f4b427441de1af2cb047e887e0391b878"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::cloudflare_tunnel::complete_cloudflare_profile_cleanup (cognitive 23): webcodex_environment::cloudflare_tunnel::complete_cloudflare_profile_cleanup has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a20c1c7e92105db7f9abd0817524a89d2ba0920cb1144867cf4da4dad1d7aab"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::upgrade::desktop_tree::copy (cognitive 23): webcodex_environment::upgrade::desktop_tree::copy has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d739a400531fec2544ee1630c8784accd8d31ecd227779623e52036212cb44ed"}},{"ruleId":"D2","level":"warning","message":{"text":"JobManager::replay_snapshots_since (cognitive 23): JobManager::replay_snapshots_since has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/delivery.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fa53cac266db8b34047c9f79de46946c7ef6145bbc19a24cb5744035f14dee"}},{"ruleId":"D2","level":"warning","message":{"text":"JobManager::start_detached_process_job (cognitive 23): JobManager::start_detached_process_job has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 6 (7 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/detached.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"151d0f46a81bee6bfc961cf1731034b48ec5e8771b03631cf6aef3fbbd62cc87"}},{"ruleId":"D2","level":"warning","message":{"text":"JobManager::record_update (cognitive 23): JobManager::record_update has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a5ccd8b18d5b372323f88ac8155128314597f2fc2ac94618604c43d29b8f65"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_finish (cognitive 23): webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_finish has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 6, boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fabe78a30656d5ce778a5fff6e93322b478e396fb46faf894c9b9d0ba0414f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::projects::managed_worktree::resume_managed_worktree (cognitive 23): webcodex_runner::webcodex_runner::projects::managed_worktree::resume_managed_worktree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, match/switch 5 (6 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":"crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"11462b2344a08ed500529d04ea78a2889160a5922e85f1b699083f12d35ce339"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerRegistry::enqueue_computer_checked (cognitive 23): RunnerRegistry::enqueue_computer_checked has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"1373b6aba0b09844addad890226e42ee68d555aa0565f90fe56122d7e1e94ace"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner_registry::job_updates::validate_job_activity (cognitive 23): webcodex_runner_registry::job_updates::validate_job_activity has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"4749fa789932bac29c2dd071d38609547520325f83677dcc1cfaa3b22802a526"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_validation::recipe::resolve_validation_recipe_with_policies_and_exclusions (cognitive 23): webcodex_validation::recipe::resolve_validation_recipe_with_policies_and_exclusions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/recipe.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d23443dc1ccf242029e792d1249179f4a0fe57c0aa8762c9b8773df1e5d89d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_context::worktree_sha256 (cognitive 23): webcodex_workspace::project_context::worktree_sha256 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_context.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c0ba71583bf13fb53ecafe49ce74572cfcea58fcf54d8575baebba3b55865a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_recipe::nearest_recipe_root (cognitive 23): webcodex_workspace::project_recipe::nearest_recipe_root has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 1, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"2963ed1b5c7957b37d282708e65e610ba1dfb737ec04c5d6c6d4dc63addf7a27"}},{"ruleId":"D2","level":"warning","message":{"text":"OrchestrationEffectAccumulator::finish (cognitive 23): OrchestrationEffectAccumulator::finish has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (21 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":"src/tool_runtime/orchestration_host.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bb1e429b1aea51ee26b083226f3194f34001b69d5857a726c65af243ddb8c7"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::dispatch_runner_config_tool (cognitive 23): ToolRuntime::dispatch_runner_config_tool has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 8 (10 pts), boolean chains 3 (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":"src/tool_runtime/runner_config.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d13b82cdd8a92b858048ea2254db187ef8641a28fa28a03f05a1a64a7f8fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowActivityRegistry::start_with_identity (cognitive 23): WindowActivityRegistry::start_with_identity has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/window_activity.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f45c2af27ed7e1e90dbee6e719a0266ae2b6ebacb7dc08a503ce426734ff2f1"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::auth::middleware::parse_http_authority (cognitive 23): webcodex::auth::middleware::parse_http_authority has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/middleware.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbde3ce1148f45dd1c34d51bd589b6d8c393c02d97dd8a33e52464b30127bdf0"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::resources::handle_read (cognitive 23): webcodex::mcp::resources::handle_read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 3 (7 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/resources.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fc8f967b2a13dca3259a73bd14bd446b50ec66512a5bd6f0d69e58171f3393"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::tools::mcp_tool_parts_json (cognitive 23): webcodex::mcp::tools::mcp_tool_parts_json has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (22 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":"src/mcp/tools.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8b22d81027bddb07f0fda397af0f0e45b42070213aba028cad96d0be0b7be9"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::computer_tools::accessibility::validate_computer_element_state (cognitive 23): webcodex::tool_runtime::computer_tools::accessibility::validate_computer_element_state has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 16, if/else 5, match/switch 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/accessibility.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c5aee3bf29a4686daf161ae9b36cf721966f341f1a8c601c1a56e6cc4e89cb"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::patch_result::validate_apply_patch_edit_summary (cognitive 23): webcodex::tool_runtime::files::mutations::patch_result::validate_apply_patch_edit_summary has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, boolean chains 7, 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":"src/tool_runtime/files/mutations/patch_result.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18804e3e21d39e51f19c4bc7c409b642fa388cf1039f28eeb933209ba5a10f1"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::git::diff_hunks::sparsify_complete_diff_files (cognitive 23): webcodex::tool_runtime::git::diff_hunks::sparsify_complete_diff_files 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":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf8d4b77d4d0072f1b34d5a43c9c0ea21d4bf98982b88fb32323cf78826f81b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::git::diff_hunks::project_git_diff_hunk_fragment (cognitive 23): webcodex::tool_runtime::git::diff_hunks::project_git_diff_hunk_fragment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (20 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":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6d79d2d4fabb7b2b019ef2544ab313c6cda8a13e38335e40c78f5c2cd59b89"}},{"ruleId":"D2","level":"warning","message":{"text":"external_observation_hook.deliver (cognitive 23): external_observation_hook.deliver has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 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":"integrations/codex/external_observation_hook.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2a595ab75020e7b53e9a6cdefdea1eee0e224db3655703b6a44c2b5684ea39"}},{"ruleId":"D2","level":"warning","message":{"text":"CodingAgentEditor.CodingAgentEditor (cognitive 23): CodingAgentEditor.CodingAgentEditor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, ternaries 3 (4 pts), error handling 3, loops 1 (nesting depth added 2). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 5 function items inside it that branch (submit, a function literal at line 52, chooseExecutable, \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":"apps/desktop/src/features/extensions/CodingAgentEditor.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"36771638f72351e1bedf143534459fa97a5f23771e01d32d8c70fd813d57f55d"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowActivityDetail.WindowActivityDetail (cognitive 23): WindowActivityDetail.WindowActivityDetail has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 16, if/else 4 (5 pts), error handling 1, ternaries 1 (nesting depth added 1). Of this number, 15 points are the body\u0027s own statements and 8 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/activity/WindowActivityDetail.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e951642f4c68fbff282afed677795636f0793eeffe42193080e6b64066776414"}},{"ruleId":"D2","level":"warning","message":{"text":"App.DesktopApp (cognitive 23): App.DesktopApp has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 20, ternaries 1 (2 pts), if/else 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d068f48aa5fa76c8e62a3a2d8fdc97aff9552fe6251baa7bddd08ac5bed153c4"}},{"ruleId":"D2","level":"warning","message":{"text":"config.loadConfig (cognitive 23): config.loadConfig has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 8, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/agent-browser/src/config.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc84accd528142cc817ac54b0498f120c1579cbeb1bcb0754f7e5dcac87cf4e"}},{"ruleId":"D2","level":"warning","message":{"text":"upload-source.resolveUploadLocation (cognitive 23): upload-source.resolveUploadLocation has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7, ternaries 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/campus-application/src/upload-source.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"884812913ea403cd92d100606a0639a3538517c76260171b116310cfc78b3ff5"}},{"ruleId":"D2","level":"warning","message":{"text":"l.#c (cognitive 23): l.#c has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 5 (8 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d9409f3f3e66b37956992bb28c685fc5bc5487f02e864951fdac8664854c67"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_result_app.html.addGitFile (cognitive 23): mcp_result_app.html.addGitFile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_result_app.html"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4897a833e60d25679267ad92644b38557d47d64532aa1419e59881eef49e8e6"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_result_app.html.appendJobDetails (cognitive 23): mcp_result_app.html.appendJobDetails has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 16 (20 pts), boolean chains 2, if/else 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_result_app.html"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dadc1f1bef0bb2b9cf63d1339cb2e9cca3e0f32317cbfc0a718cab08105596"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.loadOverview (cognitive 23): mcp_workbench_app.html.loadOverview has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (9 pts), boolean chains 7, if/else 5 (6 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":"src/mcp_workbench_app.html"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bfdd9f3abc7ab1d0e5a4b6d3a43a0946e0bfb18e7c25062317107af9829195"}},{"ruleId":"D2","level":"warning","message":{"text":"chooseYear (cognitive 23): chooseYear has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 4 (8 pts), boolean chains 2, loops 1 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 5 belong to 9 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/widgets/date.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"716ae20c34694364d9d68e9eebb281a8e170b8a48143116331d1ac0ef34e0d9e"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopCore::migrate_environment (cognitive 22): DesktopCore::migrate_environment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"6784f7176be0ffd92d35f947db6153241f9729af42765b15be2dc33fb34a395c"}},{"ruleId":"D2","level":"warning","message":{"text":"ControllerRuntime::poll_runner_observation (cognitive 22): ControllerRuntime::poll_runner_observation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_runner_observation.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc84646fbaa49594d9fd085ddefc38d059c14ee33fc241d5f67077de34bd2d7"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_computer::platform::macos::applications::mac_application_candidate_at_path (cognitive 22): webcodex_computer::platform::macos::applications::mac_application_candidate_at_path has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13, boolean chains 9. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/applications.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e5f979b1e2433dafe5afeceb94a6af5d0a5a7878ccabc2439bec67dcb0fd9f"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerConfigOperationResponse::validate (cognitive 22): RunnerConfigOperationResponse::validate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, match/switch 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33bae9684eaceffdc6b2e1d90649663be48fa85ff01aa3f582c7719faa5b297"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::runner_protocol::validate_script_request (cognitive 22): webcodex_core::runner_protocol::validate_script_request has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol.rs"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d404872c3b70d0f5b1d6a72ce235ae3770364d7a03ffa65ee625a08240f6c831"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateManager::run_locked (cognitive 22): UpdateManager::run_locked has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/download.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9a0c4843a8834cbb42b6a16dbeb9898702dde1c09337a5856fa46680c59245"}},{"ruleId":"D2","level":"warning","message":{"text":"UnifiedInstallerManifest::parse_value (cognitive 22): UnifiedInstallerManifest::parse_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (6 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"321e438593eb1d3adb49e8d9f387a00d14e5b53a3cf8d725e59b615f94f75b9b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::installer_unix::finish_authorized_installation (cognitive 22): webcodex_environment::installer_unix::finish_authorized_installation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/installer_unix.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"940c51756ded3ffe97fd2276723c36841043afb6b7cd46238c752730e557e23a"}},{"ruleId":"D2","level":"warning","message":{"text":"Receipts::open_inner (cognitive 22): Receipts::open_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_receipts.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37496aa536efa3c5af2ba87b01da286ef5136fd050e78e88678bf2a6b68841f"}},{"ruleId":"D2","level":"warning","message":{"text":"RegisteredStream::receive (cognitive 22): RegisteredStream::receive has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 3 (8 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/stream.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8837d76ba5f5311a331ea94a3d605f287216d50f6772440dbda2942b63a4f106"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::patches::write_file_atomic_strict (cognitive 22): webcodex_runner::webcodex_runner::patches::write_file_atomic_strict 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":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"522b3bd448f01794102f22783ac5d209c1dfad1a8d3de77447e24a14bde53868"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_build::rust::selected_packages (cognitive 22): webcodex_runner::webcodex_runner::project_build::rust::selected_packages has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build/rust.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"285531ea4da5d171902f959f273965b7a1a6f14769d8a7328f3d9729629d969d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::projects::lifecycle::update_allow_patch_locked (cognitive 22): webcodex_runner::webcodex_runner::projects::lifecycle::update_allow_patch_locked has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"facb93b832b308f5724817b9a2df679e2cadc054e7f6bdd63b92b35fdfee12eb"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::validation::project::plan (cognitive 22): webcodex_runner::webcodex_runner::validation::project::plan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 3, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/project.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"974c9b61e98538319a980d2f6c8329de32dedd4d6a7c76c7a5d9fa5bcfe76991"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner_registry::reconciliation::validate_context (cognitive 22): webcodex_runner_registry::reconciliation::validate_context has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 8, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a8182cd338355e9c0959e429310b6dab77abe8385fd5c6c3eb43fbb24a5e39"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplyFileChangeInput::deserialize (cognitive 22): ApplyFileChangeInput::deserialize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 8, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_inputs.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"322e56386c4a29c4561e4ac018cd75ba4d2d6405b39da12db75bb9ac62326aaf"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_tool_contracts::tool_call::parsing::validate_coding_project_source_shape (cognitive 22): webcodex_tool_contracts::tool_call::parsing::validate_coding_project_source_shape has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/parsing.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf9ce0c46de6cdae76d1f93d97c14c2af1b485145108813232f095175918e04"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_context::untracked_files_sha256 (cognitive 22): webcodex_workspace::project_context::untracked_files_sha256 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_context.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"2314b4813d522b154b6e64d93f00023a175f4f55b0f617650ccc1b46c38bbeb2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_recipe::collect_workspace_member_dependencies (cognitive 22): webcodex_workspace::project_recipe::collect_workspace_member_dependencies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"52feb519c0995229c21b14bc758811f99eb8180ff0ea6ef931b647f75fad80bd"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_recipe::cargo_manifest_uses_workspace_inheritance (cognitive 22): webcodex_workspace::project_recipe::cargo_manifest_uses_workspace_inheritance has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (8 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"911fffd747e96dd5735db360250561d24be4f61b439c74e15d8c44f8d8c32685"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentContinuationController::verify_mcp_app_registration_target (cognitive 22): AgentContinuationController::verify_mcp_app_registration_target has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, 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":"src/agent_wake.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"5420c1c7d0822bd9100f4da502eb9c915240201134521cb7e8f281d461c8c7cd"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudflareControl::provision_oauth (cognitive 22): CloudflareControl::provision_oauth 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":"src/cloudflare_ingress.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3175539200df051f0c917ea60ffc79bad57e5c089fe849f4fc022193bba815"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::complete_agent_task_attempt (cognitive 22): ToolRuntime::complete_agent_task_attempt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (8 pts), match/switch 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":"src/tool_runtime/agent_task.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73f665b29e69005779cd329a84ca2921013da7de13ca52b98d324829d13ea36"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::dispatch_lsp_tool (cognitive 22): ToolRuntime::dispatch_lsp_tool has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/lsp_tools.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5f4988e4c57e65fea9cff32329bf1b389b13cc4c918585754bc3585530f419"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::read_files_planned_resolved (cognitive 22): ToolRuntime::read_files_planned_resolved has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4 (5 pts), boolean chains 3, 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":"src/tool_runtime/read_files.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d8b8cce5998b65c84019a751e0143378e21016567ae56733adc2fa7cef574e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::oauth_http::shared_key_bridge::oauth_authorize_bridge (cognitive 22): webcodex::oauth_http::shared_key_bridge::oauth_authorize_bridge has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 4, boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/shared_key_bridge.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"c556080c1468d28ba5bc805deb791b44dca156ae216cd102a914a9b4b9a7121f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::startup::run_project_command (cognitive 22): webcodex::startup::run_project_command has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 5 (10 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/startup.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c21bc60d9fa0bb4ecab97ebba464178adbe89de49b0e8ef616ad39a64a5f5e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::kernel::admission::check_protocol_capabilities (cognitive 22): webcodex::tool_runtime::kernel::admission::check_protocol_capabilities has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 11. 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":"src/tool_runtime/kernel/admission.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d639863d341f3eb059061ee1ebf6243184063f229adfd926ac5e729dec1bcc2"}},{"ruleId":"D2","level":"warning","message":{"text":"read_handoff.read_handoff (cognitive 22): read_handoff.read_handoff has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13, boolean chains 8, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/codex/read_handoff.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4edeedef49a40440d8a1edaf91693feda18e02707843563043b24aaf4984e28"}},{"ruleId":"D2","level":"warning","message":{"text":"SshResourcesPanel.SshResourcesPanel::observe (cognitive 22): SshResourcesPanel.SshResourcesPanel::observe has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 2 (5 pts), boolean chains 3, error handling 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":"apps/desktop/src/features/extensions/SshResourcesPanel.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d6540244883719e83439a3e79da014f65eacfe755434825c5d65be9b5686fd"}},{"ruleId":"D2","level":"warning","message":{"text":"McpProvidersPanel.McpProvidersPanel (cognitive 22): McpProvidersPanel.McpProvidersPanel has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 16, if/else 3, error handling 2, ternaries 1. Of this number, 13 points are the body\u0027s own statements and 9 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":"apps/desktop/src/features/extensions/McpProvidersPanel.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d6a4d6630ab669f108e8f2ad4162bc7c1e96e38512536755aa78e5614356ce"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateComponents.UpdateComponents (cognitive 22): UpdateComponents.UpdateComponents has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 9 (18 pts), boolean chains 4 (nesting depth added 9). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 2 function items inside it that branch (a function literal at line 11, build). 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":"apps/desktop/src/features/settings/UpdateComponents.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f768c1556dcafb0f8c25b45d4fc8fee6ef94effdca4b3e48ea4e8a5cb866004"}},{"ruleId":"D2","level":"warning","message":{"text":"wrapper.captureProtectedNpmEnvironment (cognitive 22): wrapper.captureProtectedNpmEnvironment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, error handling 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/webcodex/bin/wrapper.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2c9d3e8d43fe94c3ecec4845de8afe7712651b65717ae893836a46adb73ed8"}},{"ruleId":"D2","level":"warning","message":{"text":"context.parseCargoMetadata (cognitive 22): context.parseCargoMetadata has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 6). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/repo-context/src/context.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9e4e2a09dd0cc809c7a3ff41daefe8c2df7bfbeea4e41dedab523200c947fc"}},{"ruleId":"D2","level":"warning","message":{"text":"l.commentButtonPosition (cognitive 22): l.commentButtonPosition has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 3 (8 pts), loops 3 (7 pts), if/else 4 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b714b781d0f72fe839b7ced7361a51675905c2feea0178bd6e5806e05c1542"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.preview (cognitive 22): mcp_workbench_app.html.preview has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (9 pts), ternaries 2 (3 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":"src/mcp_workbench_app.html"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f97061b7c54cdc89bd65637e03f28e729ad4749b30b935122dbf5aa26047ab"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.applyLaunch (cognitive 22): mcp_workbench_app.html.applyLaunch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 7, ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d981795e4c9daff2d7c5ec7989ae39e38d239df0422bc0279bd6f4f194c36a5"}},{"ruleId":"D2","level":"warning","message":{"text":"MachineEventSender::send (cognitive 21): MachineEventSender::send has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (21 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":"apps/desktop/src-tauri/src/process/supervisor.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f1e4c494a872a30da2c6900ca0c5df5684a1e7baa8e027abe730a8551dc536"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::cloudflare_connection (cognitive 21): AppState::cloudflare_connection has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/cloudflare_connections.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ff7907675430efa710ecf183ffefa92afa673c13dc3358e84c1563160a699d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::coding_agents::validate_profile (cognitive 21): webcodex_desktop::coding_agents::validate_profile has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, loops 3 (4 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":"apps/desktop/src-tauri/src/coding_agents.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"026966745c990bed625e81d47b3c44ea117fba5d78ffbe404da9921a30bca4b5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::state::operation_completion::reconcile_after_operation_failure (cognitive 21): webcodex_desktop::state::operation_completion::reconcile_after_operation_failure has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/operation_completion.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c9aae5716f051face478c561907a082b9a6ccb47306135b89e8667a73287bc"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::webcodex::cli::run_bounded_until (cognitive 21): webcodex_desktop::webcodex::cli::run_bounded_until has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 7 (8 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/cli.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e47419c21f1d0caa0936ac51cbc3f6e361115833cf506c3d224385daa5dafd5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_browser::bridge::serve_peer (cognitive 21): webcodex_browser::bridge::serve_peer has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/bridge.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adfff7a16b58ca59d80032f87bcd6711fcdf56cc953d646a9a4fceffac10678"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::mcp_config::render (cognitive 21): webcodex_cli::webcodex_cli::mcp_config::render has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, loops 3 (5 pts), match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/mcp_config.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c14ff588b7ad53e5a0de0cff415df9ee580ed9313c661ce97808950301cc525"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_computer_control::windows::serve (cognitive 21): webcodex_computer_control::windows::serve has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer-control/src/windows.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d544858518347aea76f52a7fb9c1adb43a2eb3047de70a78b5595c45241158"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectInstructionsSnapshot::retain_unavailable_scopes (cognitive 21): ProjectInstructionsSnapshot::retain_unavailable_scopes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_instructions.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c998ef9e9bb25b2cf196da8ea6679919c0dcb39a5a173497a3d083be44449aa3"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::mcp_gateway::validate_tools_with_description_limit (cognitive 21): webcodex_core::mcp_gateway::validate_tools_with_description_limit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc90f76b7bb4b86bd80a5509650fb0cd1fcf3c9f56bf5615bb17fc1344c4d3ba"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::validation_evidence::strip_ansi (cognitive 21): webcodex_core::validation_evidence::strip_ansi has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"082f2ad96a299ca4ef506939342f713a89d12eaa4223b29ec1378f6b5d8fd27b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::workflow_session_contract::validate_model_facing_result_expectation (cognitive 21): webcodex_core::workflow_session_contract::validate_model_facing_result_expectation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/workflow_session_contract.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d7a57ca8ff7a4755d13514aaa66c0a50d64e0b700ac63a11c436df179ac481"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::service::validate_spec (cognitive 21): webcodex_environment::service::validate_spec has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, if/else 7 (9 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/mod.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e69382f3c15c1eb8bd296b0709d53405608bab172e0b3bffcb5bf705cf19a7"}},{"ruleId":"D2","level":"warning","message":{"text":"McpGatewayManager::handle (cognitive 21): McpGatewayManager::handle has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f95d35bbb534862abdd4ad8190edf7debedda40a46a3e6d0092700568fe65a2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::coding_agent::diagnose::project_live_options (cognitive 21): webcodex_runner::webcodex_runner::coding_agent::diagnose::project_live_options has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/diagnose.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"89af35a44c3d326dda981d9a4d748100fb8a37ce7d058de0efee46acb55324b2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::external_tools::spawn_stdout_reader (cognitive 21): webcodex_runner::webcodex_runner::external_tools::spawn_stdout_reader has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/external_tools.rs"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ee396db31fef341d42041ab6349ab7b6eb5004f8d94767e679afc678e1524b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::job_manager::detached::validate_detached_recovery_context (cognitive 21): webcodex_runner::webcodex_runner::job_manager::detached::validate_detached_recovery_context has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/detached.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07c322a93fc8c111b53fc1b10f5397890271268754f7bf12a7cefa6ee794dc8"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::output_text::decode_utf16_stream (cognitive 21): webcodex_runner::webcodex_runner::output_text::decode_utf16_stream has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/output_text.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc94e98078f85d2696d3ba4d9114c431a4c68add101653f4d647817a4fce789d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::plugin::provider_stderr_reader (cognitive 21): webcodex_runner::webcodex_runner::plugin::provider_stderr_reader has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cc3e685ed04d8f0c91fb6ac3a2c0e3c13eea1dbff367f142097fbc9d106545"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::remote_shell::process_control_pending (cognitive 21): webcodex_runner::webcodex_runner::remote_shell::process_control_pending has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/remote_shell.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e039f8b3c855497ecd0869969eb5a5cae920efa524162117de252eac846fcbd"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerRegistry::begin_maintenance (cognitive 21): RunnerRegistry::begin_maintenance has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/maintenance.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"8992015418756ec6f80c8f8df1006e3d24df39802359741eb0108fb864d04ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_recipe::extend_cargo_workspace_member_routes (cognitive 21): webcodex_workspace::project_recipe::extend_cargo_workspace_member_routes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf9fe443dabbd8e7545923233f4c6587227841aeda451bfba6a59112a644ea5"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlExecution::validate (cognitive 21): ControlExecution::validate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 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":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"86439ba19849f52dd1040e97268b82c9e00806ce3ab27355213b64f1d299b714"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::save_computer_snapshot_artifact (cognitive 21): ToolRuntime::save_computer_snapshot_artifact has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, match/switch 9, boolean chains 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":"src/tool_runtime/computer_tools/snapshots.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9640498f1f0269a4f16f1e623329f4fe5cb59fd8e900138ddff6b124d0334530"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::workflow_resume_context_projection (cognitive 21): ToolRuntime::workflow_resume_context_projection has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 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":"src/tool_runtime/context_projection.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8945278eae7f9d43687263102fe72c0be75c612d16053eaaec1cbe8268133a"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::apply_patch (cognitive 21): ToolRuntime::apply_patch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 5, boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/patch.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f24488f5a6c027d7e613017df7078cb7c9bc6a520ce118cf9fedde0c2f82ec5"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::search_one_resolved_project_text_outcome (cognitive 21): ToolRuntime::search_one_resolved_project_text_outcome has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/search.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"890937b7000ff22a3cac2fb4b9440b308cf8fc33ca8c5978ba3f8caad103ca72"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::show_changes_from_capture (cognitive 21): ToolRuntime::show_changes_from_capture has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":2736}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30afe741b65016c58f37dfdf637c4da9c4d15058080edf2886a78ff2b9a8581"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::passive_job_attention_item (cognitive 21): ToolRuntime::passive_job_attention_item has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (3 pts), boolean chains 2, 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":"src/tool_runtime/job_attention.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6388dafe5b0e596686fa36fdbab8572f0c7981280fc9d3a35600694ed2dc709"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::action_audit_sessions::sanitize_value_inner (cognitive 21): webcodex::action_audit_sessions::sanitize_value_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/action_audit_sessions.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"839ad99f87d97d30e6686d678936883bf25cf4d2489e773c23913a9d04cb6bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::audit_http::routes::audit_stats (cognitive 21): webcodex::audit_http::routes::audit_stats has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 4 (6 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/audit_http/routes.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf99a483470d8b9f5f05f03dc9c9fa78768addde037d66e591cb3754a6a4e56"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::project_manifest (cognitive 21): webcodex::mcp::cli::project_manifest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to one function item inside it that branches (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":"src/mcp/cli.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad849465d5c19efa18c978b9ecbb205ee7f77209b890d76e20837a6494eb5e05"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::files::mutations::patch_result::valid_apply_patch_failure_match_diagnostic (cognitive 21): webcodex::tool_runtime::files::mutations::patch_result::valid_apply_patch_failure_match_diagnostic has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, boolean chains 5, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/patch_result.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11786037776248274869e6728ac631747451b1ab6f0ced03f8419c2106f0d52"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::git::diff_hunks::decode_git_diff_hunks_v2_continuation (cognitive 21): webcodex::tool_runtime::git::diff_hunks::decode_git_diff_hunks_v2_continuation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f89d7d6e53bbf8b3053365874167b29d599d4e0e3c2aacb432390a39d9c957d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::git::show_changes::show_changes_transport_safe (cognitive 21): webcodex::tool_runtime::git::show_changes::show_changes_transport_safe has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 9 (10 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00af81aaf5c4c0fcf42bad3fc8325eb81324bff76d0a5f031b7e4b47fa606da"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::kernel::admission::check_runtime_tool_scope (cognitive 21): webcodex::tool_runtime::kernel::admission::check_runtime_tool_scope has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/kernel/admission.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5d617c38e219a22f3bf86f6a9b67f491dded71d24ee3833e987ed9b9dd7226"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::workbench_state::project_task_summaries (cognitive 21): webcodex::tool_runtime::workbench_state::project_task_summaries has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (8 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/workbench_state.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"0935ecc7a19b2a3f475e48a2151063cffb6a44ca05a1e77eefb48a2bd8c28622"}},{"ruleId":"D2","level":"warning","message":{"text":"platform_security._windows_private_acl (cognitive 21): platform_security._windows_private_acl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/codex/platform_security.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bcc61141346589c34bf5ffe3d47c4b4bcfca820701a25d06e86b29fbcac213"}},{"ruleId":"D2","level":"warning","message":{"text":"domain.resolveAuthorizedTarget (cognitive 21): domain.resolveAuthorizedTarget has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), error handling 4 (5 pts), boolean chains 2, 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":"plugins/safe-delete/domain.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bdff3ecdc6b4d6d97f503f5dcbb35dc3d971a3b9d16fd887e04f07dffb1a09"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopCore::refresh_runtime_status (cognitive 20): DesktopCore::refresh_runtime_status has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 4 (6 pts), boolean chains 2 (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":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecdc8a9644483b300498d5d5ccac282a9f8135ecaa6c6560e54e353fa3650ee"}},{"ruleId":"D2","level":"warning","message":{"text":"TrayProjection::from_snapshot (cognitive 20): TrayProjection::from_snapshot has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/tray.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e11aedc92552fbc3f4e61da2b2506bb1ab6a4edae897469a99963ed82590b00"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::project_inventory::unregister_batch (cognitive 20): webcodex_desktop::project_inventory::unregister_batch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, match/switch 1 (3 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/project_inventory.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a60f3e16e653888e7ebb32c90787b8c1b34d07c1e94a19eea39209289970d7d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::state::environment::validate_legacy_runner_layout (cognitive 20): webcodex_desktop::state::environment::validate_legacy_runner_layout has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2d88e56aa6d072036eb7b293e155ab43e1a4bc26bbdbd1fb0009501b2d475d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_browser::bridge::native::run_inner (cognitive 20): webcodex_browser::bridge::native::run_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/bridge/native.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81fce62aee22949fa2689461d6acccd0c1e396ac5886099e66eb4d2bf4a9a1f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_browser::cdp::clickable::collect_candidates (cognitive 20): webcodex_browser::cdp::clickable::collect_candidates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/clickable.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a4d1988adbbabb8ae583db774c35dd5d9303e9b59616e1f4d28044649ac13e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::system::resolve_user_api_token (cognitive 20): webcodex_cli::webcodex_cli::system::resolve_user_api_token has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00245984a7a95811aa1729dccdbd5e88c707b3005c7e42baeb634d8ae67e3e7"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectValidationRequest::validate (cognitive 20): ProjectValidationRequest::validate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_validation.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"067a5318047f088cc4fdb5fa759c2e5a94c9ad0a28cc2abe274ccd0b5e7c6167"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSkillRequest::validate (cognitive 20): RunnerSkillRequest::validate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_skill.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e60c3d040c4f168eddf75800bd4c7a85701cf43c0a5c578f05d2b277b5c1e9"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::apply_edits_shared::resolve_apply_text_match (cognitive 20): webcodex_core::apply_edits_shared::resolve_apply_text_match has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_edits_shared.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbebd83c30cace5a0bd6a8de7eacbbdc393d2ee4fc6381344c4534086e421fa2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::runner_operation::validate_file_payload (cognitive 20): webcodex_core::runner_operation::validate_file_payload has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fbefd59420a198933154e10ff05a2a63bcb93905f0b9e0a85a458d16f6d26b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::validation_evidence::pytest_summary_line (cognitive 20): webcodex_core::validation_evidence::pytest_summary_line has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8443e97f95d0bff098c88a833e7f710ca07f5a3128aebafaa3c838178ec723b1"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::validation_evidence::node_native_test_summary (cognitive 20): webcodex_core::validation_evidence::node_native_test_summary has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea92c619468e5b3394d7ce41101c885fff7e23ccdead187768dcd9d7248cce18"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::local_status::collect (cognitive 20): webcodex_environment::local_status::collect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 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":"crates/webcodex-environment/src/local_status.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de05f6785e3f982c67b6820154764580f08d474853e8f77f1fe4816c6b0529f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::service::windows::grant_access_paths (cognitive 20): webcodex_environment::service::windows::grant_access_paths has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/windows.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2760f446dbf0afbf1444053a484db0a271d9ee33e3fb55e0f914c209215baf9"}},{"ruleId":"D2","level":"warning","message":{"text":"RunFence::acquire_restartable (cognitive 20): RunFence::acquire_restartable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba34f6273987f8d826b8231ce372fcb0cd73fdd350ad6a1fb946d72aed434925"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_process::windows::resume_process_threads (cognitive 20): webcodex_process::windows::resume_process_threads has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/windows.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffae1ef7124e534d94383e83272f11d104254b3e92c5e29806405a4e2f9416fd"}},{"ruleId":"D2","level":"warning","message":{"text":"JobManager::stop (cognitive 20): JobManager::stop has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/shutdown.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f08030eeea9a08c50e2f23c20d0526deacaed736406988ddd7f728d356a79b3"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::computer_session::platform::macos::run_helper (cognitive 20): webcodex_runner::webcodex_runner::computer_session::platform::macos::run_helper has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/computer_session/platform.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f4d67129ff65d9241207994c5c752b5bc170c4829a2a16475186dcb2777698"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::config::load_config_with_server_url (cognitive 20): webcodex_runner::webcodex_runner::config::load_config_with_server_url has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ceb69614296ddece654f1987a387d6322cfe9e2f25ffa52a98025622da123b4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::config::validate_plugin_config (cognitive 20): webcodex_runner::webcodex_runner::config::validate_plugin_config has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9208ce8f06408fb515e49a01cf6bf10edc0e2d4f8e7e53b7481aabce64f0c78e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::shell::preparation::run_prepare_command (cognitive 20): webcodex_runner::webcodex_runner::shell::preparation::run_prepare_command has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 3 (7 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/preparation.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83ae558fe2a038f81d9c2fd2e45dc1e9d7fec08b2a239d146f1766a097be681"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerRegistry::select_projects_for_auth (cognitive 20): RunnerRegistry::select_projects_for_auth has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/project_selection.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0294ba414a946806a749e0c1da18084a7c058e9858026611279325888a6e57ce"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::consume_agent_wake_with_now (cognitive 20): Database::consume_agent_wake_with_now has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"486136efbdf61d64b801155373250081112c696db914419d29502a5b13111bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::update_goal_at (cognitive 20): Database::update_goal_at has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0a7bc77af0ac7c62ef59f353b3639410ed535fabf18c6783d5cdc938ab20a7"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionStore::resolve_ack_ref (cognitive 20): SessionStore::resolve_ack_ref has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/messages.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e041e663db471897bffdf4c83727b9392fd2b6f5566f4fe02f84e24e37883df2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_recipe::project_cargo_all_packages_provenance_inner (cognitive 20): webcodex_workspace::project_recipe::project_cargo_all_packages_provenance_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 6 (10 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80fef73fd22d2c95e7e5f19eabf6cade2fdc5f184b60c201085b42b8dff3fe8"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_recipe::add_path_dependency_witnesses (cognitive 20): webcodex_workspace::project_recipe::add_path_dependency_witnesses has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"0460098d13c62900ae42baceb3c1ee325d4b57867474dc9f9504da61bddb7a3d"}},{"ruleId":"D2","level":"warning","message":{"text":"ClientIngressGate::handle (cognitive 20): ClientIngressGate::handle has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/public_ingress_auth.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"918ac122e7f388a48161c60b3e7840ca7bebe86c61420f9ffb9dde7bfed3092c"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::git_commit_paths (cognitive 20): ToolRuntime::git_commit_paths has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 5 (6 pts), boolean chains 2 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/mutations.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcfd2f178cfdda6b1661a73313026955f164cde3d8ea1ada0001f3ffda631fc"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::add_peer_collaboration_projection_until (cognitive 20): ToolRuntime::add_peer_collaboration_projection_until has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 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":"src/tool_runtime/peer_collaboration.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadd4df0b47db3dd8660fd483c5efc3954c5d1db8108afc1218b25ff99db63d4"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::resolve_workspace (cognitive 20): ToolRuntime::resolve_workspace has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/projects/maintenance.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"764773e32c274ad7fe51d1ee7120d0e66df3615b8fc9e72eb50cf79a568a6864"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::project_validate (cognitive 20): ToolRuntime::project_validate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, match/switch 6, 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":"src/tool_runtime/validation.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ae3412d2186ab89b6538716853b6bbb51ea17de2799c9c19bd4adeb314ec82"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::post_window_operator_message_with_options_for_principal (cognitive 20): ToolRuntime::post_window_operator_message_with_options_for_principal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/window_collaboration.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ba0532abc042261dee0611582644ef921040a93b3df66153802d50f83c5d44"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionShellRegistry::apply_result (cognitive 20): SessionShellRegistry::apply_result has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_shell.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"0608b7838ae60a7bce59d7038f8593da2ff4e8b24400ebeaad86a3416a2cc8af"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::auth::scopes::enforce_route_scope (cognitive 20): webcodex::auth::scopes::enforce_route_scope has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/scopes.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"391979589c41b91fd2cf525be88c2edfa835e6e476c0e3588f4450b3a6db34dd"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::text::compact::execution (cognitive 20): webcodex::mcp::cli::text::compact::execution has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, 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":"src/mcp/cli/text/compact.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"997aa67aeba7f141780c6e36b038ee9b4a88f759414f6af18673232974cf8967"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::presentation::git::show_changes_diff_hunks_for_path (cognitive 20): webcodex::mcp::presentation::git::show_changes_diff_hunks_for_path has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 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":"src/mcp/presentation/git.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a1d88e9adeb9b7fcc6a137ec387d075dbcfa1ebdbddc46718310e377fc3769"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::tools::mcp_host_file_import_trust_decision_from_state (cognitive 20): webcodex::mcp::tools::mcp_host_file_import_trust_decision_from_state has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.rs"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedf5ced1ab458a6ac66ea539caea0c9067e79e44ce17ed33a2ebf895a6795dd"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::plugin_gateway::call_plugin (cognitive 20): webcodex::plugin_gateway::call_plugin has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugin_gateway.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d6825b955075b097d614de4367da5a1f6f3a825bb6d84a0b6f01f04ec4e4f8"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::git_review::parse_numstat (cognitive 20): webcodex::tool_runtime::git_review::parse_numstat has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git_review.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b2e4d8da843fcf24368a04e27fcbe0f8f7df11b348ec9a0c6ccc3fe38957ba"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::search_and_read::project_compound_matches (cognitive 20): webcodex::tool_runtime::search_and_read::project_compound_matches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/search_and_read.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bade5c79119e27a0b19415ecd877ee0b81eb4dadd3ef6e1e252395de1724929"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::startup_brief::workspace_projection (cognitive 20): webcodex::tool_runtime::startup_brief::workspace_projection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, 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":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e5973cb4fdbdf6fc7444afcc1c6b51fb84ed2ca48c182e682912ad8b7fad26"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::startup_brief::startup_verdict (cognitive 20): webcodex::tool_runtime::startup_brief::startup_verdict has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17 (19 pts), loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"e268eb2e82cb2b7fbfca2b767bf74fea31d35293a314b7c2e8143cff9feface3"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserRuntimeStatus.BrowserRuntimeStatus (cognitive 20): BrowserRuntimeStatus.BrowserRuntimeStatus has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (9 pts), boolean chains 6, if/else 5 (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 8 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":"apps/desktop/src/features/dashboard/BrowserRuntimeStatus.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8534c1a55124ac5bb2f010ffbc4fb95c27cdd61ad65669550fcc4b9ea48475bf"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalServicesPanel.LocalServiceControls (cognitive 20): LocalServicesPanel.LocalServiceControls has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (5 pts), ternaries 3, error handling 1 (nesting depth added 1). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (act, a function literal at line 36, a function literal at line 36). 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":"apps/desktop/src/features/settings/LocalServicesPanel.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a4ea4c4ea3bd4c774a48193b9bba59ac72a19f7037f0a398dcbe35cd612c68"}},{"ruleId":"D2","level":"warning","message":{"text":"l._abortOperatorList (cognitive 20): l._abortOperatorList has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"b635bdfa2db606f45447431ff00419312492dc08fdcf85a6410918a0ad788801"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.loadList (cognitive 20): mcp_workbench_app.html.loadList has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts), ternaries 2, error handling 1, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62bec8066b9ab3ff36c08af221c87887a4249bf5e420682aae1ae9e91145613"}},{"ruleId":"D2","level":"warning","message":{"text":"chooseMonth (cognitive 20): chooseMonth has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 12 function items inside it that branch (a function literal at line 172, a function literal at line 153, a function literal at line 158, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/widgets/date.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7539ce60ec7052af511ead2442b83bff1fe7ded00dc67cec40c1239c963e1435"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessSupervisor::stop_until (cognitive 19): ProcessSupervisor::stop_until has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 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":"apps/desktop/src-tauri/src/process/supervisor.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"597331c534ff1ca45881d8048da0356839b563ae4280017aa44c23fe92590113"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::mcp_providers::validate_profile (cognitive 19): webcodex_desktop::mcp_providers::validate_profile has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 8, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/mcp_providers.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"59aaadf735be1ff1ad943d0ff7b0ef2c6449c3250730b88dc66d3bd93a99684e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::state::environment::config_fingerprint (cognitive 19): webcodex_desktop::state::environment::config_fingerprint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"898d691be66cef46a34c0a7c96110a2b89ad4b570e57ec9867859f9e5e2b067e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_browser::bridge::serve (cognitive 19): webcodex_browser::bridge::serve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/bridge.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc49f5d27bf90226bfd75f1fe13efd5efab4745cc8370622c463b71fbe0bdbe"}},{"ruleId":"D2","level":"warning","message":{"text":"Overview::key (cognitive 19): Overview::key has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_tui.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bc3399be9d230938a44821a4b85475f4755e92010068033a11543693ff0dbb"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::connect::disconnect::resolve_registration (cognitive 19): webcodex_cli::webcodex_cli::connect::disconnect::resolve_registration has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/disconnect.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec0808589021728b989a8acff5e2747fc795ba7d065e973f34fed6ec67e56df"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::connect::shared_key_oauth::finish_shared_key_oauth_connect (cognitive 19): webcodex_cli::webcodex_cli::connect::shared_key_oauth::finish_shared_key_oauth_connect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb88ccdb8be75396979f7fcd1f1c15f7596ca065226ea5039807c00423a16a43"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::login::run_login (cognitive 19): webcodex_cli::webcodex_cli::login::run_login has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 5 (8 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4739f24c0a5e12a3afc7158d1349d67e3777c32dad2712a707f0d98416274d5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_computer::platform::windows::accessibility::accessibility_tree_impl (cognitive 19): webcodex_computer::platform::windows::accessibility::accessibility_tree_impl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/accessibility.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77c41575c583c10c0cdcf445a2438a1ae79593af5f712521d2e2dcaf7116f27"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_computer::platform::windows::accessibility::element_state (cognitive 19): webcodex_computer::platform::windows::accessibility::element_state has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 6, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/accessibility.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa270aece032f44ebeb816704545c86f895e2fa4482618403346aac67f5b8291"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_computer::platform::windows::accessibility::activate_window (cognitive 19): webcodex_computer::platform::windows::accessibility::activate_window has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/accessibility.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"6874b44ee21fc7788a8e5c45b0e5dd9fdd07084fb0376372a47ae2e46d772fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateManager::install_locked (cognitive 19): UpdateManager::install_locked has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/install.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a858af782e45bc0239b386c7c82679e7e2151d210ff2c8ead2396e7b4666b4fa"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::inventory::entries::role_entries (cognitive 19): webcodex_environment::inventory::entries::role_entries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/inventory/entries.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d6354a1b9dbd4c3850a75248b5afec32267b955d8e60342fbe748b09ae02fa"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::inventory::paths::local_path_entry (cognitive 19): webcodex_environment::inventory::paths::local_path_entry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/inventory/paths.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99e3086bbda4e5bf1c31f2e7a5ed53e939c62603341a01f0b730957f8706330"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::migration::copy_data_tree (cognitive 19): webcodex_environment::migration::copy_data_tree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76bc83858c9c7c5ff4db9b7c51926181a2b360e4fa546504d5dfbda6c499aec"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::native::validate_request_with_preserved_listen (cognitive 19): webcodex_environment::native::validate_request_with_preserved_listen has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"8825e53c1ccb6a83933e112666625dc0858470ca15b7cb77fb58ff25545d40d7"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::process::unix::capture (cognitive 19): webcodex_environment::process::unix::capture has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/process/unix.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db8a88b8866e9eb877142068652af494c463b273dda6debd01d30161e419dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::service::linux::uninstall (cognitive 19): webcodex_environment::service::linux::uninstall has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4f1c681a3d4e23c7dd51fc53542fa338c2494771304d47aa7d3710eb29b6c6"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerStatusCache::wait_for_quiescent_ok (cognitive 19): ServerStatusCache::wait_for_quiescent_ok has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f37844f0c21d2d4cc109083081ba8ebef79e72fa2b787b3aa92284443fdf5c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_lsp::navigation::normalize_call_hierarchy_calls (cognitive 19): webcodex_lsp::navigation::normalize_call_hierarchy_calls has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (9 pts), if/else 4 (7 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"617e2755cccd1e00f71aea166876472dfbfb867d0491ab2fe210dc3b20dfa941"}},{"ruleId":"D2","level":"warning","message":{"text":"CodingAgentManager::recover (cognitive 19): CodingAgentManager::recover has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/lifecycle.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed94667824ab35869ba7a2324fe761618d3b7204a88572635597da29c1f93243"}},{"ruleId":"D2","level":"warning","message":{"text":"JobManager::start_available_queued (cognitive 19): JobManager::start_available_queued has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabb08e268671f735eccd62bde88b88ff42f86d650075e416683c77aa3bb1992"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillStore::gc_expired_replays_locked_at (cognitive 19): SkillStore::gc_expired_replays_locked_at has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf84c636e7f76823c476421169e974de3f43eaafb2b07431f86674ed8cab05a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::computer_session::platform::windows::run_helper (cognitive 19): webcodex_runner::webcodex_runner::computer_session::platform::windows::run_helper has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/computer_session/platform/windows.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6c027fd079eb66a3ca99341de9ac80ec50fded12800ff1f93a9087e73df0e9"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_build::observe_python_artifacts (cognitive 19): webcodex_runner::webcodex_runner::project_build::observe_python_artifacts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed1735badca29347fa069aa250305c457281215fe21dbe5b92ecc1b9b4b923a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::project_format::plan (cognitive 19): webcodex_runner::webcodex_runner::project_format::plan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, match/switch 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_format.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdfd72bf6d75f72ec197b4d4060ce7549518846bfaa9fa8548d5208290577bb"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::projects::catalog::run_git_bounded_with_program (cognitive 19): webcodex_runner::webcodex_runner::projects::catalog::run_git_bounded_with_program has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f30a6129ad890be1fb9692507da0f797c8b642240307fb28ad3ddb61dd9f8b3"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerRegistry::enqueue_project_file_mutation (cognitive 19): RunnerRegistry::enqueue_project_file_mutation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d080c3a963055f67ee5c4735f2811eca005ffa01ebb9caf90eb2c559998cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::get_or_create_project_references (cognitive 19): Database::get_or_create_project_references has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/project_reference.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f425fb6e0b461b1699630482cd4e50842657d79671d6f599986c641e8883ff36"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::continuation::build_attempt_validation (cognitive 19): webcodex_workflow_session::continuation::build_attempt_validation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/continuation.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8dcb900b9509cd09e1e79bdff56c75658a6d3fd793659b051249243a75b1ca"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::continuation::build_suggested_next_actions (cognitive 19): webcodex_workflow_session::continuation::build_suggested_next_actions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 2 (7 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/continuation.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b35b81d659385b371790c6226d8a24daf40c270dab60a50b06f3834de5033e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::events::validation_output_summary_for_tool_result (cognitive 19): webcodex_workflow_session::events::validation_output_summary_for_tool_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f71b441b1709c11906e8f0fa28b419fdad6ce94f75239200fb00f7d2eea7f58"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_overview::classify_key_file (cognitive 19): webcodex_workspace::project_overview::classify_key_file has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (9 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_overview.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"779c4a7726f0f790291ec807477a1ee4ccd2cf31677871558610e44091d19097"}},{"ruleId":"D2","level":"warning","message":{"text":"JobAttentionCursor::project_result (cognitive 19): JobAttentionCursor::project_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/job_attention.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4707f12f211432eeab0cd5a785ae488f821f4b076fc4e2e3b11363c43518c9bc"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::list_project_files (cognitive 19): ToolRuntime::list_project_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 5 (7 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/inspection.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b2969ead76a1a2cc5a2d08720e5c9b0e83e7b044a9cdbf8168751c24979b9e"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::open_session_shell (cognitive 19): ToolRuntime::open_session_shell has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (10 pts), if/else 5 (9 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_shell.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3165a9fbe7a71f8ca2c092413b8bb2fcd57fc5d97c4e34d4fc8ee27347538a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::run_skill_resource (cognitive 19): ToolRuntime::run_skill_resource has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/skills.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b93e60ca2c68eadba10c3658c650361233661c69bb7a86a20729d365a0d0dd"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::exact_work_result (cognitive 19): ToolRuntime::exact_work_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/work_result.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a40f377bf128c6163b06bc2b89723c50ec189ae5b1886e7abcb22a4e44c2a7"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::text::render_search_batch (cognitive 19): webcodex::mcp::cli::text::render_search_batch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89e26658aecd6f3654a7dc4a5e527f3dbd04a5937572d01e7fff86b6d5c6bb8"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::discovery::compact_input_descriptions (cognitive 19): webcodex::mcp::discovery::compact_input_descriptions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (9 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":"src/mcp/discovery.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8420402839a2faf0efe9f3535b9dd694623ba1ec5bbbc0927fc9be652d770129"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::http_metadata::validate_http_protocol (cognitive 19): webcodex::mcp::http_metadata::validate_http_protocol has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/http_metadata.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e604a78401a84549f09fe362c0ac072c272ec4597906e3e13be269b10f0f49"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::resources::mcp_native_image_tool_result (cognitive 19): webcodex::mcp::resources::mcp_native_image_tool_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 3, 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":"src/mcp/resources.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4e49338d3810b90a7db1c57567bcdcb6dd2372bf27992031b1e6a6274d9a91"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::tools::call::search_mentions (cognitive 19): webcodex::mcp::tools::call::search_mentions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"540bb9229ee71b1fdc9e19088b87e364f1db3f705ab03165ef045c521c4185c9"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::oauth_http::shared_key_bridge::validate_bridge_authorize_request (cognitive 19): webcodex::oauth_http::shared_key_bridge::validate_bridge_authorize_request has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8, boolean chains 7, match/switch 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":"src/oauth_http/shared_key_bridge.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2a9fe7e0bd7e5db1bf4d83f446344a13b0d7aad94e811e8c8fe4feaed3b248"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::project_entry_setup::setup (cognitive 19): webcodex::project_entry_setup::setup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_setup.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72f01bfa5c3a6a998f5991b176927b219f9f050f114b9d4adeabe2d5a11a4fe"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::server_shutdown::serve_with_ingress (cognitive 19): webcodex::server_shutdown::serve_with_ingress has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (6 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server_shutdown.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd1006731a52d3fe2e1682a736d8c38f04ac3ef9b9bcd9a6d38faf238e14ad5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_request_trace::reader::read_trace (cognitive 19): webcodex::tool_request_trace::reader::read_trace has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 1, loops 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":"src/tool_request_trace/reader.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada4cc714b99a9ae40e528be50fbec63035cd7dabebcebdb67c22f24e8577f1d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::changes::parse_workspace_freeze (cognitive 19): webcodex::tool_runtime::changes::parse_workspace_freeze 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":"src/tool_runtime/changes.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f000cdc4a8d824f2243d666c34761b92cfbf0e6e147c3b7d503141bc19d435d2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::checkpoint::normalize_validation_input (cognitive 19): webcodex::tool_runtime::checkpoint::normalize_validation_input has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/checkpoint.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e37aefd46632436be433df25b75869ea072581e3edc8fe711d496e24bac7fd"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::checkpoint::checkpoint_file_list (cognitive 19): webcodex::tool_runtime::checkpoint::checkpoint_file_list has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 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":"src/tool_runtime/checkpoint.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c9a1ff222f068f0846fc083ed9e8c2942d50143f5124cd255ae6ac8e80d4f7"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::computer_tools::accessibility::validate_accessibility_node (cognitive 19): webcodex::tool_runtime::computer_tools::accessibility::validate_accessibility_node has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, match/switch 2 (3 pts), loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/accessibility.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"00320c1f8b4298046577dbcdbca0fd1f0b49f43f98f7fe064d1e18ea19347c04"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::execution_control::job_control (cognitive 19): webcodex::tool_runtime::execution_control::job_control has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, 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":"src/tool_runtime/execution_control.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed2b4bb0d3c9b2fb5dc7e4d111dbc48544684bc436ee56a474426e67f30d711"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::hygiene::parse_hygiene_diagnostic_stdout (cognitive 19): webcodex::tool_runtime::hygiene::parse_hygiene_diagnostic_stdout has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 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":"src/tool_runtime/hygiene.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1abd685de0c7e419601b0302549cd16e5b811d85e9655855e627325abd65b9"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::read_files::add_actionable_read_continuations (cognitive 19): webcodex::tool_runtime::read_files::add_actionable_read_continuations has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 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":"src/tool_runtime/read_files.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2538945e41708fb75a40ad2314d9f4a5d5fcfd401fa084fc70c8463c5f44d2dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Adapter.document (cognitive 19): Adapter.document has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 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":"integrations/model_gateway/adapter.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd8ec5124de8826155f83f873b856664f5194e20c21095ddb8ff49074ba7976"}},{"ruleId":"D2","level":"warning","message":{"text":"PowerShellInstallGuidance.PowerShellGuidanceControls (cognitive 19): PowerShellInstallGuidance.PowerShellGuidanceControls has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 3, error handling 2 (nesting depth added 2). 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 (recheck, openGuide). 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":"apps/desktop/src/features/settings/PowerShellInstallGuidance.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acfbadb273ac2606b7ccf130df8dc36baa40392a0e88bec556276477e7f910d"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudflareConnectionCard.OAuthHandoff (cognitive 19): CloudflareConnectionCard.OAuthHandoff has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (5 pts), ternaries 2 (3 pts), error handling 1 (nesting depth added 2). Of this number, 13 points are the body\u0027s own statements and 6 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":"apps/desktop/src/features/connection/CloudflareConnectionCard.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c7112cce8f43bc459d0804c2f4de1a3f963103f7c519be803bd549729bb064"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimePanel.BinaryFacts (cognitive 19): RuntimePanel.BinaryFacts has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 16, ternaries 2 (3 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/settings/RuntimePanel.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b683927b048f0bfedf63000b304d7e49b8bab058191af0e491541764b1042b"}},{"ruleId":"D2","level":"warning","message":{"text":"TunnelConfigDiagnostics.TunnelConfigDiagnostics (cognitive 19): TunnelConfigDiagnostics.TunnelConfigDiagnostics has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, ternaries 5 (6 pts), error handling 2 (3 pts), if/else 1 (nesting depth added 2). Of this number, 13 points are the body\u0027s own statements and 6 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":"apps/desktop/src/features/connection/TunnelConfigDiagnostics.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b755efa0ffd0d1724f28b80bfe7b6c31c5cebca94e04c738f182832d028b6f"}},{"ruleId":"D2","level":"warning","message":{"text":"set_value.default (cognitive 19): set_value.default has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, ternaries 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/set_value.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc20cb9cbdb4ef4092a672c039917ba82a65c3de95deb8f7947c3d4ce6568da"}},{"ruleId":"D2","level":"warning","message":{"text":"fill-batch.operation (cognitive 19): fill-batch.operation has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/campus-application/src/fill-batch.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aab9db5296965d7a3fe8155e13704cde7519b018c8a2d82efc4cfc8778863f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Dr.parseDrawingWrapper (cognitive 19): Dr.parseDrawingWrapper has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, ternaries 1 (4 pts), if/else 1 (3 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_docx_app.html"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b43979ca758bee3702ebb160ba96f947ff06be95d391dd25db85946be53b97"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_goal_plan_app.html.validActivity (cognitive 19): mcp_goal_plan_app.html.validActivity has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (8 pts), loops 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_goal_plan_app.html"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"769cb1d11e511a5e08d03330e29705acd54653d983dc508e5d9e58a17fc40f2c"}},{"ruleId":"D2","level":"warning","message":{"text":"l.getScaleForStroking (cognitive 19): l.getScaleForStroking 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"133b26f8da126100a4ecded841e4d6ffaa5f3963dea7e405a9a97d098b9c0655"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.openGoal (cognitive 19): mcp_workbench_app.html.openGoal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 8, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d1dcfc04c648bb0c9da7fb84ec9e4a5ac11a9ad80a50261258cabbf4b6d528"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.useSelectedContext (cognitive 19): mcp_workbench_app.html.useSelectedContext has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 6, ternaries 2. Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1017, 1033). 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":"src/mcp_workbench_app.html"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b1b694e2cfc1c8998f186d271de02af07dcd495159e02e27ffe2db3af805dc"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 19): (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, ternaries 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/set_value.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee406d9726e10856b809c326b4411895bd838f301d2ed95b531cb759771b0c09"}},{"ruleId":"D2","level":"warning","message":{"text":"Controller.Run (cognitive 18): Controller.Run has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/windows_controller.cs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b18b53453a470ae46d3acd67243599ba36f6eb0825cd0ad12bb868b29dbd23"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::state::connections::persistent_runtime_projection (cognitive 18): webcodex_desktop::state::connections::persistent_runtime_projection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/connections.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f4417b58b9a6cefb6257e24e68821a1a3bc2bda1a133a65933fa9478b44815"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::updates::install::native::launch_windows (cognitive 18): webcodex_desktop::updates::install::native::launch_windows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 5 (6 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":"apps/desktop/src-tauri/src/updates/install/native.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4615244f3d501d767adae7217636c5750e9ebdd8e737af9eb28589ec600439"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::webcodex::settings::provider_preflight::preflight_providers (cognitive 18): webcodex_desktop::webcodex::settings::provider_preflight::preflight_providers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 5 (9 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/settings/provider_preflight.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eef3fb831adf299907a49c41a42cf5d29a82d38257025eef63412ee03bd78ab"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameReader::poll (cognitive 18): FrameReader::poll has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/bridge/protocol.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b18ac44aa293b898d157e4fe152c9cbcecb78c697fce0b744e7eb17293e2bb2"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserSupervisor::snapshot_query (cognitive 18): BrowserSupervisor::snapshot_query has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f9dfa4dbb19c3ca30f4029a9ce5709e667800f81e5d17dfbb13b52dd56d737"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_browser::cdp::clickable::safe_content (cognitive 18): webcodex_browser::cdp::clickable::safe_content has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/clickable.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfdb499ee0bfc4b810b5d4c42d6e18554f363c721870df77bce7cac30aae07e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::connect::profile::recover_key_for_project (cognitive 18): webcodex_cli::webcodex_cli::connect::profile::recover_key_for_project has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a02b1f1086d60d09aa1a6373619b48ecc2041180f21c0cb44529d127441724"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::ops::fetch_projects (cognitive 18): webcodex_cli::webcodex_cli::ops::fetch_projects has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/ops.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5231a90857fa02cbc0e87b4c1ab4e9917a44862c109dae4a8d36a0e5287a2dd"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::service::pair_rollback (cognitive 18): webcodex_cli::webcodex_cli::service::pair_rollback has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4, match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"122d11b411c8e897fa36903fa36aa10b53e3bba6ec6385794f698d9ca3f2f444"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionExecutionContext::validated (cognitive 18): SessionExecutionContext::validated has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/workflow_session_contract.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a52cbd55eae49e63db9a6c49089ff491aea5dc37410609a9676762689c638a2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::lsp_bridge::redact_absolute_paths (cognitive 18): webcodex_core::lsp_bridge::redact_absolute_paths has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, loops 2 (4 pts), if/else 1 (2 pts) (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 3 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":"crates/webcodex-core/src/lsp_bridge.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fd99ce9752efa92bcb7a7184daeaf72fcdf6a2ce9743af04fad1ce49de3a97"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEnvironment::complete_upgrade_finish (cognitive 18): NativeEnvironment::complete_upgrade_finish has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"1950ac035c931d4c987dc22a2a65000a821d40f219b60ae8225113a261249342"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::installer_unix::authorized_response (cognitive 18): webcodex_environment::installer_unix::authorized_response has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/installer_unix.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a55236d8d047318c0a3fef5df76fa20730c9120ce556cc3f77d46fa64c4f98"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::privilege::run_privileged_service_request (cognitive 18): webcodex_environment::privilege::run_privileged_service_request has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d370472a5a79c609238681a961e5e1db95e1a82f354586ff281ce22196d3fe5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::unified_update::network::verify_checksums (cognitive 18): webcodex_environment::unified_update::network::verify_checksums has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/network.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a540f18a642d108fbe30c79dac5a0ad25e3b9f740347dbddd37ad1a156fcf92"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::upgrade::verify_prepared_installation_for (cognitive 18): webcodex_environment::upgrade::verify_prepared_installation_for has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d7a9a9b6f4090d5749753bb07526bdb09e1c1de386135715f734cf6f1fae43"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::upgrade::desktop_tree::entries (cognitive 18): webcodex_environment::upgrade::desktop_tree::entries has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 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":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bdca958d19e75ef567ef18f08078aaa9ce471607b3ffab94183b22ce149173"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerInstance::shutdown_until (cognitive 18): ServerInstance::shutdown_until has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":2423}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f0210f078ba4e185af4e105f76e940e81547f50b23331e296a6b1df8d0cd5d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_lsp::fake_server::maybe_publish_diagnostics (cognitive 18): webcodex_lsp::fake_server::maybe_publish_diagnostics has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"60837b32dd3e4a704a3e8400445e7d136f460bd03481aa3e61cbf5547873cd24"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_process::program::resolve_program_in_path_with_pathext (cognitive 18): webcodex_process::program::resolve_program_in_path_with_pathext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/program.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a23e92d445109e398cf81bbd0e10623958841f90b60f5b90da913014fbd2c0"}},{"ruleId":"D2","level":"warning","message":{"text":"DurableRunStore::scan (cognitive 18): DurableRunStore::scan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29cde9c6ae8b4f947bcaf44cacdfd471af78b2459b131666ed2de433566bd9b"}},{"ruleId":"D2","level":"warning","message":{"text":"ShellExecutionContext::run_internal_posix_script_impl (cognitive 18): ShellExecutionContext::run_internal_posix_script_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/internal.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31218d8466797c6017851e4de3f15eb5f7c1061beed95bf1addf4fdf36fac34"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact_export_chunk (cognitive 18): webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact_export_chunk has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 9, if/else 7, boolean chains 2. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c72f096679f8266bd78f64f6227a19cea61f1f38fb9f9470a4233c69f4cc240"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::inspection::artifact_mime_from_file (cognitive 18): webcodex_runner::webcodex_runner::artifacts::inspection::artifact_mime_from_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a88a027dc4fa52aef6ca17159adf4ae81750858a4c585fc7f2f9430e2ca21c4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::detached_job::platform::unix::read_line_with_timeout (cognitive 18): webcodex_runner::webcodex_runner::detached_job::platform::unix::read_line_with_timeout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57be27b5d94356526fe080517fff1614d5940a9e849172c6c67393ee2dfdd2b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::detached_job::supervisor::spawn_output_reader (cognitive 18): webcodex_runner::webcodex_runner::detached_job::supervisor::spawn_output_reader has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/supervisor.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e22722e9ddfc3244b0cdd7bb67b830133fb6631c2c59c6f8a5289ba2d732b2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::output_text::decode_legacy_stream (cognitive 18): webcodex_runner::webcodex_runner::output_text::decode_legacy_stream has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/output_text.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b5aa3b18fe1a3941d217591b09c9d1c31cf4eccb694e48498a789bf1c5774c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::shell::scripts::select_script_interpreter (cognitive 18): webcodex_runner::webcodex_runner::shell::scripts::select_script_interpreter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3, boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27f157a6184b64de6ff3d2ed90cc02288c49c1e765263b161c8426bdc66ca78"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerRegistry::enqueue_run_with_ssh_typed (cognitive 18): RunnerRegistry::enqueue_run_with_ssh_typed has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (9 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc2dc8716e2b4a48068f885b636bc7b8b3294028d04004253631c0dff03b4e0"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::recover_expired_mcp_app_endpoint (cognitive 18): Database::recover_expired_mcp_app_endpoint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c02090277c040a42e6d1bd60820c80746ac10878211912962e587b2837a5ac5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_tool_contracts::registry::output_schemas::jobs::output_schema_for_tool (cognitive 18): webcodex_tool_contracts::registry::output_schemas::jobs::output_schema_for_tool has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (7 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae6180403db083fadbdce9d5ec476c96d84755691905d7504dfabe2de2c8024"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionStore::record_validation_job_terminal (cognitive 18): SessionStore::record_validation_job_terminal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, 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":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"42984f41e53e549407a91fbb2a37fb63bb86493068fc2b3d3fc4e1feac856a69"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::continuation::has_unclosed_mutating_call (cognitive 18): webcodex_workflow_session::continuation::has_unclosed_mutating_call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/continuation.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"911ff7550429b9ee1eb518716837575779b7446722cd3d8b1b3c9bc6fbc20fff"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::handoff_brief::project_validation (cognitive 18): webcodex_workflow_session::handoff_brief::project_validation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d49e155b48aa02b21b81e13f6cfe9d271e66d9b9e01613e4889ea691df0e210"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_context::git_fingerprint (cognitive 18): webcodex_workspace::project_context::git_fingerprint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, match/switch 3 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_context.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"3447444311b865e17f2ca294df1cf6c088db55fc6b4c78c0acd31020e4498caa"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::start_agent_task_coding_run (cognitive 18): ToolRuntime::start_agent_task_coding_run has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 8 (10 pts), if/else 5 (8 pts) (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/agent_task.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"0deea036735758739fda7fab9635b3c7056341db5531453dc5881264d3c88bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::dispatch_cargo_tool (cognitive 18): ToolRuntime::dispatch_cargo_tool has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/cargo_tools.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e23f3c95cc45f015480bc771d9b8fc3758e3786b93f54e113a6d024a36b1cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::project_cli_schema (cognitive 18): webcodex::mcp::cli::project_cli_schema has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"942b07e5b0b8b722ff97f0c097c393d21f39bf92cb5ffc3cb063079933faeaf0"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::cli::text::native::recovery (cognitive 18): webcodex::mcp::cli::text::native::recovery has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/native.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b316c1df36cab2b7d57bd9a81ae229fa1d503cd097b4726b1d8880b956c80f72"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::discovery::strip_schema_descriptions (cognitive 18): webcodex::mcp::discovery::strip_schema_descriptions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (9 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":"src/mcp/discovery.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"098a2da2bce617d277028be1ab35d2e8ca69359282ae552d255c8c3fa3c65164"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::execution_control::project_result (cognitive 18): webcodex::mcp::execution_control::project_result has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (4 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":"src/mcp/execution_control.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc324f494fcf6557550ace852b26a1bc69c6c3fe6b90099cda05c9f21eb988ca"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::resources::mcp_artifact_export_stream_transfer (cognitive 18): webcodex::mcp::resources::mcp_artifact_export_stream_transfer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/resources.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"49904a24d363de2d468121e39f4955f4f3277049ddd7f237277550b5d674ea84"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::tools::call::handle_call (cognitive 18): webcodex::mcp::tools::call::handle_call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3, boolean chains 1 (nesting depth added 8). 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":"src/mcp/tools/call.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6079a0fa4564fef524d50084304e8d3145f3e28087905946ccc8901162e430"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::runtime_console_http::goals::project_ids_for_goal (cognitive 18): webcodex::runtime_console_http::goals::project_ids_for_goal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime_console_http/goals.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"464a92ec3803a03a648d91f8922c8e9f75b14ecbab442fbdfc9a4f7b497cb574"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::runtime_console_http::window_inventory::live_for_auth (cognitive 18): webcodex::runtime_console_http::window_inventory::live_for_auth has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 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":"src/runtime_console_http/window_inventory.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"66077afe143c2c5cf8734b034d20d823d1fff90a3d71d7fa374a0c02007a497b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_request_trace::payload::parse_trace_payload_index (cognitive 18): webcodex::tool_request_trace::payload::parse_trace_payload_index has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 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":"src/tool_request_trace/payload.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7443e3e495c9d5e02b4df893efd2e753b2ecd0a40e7d25bac7041d89f206860"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::changes::parse_name_status_z (cognitive 18): webcodex::tool_runtime::changes::parse_name_status_z has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/changes.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea0c6bca8b789124f464094ba481c45445198dc207278817e4199e80e436444"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::files::inspection::parse_runner_file_read_range (cognitive 18): webcodex::tool_runtime::files::inspection::parse_runner_file_read_range has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/inspection.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"207f8f0974c63ba51cc6bbdd69d0357739124497415ca7397476134903537ce4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::git::diff_hunks::git_diff_hunks_page_command_for_source (cognitive 18): webcodex::tool_runtime::git::diff_hunks::git_diff_hunks_page_command_for_source has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b8c32a89e1e5b8741992c24b24ca87e686ad1105d0834a70e25b4a08da5132"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::git_review::parse_name_status (cognitive 18): webcodex::tool_runtime::git_review::parse_name_status has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git_review.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b926d72196eb379043554a26656e032946e6b0df2e2111c609a886cb1bcfe3"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::git_review::collect_symbol_hints (cognitive 18): webcodex::tool_runtime::git_review::collect_symbol_hints has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git_review.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"7569206bad7f7eba153d285305eb95780081e08f9f79c49e45db04a12480d414"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::search_project_texts::enforce_final_model_facing_hard_cap (cognitive 18): webcodex::tool_runtime::search_project_texts::enforce_final_model_facing_hard_cap has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/search_project_texts.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"11211a629793fa56b2ea92dc39df662715525ac98ab8491dcd163d44e186af9f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::work_result::work_result_workspace (cognitive 18): webcodex::tool_runtime::work_result::work_result_workspace has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, match/switch 2 (4 pts), boolean chains 3, loops 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/work_result.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b267babc19815e557e3aa1d74a594a3faa25969dab2e59e1aa94ba7c9f9056"}},{"ruleId":"D2","level":"warning","message":{"text":"Knowledge.source (cognitive 18): Knowledge.source has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, loops 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/project-knowledge/knowledge.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"55af8af4eb1f645b426a9930106d5edfad292e6f507a52dacd8f1e7011bc4620"}},{"ruleId":"D2","level":"warning","message":{"text":"McpProviderEditor.McpProviderEditor (cognitive 18): McpProviderEditor.McpProviderEditor has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, ternaries 4, if/else 3, error handling 2. Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 5 function items inside it that branch (submit, a function literal at line 28, a function literal at line 49, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/extensions/McpProviderEditor.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db342a8b0e7a7c897adad8fefefda6b79d11ab03c589773c5a753abc869d887"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionsPanel.ExtensionsPanel (cognitive 18): ExtensionsPanel.ExtensionsPanel has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 15, ternaries 2, if/else 1. Of this number, 15 points are the body\u0027s own statements and 3 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":"apps/desktop/src/features/extensions/ExtensionsPanel.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c602170352acf364b87c5850ea1ee3edbd99fdc936a90f91aa2ef4c5e959fe40"}},{"ruleId":"D2","level":"warning","message":{"text":"useRuntimeUpdates.useRuntimeUpdates.refreshLocal (cognitive 18): useRuntimeUpdates.useRuntimeUpdates.refreshLocal has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (5 pts), ternaries 3 (5 pts), error handling 1 (nesting depth added 3). Of this number, 11 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":"apps/desktop/src/hooks/useRuntimeUpdates.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"32695aa0b5999380f7f35cfd2b167f2ea7a047f65eba5e6c8c40e83a3a8f05b8"}},{"ruleId":"D2","level":"warning","message":{"text":"AddLocalProject.AddLocalProject (cognitive 18): AddLocalProject.AddLocalProject has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (7 pts), error handling 1 (nesting depth added 1). 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 items inside it that branch (run, a function literal at line 38, run::isCurrent, \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":"apps/desktop/src/features/projects/AddLocalProject.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab8be42d26a84c29c21bae583d48ebcd6804baffb1941c5fba54a0334cb118b"}},{"ruleId":"D2","level":"warning","message":{"text":"wrapper.resolveWindowsNpmCli (cognitive 18): wrapper.resolveWindowsNpmCli has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/webcodex/bin/wrapper.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe1ba36cc2e497d79b65b7694c7c67412fbc212c3edce7f15cf3e17cd2a4864"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_agent_continuation_app.html.maybeStartBinding (cognitive 18): mcp_agent_continuation_app.html.maybeStartBinding has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, 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":"src/mcp_agent_continuation_app.html"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12e1e93ea89823f5c4935c7faf85973ace131a9184c118544755560a14175ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Dr.parseDefaultProperties (cognitive 18): Dr.parseDefaultProperties has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 2 (6 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_docx_app.html"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1e66a2b2fdfb2dc1196a11090098af4cc6af1b811e12de2a68398acc2fc4c6"}},{"ruleId":"D2","level":"warning","message":{"text":"l.#ot (cognitive 18): l.#ot has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 pts), ternaries 1 (2 pts) (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a786e52560223925a1c33259dd4b8af5022ae89b28dac41dae6deb509c09627"}},{"ruleId":"D2","level":"warning","message":{"text":"ps.#P (cognitive 18): ps.#P has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"1503b9dc3b0964304781d0ab7797c96552ed6e08f002df5255d5372aa97370dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Ge.editorStats (cognitive 18): Ge.editorStats has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, loops 3 (4 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":"src/mcp_pdf_app.html"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b6b612730988f55b42316e876e2785c377ba6b0bcb44ee6d314a30b70fe113"}},{"ruleId":"D2","level":"warning","message":{"text":"l._createMaskCanvas (cognitive 18): l._createMaskCanvas has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 13, if/else 3 (4 pts), ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab7013ea40ebe98408f9502896c4cc6a36d2375c7d73031bb6ffe7ccacb310b"}},{"ruleId":"D2","level":"warning","message":{"text":"command (cognitive 18): command has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, error handling 2, other 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":"extensions/browser-bridge/worker.js"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d0252d8a188ab421371ab85f65c04c9be9730c2ece0e55f6e02cc693fb9a60"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopCore::persistent_tunnel_profile_action (cognitive 17): DesktopCore::persistent_tunnel_profile_action has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/connections.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34b9a97c3ca77fb4e3987b340624456c7b51c7c7a0ea2d60c5e00359e2570cb"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::diagnostics (cognitive 17): AppState::diagnostics has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/diagnostics.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a905a15e5074dc22382d3eb29b363e0446b5d66107b703c9e5556f6c4e2c2ff2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::state::environment::adopt_saved_environment (cognitive 17): webcodex_desktop::state::environment::adopt_saved_environment has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72c8eb6eebd7d9a48056c4b5f2afe69ae372d5773e7e8bc5952d000816ea648"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::state::path_inventory::append_legacy_locations (cognitive 17): webcodex_desktop::state::path_inventory::append_legacy_locations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/path_inventory.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9067f498291f363383800a6a89f1b094d3ede5a8c782865b66f5e75c3b36219"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::environment::cloudflare::control (cognitive 17): webcodex_cli::environment::cloudflare::control has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/cloudflare.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c854d40850e27d7e0b1e6da2bbcdfb3ca27447d6354d09ccf92dc0d32122de"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::controller::wait_runtime_status (cognitive 17): webcodex_cli::webcodex_cli::controller::wait_runtime_status has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (16 pts), 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":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a823742b8ea321a9a27760f007402c48970ede5402649d6056ac66f0071aa0e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::plugin::run_plugin_command (cognitive 17): webcodex_cli::webcodex_cli::plugin::run_plugin_command has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/plugin.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0d7bb08a0817141f35a90463cdf0e4b96f0fd4658699b7dd12e15f2b598092"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::plugin::validate_request (cognitive 17): webcodex_core::plugin::validate_request has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/plugin.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"51070e02df4a970e1b75dbe57efe7c82600634d7ba677d75626a9cd93dc4d04f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::project_instructions::build_instruction_file (cognitive 17): webcodex_core::project_instructions::build_instruction_file has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_instructions.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c90dce8ccdc539c2c776e8165e442911b074dba530a062b4b14df7c280671e6"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::runner_operation::encode_operation (cognitive 17): webcodex_core::runner_operation::encode_operation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"029beab353ca5db438a5c7759f9df1d84baff9777a4e90848d80dc114126b112"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEnvironment::control_service_for_environment (cognitive 17): NativeEnvironment::control_service_for_environment has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25e6e6f1d717d888c5f9298ac5cb1613a3155f322fdf75cecb69f9a68516f59"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::migration::validate_import (cognitive 17): webcodex_environment::migration::validate_import has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"0295c0e919af4eb877aab9d4a40418826e7900d3fed27202eb5561fc7289cac9"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::privilege::apply (cognitive 17): webcodex_environment::privilege::apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d45b65c81dd4210dda0aaa64f1ac346555748f6e4c6c1c05c27ef50e74ee25"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::runtime_entry::validate_windows_env_acl (cognitive 17): webcodex_environment::runtime_entry::validate_windows_env_acl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/runtime_entry.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f04e8a24531c822ba514b65eaa2b7b46d399b8dce8349b9ee5c67d410191dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::service::windows::install_inner (cognitive 17): webcodex_environment::service::windows::install_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/windows.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8de711550e634674c474ccef7f3e6036082d7ff3983bfe1bb5a99af29f65c79"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::upgrade::authorize_restore_destinations (cognitive 17): webcodex_environment::upgrade::authorize_restore_destinations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2709}}}],"partialFingerprints":{"codehealthFindingId/v1":"0261eda972571474ac529173857b2ab1ded379493aaf59eeba07e9c752f35fdf"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_lsp::navigation::normalize_document_symbols (cognitive 17): webcodex_lsp::navigation::normalize_document_symbols has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), 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":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddb83b50315aff0888609876a8fa5b23bde583860aa76b74b6281138ef00354"}},{"ruleId":"D2","level":"warning","message":{"text":"Sse::push (cognitive 17): Sse::push has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/mcp_http.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd32453ad23a61858ab84d3d51a373fc1b8729c514268796df99e813c8c2a990"}},{"ruleId":"D2","level":"warning","message":{"text":"CodingAgentManager::run_live_acp_probe (cognitive 17): CodingAgentManager::run_live_acp_probe has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 12, if/else 5. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/diagnose.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9990827e1833f9ffba8693841775551bea15ac72873d72850c84cd58e36216be"}},{"ruleId":"D2","level":"warning","message":{"text":"CodingAgentManager::handle (cognitive 17): CodingAgentManager::handle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 4 (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":"crates/webcodex-runner/src/webcodex_runner/coding_agent.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cf556542785ca81ff712b830b7f73cfb29e46b1f9a56ea7b83d66a5bfba9c4"}},{"ruleId":"D2","level":"warning","message":{"text":"CodingAgentManager::start (cognitive 17): CodingAgentManager::start has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5681a817efbafce49fc4515cf9d2d8a7b8cf30a60797379737a0be8e1522249"}},{"ruleId":"D2","level":"warning","message":{"text":"JobManager::enqueue (cognitive 17): JobManager::enqueue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"212b5a2272a98075f1e689abe13fc08cb22cc9d8a8de7bcf5e70eb0a12e35e7a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::detached_job::model::validate_launch_spec (cognitive 17): webcodex_runner::webcodex_runner::detached_job::model::validate_launch_spec has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/model.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a268923170b3f301a66486bb86cb6cfd6215f055df3114f08540b87f900172b"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::shell::process_tree::terminate_child_process_tree_until (cognitive 17): webcodex_runner::webcodex_runner::shell::process_tree::terminate_child_process_tree_until has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (7 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/process_tree.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"721d4241763c896da8668375b4644b356dcaa698adcf824765290dad0337dfdc"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::shell::run::run_shell_impl (cognitive 17): webcodex_runner::webcodex_runner::shell::run::run_shell_impl has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 3, boolean chains 1 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/run.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bf3f429ea7924838a3a2a7730d3c6218878e012878e6cd53222c474eb13c7f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::skill_store::prepare_archive (cognitive 17): webcodex_runner::webcodex_runner::skill_store::prepare_archive has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"b566d01531057866e52461139ba1cccc527bb096158b525902cd430aaa4e6470"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::console::build_overview (cognitive 17): webcodex_workflow_session::console::build_overview has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/console.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"541dbde86d5eae62f2dd48f829b519de3e9d7859e6136fa345fb71eefcb51342"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::continuation::build_attempt_exploration (cognitive 17): webcodex_workflow_session::continuation::build_attempt_exploration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 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":"crates/webcodex-workflow-session/src/continuation.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8de9ca8eb4650b5bc658d4328058bf0c1e6e1acfa561705b0461fd51240685a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::events::canonical_tool_call_finished_event_refs (cognitive 17): webcodex_workflow_session::events::canonical_tool_call_finished_event_refs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 1 (3 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":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a80e1464003d6566c5f6f50953a0d15e1194c4aaed40fdb0a8515d5b09b6fe"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::events::observed_paths_for_successful_result (cognitive 17): webcodex_workflow_session::events::observed_paths_for_successful_result has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 1 (5 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":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e4c65509b9dd023df3317afebd0d3dda75beeea9a447d564a0a5ad8ae2041f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::store::writer::writer_loop (cognitive 17): webcodex_workflow_session::store::writer::writer_loop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 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":"crates/webcodex-workflow-session/src/store/writer.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a7972b7cc4d57c1ddb837183cd7003e980e4505374fa8b8d890a1b0e9c481d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_recipe::rust_workspace_root (cognitive 17): webcodex_workspace::project_recipe::rust_workspace_root has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"337837a021339654c7b2efa2677835f373285d7f089d2b06e755a01ca5a7a876"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentContinuationController::recover_expired_mcp_app_endpoint (cognitive 17): AgentContinuationController::recover_expired_mcp_app_endpoint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent_wake.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd4e4662590a157c8860d5cbd040237345ab6c1e8de7c205b604d2d53d0cdf7"}},{"ruleId":"D2","level":"warning","message":{"text":"PatVerifier::verify_sync (cognitive 17): PatVerifier::verify_sync has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 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":"src/auth/tokens.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43222e6fc190de7f023f451d9a9cecbc03078b4c84d5184b8960f3f932071e1"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelErgonomicsCompletion::record_from_parts (cognitive 17): ModelErgonomicsCompletion::record_from_parts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (17 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, 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":"src/tool_runtime/model_ergonomics_telemetry.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"063cbb70c632c947da738437765440f95779c3834149638867257db6e1e07f75"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::work_on_project (cognitive 17): ToolRuntime::work_on_project has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_task/startup.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b4940e9096670eeb420d85b4aa018841ac0e8107152eb74cf8d20955e751b9"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::unregister_projects (cognitive 17): ToolRuntime::unregister_projects has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/projects/maintenance.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cd6d2271b66943629d448c37965f524e154a8fb22af95930b3faeabba0da77"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::prepare_managed_worktree (cognitive 17): ToolRuntime::prepare_managed_worktree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (5 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":"src/tool_runtime/projects.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e296f33be0fc118fc6e3221866cea069e679d417b686a187fbf040eabb046b5"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::load_runner_instruction_files (cognitive 17): ToolRuntime::load_runner_instruction_files has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 4, boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runner_instructions.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff2832bc622c6b450f7eaf1326c6537995ee850b8b85be5f49399f7de217017"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::run_script_with_contract_for_resource (cognitive 17): ToolRuntime::run_script_with_contract_for_resource has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7 (10 pts), if/else 6, boolean chains 1 (nesting depth added 3). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/script.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c26ea072d0332c944d142e5452d567c0845d7fcbf27b4700c2478d044f549e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::config::sanitize_quic_runtime_error (cognitive 17): webcodex::config::sanitize_quic_runtime_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8336af48043bb5f58ffcdee557f96666ea579c527241a18ec71f6f8f5ae051b5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::mcp::presentation::jobs::observe_jobs_presentation (cognitive 17): webcodex::mcp::presentation::jobs::observe_jobs_presentation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/presentation/jobs.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"b586f64feb077369e999088cb0dc2b08cae6309ccbcfeb80b7905d2ef4ce1be7"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::runtime_console_http::window_queries::console_window_event_visible_cached (cognitive 17): webcodex::runtime_console_http::window_queries::console_window_event_visible_cached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime_console_http/window_queries.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35d7ffd7f49110d90f06a1649e6fce78054b0f7ff9b82270669e0e02bbff66d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_request_trace::store::persist_payload_with_config (cognitive 17): webcodex::tool_request_trace::store::persist_payload_with_config has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), 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":"src/tool_request_trace/store.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"df65fa621fecc6785a75230c68bcabdfb444ba128552cfaea97bd9c237ee2f3a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::computer_tools::screens::validate_display_list (cognitive 17): webcodex::tool_runtime::computer_tools::screens::validate_display_list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/screens.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"330dcb16bf9c666f959d2b1b3eea1d3f3590270a03fbd3d5c0799f7f57b6dfdf"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::files::inspection::slice_covered_read_range (cognitive 17): webcodex::tool_runtime::files::inspection::slice_covered_read_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 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":"src/tool_runtime/files/inspection.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"933d281d62efd10b8010eb131eddac43ffe943c93108b693f1f304c547c0a0f5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::git::show_changes::enrich_show_changes_files_with_numstat (cognitive 17): webcodex::tool_runtime::git::show_changes::enrich_show_changes_files_with_numstat has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"64804865aa42fd7a20d8149b1398ef70d60c58738ee2b52ccc0ac9bbbe10655f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::process::classify_process_failure (cognitive 17): webcodex::tool_runtime::process::classify_process_failure has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/process.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c134cece84ae6b3fc538003a3ec1cda82c9d942036fc29c4b3e702baff6b954"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::result_projection::sparsify_failure_model_result_metadata (cognitive 17): webcodex::tool_runtime::result_projection::sparsify_failure_model_result_metadata has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/result_projection.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d260af47f226bea20f8cf572dc815e18d347a736b29cd9bc70b8f25cb80dfc2"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::result_projection::sparsify_search_output_for_model (cognitive 17): webcodex::tool_runtime::result_projection::sparsify_search_output_for_model has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, loops 2, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/result_projection.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04203ca8053c42fb79ebd5a15f15d3275dfcd891bceae8acc0fd1a0fc4bb8ad"}},{"ruleId":"D2","level":"warning","message":{"text":"experience_proposals.validate_candidate (cognitive 17): experience_proposals.validate_candidate has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 12, if/else 2, ternaries 1 (2 pts), loops 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/codex/experience_proposals.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f494ea2da0865411f6256922f21cb6babe906681ac71a0113635ea3d76912eaf"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerCapabilityAuthorization.AuthorizationFlow::authorize (cognitive 17): RunnerCapabilityAuthorization.AuthorizationFlow::authorize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/extensions/RunnerCapabilityAuthorization.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf057a3045cc50cf5f108b0b90404214807c0446e378ecfa5f0b9d9234027d8"}},{"ruleId":"D2","level":"warning","message":{"text":"wrapper.runNative (cognitive 17): wrapper.runNative has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), ternaries 3, loops 2 (nesting depth added 1). Of this number, 12 points are the body\u0027s own statements and 5 belong to 3 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":"npm/webcodex/bin/wrapper.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3239ff8e61206e622a90a4bbaebe06afbd2098603a618bac3a907bf88bc9f02e"}},{"ruleId":"D2","level":"warning","message":{"text":"fill-batch.createFillBatch (cognitive 17): fill-batch.createFillBatch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 3 (6 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":"plugins/campus-application/src/fill-batch.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67aeddcf5cd76d293c0a20afe7e52f96ad7360da16181df35007952038ef74e"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin.supportFor (cognitive 17): plugin.supportFor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, boolean chains 7, ternaries 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":"plugins/campus-application/src/plugin.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66b148f4c60f197cc839e31706a6968104d2fc64b13e5c54a6bb9160a0d41eb"}},{"ruleId":"D2","level":"warning","message":{"text":"context.mapAffectedPackages (cognitive 17): context.mapAffectedPackages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/repo-context/src/context.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"380c18cc721bf28035fada3686d1237423096d05d81d3733b6aab633db82c27f"}},{"ruleId":"D2","level":"warning","message":{"text":"domain.moveToFreedesktopTrash (cognitive 17): domain.moveToFreedesktopTrash has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, error handling 4 (5 pts), if/else 4 (5 pts), loops 1 (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":"plugins/safe-delete/domain.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"409c95cc7102a917e1e393d46fd629d5c9fa2009987427c4bf63cc804bc59d81"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_agent_continuation_app.html.bindSemanticFailure (cognitive 17): mcp_agent_continuation_app.html.bindSemanticFailure has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 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":"src/mcp_agent_continuation_app.html"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dab841ecf1da0cd339f250ba825f99378884870f0f2b9bccd851128e9bce30"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_agent_continuation_app.html.dispatchWake (cognitive 17): mcp_agent_continuation_app.html.dispatchWake has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (5 pts), ternaries 2 (5 pts), error handling 3 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_agent_continuation_app.html"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb7950ef4d08ea468a0cbbc621aa1d63c62e1d506ee0f44c254093eb92eadd7"}},{"ruleId":"D2","level":"warning","message":{"text":"l._createContainer (cognitive 17): l._createContainer has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 3 (4 pts), match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"53dcbdbfdf97fbe5574f8754cae20c06ec033bdb877170536e616122b924bfb5"}},{"ruleId":"D2","level":"warning","message":{"text":"l._getElementsByName (cognitive 17): l._getElementsByName has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 4, loops 2 (3 pts), ternaries 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f114d323fcbefc92d986e773950bd51ab03e002b283bd6aee846b8bad7c31c5"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_result_app.html.jobState (cognitive 17): mcp_result_app.html.jobState has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_result_app.html"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"6791e1a12b694f71afe327580e4869870c2118beab55abd55d1e4f4e3990c99b"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.loadProjects (cognitive 17): mcp_workbench_app.html.loadProjects has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), ternaries 2, error handling 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd893e27ce3549a785ca566566c556cc00c6eaa0a19d326f2ffe9354dd75e647"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.addReferenceNow (cognitive 17): mcp_workbench_app.html.addReferenceNow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d5176cb10bccd345fc388d69c34bf69096a7ce2c5cd1ff21d10d679c226221"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_workbench_app.html.acceptResult (cognitive 17): mcp_workbench_app.html.acceptResult has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, ternaries 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":"src/mcp_workbench_app.html"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36e16b8367aefc0465d9288f2d1c34c5784ecb4aecd4cdbd7a54231e8b1fb93"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopCore::start_quick_share (cognitive 16): DesktopCore::start_quick_share has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (7 pts), if/else 5, boolean chains 3, loops 1 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"259e0ab14053c67592d5911ea4c999924dbcdfce3f3b870bc551d0d86783eed4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::mcp_providers::validate_manifest (cognitive 16): webcodex_desktop::mcp_providers::validate_manifest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, loops 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/mcp_providers.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03c4fb10550875610d6f8e4bc4bf8729d816318d4f0d3bdecd3383b51d14f69"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::runtime_selection::probe_binary (cognitive 16): webcodex_desktop::runtime_selection::probe_binary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 5 (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":"apps/desktop/src-tauri/src/runtime_selection.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5bfa86c61afa59656bdcc072203269f088761c052324873d774c7dc006e4af"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::runtime_selection::probe (cognitive 16): webcodex_desktop::runtime_selection::probe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 3, boolean chains 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/runtime_selection.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb359525c76a127ae1bd8a7cf7aea07a6dddf2a2ef1e207ef1c43c833b120a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_desktop::tray::handle_menu_event (cognitive 16): webcodex_desktop::tray::handle_menu_event has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (6 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":"apps/desktop/src-tauri/src/tray.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"27526986962d567a6a1230843d0fd8c8a72df24b0eaa15283845decd95aa5c1d"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_browser::cdp::semantic_element_label (cognitive 16): webcodex_browser::cdp::semantic_element_label has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":3276}}}],"partialFingerprints":{"codehealthFindingId/v1":"13517c787f79d56d773439a0f2c1aea28b154540419d89b09713c9218959ed57"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::parse_logout (cognitive 16): webcodex_cli::parse_logout has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 4 (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":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b916dc28d819103e42d41f273aed76eb27eb75084736326964ca342e79f8bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::parse_runner_service_action (cognitive 16): webcodex_cli::parse_runner_service_action has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a24adf596dd703528e6f9bc77996093f300ffb68316438b167194f8dae4098"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::parse_cli_runner_init (cognitive 16): webcodex_cli::parse_cli_runner_init has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a94b2e82b0b104fee01764feb8a1d11999b53127e241f67bf60f97ad614db0c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::controller::run_controller (cognitive 16): webcodex_cli::webcodex_cli::controller::run_controller has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce176c7f97502c4d8003c7236bcc04d0a18dcd2555784f3c979edc12df357d9a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::plugin_init::parse_plugin_init (cognitive 16): webcodex_cli::webcodex_cli::plugin_init::parse_plugin_init has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/plugin_init.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ea1ce305b4b48095429accb51d2cfb2918f14739b10f6d39ae53ea72774f3f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::server::resolve_status_token (cognitive 16): webcodex_cli::webcodex_cli::server::resolve_status_token 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":"crates/webcodex-cli/src/webcodex_cli/server.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"534738cf938b2ded7b2f691a34b28fc8ef3aa56cb5281867a56c487f5e311325"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::server::run_server_status (cognitive 16): webcodex_cli::webcodex_cli::server::run_server_status has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (16 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/server.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"582bf30d56a5c7886c21f7bd5aff6d876ec4b44a2ae6aaea847f3f625a05d058"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_cli::webcodex_cli::service::preflight_unit_path (cognitive 16): webcodex_cli::webcodex_cli::service::preflight_unit_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"723a5c1df15b6c283f8654300421b4cdf1b0ad4a1300c2e14cea4b8d21713d8f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_computer::platform::macos::accessibility::accessibility_tree_impl (cognitive 16): webcodex_computer::platform::macos::accessibility::accessibility_tree_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 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":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9e8a783fe227348d49f69f2d11b725dea14ab01ab6d5d3c88c746536099b4f"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectFormatRequest::validate (cognitive 16): ProjectFormatRequest::validate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_format.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b6a46ca92ccdc2c2132d5fc686f8f9f6733aaa238f6ebae7c0f15c36109efe"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_core::plugin::validate_project_plugin_catalog (cognitive 16): webcodex_core::plugin::validate_project_plugin_catalog has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/plugin.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac4f04b4793ffc221c5fb99ee78faa244fe8c3c211af443f654d4376ee2d15a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_environment::tunnel::wait_tunnel_readiness (cognitive 16): webcodex_environment::tunnel::wait_tunnel_readiness has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e0c18f8314c2264d3111064c3fa5154bcb14e368b30c7dad2b4d0082b531c9"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_lsp::navigation::normalize_diagnostic (cognitive 16): webcodex_lsp::navigation::normalize_diagnostic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 3 (6 pts), loops 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"499db31082d9fa26df4d55560da9100b500d2e9fb9aae35e297337d41746dbb8"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_lsp::navigation::normalize_location_or_link (cognitive 16): webcodex_lsp::navigation::normalize_location_or_link has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad425e47cb8374d5ea59904cf9d08ef26505c57fe0eef617f6f490d87c7c953"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_lsp::protocol::read_message (cognitive 16): webcodex_lsp::protocol::read_message has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/protocol.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4514c600f1e92a47ba211413ae7b199a12dcf5bd8f23b851ad688b203d7610"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_process::unix::group_has_live_members (cognitive 16): webcodex_process::unix::group_has_live_members has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/unix.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c747baddb6bf2344a6be2576c1646b4b74ba393ff0b003cb8cf71430699940"}},{"ruleId":"D2","level":"warning","message":{"text":"JobManager::recover_detached_jobs (cognitive 16): JobManager::recover_detached_jobs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/detached.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"280c4ecf4aeb2817581ca78abc07339d91ec20cb4a7ffdc4ff70973924bdde6e"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::artifacts::observe_cargo_build_artifact (cognitive 16): webcodex_runner::webcodex_runner::artifacts::observe_cargo_build_artifact has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46cc8f0627f7cc6c00bb52c91dfa2127194a091cb8fec52a986f69871560229"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::job_manager::delivery::run_job_heartbeat_worker (cognitive 16): webcodex_runner::webcodex_runner::job_manager::delivery::run_job_heartbeat_worker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/delivery.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"21675ff2ad60b4bd1661a60153c97ef1477753a7e3bfaab1703b5792a5856904"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::projects::catalog::terminate_project_git_tree (cognitive 16): webcodex_runner::webcodex_runner::projects::catalog::terminate_project_git_tree has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 5 (7 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"12069f3541fddafcdb0d15a1b4334883a40ed05dc107e4fc44e33ba1e4c19251"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::shell::commands::configured_python_module_job_command (cognitive 16): webcodex_runner::webcodex_runner::shell::commands::configured_python_module_job_command has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/commands.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"403f846c67d712f17c0d3a0891c5921930bf8c707966c379cdc00918f95ca0cd"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner::webcodex_runner::validation::execute::terminate_validation_child (cognitive 16): webcodex_runner::webcodex_runner::validation::execute::terminate_validation_child has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 5 (7 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/execute.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0945d513a1d543251e71fcab8e2135d9f07e5e36272489ee63cd79f88d96089"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_runner_registry::reconciliation::validate_job_inventory_inner (cognitive 16): webcodex_runner_registry::reconciliation::validate_job_inventory_inner 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":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5e3fdcdc5ef276b46a5a822fb57e932f9ce7096f4b426f4dac72bf2cc30220"}},{"ruleId":"D2","level":"warning","message":{"text":"GoalPlan::checkpoint (cognitive 16): GoalPlan::checkpoint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal_plan.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc2ebf0a7b0bce08c858aae3399e8bb56c18f4670595e905ff42cdf8b54c492"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_validation::adapters::rust::cargo_test_plan (cognitive 16): webcodex_validation::adapters::rust::cargo_test_plan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 2 (4 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/adapters/rust.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc65184168613e351f0146409f69491ff172dd3d704ea72672df4e031e1fb6ac"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionStoreInner::post_message (cognitive 16): SessionStoreInner::post_message has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":2832}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0024ffdd84ade146a7e535cee51f1542629d392718aea6fd70aece942d5543"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::events::classify_error_message (cognitive 16): webcodex_workflow_session::events::classify_error_message has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"2693bda18e986f2c4009f434aef9081dd602fe38f75199d4ff0fd5cd183b74f6"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::events::sanitize_persisted_validation_output_summary (cognitive 16): webcodex_workflow_session::events::sanitize_persisted_validation_output_summary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d760d10f6dd978d8fde205aa2551b8cdf09df50e79a4ab6536e5bc7d04f63ec"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workflow_session::handoff_brief::bounded_path_list (cognitive 16): webcodex_workflow_session::handoff_brief::bounded_path_list has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"174d48ac9977262e03fa02f7e822fae08ef64234976addd4f2df5e1cb012ec18"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex_workspace::project_context::compare_project_context (cognitive 16): webcodex_workspace::project_context::compare_project_context has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (7 pts), loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_context.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac7ee86585eacb9576d7de9f390b59e6e1512ed13ca71394fad0b0ee1762c13"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlExecution::decorate_result (cognitive 16): ControlExecution::decorate_result has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 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":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b40ea5c49b4a1d3cd5ce0336f2b07f58708c2ae8c825f9561ec01cbace16a97"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::coding_agent_diagnose (cognitive 16): ToolRuntime::coding_agent_diagnose has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 5 (7 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":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b801d932ce177a64a42126de658e015b6524cfbabf684ea0238cc873e2fdae"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::dispatch_computer_control (cognitive 16): ToolRuntime::dispatch_computer_control has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 4, boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/post_observation.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c2b2725e86421ee26451e5dbe119bca3e3d9b514f75294184b72f571bdfede"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::external_observation_tool (cognitive 16): ToolRuntime::external_observation_tool has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 2, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/external_observations.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8859396b7a9c51c9891228753d16250e19e7651f4a53ce2f8e9062d52b6d027"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::list_project_tracked_files (cognitive 16): ToolRuntime::list_project_tracked_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 5, boolean chains 4 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/inspection.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aec6f9c06207114e3b60938d1881e121617d76ff24a6c0a47b6660ae5481bb0"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::run_detached_process_with_contract (cognitive 16): ToolRuntime::run_detached_process_with_contract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 6 (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":"src/tool_runtime/process.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0bb6961dbb848314831b88eabc333dd4ad0adce61ea872a95e7e9bcf0eaff7"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRuntime::govern_specialized_invocation_on_project (cognitive 16): ToolRuntime::govern_specialized_invocation_on_project has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 1 (2 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":"src/tool_runtime/specialized.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"9230d657aac5aed52758ace66e64ece5c554424d396d43915113900ca47ad62a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::oauth_http::token::handle_authorization_code_grant (cognitive 16): webcodex::oauth_http::token::handle_authorization_code_grant has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/token.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"04be8d97e4156ed7adf4c10ce646b2448132b6ca82975ec385a2b565bfe6f45a"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::project_entry_setup::canonicalize_with_missing_tail (cognitive 16): webcodex::project_entry_setup::canonicalize_with_missing_tail has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_setup.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d89cf4ace41db491c43daa2c34d8dfe5bad976369ac9d2b99aa1e0f833a629"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::project_entry_share::prepare_share_oauth_client (cognitive 16): webcodex::project_entry_share::prepare_share_oauth_client has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_share.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"853fea6d6c9029d9dc17080bbcd3539e9987af94ebc19b840ba48415dbf6df4c"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::runtime_console_http::workflow_session_detail_with_windows (cognitive 16): webcodex::runtime_console_http::workflow_session_detail_with_windows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime_console_http.rs"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"44486ce92b1d073bb58fd68115eb365dd7ce940301528d973734dbb03ff4b67f"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::computer_tools::screens::validate_application_list (cognitive 16): webcodex::tool_runtime::computer_tools::screens::validate_application_list has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, match/switch 2, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/screens.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bccb70a7cb94b18d721a92998a9e735f004ef12c1d26e3a18155e8a1cb851f5"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::computer_tools::snapshot_receipts::validate_display_snapshot (cognitive 16): webcodex::tool_runtime::computer_tools::snapshot_receipts::validate_display_snapshot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 6, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/snapshot_receipts.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1999700699e53a4ac97e2ba97b4b6401d4b4cec4dc7e5865995b4dc35c6686de"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::git::show_changes::parse_status_header (cognitive 16): webcodex::tool_runtime::git::show_changes::parse_status_header has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a679bce6a36e1f9fcad8342df963b738d95d3bf67c98fd3afe46baf8248fe4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::jobs::structured_validation_evidence (cognitive 16): webcodex::tool_runtime::jobs::structured_validation_evidence has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, 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":"src/tool_runtime/jobs.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b268a313a53283bc6f4114ccee09dfe1c673e4b78e72c66fde9e774f5e4bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::read_files::fit_truncated_batch_to_budget (cognitive 16): webcodex::tool_runtime::read_files::fit_truncated_batch_to_budget has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0e6813759f3d7efb4b9f3f750a2b8f0ac496f1ed5f0b69f5d46c67db2012d4"}},{"ruleId":"D2","level":"warning","message":{"text":"webcodex::tool_runtime::runtime_compatibility::compatibility_facts_against (cognitive 16): webcodex::tool_runtime::runtime_compatibility::compatibility_facts_against has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4, boolean chains 1, loops 1 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runtime_compatibility.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cee6fae2f41078593415af5cec9657f88d898fbb3c03f1a2a62b53990cb037"}},{"ruleId":"D2","level":"warning","message":{"text":"read_handoff._valid_goal_detail (cognitive 16): read_handoff._valid_goal_detail has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), loops 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/codex/read_handoff.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f53a05e2f3adc8eb8f2def38a7764242a72d8ed127b4e214898b265e8648ac"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin.serve (cognitive 16): plugin.serve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), boolean chains 2, 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":"plugins/project-knowledge/plugin.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3d46476dd2fab16bfc5a188d9e0bc9caf174899b4b15ca355598d96506ff3c"}},{"ruleId":"D2","level":"warning","message":{"text":"QuickShareSetup.QuickShareSetup (cognitive 16): QuickShareSetup.QuickShareSetup has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (7 pts), boolean chains 4, if/else 3, error handling 2 (nesting depth added 1). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 3 function items inside it that branch (chooseProject, run, a function literal at line 48). 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":"apps/desktop/src/features/onboarding/QuickShareSetup.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89c702c28671bf2fe22a158b01f1714895abf583a4a3a0f976d5c95b176c79f"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinuationFacts.ContinuationFacts (cognitive 16): ContinuationFacts.ContinuationFacts has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 8 (12 pts), boolean chains 3, if/else 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":"apps/desktop/src/features/activity/ContinuationFacts.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6052c674ac658748a753f16286a3790d0090c81e1f71b12607cba9b26a21e6"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowSessionDetail.WorkflowSessionDetail (cognitive 16): WorkflowSessionDetail.WorkflowSessionDetail has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 12, if/else 3, ternaries 1. Of this number, 11 points are the body\u0027s own statements and 5 belong to 5 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":"apps/desktop/src/features/activity/WorkflowSessionDetail.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c4d434eff9004f659331cdb249195814107b23681913bcb2315584543c8a6b"}},{"ruleId":"D2","level":"warning","message":{"text":"common.open (cognitive 16): common.open has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5 (nesting depth added 3). 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/widgets/common.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b1560808d810917246f65bf40dbc90d5b7a5ec652c94b530586fc02bb18e40"}},{"ruleId":"D2","level":"warning","message":{"text":"worker.consoleText (cognitive 16): worker.consoleText has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/browser-bridge/worker.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bd0627f38a924f4487d2806dac13aee1ea3705a9bafd099c7ba1e89408ef66"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserController.snapshot (cognitive 16): BrowserController.snapshot has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, if/else 4 (5 pts), ternaries 3 (4 pts), error handling 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/agent-browser/src/browser.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9488d01623e8f5523ef62c320a00d938b51a3002a8f0f0a41edd9551414a38b2"}},{"ruleId":"D2","level":"warning","message":{"text":"form-cache.resolveFormMappings (cognitive 16): form-cache.resolveFormMappings has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 3 (6 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":"plugins/campus-application/src/form-cache.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"b497aaa76f7b069d70a0cf2d6c131c0626770fc3b951955b1f96435ebf4d5889"}},{"ruleId":"D2","level":"warning","message":{"text":"domain.runTrashBackend (cognitive 16): domain.runTrashBackend has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 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":"plugins/safe-delete/domain.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"870f342468508f8fd14c8dc6afaa780c34fdc37d8a610ae0a60a16877b9b76d6"}},{"ruleId":"D2","level":"warning","message":{"text":"It.#f (cognitive 16): It.#f has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"9676e4fc96782a422d0aca01d31675d1343c7af6e9c34477ac7fe66a13a0794a"}},{"ruleId":"D2","level":"warning","message":{"text":"l.createPatternCanvas (cognitive 16): l.createPatternCanvas has cognitive complexity 16 (threshold 15). Drivers by points: loops 2 (5 pts), boolean chains 4, ternaries 2 (4 pts), if/else 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":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e91b2fd6b33d54fa6e292d450ab707bee4483c8120e28768da4f2179570088"}},{"ruleId":"D2","level":"warning","message":{"text":"Mi.render (cognitive 16): Mi.render has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, ternaries 3 (4 pts), if/else 1, loops 1 (nesting depth added 1). Of this number, 10 points are the body\u0027s own statements and 6 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb630943214e8526b062511b4c5748be51fb3494185f51d10530badc0a8a295"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ToolRuntime: TooManyMethods \u2014 522 methods, declared across 120 files: tool_runtime/communication.rs (29), tool_runtime/skills.rs (20), tool_runtime/agent_task.rs (18), tool_runtime/goal.rs (18), \u002B116 more file(s). The bar is 30 methods; this is 492 over it, 17.40\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runtime.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1faf70b51c3f7bb4c9b31ccb914b8db3121e2897df59697f30331190469545"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolCall.session_log_arguments: MethodTooLong \u2014 session_log_arguments runs 1679 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1579 over it, 16.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"127705d1c2ffe848e40137282bea11603f908fd925f113ae28717c614404d893"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Database: TooManyMethods \u2014 284 methods, declared across 35 files: agent_task/operations.rs (32), src/oauth.rs (32), src/communication.rs (24), src/accounts.rs (21), \u002B31 more file(s). The bar is 30 methods; this is 254 over it, 9.47\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/lib.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9284198c05630c4185a143e41ac353f64393af818866cdff9f2cfcc2113fc35"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::jobs::output_schema_for_tool: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::jobs::output_schema_for_tool runs 658 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 558 over it, 6.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acbf6e4d10f50f19579006ff69fe88683c339fca5c4450ea2c4867f196bfebb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cdp.rs: FileTooLong \u2014 2961 significant 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 2461 over it, 5.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":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4105e9ec2f8a878c87c004c7f99271137b79a72f9a86c2625a164013483b1d04"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::environment::run_inner: FunctionTooLong \u2014 webcodex_cli::environment::run_inner runs 576 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 476 over it, 5.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89cfff23bbef14ff08e2074ec791ba2af08a396f21ad2d97436030b3d6a3b4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::mcp::mcp_post: FunctionTooLong \u2014 webcodex::mcp::mcp_post runs 558 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 458 over it, 5.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":"src/mcp.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"7906e0e01023e870d89a980d0cd955f6e20e2ce008646cde91fcf7cb07d572d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/store.rs: FileTooLong \u2014 2767 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2267 over it, 5.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92055ebe29dc11568a15dff55ea481155a28bef96376a9380e1401e67ec54abe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RunnerRegistry: TooManyMethods \u2014 164 methods, declared across 13 files: src/requests.rs (44), src/job_updates.rs (42), src/runners.rs (38), src/maintenance.rs (10), \u002B9 more file(s). The bar is 30 methods; this is 134 over it, 5.47\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/registry.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c9081894d82e4869ddf2cfcb1a721725bfd2ac7310bb2a7a11dd6536c5fb31"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ToolCall: ClassTooLong \u2014 2168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods. The bar is 400 significant lines; this is 1768 over it, 5.42\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/canonical_enum.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafeaf83396cc7d09f16d4d246bd6b18e9fb71b09179bdfd0e26ac26b2de8ccf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/communication.rs: FileTooLong \u2014 2680 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: Database (397-2623). The bar is 500 significant lines; this is 2180 over it, 5.36\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a4876c750770abc67a96e61d6ba1c71431fd110c74029295eb3c7f48a547af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::projects::managed_worktree::handle_prepare_managed_worktree_operation: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::projects::managed_worktree::handle_prepare_managed_worktree_operation runs 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 416 over it, 5.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d5301afd247d2e340b562e820263ddcd25e0177af1d9554c1464a6dc642453"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_browser_tool: MethodTooLong \u2014 dispatch_browser_tool runs 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 411 over it, 5.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":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de88b4ef7771283cc02ed305cbdc3f12e0eea6b21692d6c5d8ce3caaaea8a33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/requests.rs: FileTooLong \u2014 2458 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 84% of them inside a single declaration: RunnerRegistry (568-3182). The bar is 500 significant lines; this is 1958 over it, 4.92\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b571ca79668ac2129a3f2e8fd083169786ec522ac5eed520a906537dc314a866"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/agent_wake.rs: FileTooLong \u2014 2404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1904 over it, 4.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e5c67c9dffbc5b77012d1f15a09b5ddb7700ce53761255b92ce0f07a2bf7a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/upgrade.rs: FileTooLong \u2014 2403 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 1903 over it, 4.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3e9b37da14d364bc93e26b275469ce861773f5154da3b36024d4d8c7115021"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.git_diff_page_for_source: MethodTooLong \u2014 git_diff_page_for_source runs 475 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 375 over it, 4.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":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35d70042eb7dbc764013c6151911f054175f8e4a55bdae4d6dc41bbf7352ec7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2314 significant 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 61 free functions. The bar is 500 significant lines; this is 1814 over it, 4.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ad55d6464bff4e09654eb2357ac2fad9afcdfa0390a3b6814a11bf9391d9be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_computer_request_for_instance: MethodTooLong \u2014 dispatch_computer_request_for_instance runs 458 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 358 over it, 4.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":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b907de631c4aa00d8670fa40190aad25583f6f1dc184487178841cc0d3f47b78"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodingAgentManager.run_turn: MethodTooLong \u2014 run_turn runs 442 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 342 over it, 4.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/run.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"73036e7c3e4bb4e7d01f0a2e28e7417bf7651277158e421782041c7930b63e93"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::sessions::output_schema_for_tool: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::sessions::output_schema_for_tool runs 442 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 342 over it, 4.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/sessions.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b4267481f712f8a8b40d0d66f926a68415c552e732355eba975071dadc0e5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/skills.rs: FileTooLong \u2014 2200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: ToolRuntime (284-2248). The bar is 500 significant lines; this is 1700 over it, 4.40\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/skills.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b42050914834e3a89c3541fb957e0f699dd81b064eb4a1984563e9200d345a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_call/canonical_enum.rs: FileTooLong \u2014 2174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: ToolCall (8-4108). The bar is 500 significant lines; this is 1674 over it, 4.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/canonical_enum.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c0dbc0dc0612f36b34c5910403959a7e06385d3fc0a6c5d62d6d610c71e975"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::run_server_with_shutdown: FunctionTooLong \u2014 webcodex::run_server_with_shutdown runs 431 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 331 over it, 4.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":"src/lib.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c4ad31df09db84445e917124eb60a43c7c697b9b71636834e3101c06457cec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.transfer_resolved_project_artifact: MethodTooLong \u2014 transfer_resolved_project_artifact runs 426 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 326 over it, 4.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":"src/tool_runtime/artifact_transfer.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe508a75947f19bfe10c49baa7951358ee6c4af8f6e6d76f61dfb1ab2eddad4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.govern_dispatch: MethodTooLong \u2014 govern_dispatch runs 414 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 314 over it, 4.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":"src/tool_runtime/dispatch/governance.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf7278b161c1aa9fc2101454be7f068d73ac1e1bd71251d15ea66ff9da06bd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime_console_http.rs: FileTooLong \u2014 1987 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 65 free functions. The bar is 500 significant lines; this is 1487 over it, 3.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime_console_http.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0524aa655ae1b0662662e74e2d58885c1ad7ba80feae5adc101d9cdceaa1ed98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: git/show_changes.rs: FileTooLong \u2014 1987 significant 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 1487 over it, 3.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f72a8e2d0094f59e06e455de667d6099317a4cc21252ab0e86a58cf3c5ba7f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionStore: ClassTooLong \u2014 1577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 76 methods, 3 blocks, lines 98-2262. The bar is 400 significant lines; this is 1177 over it, 3.94\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3965bb7e63bff53bab22a976952d0c68b851c1f6812b224012e10d49641e00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runner_operation.rs: FileTooLong \u2014 1960 significant 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 1460 over it, 3.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":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0d2fc6cb0d6447caa8bf1ea329f17b4aaa86d75e04de9e2084dca8a7471718"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::patches::handle_apply_text_edits_file_request: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::patches::handle_apply_text_edits_file_request runs 385 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 285 over it, 3.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec9ca33bff912cd2335a9fc1e7a5728e56dd674c205f88e97c5c1ae5a4b9f51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: git/diff_hunks.rs: FileTooLong \u2014 1922 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 1422 over it, 3.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7624c145b69b7d000260a58cbf5ec1f807f7112d78f9df32d8062f547d7165"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopCore.configure_local_setup: MethodTooLong \u2014 configure_local_setup runs 381 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 281 over it, 3.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":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"db59656d25d45ee1610b38bc2fcef815734be841c8defab03d60cdc49f521dde"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::fake_mcp_gateway::main: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::fake_mcp_gateway::main runs 378 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f525901533d426671a95b3ed826f0e224191e2b55aab62b9b4fcb74634b7ecb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/job_updates.rs: FileTooLong \u2014 1858 significant 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 72% of them inside a single declaration: RunnerRegistry (712-2491). The bar is 500 significant lines; this is 1358 over it, 3.72\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb4c189bfb8971df2a54a7aea692f89fc3d6113508d5c25b3efb44cfcadb5cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_core::runner_operation::decode_operation: FunctionTooLong \u2014 webcodex_core::runner_operation::decode_operation runs 370 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 270 over it, 3.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f311bfe4478ff7f26b6f396d24546b4de3ec4022418ee379119d517c197bf75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::dispatch::dispatch_request_with_outcome: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::dispatch::dispatch_request_with_outcome runs 369 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 269 over it, 3.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/dispatch.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d4969167c6dd4dfbe61188fd963cb61fb65d884bcdec5e4d397ffc466e60a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::discovery::output_schema_for_tool: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::discovery::output_schema_for_tool runs 369 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 269 over it, 3.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/discovery.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0593a5ae240ddfd02e2a18a8139b6f1b88d050af3118988cf4a72532df02ed6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/native.rs: FileTooLong \u2014 1840 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: NativeEnvironment (3 blocks, 22-1712). The bar is 500 significant lines; this is 1340 over it, 3.68\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e201efad7c1fbddb5e3587ef35e6822d9d42fb7a0649ecb7f3bbcb7fc5d2ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.finish_coding_task: MethodTooLong \u2014 finish_coding_task runs 365 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 265 over it, 3.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_task/closeout.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb3502a42dbe5df488db02c861e57c98db48e8ef47ff773fc139cd555a51336"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1822 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1322 over it, 3.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"598180ea47b551b8ba66354c0b693e25e576c598c0a7100f6474b105af7a021a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/coding_agent.rs: FileTooLong \u2014 1816 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 1316 over it, 3.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee44878e7788d35acdcc57e3db443520d1c0e0693a1406040d5c99ad9c08440"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/supervisor.rs: FileTooLong \u2014 1815 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1315 over it, 3.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4365c9cdeaffaaa704f3fe1a25b7edd1184dc0d942b68d570a103483e3bd785f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/patches.rs: FileTooLong \u2014 1811 significant 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 1311 over it, 3.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ecc99173c95edd3812981cb06cb3da58eadf6b3e769ef814a024a9ce3deca3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::testing::cargo_output_schema: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::testing::cargo_output_schema runs 353 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 253 over it, 3.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/testing.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"292f09b83659765825c3fe06404029af8b24199131faca2f5f965f957e6d64a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tool_audit.rs: FileTooLong \u2014 1757 significant 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 96% of them inside a single declaration: ToolCall (150-2024). The bar is 500 significant lines; this is 1257 over it, 3.51\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63afd329cbe901c3194a56a2d1202737a79b783cc8df59e089822d651ccd8a36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_cli/controller.rs: FileTooLong \u2014 1754 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 47 free functions. The bar is 500 significant lines; this is 1254 over it, 3.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7f4b42494edd3c6a9cc2b5f0520789ee1755a29acfebacab7e71430c5a3203"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.start_coding_workflow: MethodTooLong \u2014 start_coding_workflow runs 350 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 250 over it, 3.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":"src/tool_runtime/coding_task/startup.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbfef791195bdc553147512ba5b0b03b58cb1be0b99a943e71b044c67986f32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JobManager.start_prepared_shell_job: MethodTooLong \u2014 start_prepared_shell_job runs 342 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 242 over it, 3.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"22241a37e901568c15e41c7a819817538aabbef3fd4301faaffda29848e239eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AuthorizedDispatch.execute: MethodTooLong \u2014 execute runs 341 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 241 over it, 3.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":"src/tool_runtime/dispatch/routing.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"342cbd86be1e2d50a44158b2cbafa89ef40d2a7ed5f72aa3ab064e61d40ce805"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.post_conversation_message: MethodTooLong \u2014 post_conversation_message runs 337 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 237 over it, 3.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"526ced9d5bbcee6ba302807b4499c3c6953acb59dded7757a2686d12468c2718"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.init_tables: MethodTooLong \u2014 init_tables runs 337 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 237 over it, 3.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/schema.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f6f9f2cae8d4b33eee3724909dd8a8189d7a2becac387291896249332fa70f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.session_handoff_observation: MethodTooLong \u2014 session_handoff_observation runs 337 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 237 over it, 3.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":"src/tool_runtime/handoff.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4ba557fa5b4bbd7b63a9208c4e5a9c7369bf6281dcb83ffaf28cf11e75e6ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/navigation.rs: FileTooLong \u2014 1681 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 53 free functions. The bar is 500 significant lines; this is 1181 over it, 3.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da270d63e69e0cf22681226a0b09993e8544002afe8b5c5046f44dd235ae496"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::git::output_schema_for_tool: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::git::output_schema_for_tool runs 335 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 235 over it, 3.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/git.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"86361f9508b176c195600542557d3a797c55dc1cd1472faab3116b31039ebdf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/skill_store.rs: FileTooLong \u2014 1651 significant 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: SkillStore (152-1587). The bar is 500 significant lines; this is 1151 over it, 3.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1e32aac5973b9e81829be46030b6218888b3614e1b870238b7b75fd3a756f2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_browser_request: MethodTooLong \u2014 dispatch_browser_request runs 329 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 229 over it, 3.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":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec2b88f2a983ce8772ec869aff33bf930dad9c3190426f6b61dfbfd04debe94"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::jobs::observe_jobs_output_schema: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::jobs::observe_jobs_output_schema runs 328 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 228 over it, 3.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"62af69cb1f261e8a76e8d5d58c11403810ae37ac7518c1a20192aaf543cd7e55"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/jobs.rs: FileTooLong \u2014 1623 significant 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 1123 over it, 3.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":"src/tool_runtime/jobs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a23fd3a365e51bb65176def1661a4067fb7bb2571d29caf84345d757b99afa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent_task/operations.rs: FileTooLong \u2014 1604 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: Database (1-2089). The bar is 500 significant lines; this is 1104 over it, 3.21\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/operations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e30674b13232f7b456532275d16b50b827c8ea9fe92bc77c0448b6647bb1aa1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_file_tool: MethodTooLong \u2014 dispatch_file_tool 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":"src/tool_runtime/file_tools.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20280635b14dddf35ff5f905e79ef4b6019f8ec925099a1a6d88ac2372dc595"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerRegistry.poll_checked: MethodTooLong \u2014 poll_checked runs 314 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 214 over it, 3.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/polling.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b8a443a0d58545e89c30a1d850884bada56ffb8784488862cce4c39329bd73"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeEnvironment: ClassTooLong \u2014 1255 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 59 methods, 3 blocks, lines 22-1712. The bar is 400 significant lines; this is 855 over it, 3.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"867a0f95d25881434d2a29e3168195e559722d9df418f796f4c68b1cdf325fbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runner_protocol.rs: FileTooLong \u2014 1536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1036 over it, 3.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b3c358bbc1fbba8e40233271faa0a11c3a897c54efa3357234c4995dce6622"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerRegistry.register_session: MethodTooLong \u2014 register_session runs 306 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 206 over it, 3.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"389084f4aea2a4f7970df1520aaa0ca25b6d6d1e9facc5a484ac39eb972b54ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::webcodex_cli::connect::oauth::run_oauth_connect: FunctionTooLong \u2014 webcodex_cli::webcodex_cli::connect::oauth::run_oauth_connect runs 301 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5865a780846ceaa372297230d5a95631fa29640e2c7876564ab1d1c172e04f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::computer::raw_output_schema_for_tool: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::computer::raw_output_schema_for_tool runs 301 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d099386295ac9facf819384c8af17f427e7832510314535a337cb0a413d141b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_workspace::project_overview::validate_project_overview: FunctionTooLong \u2014 webcodex_workspace::project_overview::validate_project_overview runs 300 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 200 over it, 3.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_overview.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c9a5cae5a09ca36779effc16f52ebd45c26d46b2e1c9812ed40116c587e936"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DesktopCore: ClassTooLong \u2014 1199 significant 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 1-1510. The bar is 400 significant lines; this is 799 over it, 3.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a2830d3adf431db4dbe473665256a6677e9e2c31bb6398dd980b45c6288ef6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/config.rs: FileTooLong \u2014 1497 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 57 free functions. The bar is 500 significant lines; this is 997 over it, 2.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedafa281ed90f429d2629ffbdc962e72fd6ed33bf08dd10bdd064c71ae4b796"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.read_goal_stall_continuity: MethodTooLong \u2014 read_goal_stall_continuity runs 299 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 199 over it, 2.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal_stall.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9924ede551f50849952df6ceb289015d941c9f7f3ed33c8480889275bc45eba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::projects::lifecycle::handle_project_operation: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::projects::lifecycle::handle_project_operation runs 298 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 198 over it, 2.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbc48fab4b0cf6caa2273505610d720d319f60cc19b4bb9897d8f328adcd658"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.apply_text_edits: MethodTooLong \u2014 apply_text_edits runs 297 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 197 over it, 2.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":"src/tool_runtime/files/mutations/text_edits.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f23c9f6a1b6f48581be22168e5e95bd7ffc48cb96be5ac998a5c174aaa2c34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tunnel.rs: FileTooLong \u2014 1482 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 982 over it, 2.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f2249dcf97577fe706cdbb6edde86eef525c035dfba623aec5bc9a97207a60"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::transport::polling::run_polling_session: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::transport::polling::run_polling_session runs 296 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 196 over it, 2.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/polling.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fe01b3c1a64cbfab6bf82b90dc57d15fe918fe1855807cc14261bf7b65235d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/agent_wake.rs: FileTooLong \u2014 1475 significant 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: AgentContinuationController (2 blocks, 262-1687). The bar is 500 significant lines; this is 975 over it, 2.95\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent_wake.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6059caaf594315e7fb5be6ca8f8feecf605ef82e6482f03404d100ee9c537dc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppState: TooManyMethods \u2014 88 methods, declared across 17 files: state/app_state.rs (27), state/updates.rs (12), state/workspace_settings.rs (6), state/runtime_shell.rs (5), \u002B13 more file(s). The bar is 30 methods; this is 58 over it, 2.93\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e783da07167bc71fa360786918807d577ae4ab86e139079f2e3da0c90a6aa37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: output_schemas/jobs.rs: FileTooLong \u2014 1456 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 956 over it, 2.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d3c648cdc2151645208de11a489b27404750b0c7498ab5b24052df867b64ee"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AgentContinuationController: ClassTooLong \u2014 1160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 2 blocks, lines 262-1687. The bar is 400 significant lines; this is 760 over it, 2.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent_wake.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa30677a17ba5f4a52e18dade468ca1a670f7500b567ded42675b89ce42dd4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/plugin.rs: FileTooLong \u2014 1449 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 949 over it, 2.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ea8b68d61d8f1ec6af00fc9c5dee3e33eae799bf3b70f6d76975a4ad36ac73"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::git::diff_hunks::git_diff_hunks_page_command_for_source: FunctionTooLong \u2014 webcodex::tool_runtime::git::diff_hunks::git_diff_hunks_page_command_for_source runs 285 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e218264890b14369226184d6db5f8b03dd0c68679e18d307e7d2a09284660c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.run_shell_with_contract_for_resource: MethodTooLong \u2014 run_shell_with_contract_for_resource runs 285 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"src/tool_runtime/shell.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d159aa5fc51eead2cdca65552e94e1524d471b1b1bb656e82b61c1f20435fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::fake_plugin::main: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::fake_plugin::main runs 284 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 184 over it, 2.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8e90ec6339beb555879788ce9bb39518043034e336eef862ffd04d60a5ff5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::patches::edit_plan: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::patches::edit_plan runs 278 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 178 over it, 2.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3ccf8f9f0f18f5b7855551f638d002ddf5dac43b58bd9abcf09f276c63544b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/continuation.rs: FileTooLong \u2014 1370 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 870 over it, 2.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/continuation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f67c22e390a66b6a5871936a79248fb8a4aa627ebf75df960a85c33338f68c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/tools.rs: FileTooLong \u2014 1360 significant 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 860 over it, 2.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":"src/mcp/tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21881c5ee70dd19b62efc4e3658f76fa1957d35373aca1542cd108c02b07f482"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/goal.rs: FileTooLong \u2014 1355 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 63% of them inside a single declaration: Database (232-1284). The bar is 500 significant lines; this is 855 over it, 2.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":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d124ad0943ebe8a00fff9021b5bc5e473aa7974727ec38357d03445b00a84bdb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::run: FunctionTooLong \u2014 webcodex_cli::run runs 271 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 171 over it, 2.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4312098982320cc29a1557c1c73800f2d29e4f0930804d23473250df1c6aa7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.review_changes: MethodTooLong \u2014 review_changes runs 271 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 171 over it, 2.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":"src/tool_runtime/review_changes.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3ed1804b0c8306b3e77e0cb1b214e1c9cb599c7206a0407498d38812623486"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.run_process_with_contract_mode: MethodTooLong \u2014 run_process_with_contract_mode 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":"src/tool_runtime/process.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15f531d771e383c979d2f19b7d29812a648850256aa210b8d6393056f9e1daf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::plugin::prepare_provider: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::plugin::prepare_provider runs 268 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 168 over it, 2.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b959e1bba69e7f0b424c36ab611d8086aea4743dd887cfd0f64248da99b8574"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.git_review_summary_for_scope: MethodTooLong \u2014 git_review_summary_for_scope runs 267 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 167 over it, 2.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git_review.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcb3749bb86625237377065aba7fbb85ae7ae33b0b8006e815ad54481c42415"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SkillStore: ClassTooLong \u2014 1065 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 39 methods. The bar is 400 significant lines; this is 665 over it, 2.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":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e36d80f53d474491e76e9bb823674fe353500baf87e7f517a24830fd86e28aa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ir: TooManyMethods \u2014 79 methods. The bar is 30 methods; this is 49 over it, 2.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_docx_app.html"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9560e0c319d3da5a362109f59354bbf1966ba01916480905dc20007184e5b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_cli/ops.rs: FileTooLong \u2014 1312 significant 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 812 over it, 2.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca46fcc1a00754352a873869917fcd15ae00c723e250d16c7cc35d060f8ab86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/runtime_info.rs: FileTooLong \u2014 1302 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 802 over it, 2.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runtime_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe19ba715ceb524d519c9c6c806bfcb848cd26fbd5c8f2af015d560b68141a04"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JobManager.start_ssh_shell_job: MethodTooLong \u2014 start_ssh_shell_job runs 259 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 159 over it, 2.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/ssh.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d7bb987989dd50e6c3319dd6d14f644343b6eba338c98ea76cffe40c7b7ba0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/supervisor.rs: FileTooLong \u2014 1289 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: BrowserSupervisor (4 blocks, 37-1198). The bar is 500 significant lines; this is 789 over it, 2.58\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2edf7a000d38337e6967c529176c24a14dae4de0e2cbfe7ea50fbda3a3c2e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_lsp::fake_server::run: FunctionTooLong \u2014 webcodex_lsp::fake_server::run runs 254 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ee9a4e2fa4c6e020e38ce7d489ae2afdf6b572bcf6fe24527f870f614107cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_computer_control_action: MethodTooLong \u2014 dispatch_computer_control_action runs 254 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"src/tool_runtime/computer_tools/control.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"df62c0856b6c53187a8d04fdb6fd98f0feaca7cc74e0369ccd9d3ba8adbe4c36"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionStore: TooManyMethods \u2014 76 methods, declared across 4 files: src/store.rs (52), src/messages.rs (22), store/residency.rs (1), store/writer.rs (1). The bar is 30 methods; this is 46 over it, 2.53\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1323ac29ab4a1f15c2513996b5c95e0ad51756d5616aa5bee466485c4d12f5af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::browser::handle_browser_operation: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::browser::handle_browser_operation runs 253 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/browser.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a2d355eb85c79c90c73f75f484aa3e7015f5f08a5956748a2606cf8dfec3e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::webcodex_cli::controller::run_controller_command: FunctionTooLong \u2014 webcodex_cli::webcodex_cli::controller::run_controller_command runs 252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"9735d063f84c446f0a6028c8c87c1ef2d5840385cbd4d13c7d15ea1884d8ecc4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.save_computer_snapshot_artifact: MethodTooLong \u2014 save_computer_snapshot_artifact runs 252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 152 over it, 2.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":"src/tool_runtime/computer_tools/snapshots.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0d395a1d5ad4c6ca9bca890befb632ecf3b39ce598673e7b90b90755654455"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: output_schemas/common.rs: FileTooLong \u2014 1258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 63 free functions. The bar is 500 significant lines; this is 758 over it, 2.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7180d3d61518f891639008c5792bc1036f6309f9c51f7e0da6f2dbeee8aca15d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/observe_jobs.rs: FileTooLong \u2014 1244 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 744 over it, 2.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"211dc74a06621b84e3af5c71c02a21ca1345d57cc04abaf36137bd481218f600"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.read_workbench_state: MethodTooLong \u2014 read_workbench_state 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":"src/tool_runtime/workbench_state.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab597dd2f1bdc26be5fdf3defb50043bda99cf4d2520d4dd651072f4e758714"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::webcodex_cli::project::run_project_activate: FunctionTooLong \u2014 webcodex_cli::webcodex_cli::project::run_project_activate runs 245 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 145 over it, 2.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94b5b65831a0c4d2eb7953687a179515d65a949b5b2a857f152baaa5badc86b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.create_agent_wait: MethodTooLong \u2014 create_agent_wait runs 245 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 145 over it, 2.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wait.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b339f3d7837fd16ede08c0f5fe26af8cca95f7c6586e3f5f68815dc17889bffa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_call/input_types.rs: FileTooLong \u2014 1224 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 724 over it, 2.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/input_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d8ec6bbafda2ced5003a3096244fb661a147da68f60f7a08f3b081052c7e5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::computer::handle_computer_operation_with_runtime: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::computer::handle_computer_operation_with_runtime runs 244 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 144 over it, 2.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/computer.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d1060473fad623eadf8f3a90c929ea3eab417d3e1a95dae080654f49ee35fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::common::handoff_brief_schema: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::common::handoff_brief_schema runs 244 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 144 over it, 2.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"8def28ba3a4ff3e5510eabf2a777ded509eee1aa93f1009d1ee3905e01bfe784"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runners.rs: FileTooLong \u2014 1217 significant 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: RunnerRegistry (145-1721). The bar is 500 significant lines; this is 717 over it, 2.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d3396fe719788e87cc1c7cb3b7bda740ab829e3c333f1c6208069779424b64"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.record_goal_workflow_stalled_diagnosed: MethodTooLong \u2014 record_goal_workflow_stalled_diagnosed runs 243 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 143 over it, 2.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal_stall.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8b012fe5c5aafb53ef6e1f9fb316189bbdabca6d506273696eecad9a22d668"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/desktop_core.rs: FileTooLong \u2014 1199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: DesktopCore (2 blocks, 1-1510). The bar is 500 significant lines; this is 699 over it, 2.40\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb314fac6857470404f75051ce2d68a064a7a750b5a147a246c887944f449d64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/resources.rs: FileTooLong \u2014 1198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 698 over it, 2.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/resources.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c7270ceebb773e5f3e35d7437bffd4a61b3d14e8d21fb2f587b18bbb1b8fa0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::runner_session::dispatch_inbound: FunctionTooLong \u2014 webcodex::runner_session::dispatch_inbound 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":"src/runner_session.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae969f2d1161bd655fc03d4aeef4e73973f89d10a3cf7fde6e582db4207539e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_workflow_session::handoff_brief::build_handoff_brief: FunctionTooLong \u2014 webcodex_workflow_session::handoff_brief::build_handoff_brief runs 236 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 136 over it, 2.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff091b6fb2232e5a6697a5f20d0cd87ff1e73ca31d9c1aaf8e7bd33f90046d51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/communication.rs: FileTooLong \u2014 1176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: ToolRuntime (294-1666). The bar is 500 significant lines; this is 676 over it, 2.35\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":"src/tool_runtime/communication.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d50fc82c2f0a75f92cd7934a7f3d59d24cf7916e188f321c51f0e1cfceeefd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FirstRun.FirstRun: FunctionTooLong \u2014 FirstRun runs 235 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 135 over it, 2.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":"apps/desktop/src/features/onboarding/FirstRun.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec7d8e19edf3eb929b016098207a80448ba8ca55b2954cbedb449f5ae07432a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::shell::execution::execute_configured_command_impl: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::shell::execution::execute_configured_command_impl runs 232 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 132 over it, 2.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/execution.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"430239e62135990b239b01f2a2630e147c13f8e2a6cca55bc18f077bad1f0c89"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerRegistry.complete_checked: MethodTooLong \u2014 complete_checked runs 231 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/polling.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76a1a9888884fd8fc58e758115fb5614bd13899a30ec9a6770484926d45104c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JobManager.start_shell_job: MethodTooLong \u2014 start_shell_job runs 230 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/local_shell.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6711755ba438388b2ecd155e87cbb7be0215921f1717a4c63fe8e64dfbe3c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeEnvironment.configure_tunnel_profile_under_lock: MethodTooLong \u2014 configure_tunnel_profile_under_lock runs 229 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca40140812812457bcc40c0e0d8d207442fc336b9d513a85a94d645570fa022e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerRegistry.update_job_checked: MethodTooLong \u2014 update_job_checked runs 229 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b75884ed090fce42bafff007876dd4ca9d7833d9849eab9c6296a90820bab0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/browser_tools.rs: FileTooLong \u2014 1142 significant 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: ToolRuntime (146-1295). The bar is 500 significant lines; this is 642 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":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"359ab88b28478e6d7cdb8c5faa12011b907de03aa3ce8563321e91f35c71f408"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_core::runner_operation::decode_job_operation: FunctionTooLong \u2014 webcodex_core::runner_operation::decode_job_operation runs 228 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 128 over it, 2.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93b21586798f7184e9d314b68b6a7c60eb1539be762a59e56c7256c2da9d28a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDesktopWorkspace.useDesktopWorkspace: FunctionTooLong \u2014 useDesktopWorkspace 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":"apps/desktop/src/hooks/useDesktopWorkspace.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf63dabe7f2cb379e3eaf9d97b86546f9bad5d3fdbd629a991b0e385d9fa8fa7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/agent_wait.rs: FileTooLong \u2014 1133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 633 over it, 2.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wait.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4066df9230a9e7e0895f6f3910b9eea043f7c4e5603666671278235e9b09223a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreparedInvocation.prepare: MethodTooLong \u2014 prepare runs 226 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 126 over it, 2.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/kernel/recording.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6874f9c1fc954a3d1481d0b1d5e6063bce97e3e0dd762c422a3e6e065145489"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PersistentShellManager.exec: MethodTooLong \u2014 exec runs 225 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/execution.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dfd1b5e53ebc36abce6bc60848992b3f8496d68329195e0bc23777412a7687"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/goal.rs: FileTooLong \u2014 1119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 619 over it, 2.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/goal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6462d2145f73c6cd591096b43fdf74d7ee840804a32ae3219decadc7636ccb4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/changes.rs: FileTooLong \u2014 1117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 617 over it, 2.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/changes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8587b8f12fe2f8833bace82890949f853f6a3d2b1d08bb07ea23421e581f76e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BrowserSupervisor: ClassTooLong \u2014 893 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 44 methods, 4 blocks, lines 37-1198. The bar is 400 significant lines; this is 493 over it, 2.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c22c271d0c40442f9405a6eaf3b3a20169fd63d24202100b99ae5ceb234e77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/memory.rs: FileTooLong \u2014 1116 significant 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 616 over it, 2.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/memory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de391e298b704436f29a115730497d8f46f9900066ee5aed994017a2c9c3f388"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionStore.ensure_coding_session_with_git_baseline: MethodTooLong \u2014 ensure_coding_session_with_git_baseline runs 223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ab453e834b88f504165db1ae9ba9a464708a2af06e7589a47f1ea14334d1cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mcp.rs: FileTooLong \u2014 1100 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 600 over it, 2.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":"src/mcp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e35ae01bdb19a0aab62f16e56dc23ea04dea2a48b536d500c083c2a6253a61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppState.local_update_status: MethodTooLong \u2014 local_update_status 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":"apps/desktop/src-tauri/src/state/updates/view.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ed605a63bcec54e53bfb7595811092e70c697fd7f934d20f6e93c2579f9656"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::runtime_console_http::window_queries::window_for_auth_inner: FunctionTooLong \u2014 webcodex::runtime_console_http::window_queries::window_for_auth_inner 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":"src/runtime_console_http/window_queries.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4aac28b9afabd3cecc6f3a3f6ac8d242918f836e30fa9c35ee9a9da8f487d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/plugin.rs: FileTooLong \u2014 1095 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 595 over it, 2.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9659014b20439efbb632f2169bcaebec9aaf73720b6b060c6f9d36050c2ed5d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ProjectsPanel.ProjectsPanel: FunctionTooLong \u2014 ProjectsPanel runs 219 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 119 over it, 2.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":"apps/desktop/src/features/projects/ProjectsPanel.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bfc8004c511b6caa1855d666246964cca348c7cd540d21125c0c41676fc636"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/projects.rs: FileTooLong \u2014 1094 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 594 over it, 2.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/projects.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a1d6345bcd5497a10f87895f5e489fba71c2370596ee3fb240c7383a0ed792"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/environment.rs: FileTooLong \u2014 1085 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: DesktopCore (2 blocks, 432-1373). The bar is 500 significant lines; this is 585 over it, 2.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"148dbaa255a74e577d68fa8128ade4f356b329396e6212fdb5e71cb7c44fc354"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/project_recipe.rs: FileTooLong \u2014 1080 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 580 over it, 2.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8814c83f6102e7ee3bb3d2e21f7403a7f8e9a8b445eef925306dbf9500dcbd12"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::patches::handle_apply_patch_file_request: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::patches::handle_apply_patch_file_request runs 216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"635eff699203eb8776a5e21337fb87564570116219f77e515bf9cca3cf2d2758"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: plugin.analyzeNodes: FunctionTooLong \u2014 analyzeNodes runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/campus-application/src/plugin.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a5fc37ba5af91ee1b211b319062947d7b91861c41a5a46da172839da15a2e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.recover_expired_mcp_app_endpoint: MethodTooLong \u2014 recover_expired_mcp_app_endpoint runs 215 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 115 over it, 2.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8cd6e86ca63546b9b1a818c16bf52be03c4bae584d779a86e491aa8eec779a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AdminProjectLifecycleService.mutate_authorized_core: MethodTooLong \u2014 mutate_authorized_core 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":"src/admin_project_lifecycle.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"031dfcd759a94d03b17fd2ec99a85797890ab08eb0b03d14c50ddaed1f72b9c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_computer_observation: MethodTooLong \u2014 dispatch_computer_observation runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/observe.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6702465aaebb3d1d421999a45b9e06f2e49e46503674c89c4280e9f573e7654e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DesktopCore: TooManyMethods \u2014 64 methods, declared across 8 files: state/desktop_core.rs (24), state/connections.rs (12), state/environment.rs (10), state/runtime_shell.rs (6), \u002B4 more file(s). 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":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4648642cb812c84da73988959196a635326c13f4e1fbb768ae877446e3d161e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/work_result.rs: FileTooLong \u2014 1065 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 565 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/work_result.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fd7e54ef62ca6d9d99d8997c710cefd201defa88226a313a5a00b228b8cc58"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::communication::output_schema_for_tool: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::communication::output_schema_for_tool runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/communication.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95f0a65faed030addcc57d93be2bea72e3d50c919daa7ac51891473417eb5e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/external_tools.rs: FileTooLong \u2014 1060 significant 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 560 over it, 2.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/external_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9625d360eba4376f2fab53faa15518f29602bb2a33693183d73fd55a8f158672"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/project_entry_share.rs: FileTooLong \u2014 1060 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 560 over it, 2.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_share.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbab794cbf4c9c5d6d0f68e672fdfa663ec5b19f3e277091199ba6c199ed89e9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeEnvironment.configure_cloudflare_tunnel_profile: MethodTooLong \u2014 configure_cloudflare_tunnel_profile runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"789f00ecbbc194e9c0277f68a756f64b055c6490dfd12b7d336060a42638c83a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_environment::inventory::inspect_environment_paths: FunctionTooLong \u2014 webcodex_environment::inventory::inspect_environment_paths runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/inventory.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"085010a58f61eac8c54000d82c6231946d1a12887e4ce5fe380dda96dac740cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::files::search_project_texts_output_schema: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::files::search_project_texts_output_schema runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc6da0fce121e7f8ea519ffa5193ec662354fa033fe672592a23d665d7150ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/read_files.rs: FileTooLong \u2014 1052 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 552 over it, 2.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c5d3b2fc5328ec1380f7ae9abfb15b26c1eda86a68f5fa6a37b39eeefaf5db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_environment::migration::migrate_legacy_environment: FunctionTooLong \u2014 webcodex_environment::migration::migrate_legacy_environment 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":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0acd6164c18424aaf779aef4fe97a324e4e536f11d4b6ba5fe0f1389d09b4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::project_entry_share::share: FunctionTooLong \u2014 webcodex::project_entry_share::share runs 209 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 109 over it, 2.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":"src/project_entry_share.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"266936232376ca77be3223a8a2386dde6f24138840f91a75598881e53c2685e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runner_protocol/job.rs: FileTooLong \u2014 1037 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 537 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0a661a5ca18d4127abb0f54a98e7a65e0fba350804bc3d95113fdf6dcc11ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/artifact_handoff.rs: FileTooLong \u2014 1031 significant 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 531 over it, 2.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/artifact_handoff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b96de4e9c7a24d16ac38e2f21ce54a429219de63519914e6bccd104b67f08f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/environment.rs: FileTooLong \u2014 1030 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 530 over it, 2.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a702032e841e353ca7f58187ca4a8c38aff738b958265a78f5879772dc695d44"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.run_script_with_contract_for_resource: MethodTooLong \u2014 run_script_with_contract_for_resource runs 206 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/script.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6880d77d7adf888bde98aab9ccf39e11b17f6db4b97b955e1ce00c8accdcb791"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner_registry::reconciliation::validate_snapshot: FunctionTooLong \u2014 webcodex_runner_registry::reconciliation::validate_snapshot 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":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89c2a82069bcd00021170f3e0ca4b90ca707f2c77012c8e99d6206241bf48a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::artifacts::output_schema_for_tool: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::artifacts::output_schema_for_tool 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":"crates/webcodex-tool-contracts/src/registry/output_schemas/artifacts.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"43264ac9b1f2e945b81808f7268cfbcf84868ee3557e974f0e89578773dd2563"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolCall.tool_name: MethodTooLong \u2014 tool_name 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":"crates/webcodex-tool-contracts/src/tool_call/parsing.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"182f8ce13aa5a0040ef8d2177122b17d0af394677ef5b030213d1b1fec310e10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/startup_brief.rs: FileTooLong \u2014 1022 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 522 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e0705691bad78dee3fe55b79676495104962731d13c066e8581febfb704a5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::detached_job::platform::unix::run_accepted_payload: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::detached_job::platform::unix::run_accepted_payload runs 204 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ea5143916ab5b1b54a1e8052ab1fe9ab16dea1194406a0a54c6dc80ec5f51c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PersistedSessionRecord.into_record: MethodTooLong \u2014 into_record runs 204 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/persistence.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f425b7695b33c8744d66f10df68ba0a4e81026a5fe564dfb16e11a7aa7f83bb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cloudflare_ingress.rs: FileTooLong \u2014 1017 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 517 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":"src/cloudflare_ingress.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f450820a58d34b056ae7e5b248531c3e75d4fb84ecfa86fffd4eea626300f07"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: l: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"1777f8b351871681b72fbae2577b03061a05ebd542c7bcdb8f4332bb034f0017"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.observe_jobs_for_auth: MethodTooLong \u2014 observe_jobs_for_auth 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":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25467d72f1653d7d30e195e6e41c841e6d21098f236c807a01af3b7d2b45640"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/agent_task.rs: FileTooLong \u2014 1013 significant 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 75% of them inside a single declaration: ToolRuntime (364-1352). The bar is 500 significant lines; this is 513 over it, 2.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":"src/tool_runtime/agent_task.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75d6483df0136c9dae46ea80e16c6b47342603f837850ecaeb8e86f0460ec5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner_registry::validation::validate_file_request: FunctionTooLong \u2014 webcodex_runner_registry::validation::validate_file_request runs 202 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"822c190149139d5f9ad7200f5275dc93ef34c496e5d800b4d93347afb9d92ea7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodingAgentManager.initialize_session: MethodTooLong \u2014 initialize_session runs 202 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"84799b090e75dec5c9b27d6ebd99fb7554767763220da4621055ecc39e54fc13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cloudflare_tunnel.rs: FileTooLong \u2014 1009 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 509 over it, 2.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7921afff038b018362eaad2fb1bce6c16b4e49fcc28a81f59bb4d2099cf996c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: artifacts/upload.rs: FileTooLong \u2014 1008 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 508 over it, 2.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"761995e4dfe697a6bd568d7a5ccd4124741c9e5cbdf9e477867773cfe9ce50ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/validation.rs: FileTooLong \u2014 1005 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: ToolRuntime (439-1310). The bar is 500 significant lines; this is 505 over it, 2.01\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":"src/tool_runtime/validation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f731889727133a5cf94eda0946acf50291f6583fde2919dd26e8979e05b4d67"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_lsp::navigation::call_hierarchy: FunctionTooLong \u2014 webcodex_lsp::navigation::call_hierarchy runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4042511d32f3fa92e86f78cc6fbecd4fd374774a1b7097d8f5b24f2eb681c7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_runtime_contracts::tool_audit::request::browser_act_audit_projection: FunctionTooLong \u2014 webcodex_tool_runtime_contracts::tool_audit::request::browser_act_audit_projection runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3ef1db31202093262073748554a9330e02afed836d79c8087719b0d5dc0f24"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.skill_read_file: MethodTooLong \u2014 skill_read_file 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":"src/tool_runtime/skills.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8d7ead421918fbd6eeacd9ac9f3cf094bd869f959662d66d35574a95046531"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_desktop::webcodex::cli::run_bounded_until: FunctionTooLong \u2014 webcodex_desktop::webcodex::cli::run_bounded_until runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/cli.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d09d89e0c669065d4aedd0c02b97b2d2be11c1f6d5d95b7b33d03efe907910"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::startup_brief::continuation_projection: FunctionTooLong \u2014 webcodex::tool_runtime::startup_brief::continuation_projection runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e49506c0f1bb864995919f24e79a02cbbb82fc1d42bbc92f5ddcca5d08d25a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/mcp_gateway.rs: FileTooLong \u2014 995 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 495 over it, 1.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5e48f74823192f3873fe94b1fd9dfd9ae228b032a9ddab8234e13f3470286d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_lsp::fake_server::write_result: FunctionTooLong \u2014 webcodex_lsp::fake_server::write_result runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed5647ee6c5510e8e2491bf531e5a8f39e0389c0f2ebdd28295c80a98bdbafd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.import_one_conversation_file: MethodTooLong \u2014 import_one_conversation_file 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":"src/tool_runtime/conversation_import.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"3631ae0bbf8c1d9516fd8afb1c4933995696d6a85e8581ef8036ceb45a715fde"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/surface.rs: FileTooLong \u2014 993 significant 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 493 over it, 1.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/surface.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5896db792822913d0d4a671a367757d17fd928899fa3e59c19653130ce384314"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/events.rs: FileTooLong \u2014 990 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 54 free functions. The bar is 500 significant lines; this is 490 over it, 1.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e775341d9408f6009a30820dfc6c406d8cd3dad509408aa0799b27f5ac1448"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_runtime_contracts::tool_audit::request::typed_communication_request_audit: FunctionTooLong \u2014 webcodex_tool_runtime_contracts::tool_audit::request::typed_communication_request_audit runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"8300b3dee6b2a4c11e60a22577f407879bde060756a105b314ab3167a28b45e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/accessibility.rs: FileTooLong \u2014 987 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 487 over it, 1.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/accessibility.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4091d0a2ba6e05207442abe0958d50032c0d9b1e1fc67cfd5c4e312979edd759"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeSurface.admit: MethodTooLong \u2014 admit 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":"src/mcp/tools/call/surface.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"adeb63db9d83858a768be8b52fd7a858432605b462b92e2e29d0581f800c8284"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeEnvironment: TooManyMethods \u2014 59 methods, declared across 7 files: src/upgrade.rs (22), src/native.rs (21), src/tunnel.rs (12), src/cloudflare_tunnel.rs (1), \u002B3 more file(s). The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"718e769fb3c40fbb07e107f406102ab43e1994e5f6a3f3fd1909d432877e5c47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tool_definition.rs: FileTooLong \u2014 982 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 482 over it, 1.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_definition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"642cef453c0cae7489b6d702994885d755fdb07baf681ff2207dd7a5f846430e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopCore.configure_environment: MethodTooLong \u2014 configure_environment runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"6717f75810d51a166dcc267202ea427df725a40dd199bd27b5f9ed6b9812ec94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/project_overview.rs: FileTooLong \u2014 978 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 478 over it, 1.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_overview.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4219e7e1d17bd58b1564c75b119bd386385e782ebb08b1fb025783ab271b655"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/plugin_gateway.rs: FileTooLong \u2014 976 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 476 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugin_gateway.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a596ea82f4417aca34d172d3345d5fcad548bd427a09a0d1b09794b5311f835"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::detached_job::platform::windows::run_accepted_payload: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::detached_job::platform::windows::run_accepted_payload runs 195 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1b8cbd69cc4737e1eaa0b7442200a1a6e241e80f6b446969159e85802aa066"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::projects::registration::handle_resolve_or_register_project_operation: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::projects::registration::handle_resolve_or_register_project_operation runs 195 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/registration.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"98987d2c699d5b67943e1516750d6542dcef3164f41af8ba734e470815e54749"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.ensure_action_event_window_schema: MethodTooLong \u2014 ensure_action_event_window_schema runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/schema.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b8b25472ded453a5a4332a630f54d660973aad61aef998211449d361aaf41c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/git_review.rs: FileTooLong \u2014 967 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 467 over it, 1.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git_review.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8127c9dd28cb48ac8701c65f2858ce541b57a5d9307fb7e2a2551b7c99c8bbf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::oauth_http::shared_key_bridge::oauth_shared_key_client_provision: FunctionTooLong \u2014 webcodex::oauth_http::shared_key_bridge::oauth_shared_key_client_provision runs 193 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/shared_key_bridge.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"16564353aa894203fead28079760593add9a6b0a6819abf16f4722f734ee2f77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SettingsPanel.SettingsView: FunctionTooLong \u2014 SettingsView 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":"apps/desktop/src/features/settings/SettingsPanel.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"483741c471fcaa3aaaf84a880f807d4d4d8b22ccd2abf0988484b2a65748ee5c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.set_project_memory_attributed: MethodTooLong \u2014 set_project_memory_attributed 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":"crates/webcodex-store/src/memory.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f1a55b1ef208ea5be95d94e18765e870dafe032e084150e6b7548dcd01855c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.project_build: MethodTooLong \u2014 project_build 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":"src/tool_runtime/project_build.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"996df32ed48d3abd8d8d6b328b51468fd67f0f219f9d11ce5c10e3cee81013c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::webcodex_cli::ops::run_ops_command: FunctionTooLong \u2014 webcodex_cli::webcodex_cli::ops::run_ops_command runs 191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/ops.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"1069a7b0f4909fe0bf5ed93dcb8cdc018f3ea13661c49b6fb02333b588a08ce9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::skills::output_schema_for_tool: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::skills::output_schema_for_tool runs 191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/skills.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4f05c5d8b40f1bbf273df3d22a5def6ca891b6ce2a995910bccb4f4847f716"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oauth_http/managed_authorize.rs: FileTooLong \u2014 951 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 451 over it, 1.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de71f513772306e232a47175ce0dd24329c5e63fc81f54404a4bdb9d217af02"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: projects/managed_worktree.rs: FileTooLong \u2014 950 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 450 over it, 1.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03afaed05d30bb077ed58770dedda7dd4ae4edbe8e103a33ed1b0c6cde92154"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParsedCall.prepare: MethodTooLong \u2014 prepare runs 190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"24043ebeb0d764b183260cec64d25d5da1a047524ec49cd9c0a3ddcafb7e8f19"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::webcodex_cli::runner_service::run_runner_status: FunctionTooLong \u2014 webcodex_cli::webcodex_cli::runner_service::run_runner_status runs 189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/runner_service.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"278c7a9272722e1fe1d42a6c80224488302650bf75fd9ab627bdb60d6138ec73"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.coding_agent_observe: MethodTooLong \u2014 coding_agent_observe runs 189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5f8f632fd33285f36665b097824f44ec3900746fc299e069823af75cac9f2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: files/inspection.rs: FileTooLong \u2014 941 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 441 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/inspection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c16c9a76c0c3f33f816c72182084629d0166802a685fd067e2d091541d35972"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/oauth.rs: FileTooLong \u2014 940 significant 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: Database (127-1082). The bar is 500 significant lines; this is 440 over it, 1.88\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d52deb258dafd2d52fbca517b819e01985ef2ce33a20e42b039f2c28793575"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.consume_agent_wake_with_now: MethodTooLong \u2014 consume_agent_wake_with_now runs 187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a789180dd55873785e24b8951f5941f89cae35de39e668010f716e91c1947e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/project_entry_setup.rs: FileTooLong \u2014 934 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 434 over it, 1.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_setup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14929841b346f053c4c024ef95c0f66ae4f371ccb9a7427c210562a9742a555"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SessionEvent: TooManyFields \u2014 56 stored fields. The bar is 30 stored fields; this is 26 over it, 1.87\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/model.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"56af9d75f4dded963be11bd7a173508ced43ed040919892d2a9c6f4c99b5de1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::runtime_info::connection_layers: FunctionTooLong \u2014 webcodex::tool_runtime::runtime_info::connection_layers 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":"src/tool_runtime/runtime_info.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d331135083a7f3ed05daad354da3357e5355acd328e80bd6eb2597f8b03690"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/ssh.rs: FileTooLong \u2014 929 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 429 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82657d8e4217513e4c244c1c01bb55c841d20d9313e075f3ed910ab07e35a27"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: output_schemas/coding_tasks.rs: FileTooLong \u2014 928 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 428 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/coding_tasks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f629d93a251b8fb4cda4bd2d00660d7a6ef4dea85c55e5e4abf059bec7aca0e6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ComputerRuntime: ClassTooLong \u2014 741 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 31 methods, 2 blocks, lines 933-1871. The bar is 400 significant lines; this is 341 over it, 1.85\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdca40faec60333f4a7cfa6e736fea97bd8da25cbaf1b04627e6962c08c0154d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_cargo_tool: MethodTooLong \u2014 dispatch_cargo_tool runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/cargo_tools.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5f55858464261cd83984862d899354f728d9722af12b17559498210dfea54a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/project_entry.rs: FileTooLong \u2014 924 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 424 over it, 1.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a49323b7c22ed0a7243f23392ba717b28cf3f446948ba7d5d3a468d4df388cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_audit/request.rs: FileTooLong \u2014 923 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 423 over it, 1.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05aec63008d67f4a228a4936bf8f59192f7e53ecde196d4f9baf322d7387430"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/recipe.rs: FileTooLong \u2014 921 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 421 over it, 1.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/recipe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd27ed83d4ad9028e001a76a289d0def544cc1b00e5134e7336a06799d7641a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.accept_explicit_agent_wake_activation: MethodTooLong \u2014 accept_explicit_agent_wake_activation 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":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d111076d09bcdca361676e746264527f269040f92d18d2d36afe09888623dc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_environment::upgrade::verify_upgrade_candidate: FunctionTooLong \u2014 webcodex_environment::upgrade::verify_upgrade_candidate runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefe3562cd09fc8da5a33d1842dbe9f52aaa5c29dd5e685d2a83da9a5f87b0d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: service/windows.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), declaring 36 free functions. 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":"crates/webcodex-environment/src/service/windows.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd2739f94a7b19b777b3527367a90859b3e797e1f8bd2b16badc19d006391f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.resolve_coding_startup_project: MethodTooLong \u2014 resolve_coding_startup_project 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":"src/tool_runtime/coding_task/project.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b435ee38d39dddf64a607ab5d97c90c43e1bd9c94937cd5d6cfb902484361e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/session_tools.rs: FileTooLong \u2014 906 significant 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: ToolRuntime (14-1122). The bar is 500 significant lines; this is 406 over it, 1.81\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":"src/tool_runtime/session_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5f6cd9edcad72529cea6814f2718c2b041059b6a18a5085b61f2ffc41c8267"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.cargo_fmt_with_context_inner: MethodTooLong \u2014 cargo_fmt_with_context_inner runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/cargo.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"83444952b58764398ebf836db6f25f265d0add20a0712192c5bfbf3e5876413c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.run_detached_process_with_contract: MethodTooLong \u2014 run_detached_process_with_contract runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/process.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"6badf16d1793dbd24a185d161655bf337ec105e5d063151d05b090a51ad979ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime.rs: FileTooLong \u2014 903 significant 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 403 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-code-mode/src/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12643c15caf2cc5c7033de573100ed5a2a32b83f84b4e712c2983cc74e722b5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JobStartPlan.new: MethodTooLong \u2014 new runs 180 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates/start.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a767ee45dc49fc6c627e936db7608e76a6fd7a61b7d4123883e9b8e224ddc1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodingAgentManager.run_live_acp_probe: MethodTooLong \u2014 run_live_acp_probe runs 180 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/diagnose.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac0e12b24011afb985f000623ba0e81470f061a889b4bd6db9526ca50d7adf7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JobManager.start_structured_job: MethodTooLong \u2014 start_structured_job runs 180 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/process.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff253a94d3fbdcb255a324180cbdf054907563ddffbdfa2dd0eed92a3e2ca9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::closeout_facts::evaluate_closeout: FunctionTooLong \u2014 webcodex::tool_runtime::closeout_facts::evaluate_closeout runs 180 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/closeout_facts.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99fb12acaa171648e42bd47b7d5dac6fa9a01aced53691d9cfadbae54fc9cb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/process.rs: FileTooLong \u2014 898 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: ToolRuntime (358-1144). The bar is 500 significant lines; this is 398 over it, 1.80\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":"src/tool_runtime/process.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcfd77588979fd94a11f40b2bd9aaebceafb3dc8b13413a6d49ec9b7587e52c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/reconciliation.rs: FileTooLong \u2014 896 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 396 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"470276e6400379f31fb525d470cee8c2782dae4528dbdd9afaf161ce12035321"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_core::runner_operation::encode_operation: FunctionTooLong \u2014 webcodex_core::runner_operation::encode_operation runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"846602dfda0e4989489019609d3d0e2459d2fefd33af654e6e8ce3bbf3d32c68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/session_shell.rs: FileTooLong \u2014 892 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 392 over it, 1.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_shell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"674d2bbb20195273ea992da879f73be0b3a53f9263520c89684fe0f7f76c833c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::startup_brief::enforce_hard_size_limit: FunctionTooLong \u2014 webcodex::tool_runtime::startup_brief::enforce_hard_size_limit runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cd9eb9d097aedd431e12cea4c69a45497d7ad89dca9ec7a1449941944beee7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/console.rs: FileTooLong \u2014 885 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 385 over it, 1.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/console.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a1012e8411d6d59041aba382312ecc0d58a48c9717cab5f8721b40aad9d0fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReloadableRunnerConfig.reload_internal: MethodTooLong \u2014 reload_internal runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"9984c7e0f6ef6ee032ba10b9477a1e94b41fb0dee8e8a3abc780345b4cf27a52"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.run_job_for_auth_with_contract_with_ssh_resource: MethodTooLong \u2014 run_job_for_auth_with_contract_with_ssh_resource 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":"src/tool_runtime/jobs.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ca64933c959e6576fea37e2386de8e38488dabbabaf0be70752ffb67439358"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::environment::parse: FunctionTooLong \u2014 webcodex_cli::environment::parse runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3141bbf572d88e94aea2c77b2f391ab567171396827b0b51cb75867bcaa3919"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeEnvironment.upgrade_prepare_with_options: MethodTooLong \u2014 upgrade_prepare_with_options runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4764e1e44ec9daab70c6ebac1964e0539685fa400618b0cfe12c84cded7a7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::transport::registration::runner_register_capabilities: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::transport::registration::runner_register_capabilities runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/registration.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1e03e375425399528dc136211ba9c66f2dc42dca718772c67dc0e4dd54a1a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::runtime_http::tools_call: FunctionTooLong \u2014 webcodex::runtime_http::tools_call 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":"src/runtime_http.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ffde665e27f39ba17b6910575737133729220e6c4885a24eb780bb40f63a2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::validation_success_projection::sparsify_structured_validation_success_evidence: FunctionTooLong \u2014 webcodex::tool_runtime::validation_success_projection::sparsify_structured_validation_success_evidence 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":"src/tool_runtime/validation_success_projection.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9121d4984b5f51bcdab616c9bffc4ec0584510839071f52a0c57b172ea3e3633"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex/adapter.rs: FileTooLong \u2014 873 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 373 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":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d0dc4dd9a4ece82b9bef5cba7ff40f4cb173c824093a13cd34b649393d515c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oauth_http/shared_key_bridge.rs: FileTooLong \u2014 872 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 372 over it, 1.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/shared_key_bridge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6534e2d07bb83ba6e46ac9288fd5325f70f19558ee4726f470d6eab2d8d5efdb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DiagnosticsPanel.DiagnosticsContents: FunctionTooLong \u2014 DiagnosticsContents 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":"apps/desktop/src/features/settings/DiagnosticsPanel.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad7116fa9565bd81ca103e33c7152d3926c9c6706051457e56dd2fb05658174"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionStore.record_validation_job_terminal: MethodTooLong \u2014 record_validation_job_terminal runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10487c543a840582ae5554e90ec1acda97cb95582cf6fa3663ea1277f7df768"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.runtime_status_for_client: MethodTooLong \u2014 runtime_status_for_client runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runtime_info.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c751f4a5a7067daf3a839fd9e93b445b4ba640c86c989c46c9d1009dda6bdec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/model.rs: FileTooLong \u2014 854 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 354 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":"crates/webcodex-workflow-session/src/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45129bbc2424915b5f7ccab827566b79baf9429b0ea5861da7592ec22fd3c434"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/schema.rs: FileTooLong \u2014 849 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: Database (6-968). The bar is 500 significant lines; this is 349 over it, 1.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":"crates/webcodex-store/src/schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9023d8abe1717fa7cc7e49e510fccb5e1c1c1c07fd0bae0bbede17d4acc05d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionStoreInner: ClassTooLong \u2014 678 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 2 blocks, lines 154-3633. The bar is 400 significant lines; this is 278 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20573540a2a8efc073ad38ca26474f89ac6ea59e773ead1072703add4a9529e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.attach_agent_endpoint_with_host_window: MethodTooLong \u2014 attach_agent_endpoint_with_host_window runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"332c076eab695aa11814b98557db045d214b89f2fbc700ab92117b28f87d1c02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.validation_terminal_result: MethodTooLong \u2014 validation_terminal_result 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":"src/tool_runtime/validation.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6d9211d92676ff53e9808dcac206eca490d9476b53b8e60581b58ec359c8c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::parse_connect: FunctionTooLong \u2014 webcodex_cli::parse_connect runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fcd2d01c3fe9b2b43e814ef608efd1dd79dc456498a64e3e818d051817835f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/project_context.rs: FileTooLong \u2014 838 significant 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 338 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada6dbb871c2cf9f0842cdb38716bd69eb03e0e47aaa059397149e31decd526a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeEnvironment.apply: MethodTooLong \u2014 apply runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3735bb282db14b67c3c370129f6bbcd6a91faf5aee9ba676a594cb6af25063c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::projects::managed_worktree::resume_managed_worktree: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::projects::managed_worktree::resume_managed_worktree runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1ef22057edc0827b1085f33999a215905ab5582ee51c5171568b7a46aeaa6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::mcp::tools::call::specialized::ssh_resource: FunctionTooLong \u2014 webcodex::mcp::tools::call::specialized::ssh_resource runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call/specialized.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3ef1ff85815f187bdd84b1880ef23618710d3abc350c438e2d9edf08ab89b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_session_tool: MethodTooLong \u2014 dispatch_session_tool runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_tools.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0afa009bc2cbfa30c4e9e9d49f141ac05a57ab61a39c47932a22daeb8619a00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.search_webcodex_resources: MethodTooLong \u2014 search_webcodex_resources runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/resource_references.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b58e1c8c2a08b888ca97bc7e03ced7cf75189ffd7f810e0fcc49dbcee415899"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.materialize_validation_job_candidates: MethodTooLong \u2014 materialize_validation_job_candidates runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/validation_events.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"0529c3469218762e6e8611663acd13093278812c36702187ac346e82b4695c2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_call/parsing.rs: FileTooLong \u2014 829 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: ToolCall (249-906). The bar is 500 significant lines; this is 329 over it, 1.66\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/parsing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5dd9e2f0d232a3b8c8f1f5c3b7dd3fd15696cce0ca55410e2469e432e53625"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/migration.rs: FileTooLong \u2014 827 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 327 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcf3f43b14c87e4b0cff337e27a83e5b107d89adc29bcdb5602bd9863411440"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/handoff_brief.rs: FileTooLong \u2014 824 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 324 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ff171725f2133a46eda823055c36f7ede50dc3ff1161de90d0e6b6343ec995"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/coding_agent.rs: FileTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 321 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe35a9e3c2ce3725e814fe14ae76e4d8a1f7bde8fcf479d4b9071bf31dce7340"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::jobs::structured_execution_lifecycle_constraints: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::jobs::structured_execution_lifecycle_constraints runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c097a8d9dc69cf4086581c5ac067498829b8361cf3037423c7b98b35c8f0d219"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::session_context::session_message_error_result: FunctionTooLong \u2014 webcodex::tool_runtime::session_context::session_message_error_result runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_context.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b04e15f42c3810fefa0e4d1f106186f655f6500a72e6f525c4544605c856e5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Dr: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_docx_app.html"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e19c33b3895410b82abad9cf97c31b5f08e61562aa32bcc68f8044240621b61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mcp_workbench_app.html: FileTooLong \u2014 816 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 316 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":"src/mcp_workbench_app.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44eae90469409d2176713becdf6e7dbc5834eb6cf9e459cda36e3402aa8f74bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_begin: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_begin runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"1309606e0b4c7cfe2df614ca04f2e6e7ded09131a7b8c84b18ee0bab8c3ee729"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_chunk: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_chunk runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"80991d1bd5f15ddd43dd638b0bb889f29762b7ba14bc08aa7f17a43a9e571352"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::project_format::format_candidates_with_deadline: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::project_format::format_candidates_with_deadline runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_format.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ceb4a472ddb0e180aa79aa56b9ad996a3d2de853e43484ca2343a5445654a1e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.job_log_with_paging_for_auth: MethodTooLong \u2014 job_log_with_paging_for_auth runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/jobs.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b5d18b1941fbd79eb143a9071b0d227aa78ddce9cfa1aa1db7e65a8ed8bb83"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: connect/process.rs: FileTooLong \u2014 812 significant 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 312 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/process.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2da22039da7af79876c271428f49e58b1de97ef7543c465072e7205faf62e05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: macos/accessibility.rs: FileTooLong \u2014 812 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 312 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea22583fbfe29d41253b8cab49b4f6f1c20483145474e171d541f616cfa11b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/validation_evidence.rs: FileTooLong \u2014 812 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 312 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5305bcac6552e4414b2a1d05285c04d5465d39ad21efd8f607961d200d8adec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerRegistry.enqueue_computer_checked: MethodTooLong \u2014 enqueue_computer_checked runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba97a0293c8a2f22bbd8d1840da8591e4b5872da36e33cd404cc0559022cbbf5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeResponse.finish: MethodTooLong \u2014 finish 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":"src/mcp/tools/call/response.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2574f75959d0b63abc5dd176050e56ba266db073cb80793fabccefc8e7b27d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.call_tool_with_context_inner: MethodTooLong \u2014 call_tool_with_context_inner 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":"src/tool_runtime/kernel.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b094323293f6d5bb197fcff85a9288c2915fef6bf66fb6ac0a317e9d269e66"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_core::apply_patch_shared::parse_codex_patch: FunctionTooLong \u2014 webcodex_core::apply_patch_shared::parse_codex_patch runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_patch_shared.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ba6ae12bfebf3d4d9d5a05b530ba4e521a7d2761e3cdc6e3b67a2699dbf570"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/admin_project_lifecycle.rs: FileTooLong \u2014 803 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 303 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":"src/admin_project_lifecycle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27417bd4d0d9cd9a76bcca193420e39b56c8a0e99c8058a24b4def3b4c59677"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/artifact_transfer.rs: FileTooLong \u2014 800 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: ToolRuntime (91-1019). The bar is 500 significant lines; this is 300 over it, 1.60\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/artifact_transfer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45774df5a24d56208b4e472a18960ae685b487db70bad9cfb271016b20eea25"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerRegistry.apply_project_inventory_page_checked: MethodTooLong \u2014 apply_project_inventory_page_checked runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/project_inventory.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9138e1fd75c6a9bfe0d3fdb864660f3913c2472727242f44e1068b48f54fff2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::coding_task::projection::project_work_on_project_output_inner: FunctionTooLong \u2014 webcodex::tool_runtime::coding_task::projection::project_work_on_project_output_inner 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":"src/tool_runtime/coding_task/projection.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0ac5454da8e0b1f2f555037edf69be0209ced08960d9b0fe2d654e22f30fe8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::files::mutations::text_edits_result::validate_apply_text_edits_success_metadata: FunctionTooLong \u2014 webcodex::tool_runtime::files::mutations::text_edits_result::validate_apply_text_edits_success_metadata 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":"src/tool_runtime/files/mutations/text_edits_result.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f207f9f4dbe8f05fda7284a358927c7674600a130b20071e6f339b005334116"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::observe_jobs::sparse_success_item: FunctionTooLong \u2014 webcodex::tool_runtime::observe_jobs::sparse_success_item 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":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c360a5423aaac93447557839b178f7061d59ce3e562481bee87a45a2b56a26b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::webcodex_cli::connect::shared_key_oauth::provision_client: FunctionTooLong \u2014 webcodex_cli::webcodex_cli::connect::shared_key_oauth::provision_client runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d0260b5089c35f1f07ec5805db50f207a5740d33264420c687e8c28dd4c6e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::job_manager::admission::validate_runner_job_context_operation: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::job_manager::admission::validate_runner_job_context_operation runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9500feb1021fd441982d96ab5b21dd7b5a8dd28a130c2b84d8fdec8992fc9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_workflow_session::continuation::build_attempt_summary: FunctionTooLong \u2014 webcodex_workflow_session::continuation::build_attempt_summary runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/continuation.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9f2f7571a9f10e9b9caea8df484f1bda3cbe77f908dfaddadddb70a6da56cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::validation::execute::run_bounded: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::validation::execute::run_bounded runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/execute.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"543030de5987d597840cbc048599bd2490a1ed7d18a116c127b0b8c618068af8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::project_entry::start_local_runtime: FunctionTooLong \u2014 webcodex::project_entry::start_local_runtime runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c8709e31a22fe5fa4dc0c10d16bf51f24bbc57bd00f015f1611142eb713335"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.submit_workbench_work: MethodTooLong \u2014 submit_workbench_work runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/workbench_execution.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6d3666fbad15e61587a92c271547284dda05960b707ef2106cb138fdc39df1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JobStartPlan.admission_requirements: MethodTooLong \u2014 admission_requirements runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates/start.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"294eb3f576c005142abe9ec5a77fa58287eab2a3fb9d0f2215a08bd5bfa5cfbb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SkillStore.install: MethodTooLong \u2014 install runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be2efe8bb1f6e3086daf4e6e5b94bf1e8a493e66e7ee0d798a2fda33826bb72"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.authorize_runner_tool: MethodTooLong \u2014 authorize_runner_tool 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":"src/tool_runtime/runner_authorization.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2e69939e32cdcae35bc589ce0cb8d5b246babebf49a04cd63f5e37cf61da89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: output_schemas/sessions.rs: FileTooLong \u2014 781 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 281 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/sessions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaeebc58341b2ba067d01e5abebd68fa609d3e625cb229f17d2e2c89c7c817c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.terminalize_agent_task_coding_run: MethodTooLong \u2014 terminalize_agent_task_coding_run runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/operations.rs"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f99a8a481c84c849d64dfeb0787e3134be309511fd2a27cb20847df45ad762"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::jobs::validation_job_result_with_policy: FunctionTooLong \u2014 webcodex::tool_runtime::jobs::validation_job_result_with_policy runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/jobs.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dc69a7d2f9eeecda2eed96f6c0dee78c4bc8dac0435e80b2a5bc96bc55d45f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LspSupervisor: ClassTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 3 blocks, lines 330-1293. 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":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92143dc517b8b97ffb4b19d679ad244bb6c85862b3fd4b2b28df465beafeec4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AuthMiddleware.handle: MethodTooLong \u2014 handle runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/middleware.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb51e5bfcb0b3a78d33ac88f353d0d1311a3b2d377a52cc9a9427bf479603d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::webcodex_cli::server::run_server_status: FunctionTooLong \u2014 webcodex_cli::webcodex_cli::server::run_server_status runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/server.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"f852932565c2cb15949756e79e8bc077c107e19777955912185cb0e270b5e283"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.read_files_planned_resolved: MethodTooLong \u2014 read_files_planned_resolved runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbd72700700677115d5df4cdd6c589970abb57a4ece72fa0d89b71ec9fef403"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::webcodex_cli::connect::run_shared_key_connect: FunctionTooLong \u2014 webcodex_cli::webcodex_cli::connect::run_shared_key_connect runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bd7116dd91bcf345a7b7470fc62b35464dad841fb2553da4e8f6672d278ef4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.ensure_communication_schema: MethodTooLong \u2014 ensure_communication_schema runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acf16814daa6c390e7d3374043d1f65c37819cbbabe1a601313b3c468d2dc28"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::coding_tasks::work_on_project_output_schema: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::coding_tasks::work_on_project_output_schema runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/coding_tasks.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb7610ff3b17b841bedf418ca3dcf63d0d4e4d5c312930fd1313c410f86392a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_agents_authorized: MethodTooLong \u2014 dispatch_agents_authorized 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":"src/tool_runtime/dispatch/agents.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26a557f59fea1691743d5c56ad497197aea1333b36c8426a63748d8043fc66c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.goal_activity_observation_at: MethodTooLong \u2014 goal_activity_observation_at 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":"src/tool_runtime/goal.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1e824931bf5eeebce30124a4fcb1e0e4dd599a2f75929a2da2d5040ac97bd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_cli/project.rs: FileTooLong \u2014 764 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 264 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b72a0a074bbc4051d2d648d6755a2948ddc81d0343fbd6d0389d1b230737be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/handoff.rs: FileTooLong \u2014 763 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: ToolRuntime (137-822). The bar is 500 significant lines; this is 263 over it, 1.53\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":"src/tool_runtime/handoff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5d1d7e9452ada34acf9b3138444da8f84402eb85a364822d52d7c17cbb535f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mcp_result_app.html: FileTooLong \u2014 759 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 259 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":"src/mcp_result_app.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3302660aee0d31ec24ae1f2e5fd6347c8cffb50771b28c3a69ef6b6efe59d8fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mutations/patch_result.rs: FileTooLong \u2014 759 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 259 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":"src/tool_runtime/files/mutations/patch_result.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1022747a14435bbb9c2f8c62b984f92e491633e2d6f2f13042baa1d1d1205a46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: files/artifacts.rs: FileTooLong \u2014 758 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: ToolRuntime (310-1012). The bar is 500 significant lines; this is 258 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":"src/tool_runtime/files/artifacts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e9b8250237d660079eec176e8b11200537cd85b0ff3edf66c09ef39000373d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_core::apply_patch_shared::derive_codex_patch_update_with_matching_mode: FunctionTooLong \u2014 webcodex_core::apply_patch_shared::derive_codex_patch_update_with_matching_mode runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_patch_shared.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8e74344704f20f4c30099b63ac39d33db627381857440eebf04e15ba40c318"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/artifacts.rs: FileTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 250 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"933f387ea03b9b92a1e9a0bcc52a01655a26af2c1d7d15ffb6a0de5ae2a19000"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::validation::project::plan: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::validation::project::plan runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/project.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78c0ed919bab49be8a47032f91f253b14a0247ca0bd61a056da2cd4451e6401"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mcp_agent_continuation_app.html: FileTooLong \u2014 749 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 249 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":"src/mcp_agent_continuation_app.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42291deccd4b44c0749637818988b61fdbff5a33b70710c2f8d8318d468bd12"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopCore.start_quick_share: MethodTooLong \u2014 start_quick_share runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ff149fd3ddfa49a587cb01239f73943f2653b72484c14d4eef655d46dced36"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.accept_artifact_handoff: MethodTooLong \u2014 accept_artifact_handoff runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/artifact_transfer.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8489da32e1ee77db15a3db0c3171712a7d2c18c147e0c1638daaa2eab463da0d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_execution_authorized: MethodTooLong \u2014 dispatch_execution_authorized runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/dispatch/execution.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7ce1eb6c6f7c0281ca32ac812767104e5046b6a8032042e621ff8f80de3671"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/commands.rs: FileTooLong \u2014 744 significant 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 244 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7a8c15c9a874b3d5b410eaf82333c3fe7b5ceca3afff9e9e030d766b4b79b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: connect/oauth.rs: FileTooLong \u2014 743 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 243 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c5b17c24a0e83a6a63b7072e8fdd0a8254d591b5541c7c3392d616fcb836d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_cli/login.rs: FileTooLong \u2014 741 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 241 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59cd9bfba162c40de65a047fce567a6f60fca641cf01f262d10b1bcff285fb3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_core::runner_operation::encode_job_operation: FunctionTooLong \u2014 webcodex_core::runner_operation::encode_job_operation runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0dc66588d3e3b2bfcb5a280887883785881638691368cf012a7a50c2adfee3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_agent_work_authorized: MethodTooLong \u2014 dispatch_agent_work_authorized 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":"src/tool_runtime/dispatch/agent_work.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2caaafff6935d356e7619dcf5fa05fa9e586910ec5685090ab2cf03b0963bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_store::agent_wake::wake_envelope: FunctionTooLong \u2014 webcodex_store::agent_wake::wake_envelope runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":2638}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93ab46060ee6c98f17ebd5836f1fd92a13d75af91791c9f26e051f25da5ad96"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.current_window_activity: MethodTooLong \u2014 current_window_activity runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/current_window_activity.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbb58bcf417bba10cf7c35a81554bb34e917a1481e91835494d23980cbb929f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BrowserSupervisor: TooManyMethods \u2014 44 methods, declared across 2 files: src/supervisor.rs (42), supervisor/user_handoff.rs (2). The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5515c15c7e5f3179d8a8f457f103ae0bf0f3ff365b6cb63e0e087acc661d45f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.update_goal_at: MethodTooLong \u2014 update_goal_at runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d12090e3610d6675a05cc89352c44d2ad35d224fc453b6514a98f63cbf90b9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_store::memory::parse_row: FunctionTooLong \u2014 webcodex_store::memory::parse_row runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/memory.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b97a5a97d8836f671dc283e321a458f8974315046a3e3af6d366d9b3271917"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionStoreInner.complete_message: MethodTooLong \u2014 complete_message runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7783a2ef705aa94b98db00bc4765b6c5858b298e41a69b6ea058d4d87df35293"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::files::mutations::text_edits_result::sanitize_apply_text_edits_model_recovery: FunctionTooLong \u2014 webcodex::tool_runtime::files::mutations::text_edits_result::sanitize_apply_text_edits_model_recovery 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":"src/tool_runtime/files/mutations/text_edits_result.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cc035d9b9ccd79fb366ddcaab6c381145bc9524e09a4e4d3271917ae9cd7c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session_service.rs: FileTooLong \u2014 727 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 227 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/session_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6346bed602f5621239a1dd4b76e4f982c0d9558685144126bf51431b7d0f9d62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/goal_stall.rs: FileTooLong \u2014 727 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: Database (151-810). The bar is 500 significant lines; this is 227 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":"crates/webcodex-store/src/goal_stall.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb739af1176a9e5ac7fc768bf2227a4f49617be9b658d88557f56b9df95430c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.bootstrap_agent_conversation: MethodTooLong \u2014 bootstrap_agent_conversation runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3890334445fd6dd22e73248422d5782d34a6b4735de8df22a56c0030761e17"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::cloudflare_ingress::cloudflare_control_handler: FunctionTooLong \u2014 webcodex::cloudflare_ingress::cloudflare_control_handler 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":"src/cloudflare_ingress.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8d2298ec8b1227371b6ccef0a13065b039acaffcf83df84fd060f5ff6b42df"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.read_runner_skill: MethodTooLong \u2014 read_runner_skill 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":"src/tool_runtime/skills.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcbce455568681a0225c1a0cf07fde61412ef08bffcee567db34cbf05fd36d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::webcodex_cli::login::render_login_result: FunctionTooLong \u2014 webcodex_cli::webcodex_cli::login::render_login_result runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d0f00919329d1f3ba98f0b2f07e87943b521092dde9039c290c46daa9af66c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShellJobValidationMetadata.is_valid: MethodTooLong \u2014 is_valid runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cc7df5f0758e0ef09b6d82ea6c756bba89f84e1f23b762ab3b9fb39fac91b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::mcp::handle_mcp_request_for_surface: FunctionTooLong \u2014 webcodex::mcp::handle_mcp_request_for_surface 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":"src/mcp.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f629c61108a5d7e09cc87d13006ba957139f2de1a35195ea6eb1cf710c015c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::oauth_http::shared_key_bridge::oauth_authorize_bridge: FunctionTooLong \u2014 webcodex::oauth_http::shared_key_bridge::oauth_authorize_bridge 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":"src/oauth_http/shared_key_bridge.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb1e0704771685967b146a3ee6cf41e3128d9d7753b4a94359d922bc10ed0fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::files::mutations::patch_result::validated_apply_patch_match_rejection: FunctionTooLong \u2014 webcodex::tool_runtime::files::mutations::patch_result::validated_apply_patch_match_rejection 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":"src/tool_runtime/files/mutations/patch_result.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9967fff25487063efab90a5d3370fe242f6cc9fcc93074d873af78bb228e53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.job_convergence_record: MethodTooLong \u2014 job_convergence_record 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":"src/tool_runtime/model_ergonomics_telemetry/job_convergence.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfa08fedd17cee136e045cc51aa7e87c641c9b109ca37642ef61a451734ded0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex/install.js: FileTooLong \u2014 717 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 217 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":"npm/webcodex/install.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4462ba57497d908d6377a1e791f21a254cbffcb48cddd2802823010e923030"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UpdateManager.status_view_for_target: MethodTooLong \u2014 status_view_for_target runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/view.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"81be6b047f913e9d335f7a7bf5de2d7894a3eba45b0e158f47bb56425c39b771"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.claim_next_agent_wake: MethodTooLong \u2014 claim_next_agent_wake runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"e568efc95f81b0c48967ef2373b79d5dcf831e363233a936515ddb4b65a26562"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::edits::output_schema_for_tool: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::edits::output_schema_for_tool runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/edits.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"17818e1768f6c2572f40c7ed9a63ab29caf806d1a52cbf319a8743bffce69997"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.apply_patch: MethodTooLong \u2014 apply_patch 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":"src/tool_runtime/files/mutations/patch.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc254f17221a6f51e17d5b14325914e30417c533ddd058a439800337e655e5d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.exact_work_result: MethodTooLong \u2014 exact_work_result 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":"src/tool_runtime/work_result.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2f770c13c64e3152af4beb74404aa5ba7aa322bce268e625af9ebc183ddace"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent_task/invariants.rs: FileTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 212 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/invariants.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9b59ec7e56bba5f10d5e6af2684a2b90db6e3f83b3381d6103a173574944df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: project-knowledge/knowledge.py: FileTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 211 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/project-knowledge/knowledge.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a7d3cd4467ee010df91318a3e597b3f0271eb07710c0ed42e4d0f6555ca4c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UpdateManager.install_locked: MethodTooLong \u2014 install_locked runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/install.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"57aa9b9a45bf9b33fccd704f0fbbe8fc77158d1c522b2bdf254cda83b9a3a646"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_environment::unified_update::installer::apply_verified_installer: FunctionTooLong \u2014 webcodex_environment::unified_update::installer::apply_verified_installer runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/installer.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2675a5931f5459217449b6b5ee1a5064ded32c7c9f1c741623e12f211daa699"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/connections.rs: FileTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: DesktopCore (165-757). The bar is 500 significant lines; this is 205 over it, 1.41\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":"apps/desktop/src-tauri/src/state/connections.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9cdc7e8b100571779501a2d5dd96e5d5d907d03c8232f85c52b98f8afb5aff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/apply_patch_shared.rs: FileTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 205 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_patch_shared.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f2807ab232bc638b2cffbbfc2e0efc670a524463dbc191f32ab7e649d7ecb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/conversation_import.rs: FileTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 205 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/conversation_import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c157a7ec4bd104cac1f3ee6ba32cbac329094a6a167c24e8157f0f35713f45"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_lsp_tool: MethodTooLong \u2014 dispatch_lsp_tool 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":"src/tool_runtime/lsp_tools.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"12617fac9e0757aa35881809aeb21adbadf10dca4b5acde3597f18461a471c88"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ToolRuntime: TooManyFields \u2014 42 stored fields beside 522 methods. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runtime.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"922ed26d01c25115f858145da8016264167cbe0c491f7ee1c4be952991a11351"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.goal_plan_recheck_attention_with_clock: MethodTooLong \u2014 goal_plan_recheck_attention_with_clock 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":"src/tool_runtime/goal.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1479a3193d5dd372291f8d793c9875cf9341f7973a20772293abfe4fb68993"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanonicalOrchestrationHost.invoke_tool: MethodTooLong \u2014 invoke_tool 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":"src/tool_runtime/orchestration_host.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"485401dbb95827e466b6c890ac24e7a4f78d11bf5b7f7ac723310d7d20dcd7a7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Input: TooManyFields \u2014 42 stored fields. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54e61dd28d00e87a147955fa1824f5dfdd544c33245b578eb212e95b785aac8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ShowChangesStdout: TooManyFields \u2014 42 stored fields. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b622a3d5e192453a34da360fed4b13cd93804b83fa106deab3735eb1d16ce5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::environment::update::run_at: FunctionTooLong \u2014 webcodex_cli::environment::update::run_at runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/update.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"0443c7b14b1c49b7994f3723c0d49bea2657cc76bc1b241bc89e26bc6cb226c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeEnvironment.remove_project: MethodTooLong \u2014 remove_project runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ba174e3b57a2dcfc5ed57826661186cb6dc6739d8a70885f8690f3009fcb61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopCore.migrate_environment: MethodTooLong \u2014 migrate_environment 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":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"591c5efe78f3f045cc7a4688e451430728712d253ab7e2fb593a7ae9bbb180d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_environment::unified_update::source::verify_source_manifest_for_flavor: FunctionTooLong \u2014 webcodex_environment::unified_update::source::verify_source_manifest_for_flavor runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/source.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fd5d857ae51c79ab6730e088141249adbb37b9b260bdcc9c74df6afbdf571f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::mcp::resources::mcp_native_image_tool_result: FunctionTooLong \u2014 webcodex::mcp::resources::mcp_native_image_tool_result 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":"src/mcp/resources.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b9681a19b74e3418baa4ece1012e0223371afc165e61f00a594b2462202263"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.project_validate: MethodTooLong \u2014 project_validate 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":"src/tool_runtime/validation.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c342c7cde0234b8bc65a58029c81a0cf77711b668a63881f9ed6b750739e8bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_runtime_contracts::tool_audit::request::typed_agent_task_request_audit: FunctionTooLong \u2014 webcodex_tool_runtime_contracts::tool_audit::request::typed_agent_task_request_audit runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ae61acb3762ff77c78326bb360347b2d595171853190bc5fa98526a149ad05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::runner_quic::handle_quic_connection: FunctionTooLong \u2014 webcodex::runner_quic::handle_quic_connection 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":"src/runner_quic.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fdf086ffb0f6b385e49d2c81afee0c395e1fa1e4c2b907a6fea2d373c48ef5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_goals_authorized: MethodTooLong \u2014 dispatch_goals_authorized 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":"src/tool_runtime/dispatch/goals.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"227daee0b4df404d43b23855fa9e31a2029ed1907b84c28a161fd81df97066a1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JobManager: TooManyMethods \u2014 41 methods, declared across 12 files: job_manager/shutdown.rs (8), webcodex_runner/job_manager.rs (7), job_manager/delivery.rs (5), job_manager/detached.rs (5), \u002B8 more file(s). The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"449134faefcbd284abdb6ae5a37757f769bd2299c246b3d3d70cba709a77fa28"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: webcodex::tool_runtime::files::search: TooManyFunctions \u2014 41 free functions. The bar is 30 free functions; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/search.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9be6a92a50143890595fa569e9c67089e0df60cb3135f813dac490a16df18a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/workspace_checkpoint.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":"crates/webcodex-workspace/src/workspace_checkpoint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"698a73928b1e1581475c5d9bca43e20f5021a32b552fcaee34d4e20d45d3c605"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConnectionRuntimes.monitor: MethodTooLong \u2014 monitor 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":"apps/desktop/src-tauri/src/connections.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"70105f64a1b834a1c84f2bbed03f18097cf225fc2b2285e97f891c5186b555f6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerRegistry.job_log_with_paging_for_auth: MethodTooLong \u2014 job_log_with_paging_for_auth runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"960c6fd1377a39ff791b72ce605468f5d530cebfe340f7c2b5cec33d96cb9234"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JobManager.enqueue: MethodTooLong \u2014 enqueue runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"261a5f34be6688b1f1647fbe1696cf542ac1f7a6798e4d556d6978850272b30d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.post_peer_message_with_delivery: MethodTooLong \u2014 post_peer_message_with_delivery runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/peer_collaboration.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9e017226879107aa50f4c765bbe92a89cc0d191f2075364ad698c523ddd235"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::files::read_files_output_schema: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::files::read_files_output_schema runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a4e9b108209f4f417177a1ced385749ac09ac937161917eee31ec75b124bab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/polling.rs: FileTooLong \u2014 676 significant 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: RunnerRegistry (32-872). The bar is 500 significant lines; this is 176 over it, 1.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/polling.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3524bc97844c9ca31792db7adefae5b8e1eb161c8465fb6b91b2c85a92194ebc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner_registry::job_updates::frozen_shell_job_log_projection: FunctionTooLong \u2014 webcodex_runner_registry::job_updates::frozen_shell_job_log_projection runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"06952726066da445ee92188073a25372e01381a15fc86892882bf29753a70de2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_workspace::project_overview::build_project_overview: FunctionTooLong \u2014 webcodex_workspace::project_overview::build_project_overview runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_overview.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a316156fe7dc91dc7364719eb992be8cd559458d12ee9be5e99a1ff8a16c7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreparedRuntimeCall.prepare: MethodTooLong \u2014 prepare 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":"src/mcp/tools/call.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"19be6a0d8aaa0ac01cf0bc62b0ab736f469dcdf3a7d51b2bef6ebad7c7ddc116"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.runtime_status_inner: MethodTooLong \u2014 runtime_status_inner 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":"src/tool_runtime/runtime_info.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4a142936d37c854a559054b65dfc7ee15796dc3bdf681bf7f4961c5e555a1c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.open_session_shell: MethodTooLong \u2014 open_session_shell 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":"src/tool_runtime/session_shell.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a059a8e765f4f4a4e9618738fe63f93c1c2bd78983a8c600a8c57562a501f70e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/checkpoint.rs: FileTooLong \u2014 672 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 172 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":"src/tool_runtime/checkpoint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e352ef82e0465197ea7dd6ae8e9d4eb78fd7e7af6d66058d186aa7ad700846c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/search_project_texts.rs: FileTooLong \u2014 670 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 170 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/search_project_texts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16095a3167b9fd18f0341179112727edf6ef8fe53846a9755eeb7dca68191181"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_desktop::tray::build_menu: FunctionTooLong \u2014 webcodex_desktop::tray::build_menu 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":"apps/desktop/src-tauri/src/tray.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c0b961d7efe1741153a16e62bbd903e69115aa42d087444bf15dddeff94b26"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RunnerCapacityPanel.RunnerCapacitySettings: FunctionTooLong \u2014 RunnerCapacitySettings 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":"apps/desktop/src/features/settings/RunnerCapacityPanel.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e462c11b313ed544ce3ffd2d7e3118035e6e0a7efc0314a2007479bbad1e93"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_core::validation_identity::structured_validation_target_identity: FunctionTooLong \u2014 webcodex_core::validation_identity::structured_validation_target_identity runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_identity.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2451fcdeec717d1ebb32b8235da03503fdd1748ccb040b5c9bafb352cacb4fd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeEnvironment.reconcile: MethodTooLong \u2014 reconcile runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9819f13b2884816595a95f36e91d24cbbe05c370672722f6bfd9db8f1e3140d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.rotate_oauth_refresh_token: MethodTooLong \u2014 rotate_oauth_refresh_token runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa156c2df9b20a2f9639aa832dcf30121fcbccc1f091885aa6c0759e82448ea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.project_format: MethodTooLong \u2014 project_format 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":"src/tool_runtime/project_format.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"735c771eb329f87c5d777658fae6deea104cabe7832637e97e6115b0df32ef47"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ShellJobInfo: TooManyFields \u2014 40 stored fields. The bar is 30 stored fields; this is 10 over it, 1.33\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"399fbd674a4dc7e1bed9cb4969c6eb4a23c9de6fa7387bc8ba7ad5673f5bb0b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fake_server.rs: FileTooLong \u2014 666 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 166 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"066c4c7c8c1e5e6577d637368f0a7d0f76703161ff34929e2df3abc5276b1acc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/persistence.rs: FileTooLong \u2014 666 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 166 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/persistence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"986afa44275ab38a2e2376c59ce85f4a987e398a254aa3dd98fcdaf753eb44a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner_config::generated_runner_config_toml: FunctionTooLong \u2014 webcodex_runner_config::generated_runner_config_toml runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-config/src/lib.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fa965f8728f380c993afc313161a12ed0dd404c8ac51ac1598c056f024404e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.admin_dashboard_snapshot: MethodTooLong \u2014 admin_dashboard_snapshot 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":"src/tool_runtime/admin_dashboard.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"837822dbf1663667becb074a0fbdd8cbcaea2a3d68818e2442e5be483af08132"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_skills_authorized: MethodTooLong \u2014 dispatch_skills_authorized 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":"src/tool_runtime/dispatch/skills.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fd9a187e40e1cdb7c3aa2f99dfb76693ea47c92711fb18758137ae43dc0f08"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodingAgentManager.apply_pre_prompt_config_option: MethodTooLong \u2014 apply_pre_prompt_config_option runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae5965371303114f027575e86269c726b7836297e0f232583a1e7cabcc23e85"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::git_review::classify_path: FunctionTooLong \u2014 webcodex::tool_runtime::git_review::classify_path 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":"src/tool_runtime/git_review.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2590d9823a38db102d5ccac25d8e94117d5cb77c0bcdf56af50af87033a752"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.run_skill_resource: MethodTooLong \u2014 run_skill_resource 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":"src/tool_runtime/skills.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb047f52a6521b4a1152c424c7d68b8a5ed0f5cb5db4fdbc5fafb5842abec1e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/files.rs: FileTooLong \u2014 658 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 158 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7241433616c259192303dc5220e5fe5ab87e7ca80caf3713238dc8820b9fa400"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: job_updates/start.rs: FileTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: JobStartPlan (2 blocks, 166-786). The bar is 500 significant lines; this is 156 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates/start.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"144b31e52b7c96ba258e6d1fb845d56299c6714d03ad92bb3d2f685892917d51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ssh_resource_gateway.rs: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 153 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ssh_resource_gateway.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3f8c388d53b2ca0de41f1fc2887def8788e8385db8a616f4dead17c8cde67e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SkillStore: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3542b3b407c942bde9e02175bbcb063acbed4b331d640b2ef3e0f5b6a28bf35"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ShellJobRecord: TooManyFields \u2014 39 stored fields beside 2 methods. The bar is 30 stored fields; this is 9 over it, 1.30\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/state.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a26152af31879453072b3090c5f10428beecb47c1bea170f6a0d0c17327eb3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerRegistry.start_job: MethodTooLong \u2014 start_job runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e04c96a7cfa8613fcf1302ba8f63425936f69f47700b65c1f56da8ee2cac32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.start_agent_task_attempt_with_now: MethodTooLong \u2014 start_agent_task_attempt_with_now runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/operations.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"8525f37a76dcc4842a23299a89f463a02d572251c592c4d2663e009ec59c2eb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: projects/lifecycle.rs: FileTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 149 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"249a217803af2ac0fbf430ec9b33762260793539609c7df6628a1ac96f562d59"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: WorkspaceContext.WorkspaceProvider: FunctionTooLong \u2014 WorkspaceProvider runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/workspace/WorkspaceContext.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce27fb248785c3c3406e982d84cf1ff335fbb9c4c40b8478f7dacaa06c1d68c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeEnvironment.upgrade_rollback_with_target: MethodTooLong \u2014 upgrade_rollback_with_target runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5859a546f34a45a95304922147c7fefc4a01a871ca2e3f8de9ef701e1ee54fe0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config.parse: MethodTooLong \u2014 parse runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/bin/webcodex-tunnel/config.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40cf3d7c943682f140e3c8c756ded4371c482e91e43d9a1c6d40c11139288b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::artifacts::inspection::ooxml_mime_from_file: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::artifacts::inspection::ooxml_mime_from_file runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd48af620730111b3df97aadf4a0eab3288e8f303980ba8395416012bf6bf0a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::oauth_http::shared_key_bridge::validate_bridge_authorize_request: FunctionTooLong \u2014 webcodex::oauth_http::shared_key_bridge::validate_bridge_authorize_request 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":"src/oauth_http/shared_key_bridge.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb42d48373b891ae88aa2b32fb565acc64ee689b777f604768b401c033c8cebf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/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), declaring 86 free functions. The bar is 500 significant lines; this is 142 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/commands/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4630d631e66ed969bc94340a9c122476af65af780ab43fd02129b34a4fafbb33"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopCore.switch_runtime_transaction: MethodTooLong \u2014 switch_runtime_transaction runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/runtime_shell.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a0cd1073cc8220a01bdf723670cec895af4b84a474c2895802d03592fd566f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerRuntimeState.cleanup: MethodTooLong \u2014 cleanup runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/runtime.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39684826d7381cbd869abda8cfc43bbd037b295b68f1b3a1c25e768f2daf01d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::sessions::session_handoff_goal_context_schema: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::sessions::session_handoff_goal_context_schema runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/sessions.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"583595ae00f1db859d6fc4a914557d1f80f911605c49e8c54076f00441e0d4a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.code_mode_exec: MethodTooLong \u2014 code_mode_exec runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/code_mode.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c00209ecadf993213559f780c474fc33f8287530a2d7acbc0441f6e38078e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex/cli.rs: FileTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 138 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12006cf249ff8863e56586519f24af501abec08e17779f59951c308f97ba3950"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_core::plugin::preflight_plugin_schema_node: FunctionTooLong \u2014 webcodex_core::plugin::preflight_plugin_schema_node runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/plugin.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"083f202657bfbedb97f44af6c3415654945cf174370f2b0f44d09799c10b55c8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeEnvironment.add_project: MethodTooLong \u2014 add_project runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddff2b3f6b7dd861aea3e70a1d6f016a041bcd2d24c204c580d23af567c9b99"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.create_conversation: MethodTooLong \u2014 create_conversation runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f20c53842ef3574a9d50d0d61b0e92aae1a1003a6c74d529d65829ae3a3ee4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::browser::output_schema_for_tool: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::browser::output_schema_for_tool runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/browser.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"781aced1277fc70c3340f711cd024140008aba0ac2d81ea8b164896719daeac0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::oauth_http::managed_authorize::authorize_issue_with_context: FunctionTooLong \u2014 webcodex::oauth_http::managed_authorize::authorize_issue_with_context 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":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"56934e803c7c983637217fc2466f9f7c164f594f037f7fcfd2022624b2bf6a1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::computer_tools::snapshot_receipts::validate_snapshot: FunctionTooLong \u2014 webcodex::tool_runtime::computer_tools::snapshot_receipts::validate_snapshot 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":"src/tool_runtime/computer_tools/snapshot_receipts.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69150d38bded09588e68600433bc85541751825e2282df01f092a5d0aa90bbc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/dispatch.rs: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 134 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d70de5de50bbd1c8a1f139c96d46d6df048ed53f051896669151c9b6d38631"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: fi: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88f25612e2eef1bae30be64f9cda3bb602dc5cc62311c339f5b26c9324b7236"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_desktop::desktop_builder: FunctionTooLong \u2014 webcodex_desktop::desktop_builder 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":"apps/desktop/src-tauri/src/lib.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ac2a262604cacd2c13d7790b85fec51ea31a6182c80caea762c8625cf12950"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_desktop::state::path_inventory::collect_inventory: FunctionTooLong \u2014 webcodex_desktop::state::path_inventory::collect_inventory 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":"apps/desktop/src-tauri/src/state/path_inventory.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"c637ccfa5953ae7b03b95d662c78a3396cd8149e9cd1da831747fb372f082dac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::main: FunctionTooLong \u2014 webcodex_runner::main runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/main.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0edf5210318e025915957c2d273de36e01025313a1ce88a03bbfaec37bda055"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_workspace::workspace_checkpoint::restore_workspace_checkpoint_inner: FunctionTooLong \u2014 webcodex_workspace::workspace_checkpoint::restore_workspace_checkpoint_inner runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/workspace_checkpoint.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e789c70d19c473a798026cc7a63524c86da9c609f2c12020a593f9993a8fd8f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::oauth_http::managed_authorize::oauth_authorize: FunctionTooLong \u2014 webcodex::oauth_http::managed_authorize::oauth_authorize 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":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2137517db49a4a6e5370aa5669a01518210bf705a750185ad4f81f90031aab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/result_projection.rs: FileTooLong \u2014 629 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 129 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/result_projection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff50354338122cf162adf6870eff8b0cc52120381639a86e7438e145e52402fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppState.diagnostics: MethodTooLong \u2014 diagnostics 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":"apps/desktop/src-tauri/src/state/diagnostics.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f059daa438c85e4206979afbc9e2fdddc00ebe71d27e4a89a966b460f5b8d6e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::projects::lifecycle::handle_project_lifecycle_operation: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::projects::lifecycle::handle_project_lifecycle_operation runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"af05c8d563a64ae6dd1b859870d368e6516f38d8f701448f9871f9f43e9243aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::transport::poll_dispatch::handle_one_poll: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::transport::poll_dispatch::handle_one_poll runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/poll_dispatch.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c50e316e8cdc57ba78fa7dbc2977d503ceed0d72d65eba84889a3ec99bd91a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_store::agent_wait::load_owned_agent_wait_detail: FunctionTooLong \u2014 webcodex_store::agent_wait::load_owned_agent_wait_detail runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wait.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed383b8c12187ce06a222cbcfeb046de846d8a0a91a78be95d2e4bd79e3864b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.ensure_agent_wake_schema: MethodTooLong \u2014 ensure_agent_wake_schema runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf92fe1be2b406126c149ae5638b9834673cc5af1a9e0b704ada93efa930706a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.exchange_oauth_authorization_code_for_tokens: MethodTooLong \u2014 exchange_oauth_authorization_code_for_tokens runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"958043cc7206c15e08fe30b07c9e7b0c3f822b5b93892e6a11c512294dacae4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::computer_tools::responses::validate_computer_response: FunctionTooLong \u2014 webcodex::tool_runtime::computer_tools::responses::validate_computer_response 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":"src/tool_runtime/computer_tools/responses.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"745f1c0aa54f05b65e94441d378cb24b34b5ee89daed0098b3d4d043dfb535e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_cli/controller_tui.rs: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 124 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_tui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a8b385abd20ec051d667796c68b0e481da01aded651d79e1f548d71a905d1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_environment::tunnel_recovery::recover: FunctionTooLong \u2014 webcodex_environment::tunnel_recovery::recover runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel_recovery.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f330216eddf772a2d7f3fa9eea66fd754af8a63b28aa77872124c74afa98c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_workflow_session::task_context::task_context_value: FunctionTooLong \u2014 webcodex_workflow_session::task_context::task_context_value runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/task_context.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33aac2123c492e6205803201c0677d13f13b84429fc7c71116cc45cb7b8a873"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OAuth2Verifier.verify_for_ingress_sync: MethodTooLong \u2014 verify_for_ingress_sync 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":"src/auth/tokens.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9ebfb620021bdf32e6d3c082c581d887ab01b865befed4c0337aa16323a24f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.read_project_artifact: MethodTooLong \u2014 read_project_artifact 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":"src/tool_runtime/files/artifacts.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b78e4489594b2663269ce37010f288a7ea9656197607a1800c4bbd41347980b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_shell_tool: MethodTooLong \u2014 dispatch_shell_tool 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":"src/tool_runtime/shell_tools.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff8fc0628c97e35fc46d1d2ce7a16404b0306a0d4c88b8b946dadd558be585f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.build_cargo_result: MethodTooLong \u2014 build_cargo_result 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":"src/tool_runtime/validation.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a493b8582acb3a551ff51855c3fd50f8d31b498f7edda228fb6341fe9f93dfb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bridge.rs: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/bridge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7262fa318af3ca68d23cd91dc8b16ddd129b74a7e651e683d214920b845638c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unified_update/download.rs: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 66% of them inside a single declaration: UpdateManager (2 blocks, 151-669). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/download.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9084c4840540d1e4fa9331f565c95227c83568efd2b7b675d1295bed924e7680"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/control_sidecar.rs: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 115 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9e47bce5bb23d8c60b85b1261f21eccfeb41419ae1690fe03d31e7b274c87d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopCore.persistent_tunnel_profile_action: MethodTooLong \u2014 persistent_tunnel_profile_action 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":"apps/desktop/src-tauri/src/state/connections.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaf0f5cc675f4817c069fd2622249db9c0c18da39c964b5ee5b7be16e2c9ce6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BrowserSupervisor.snapshot_query: MethodTooLong \u2014 snapshot_query runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df362594f39379affcd7d2f3967f0f19dc339631cba7703892c111e3ff0e3d8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.resolve_project_input_for_auth: MethodTooLong \u2014 resolve_project_input_for_auth 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":"src/tool_runtime/project_resolution.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47f93b36ef2fa2a92d1159b6c415c07b4cad6fec108f40db286789b4b13208d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.run_readonly_validation: MethodTooLong \u2014 run_readonly_validation 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":"src/tool_runtime/validation.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c4bbb3e28411bdc5357b7e4936f9f96c01328c49f6efdd170a468d41fea226"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/orchestration_host.rs: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 113 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/orchestration_host.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8d5efac09244549df256dcf93320b64f4e1faecd8beb746b80d32bb224cd13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/project_format.rs: FileTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 110 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13554a6b07c80ccc3dd3e57ebb9d6f3aa9adc4bad27ed90a4cee571e814b635"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::cloudflare_host::run_cloudflare_tunnel_with_stop: FunctionTooLong \u2014 webcodex::cloudflare_host::run_cloudflare_tunnel_with_stop 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":"src/cloudflare_host.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2e2e3aa9b86575a6f6bd92ec39a7ab41d6963fb0f1e9eca8e77be95d65f4d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::oauth_http::token::handle_authorization_code_grant: FunctionTooLong \u2014 webcodex::oauth_http::token::handle_authorization_code_grant 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":"src/oauth_http/token.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a7db000b16de08afdc7fafa7038edf020d0bbf9f49304fe028eeaebf093bd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_workflows_authorized: MethodTooLong \u2014 dispatch_workflows_authorized 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":"src/tool_runtime/dispatch/workflows.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b94a97fa270f2419c09419186aaa09af2bca7706fc40c4142f092e665a257d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.git_commit_paths: MethodTooLong \u2014 git_commit_paths 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":"src/tool_runtime/git/mutations.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6f457a8df61ced20c9bb973abc328bbd4b46f8a6d1a1009b21beff0203fa60"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::goal::goal_continuity_observation: FunctionTooLong \u2014 webcodex::tool_runtime::goal::goal_continuity_observation 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":"src/tool_runtime/goal.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bba8b3be22b95f336f6215a2650a22c593bc684cfcb26e0c4aafbf781ddefd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::specialized::try_dispatch_specialized_gateway: FunctionTooLong \u2014 webcodex::tool_runtime::specialized::try_dispatch_specialized_gateway 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":"src/tool_runtime/specialized.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7e3da69a2d59605e4cf2f34cea7d82f9c16c681551da2722d6055686f6a09c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: coding_task/startup.rs: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: ToolRuntime (51-758). The bar is 500 significant lines; this is 105 over it, 1.21\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":"src/tool_runtime/coding_task/startup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"750bf0d841dd0da8bfdcad76b5946cdb097b427a01c4d4f904604b7366ff98e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_browser::cdp::clickable::admit_clickable_cards: FunctionTooLong \u2014 webcodex_browser::cdp::clickable::admit_clickable_cards runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/clickable.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d024e53895a0eb168119b346c48b133616079630475bd4b88005ad0175935ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_finish: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_finish runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40bfc745991721fe07ba45c042b7a8ba56adfd369070199cddf67e289ca349f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::memory::output_schema_for_tool: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::memory::output_schema_for_tool runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/memory.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3630fbe0d9f3bd77109ced1a5b1f7c5223cd72e1cc79a392c621b6d94b034761"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_cli/server.rs: FileTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 103 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81e6d9401740b347bc78ba6f6a200914ee677f8494c56b8153079d65cd262f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: artifacts/inspection.rs: FileTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 103 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"deef0e04203e8869b2818455a88e780d49d8dfb5415f5439af83bf5a2aa88b82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/project_resolution.rs: FileTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: ToolRuntime (351-842). The bar is 500 significant lines; this is 103 over it, 1.21\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":"src/tool_runtime/project_resolution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2036a30dc9310bd969b1757238d0ed5426614a36494dcddf5c0e6ff071d23d48"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JobStartPlan: ClassTooLong \u2014 482 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 2 blocks, lines 166-786. The bar is 400 significant lines; this is 82 over it, 1.21\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates/start.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab9395893225ac1504e2d2bd07123443d40f9611b0517b013374fcd1e669df3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/structured_execution.rs: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 102 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/structured_execution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af368d956a5b0e9047813dbc8c54803b4159781ad3b2e4d36361eb9ed5a66ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.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":"src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a1dad5908b747bfb241f824bad89a171d16266749f9b9389507378dc4db8a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppState.cloudflare_connection: MethodTooLong \u2014 cloudflare_connection 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":"apps/desktop/src-tauri/src/state/cloudflare_connections.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ff739489a192853091b5b9922b4e900852568a2f2c8cef6bf6c9a7d47233b8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeEnvironment.doctor: MethodTooLong \u2014 doctor runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"49785fc1d9bbd6862bf164fd0b93d2debaafd039baf52fe90b6b7085126512b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_environment::upgrade::freeze_installer_upgrade: FunctionTooLong \u2014 webcodex_environment::upgrade::freeze_installer_upgrade runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"54771be5d48723bfc882702439e6ebf8e3328757af24a3d90a643400d5ffc3d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerRegistry.enqueue_browser: MethodTooLong \u2014 enqueue_browser runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":2763}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f69f9f2e53593607e83d43865568812f8634a439088fba066cd26cd44334e51"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.ensure_agent_task_schema: MethodTooLong \u2014 ensure_agent_task_schema runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/operations.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"33467b861e1420eee69ff53c41535b2f5de96a96ce590507b6b3b7f56204aafe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.start_agent_task_endpoint_continuation_with_now: MethodTooLong \u2014 start_agent_task_endpoint_continuation_with_now runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/operations.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb1dc6199e269003be7171d2053b7c1ce71f8870dee74d653ff7e02e9848ffd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::runner_session::run_runner_session_with_pump: FunctionTooLong \u2014 webcodex::runner_session::run_runner_session_with_pump 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":"src/runner_session.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abbebf568a1af2dcbe620679ffb19c116e7251f2716e62d685ee2e53c0f3bd8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.write_project_file: MethodTooLong \u2014 write_project_file 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":"src/tool_runtime/files/mutations/write.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8433d8fda254231d5ce8bff39310f1dcc0c556b5c43da6fce32163d9a00435"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.enrich_workbench_execution: MethodTooLong \u2014 enrich_workbench_execution 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":"src/tool_runtime/workbench_execution.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c74809a01b04b8193960d1f13cbda2e363489f91df69c106a7a1a38c08e0ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ActionAuditEventInput: TooManyFields \u2014 36 stored fields. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/action_audit_sessions.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"be03133831b40b731d8ac87756185c88701d9ddc80b6914291d766b32eb41f45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: upgrade/windows_package.rs: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 96 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/windows_package.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34761093b0d6ce58aff85cb8c966b75a6edef3a50a947c8db931141e5b982d68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mutations/text_edits.rs: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 96 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/text_edits.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42f4ef420e381edb7bedcd240d0ddf1d4e5f5f614f7bb2eb98bdcdbc22b5f4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::parse_runner_install_service_with_identity: FunctionTooLong \u2014 webcodex_cli::parse_runner_install_service_with_identity runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be89f3615463d3421a7b5075466d41f96a16124c10b5db610b23c8d140bf5c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdc2b5424a2e5d54a512c03835ddb6219c18b3d826b9531ab62a99378a3707a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JobManager.start_detached_process_job: MethodTooLong \u2014 start_detached_process_job runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/detached.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"638c9b5905e59ab67cba952f1ebb24c2bf98afa4208d16ae17fcc746f626f267"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::shell::run::run_shell_impl: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::shell::run::run_shell_impl runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/run.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9213a6946104506f4f7ed580e0e54c66c2e524720948c8359cfef2e1c6ad4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::mcp::tools::mcp_tools_list_payload_with_exposure: FunctionTooLong \u2014 webcodex::mcp::tools::mcp_tools_list_payload_with_exposure runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5d0c177197c7b73e9ad35ee28e017d2fca3c07bf1987390c9261ac0d857bd3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.coding_agent_diagnose: MethodTooLong \u2014 coding_agent_diagnose runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"073f20d770207093280b8ff0fdc93b1a6a5e03bc087e491c283976783bc7e995"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/peer_collaboration.rs: FileTooLong \u2014 590 significant 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: Database (86-633). The bar is 500 significant lines; this is 90 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":"crates/webcodex-store/src/peer_collaboration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c9be8a7e2a9316f753f7cb809ea675b7b1f1e33f6c796dd4b3173f52ecaf9b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RetainedJobReceipt.validate: MethodTooLong \u2014 validate runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_job_receipt.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f759c5b1e9088cab0e5f8dc1951ce0b132c619fca549ef5c987cc8efb695358"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeEnvironment.control_tunnel_with_observation: MethodTooLong \u2014 control_tunnel_with_observation runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"689270f0eb7ea625380ede0d381c954a4b09f7d49ced9e7c0a001f01053755aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PendingDispatchFence.synchronous_rejection: MethodTooLong \u2014 synchronous_rejection runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/dispatch_fence.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf3c4a902aa7afe81c9e0946060c243d2917c06bc5d90a36c43d15086792048"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner_registry::reconciliation::reconcile_inventory_locked: FunctionTooLong \u2014 webcodex_runner_registry::reconciliation::reconcile_inventory_locked runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"7144c3824222d0c29d1f94449617b8c3079a06abb0e939ec3921e971ed122198"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShellExecutionContext.run_internal_posix_script_impl: MethodTooLong \u2014 run_internal_posix_script_impl runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/internal.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"353ef564d924a46abd7f49cb35a6d234dc8c10181e3d347d7f1c9e0a8bb0ba85"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CloudflareOwner.from_root: MethodTooLong \u2014 from_root 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":"src/cloudflare_ingress.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4844dfc7b79e41ef5bbded22655f82d1c6d8cf6fced694b4cfcdd65faaf8e7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/window_activity.rs: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: Database (67-499). The bar is 500 significant lines; this is 88 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":"crates/webcodex-store/src/window_activity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2817401552062516ebb8f4e6eabd3595fd1189781ef4a4eb75ab3999a66bb66"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CloudflareControl: ClassTooLong \u2014 470 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 4 blocks, lines 58-997. The bar is 400 significant lines; this is 70 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cloudflare_ingress.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb10c3116c56f95a8289559c0d6ff61f643b21822f4d001d93337c0199a36fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/plugin.ts: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 86 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":"plugins/campus-application/src/plugin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14b70f9a358bffff15f715372312a8f38092107e2fb41a77801794389921ce0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/call.rs: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 86 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":"src/mcp/tools/call.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adae6eab83f4067dafac0999e0de9623bb35066bac960690155043b8f324e54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/validation.rs: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 85 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85f76fbf4d08d21eee325c629db2cdc847f1fca0b757ffda8e6a5e14016d24f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.associate_goal_reference: MethodTooLong \u2014 associate_goal_reference runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6310a363ffa65cfff5e4ed9ee0a045c79263112b4a7969008a0ac5ae41a6c00e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.work_result_files: MethodTooLong \u2014 work_result_files 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":"src/tool_runtime/changes.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd0419b528886540649f5bff4967a20154715975b1c18463ef7234009f72512"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.call_agent_lsp: MethodTooLong \u2014 call_agent_lsp 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":"src/tool_runtime/lsp_tools.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe37f8513532cc9e9ae723598d8d42815b5840d49a8f7573c9bdbaceb4bf20e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: webcodex_tool_contracts::tool_policy: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_policy.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f42f5713237490d974debaafcd6316ff1f7e8e147291a4847ab053f42e659b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ActionEventRecord: TooManyFields \u2014 35 stored fields. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/models.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee4d41a672bde05169cd3cf4cb166ffe13e855ceba90b04227038a9b437374c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/coding_agent.rs: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 83 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2d4138027b2bfee8ba32bbfd7b9ec504e0fd953d4aee2537ed994936f7e16b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::patches::execute_planned_file_changes: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::patches::execute_planned_file_changes runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7dc372f5bb35f2789dab852606af47717723a358a3ba8b0c3809bcde2d8bb77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::project_build::plan: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::project_build::plan runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb98e56cb7439b2f9c3cda72c53a45509ca730647a051d57f7b05beeb64d222"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::mcp::tools::call::specialized::plugin: FunctionTooLong \u2014 webcodex::mcp::tools::call::specialized::plugin runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call/specialized.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2df63a20cfb4114a3a9556816639c256b59949252a89e134c7ba6a4e2cdae5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.search_one_resolved_project_text_outcome: MethodTooLong \u2014 search_one_resolved_project_text_outcome runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/search.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e63107e07a42ed5cb5cd3e977752fce81379061a1196e0617c99ba8fa76afb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/window_activity.rs: FileTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 79 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/window_activity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85005063e5f9a0071e49daba89f2ccc47c375ad89ee73427ea4a13042cd929ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: output_schemas/files.rs: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 76 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9849bfa97c31159b65f5e34802b3e3e1e795613117a71a05003efb21394dbaa9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopCore.apply_environment_record: MethodTooLong \u2014 apply_environment_record 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":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a97375ea59acde00e3e2add4b37cbac07fa740680191068f6ebdeea86e3d68"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeEnvironment.remove_tunnel_fenced: MethodTooLong \u2014 remove_tunnel_fenced runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4d77fab20dfc7cbce10f15289ddfcab8efb59f3ffee05654b3779b8e88ac46"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.cancel_agent_wait: MethodTooLong \u2014 cancel_agent_wait runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wait.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c36cd0900e099dc3625e3e67620cef85ac333d9a336ff1d125bc8832d060bf1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolCall.from_tool_name_with_normalization: MethodTooLong \u2014 from_tool_name_with_normalization runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/parsing.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97c2dbd80d1287224f64ac157ceb49397ca0a40d4d700bf3969bd44f7a6674e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_workflow_session::console::build_overview: FunctionTooLong \u2014 webcodex_workflow_session::console::build_overview runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/console.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d828394a1cf3ef863ef26dfd1c9feb4776a7faeceda379463c0cdaabdb5e7287"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_workflow_session::continuation::compare_scopes: FunctionTooLong \u2014 webcodex_workflow_session::continuation::compare_scopes runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/continuation.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"b661bcc55352b15c95ca724b2d7ed01c2ee7c3ebc18abd413ded5f577083b66d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_workflow_session::persistence::sanitize_persisted_event: FunctionTooLong \u2014 webcodex_workflow_session::persistence::sanitize_persisted_event runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/persistence.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab616330dbf996db1a96564cb38af68498f0ceadf9b990c4f3846de535c35df"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionStoreInner.replace_message: MethodTooLong \u2014 replace_message runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3071}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f489ce6d5871c7da2f295bc6dc9558828146195147515dabc93a52c9982c8ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentContinuationController.unregister_mcp_app_binding: MethodTooLong \u2014 unregister_mcp_app_binding 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":"src/agent_wake.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e36ed86ac362425e6458089c616646e2b5db0ce24ebc5135f204e4ea57278e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: service/linux.rs: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 74 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a5c1903b201cd0bec6a39faf979b3751f32d5717df4d11fdd1ce2bc3496cb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/hygiene.rs: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 74 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/hygiene.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7122a92bddc6e28780714bb193634ae2db29bab8e00464a5d8808daa0d5b6d60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/memory.rs: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: ToolRuntime (259-756). The bar is 500 significant lines; this is 74 over it, 1.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/memory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f8519ee88345278f6aea62bc55b433a4e55696702eda16f227eb5b6d06dff0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: projects/registration.rs: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 73 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/registration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae40fc18ef43c2f2526bd5535ac43e5aaf6a8a687dff0fe02bac8327ecca157c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/privilege.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":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df6ed917d14761df28bb3ebe5df732c26a7df103cfa6b1190c624d584cdafca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/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). The bar is 500 significant lines; this is 71 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":"crates/webcodex-validation/src/adapters/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c102e1ed9356f0ee3b01ee6d3cf410e48d6fcb8bef15a639e1bf963608e15e6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AdminProjectLifecycleService: ClassTooLong \u2014 456 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 2 blocks, lines 119-695. The bar is 400 significant lines; this is 56 over it, 1.14\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":"src/admin_project_lifecycle.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0fbd5f343401eb1377ca77ef6437f34b24c270d2c8bfca705d93556670ce2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/messages.rs: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: SessionStore (21-586). The bar is 500 significant lines; this is 70 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/messages.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"136640b93b20dc5cbcb1e3b4591530f910e4526e7596fe4ebce469a8da2a557b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/job_terminal_attention.rs: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 63% of them inside a single declaration: JobTerminalContinuationController (3 blocks, 92-545). The bar is 500 significant lines; this is 70 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":"src/job_terminal_attention.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b675f5311e2c6e620ea7d003b4994505abea3630ca5c34905cab89a0c3b1a34b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::patches::handle_write_project_file_request: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::patches::handle_write_project_file_request runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"756140e95262eba07aa6d972b735d3f374f8d5ba7efc3e58b50ce4bb0badd20b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::project_build::rust::run_rust_build: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::project_build::rust::run_rust_build runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build/rust.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca25a75d6e387c895daad8a9db51053e4cad0d5ceb7654796848567db8d7a90"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShellExecutionContext.run_process_with_output: MethodTooLong \u2014 run_process_with_output runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/process.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"79de2517243959331c468ad3ebfe688636a14ea699cd4b3f017c93e12cd21279"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::git::diff_hunks::git_diff_hunks_recovery_value: FunctionTooLong \u2014 webcodex::tool_runtime::git::diff_hunks::git_diff_hunks_recovery_value 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":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6d5b0f62ed42bab88ae389cbb6779a9d133d577202b820faf74825250f5532"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transport/result_submission.rs: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: RunnerSink (2 blocks, 54-735). The bar is 500 significant lines; this is 67 over it, 1.13\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1997a05b8d3158a977b8e697073f53c65e4eab83aaefae85c03ef2ec7e0e0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/project_entry_cloudflared.rs: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 67 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_cloudflared.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3367d087057909a0d6928632b99b9b5ab77a1bc9ff9981ad8d936709ec891909"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BrowserSupervisor.diagnostics: MethodTooLong \u2014 diagnostics runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc898451e24b70407e68554b3848ae362e522cc3721daf6a1fcc057855d607ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_environment::upgrade::parse_desktop_payload: FunctionTooLong \u2014 webcodex_environment::upgrade::parse_desktop_payload runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7a4efdb966202c2b9b83be4beffd2eaec2569a944ab9d39f3fafbf96dd534a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact_metadata: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact_metadata runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1a2255622cf2d991ea19f96dd523c710dbd066dcd7e2bdeca0831603fbe0e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_store::agent_wait::record_wait_match_in_transaction: FunctionTooLong \u2014 webcodex_store::agent_wait::record_wait_match_in_transaction runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wait.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"1368c074762245225c88b6dbc3eda6b68c1c78d1a641e2bd9913810983ee0db0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.project_peer_attention: MethodTooLong \u2014 project_peer_attention runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/peer_collaboration.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed24099450a30af9bbafe70e29d2a48f0261e69889c2d46f4035e2f88e0f2a78"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::project_entry_share::parse_share_options: FunctionTooLong \u2014 webcodex::project_entry_share::parse_share_options 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":"src/project_entry_share.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ee9232f2fbd9a00bc3e2a729a896230c7795677392c81ae0bc05319f4e23c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RunnerFileAccess.RunnerFileAccess: FunctionTooLong \u2014 RunnerFileAccess 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":"apps/desktop/src/features/settings/RunnerFileAccess.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d64612d549e3a1c3cbca9068701fb6d9bae684efb947f4718280c7a80b6ac6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.heartbeat_agent_task_attempt_with_now: MethodTooLong \u2014 heartbeat_agent_task_attempt_with_now runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/operations.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff7dfbefce2e6cc420bfe94e78c2b86872cbc9b1a0dac55485c3d9402620f47"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.prepare_agent_wake_dispatch: MethodTooLong \u2014 prepare_agent_wake_dispatch runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e1657e560ea37e6a274a38b09811f79cfeec42e3713e17202a20d126567a10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_cli/plugin.rs: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 58 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77987514340f2fcc7ea0a2318f89ce33a0db72e72f8679a0933950fff5372761"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/model_ergonomics_telemetry.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":"src/tool_runtime/model_ergonomics_telemetry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b23f8c65574e829e7da274f7737972553ce24d5e8b18dcfc7052f18fc12c66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tunnel_config.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), about 65% of them inside a single declaration: TunnelConfig (3 blocks, 62-587). The bar is 500 significant lines; this is 56 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":"apps/desktop/src-tauri/src/tunnel_config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4456b18c516a561d708717fa3b2109fc48dcc0b268f4e50c924e61355f91cdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: coding_task/closeout.rs: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: ToolRuntime (14-526). The bar is 500 significant lines; this is 55 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":"src/tool_runtime/coding_task/closeout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e444dcc99c23e98ab39d03fb59558d711c19da527a92c7537810353706f4606a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_environment::migration::import_original_files: FunctionTooLong \u2014 webcodex_environment::migration::import_original_files runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd9f64f1da16e343ce2289f0e8270c776f69aa595c1706a8b3fd16b6e9677f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::runner_skills::handle_runner_skill_request: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::runner_skills::handle_runner_skill_request runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/runner_skills.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5782d67cd89a5427e2c573e50dea46e0ad9a5b260343964c1d9067f0fde3358c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::transport::bootstrap::run_runner: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::transport::bootstrap::run_runner runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/bootstrap.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d94ea217adf32d35a5fa7dfe27f2447bcfbb4f4e283bf35ad6b8da30565c2ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.prepare_agent_task_coding_run_with_now: MethodTooLong \u2014 prepare_agent_task_coding_run_with_now runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/operations.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"0022a5705f68e65c45f397f210ff6719ff0eb13345cdca66e10e8dff104938a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.start_agent_task_coding_run: MethodTooLong \u2014 start_agent_task_coding_run 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":"src/tool_runtime/agent_task.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"d189641e060452623213a1782c1de14ab97536a495a625ba006b34f20431b5b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tray.rs: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 54 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":"apps/desktop/src-tauri/src/tray.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79a30e00f947952eb44a72192db4201cfbb4416878c65dc5e8a325b0f28def7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UpdateManager: TooManyMethods \u2014 33 methods, declared across 3 files: unified_update/download.rs (20), unified_update/install.rs (8), unified_update/view.rs (5). The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/download.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e8fc65f553c9a085f7f169de87cefdfb06dba58d9b565912e01ff79d22684f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CodingAgentManager: TooManyMethods \u2014 33 methods, declared across 5 files: coding_agent/lifecycle.rs (13), webcodex_runner/coding_agent.rs (9), coding_agent/setup.rs (5), coding_agent/run.rs (4), \u002B1 more file(s). The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca902b51053f2ac5987124a2220907bd46b9fc54f7764856f9c6aefe73ae1ea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: webcodex::auth::middleware: TooManyFunctions \u2014 33 free functions. The bar is 30 free functions; 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":"src/auth/middleware.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13c2995b03c3b2a1a184c2d54dd786596a9aee4e060fed3072139d13c8b0435"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: xn: 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":"src/mcp_pdf_app.html"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbc971d51535d0c18adcdedd2da33c3cd8a3ec1fdcbd0cdb64b9527945077d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_workflow_session::persistence::database::write_row: FunctionTooLong \u2014 webcodex_workflow_session::persistence::database::write_row runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/persistence/database.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"9664fd2e2b4893777d652c800aa2975e76af3dde515eafad3ce23c75e34bc0ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::computer_tools::snapshot_receipts::validate_display_snapshot: FunctionTooLong \u2014 webcodex::tool_runtime::computer_tools::snapshot_receipts::validate_display_snapshot 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":"src/tool_runtime/computer_tools/snapshot_receipts.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d168e7125f34bdce258ad4034dc54a23430889ee815d3a1669a28b992bf21dff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.prepare_managed_worktree: MethodTooLong \u2014 prepare_managed_worktree 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":"src/tool_runtime/projects.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cef3d795f4825c236362a244a18b8751f417b3fe018c4f9be05b2a4514b00c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.read_webcodex_resource: MethodTooLong \u2014 read_webcodex_resource 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":"src/tool_runtime/resource_references.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"a202a2d6388598087d6cae8158cbfc203aaa536b31bb7f35da49909b5c8ef938"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: connect/profile.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a8ba823da2a38e0cc6f622f3ae3e11a09f4b1a549c7d4425f200c66279798a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mcp_gateway.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_gateway.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8f2b0a0926efa25106a443a6fb4193f3e45a4d13e58047a0d58d8200bf4ad4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RuntimePanel.RuntimePanelContent: FunctionTooLong \u2014 RuntimePanelContent 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":"apps/desktop/src/features/settings/RuntimePanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"25515157363cda65e3403b6119a1078c14d74b88a62483753305da27bc22589e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_environment::inventory::entries::role_entries: FunctionTooLong \u2014 webcodex_environment::inventory::entries::role_entries runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/inventory/entries.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d53027b29012e7941a1533c1c8ad9eb738423ce2c82d9e404a0bccb5a92292"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_lsp::navigation::execute_lsp: FunctionTooLong \u2014 webcodex_lsp::navigation::execute_lsp runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"790c2aa0aab03f284175e9e94e86a8052830a824237b87437af44af3274d2fe6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_openai_tunnel::bin::webcodex-tunnel::main::execute: FunctionTooLong \u2014 webcodex_openai_tunnel::bin::webcodex-tunnel::main::execute runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/bin/webcodex-tunnel/main.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e595ecbe92ab8a51ef220adcc52222959bc7f1cbb0ee5f37d72ef8474984e882"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_tool_contracts::registry::output_schemas::checkpoints::output_schema_for_tool: FunctionTooLong \u2014 webcodex_tool_contracts::registry::output_schemas::checkpoints::output_schema_for_tool runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/checkpoints.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d40188fcda26edd0a9c6613cca0a517900b4b04021ca36457664631c2630b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_validation::recipe::resolve_validation_recipe_with_policies_and_exclusions: FunctionTooLong \u2014 webcodex_validation::recipe::resolve_validation_recipe_with_policies_and_exclusions runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/recipe.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e58f2f212c15af3ca173376754fbcb8e790dc4ddd51aec8eb77134321463a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_workspace::project_recipe::workspace_member_witnesses: FunctionTooLong \u2014 webcodex_workspace::project_recipe::workspace_member_witnesses runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c407da3ee5e7f09591ce6c4b44f475815b0d55d7c39e37661c06b0756bcb5db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::runner_ws::handle_runner_ws: FunctionTooLong \u2014 webcodex::runner_ws::handle_runner_ws 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":"src/runner_ws.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd39c1ca9ba43fb13ad8277022c9c70f082b70b9399a19ed7fe94a6d2330ea97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.query_runner_inventory: MethodTooLong \u2014 query_runner_inventory 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":"src/tool_runtime/runtime_info.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"d818429f487cef138b3c848ee7f9cd0299f78b978b07f23d292a6b4e1e6bd60e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PluginManager: ClassTooLong \u2014 434 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 3 blocks, lines 43-927. The bar is 400 significant lines; this is 34 over it, 1.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8acf8b632a1393e1d5675575ceb8825ad2fa7ea9e0e7b9002f46835e6aa41bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/shell.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 86% of them inside a single declaration: ToolRuntime (85-730). 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":"src/tool_runtime/shell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baed05b1e2e278d8a6ff7c2ee319d07107262ce775bb469c5a8e52721b6aa96e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PersistentShellManager.register_and_initialize: MethodTooLong \u2014 register_and_initialize runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/opening.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"abea7c62aa6445f84a0319e8026340db7d10ff291bf73401ebd9028e6a8f16d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::fake_claude_mcp::main: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::fake_claude_mcp::main runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_claude_mcp.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"791cc95b905683173af6a405165732fee8e0ae2c9cc878df33c0e884b3d19fed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolCall.project: MethodTooLong \u2014 project runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/parsing.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"abda2f9caf8604999612f294bb71c89496933e1e3922cafd12624e4bc52f221c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::runtime_console_http::goals::goal_detail_for_auth: FunctionTooLong \u2014 webcodex::runtime_console_http::goals::goal_detail_for_auth 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":"src/runtime_console_http/goals.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f85de4f2761dca2c5e29fc4be636ec8b2a0c6f8e3fdb86851edb83bc7f602a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_prepared_coding_agent_start: MethodTooLong \u2014 dispatch_prepared_coding_agent_start 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":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da78f4a1d99c82bf7f97f1474ce1e28f8998bbf4b9c2dd78ce428808da27c5d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.coding_agent_cancel: MethodTooLong \u2014 coding_agent_cancel 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":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b193a721cfd9f1fdccae3aab06312d11d367dff3bf4d5347a0e20550779512b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_cli/runner_service.rs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/runner_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd4e48af439b6d69fdd3c2bd6c20c6685e13032502dfd665047d2bb45929074"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: install/context.rs: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 36 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/install/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"069fcbcacb27bf92bea277f61371be391cc4dac209c0b9d13ea6c0a3643eb466"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::webcodex_cli::controller::parse_controller_command: FunctionTooLong \u2014 webcodex_cli::webcodex_cli::controller::parse_controller_command runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"94666206732d9aae62cdda6faaeefdc4a3aefe0b76a4c14d5f5fb6bb42285bf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_core::coding_agent::validate_coding_agent_run_snapshot: FunctionTooLong \u2014 webcodex_core::coding_agent::validate_coding_agent_run_snapshot runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed76bd3c19df7af14c26200d512e4001d18737a5511fc4e0c8d7fce0cbee5946"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JobStartPlan.into_operation: MethodTooLong \u2014 into_operation runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates/start.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9b37df951095b748965c7d4c24321dd0c23462314499bcb67e87f51ea196a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerRegistry.enqueue_project_file_mutation: MethodTooLong \u2014 enqueue_project_file_mutation runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"57eb8df5c1d2789c3f765664cf341badbb74e59e3e3c3d2bca2adf2902ffac19"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::oauth_http::managed_authorize::issue_managed_authorization_code: FunctionTooLong \u2014 webcodex::oauth_http::managed_authorize::issue_managed_authorization_code runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d457ca113d751cf2c12f045fdccc6187fe61570e7ed52ab9aeae542162e881"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::project_entry_setup::setup: FunctionTooLong \u2014 webcodex::project_entry_setup::setup runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_setup.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"74805b0ab716db841139be870c6332c979cd24b634a53eeb29a9ff1f50897234"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_git_tool: MethodTooLong \u2014 dispatch_git_tool runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git_tools.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7022b6dd867c3ea52b9d915e9ad6f1e890b9f8dc915ef5102fa8c0e7bd129ca3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Mn: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_pdf_app.html"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"454d1c9471213cdb84c165d0cb9d74db476507f28b26f6c2f17404827ea2e5cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: output_schemas/computer.rs: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b32c87b527f4f784328d0f7b74ce1d6f1fcdafaf532a393c3442376b7ef1a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_desktop::runtime_selection::probe: FunctionTooLong \u2014 webcodex_desktop::runtime_selection::probe 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":"apps/desktop/src-tauri/src/runtime_selection.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bbc922e57f3a00370100b4355e187bc47dcad6bff72f8871326051054cbe17"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: App.DesktopApp: FunctionTooLong \u2014 DesktopApp 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":"apps/desktop/src/App.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cbc9ad24d4f74e28134825865ad2e26280779c1ed16b4f5d534a419800f9e6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeEnvironment.ensure_project_authority: MethodTooLong \u2014 ensure_project_authority runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native/project_addition.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e819474cc4b3485e36d9cdd8a596f8adf9b32f25a0dd9686a0a11650aa2be5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.create_agent_task_at: MethodTooLong \u2014 create_agent_task_at runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/operations.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6810f49b3ea47f781f21691468ae5a24dcdcb2f460a668daff2b26e1025ffba0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_workspace::project_recipe::project_cargo_all_packages_provenance_inner: FunctionTooLong \u2014 webcodex_workspace::project_recipe::project_cargo_all_packages_provenance_inner runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f02f43bc4f21365180b70d4e138669d96dd1cb435e719e7512475961991be2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentContinuationController.acquire_mcp_app_wake: MethodTooLong \u2014 acquire_mcp_app_wake 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":"src/agent_wake.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a9758910693e72d5f229a3ff3fdd3b9a57e39758f30a66b9672c29ca72b3fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::mcp::presentation::git::show_changes_presentation: FunctionTooLong \u2014 webcodex::mcp::presentation::git::show_changes_presentation 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":"src/mcp/presentation/git.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"951e4ee9a861274f258069683c11e03f5af90432789c3bd4c412371dd1ee2c82"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.list_project_tracked_files: MethodTooLong \u2014 list_project_tracked_files 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":"src/tool_runtime/files/inspection.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca39dcb9cad04a3af6819254b03d497f3eb9af180681c6efc4d5a2e54b6b8989"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.wait_for_job_terminal: MethodTooLong \u2014 wait_for_job_terminal 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":"src/tool_runtime/job_terminal_wait.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd04d5d9b92b55285e634eef5f6611b5ff97f5cd88c7e540f7762023bbf46187"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.read_agent_skill_file: MethodTooLong \u2014 read_agent_skill_file 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":"src/tool_runtime/skills.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca375c0af7e418826d4246cbcea18820761cad3261001b2222e4bd31308dd60f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::surface::sparsify_tool_manifest_model_result: FunctionTooLong \u2014 webcodex::tool_runtime::surface::sparsify_tool_manifest_model_result 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":"src/tool_runtime/surface.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36949a293a587042c49a6d6056c2e5cbb1db30c9a96f224107e6501481b36fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: projects/catalog.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":"crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc79d9c1c4993cb6cf248b03832ee6585c88f41f191081f29e629162a015a774"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ControllerRuntime.start_component: MethodTooLong \u2014 start_component runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa11c6d1a74955c63bc5e0fea790279ca73d57b12dba2dcd34e61986734190f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_lsp::navigation::document_diagnostics: FunctionTooLong \u2014 webcodex_lsp::navigation::document_diagnostics runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9104e99275d306906de2188aacbfb0e87cf15611329902f134b1c03ba4556b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::oauth_http::project_share::validate_project_share_authorize_request: FunctionTooLong \u2014 webcodex::oauth_http::project_share::validate_project_share_authorize_request 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":"src/oauth_http/project_share.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a518e284dc58f6f89a9ab63c19bf83876e7710d5adc426871909a5bd23e8155d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostRecordResponse.finish: MethodTooLong \u2014 finish 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":"src/tool_runtime/kernel/postprocess.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c820db12b894fe06e28ee58e38be291c95a801b54647a0cea86a99c9744a519c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: macos/input.rs: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 24 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9022caf595a7288e11277a5bd7a0fc86a5aa4c754812def2197dcebfa68eea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mcp_gateway.rs: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3028c9d477a7fdb5e2baf91dfbdf7c6471df79a8063e023b74fb9d21a250ec14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: output_schemas/discovery.rs: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/discovery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"815e35f32f72136467b6e93d30f7dd4ec4aaeefb94349c93976734b2e5040d44"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/runtime_shell.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 22 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/runtime_shell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f363af6feff8be45bac27f417c47405de03e4565f6b12583186fb99e90e83231"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::action_audit_sessions::record_action_event_inner: FunctionTooLong \u2014 webcodex::action_audit_sessions::record_action_event_inner runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/action_audit_sessions.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff23de2d053e0b1364ac46bb43d3d9bd5b665d088df88562fb7baa2a4ff714a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::model_surface::project_suggested_tool_calls_in_value_node: FunctionTooLong \u2014 webcodex::model_surface::project_suggested_tool_calls_in_value_node 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":"src/model_surface.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cbb263d31e8eb7a76232ad84d2c1f75798b05bb41255b435ef656ffecdd955"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::project_entry_share::prepare_share_oauth_client: FunctionTooLong \u2014 webcodex::project_entry_share::prepare_share_oauth_client 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":"src/project_entry_share.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec9c7b4ec79cf840a12c8d3d0e93a91c5200fd1952b04f7821b87208903b0fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::runtime_console_http::runner_for_auth: FunctionTooLong \u2014 webcodex::runtime_console_http::runner_for_auth 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":"src/runtime_console_http.rs"},"region":{"startLine":1978}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d45b4cec4d28ec6a7c570a38e5b02c5ab30511074a5659addd147330b9fac9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::jobs::detected_job_summary_with_activity: FunctionTooLong \u2014 webcodex::tool_runtime::jobs::detected_job_summary_with_activity 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":"src/tool_runtime/jobs.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e030502a88b1e503a61e04d3c5094bbcfaa190382c968a5413c86f1064bffc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.post_peer_message_tool: MethodTooLong \u2014 post_peer_message_tool 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":"src/tool_runtime/peer_collaboration.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3dc558f5f64c6046cf0b5c80b0b234c5ea129e4420fe1055bb57c5a742a3e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.dispatch_runner_config_tool: MethodTooLong \u2014 dispatch_runner_config_tool 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":"src/tool_runtime/runner_config.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24c290ce9e7481cccf7d9280212c325038d936afbe5cac9b195f148ce10613e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WebCodexAdapter: 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":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49270f5e5f80730a0ac242c9a9bb0793aaea6ac45ad17e207eb7a387442862f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ComputerRuntime: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c49994b7ae749bca6e84f554aa35f9df6555f08207972fe0ac1a2e79f9ae17"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SessionRecord: TooManyFields \u2014 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/model.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"15638206bc845f2caf19b13b55a556d7385d93f9849ff0f86b3b19e36455c918"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lsp_bridge.rs: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/lsp_bridge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09711d00e88869a752a2633d4025bfd589eefb4243f8300aa10148f267b7d1c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: coding_agent/run.rs: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 99% of them inside a single declaration: CodingAgentManager (11-692). The bar is 500 significant lines; this is 16 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":"crates/webcodex-runner/src/webcodex_runner/coding_agent/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78594f4190b968c7dd7313322d8c0ab36547075362eb610440876f454e04f1fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::webcodex_cli::connect::disconnect::run_disconnect: FunctionTooLong \u2014 webcodex_cli::webcodex_cli::connect::disconnect::run_disconnect runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/disconnect.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"16728dd26c3dd7849fd36035be6136d43fdbaf4b89505b1e984620fdefa160cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::webcodex_cli::controller_tui::draw: FunctionTooLong \u2014 webcodex_cli::webcodex_cli::controller_tui::draw runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_tui.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"142417b28fa18f958c8900a8a59cfa2b42e376e9ed81974e2305a935138086a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_cli::webcodex_cli::ops::ops_smoke_preflight_report: FunctionTooLong \u2014 webcodex_cli::webcodex_cli::ops::ops_smoke_preflight_report runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/ops.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3ac9f6633740d54e46cfd37e071578c5f4ae7154c1049027ce4093eb78de42"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_computer::platform::windows::accessibility::accessibility_tree_impl: FunctionTooLong \u2014 webcodex_computer::platform::windows::accessibility::accessibility_tree_impl runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/accessibility.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dac4255ef9cdbb00a8f63e35e1c8d835913efd50906ed632ac5377d4a42743c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::project_format::plan: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::project_format::plan runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_format.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"27533c139524bd44f4bcc9b2f073275fd8e5f5df2a68b0a86d7393d645b69179"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::runtime_console_http::overview_primary::primary_for_auth: FunctionTooLong \u2014 webcodex::runtime_console_http::overview_primary::primary_for_auth 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":"src/runtime_console_http/overview_primary.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd3a72ce524e33db41c0b23d5a2c3fb03c00c3b3f1815722f674fb6694440b8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.prepare_coding_agent_start: MethodTooLong \u2014 prepare_coding_agent_start 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":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"04158e63f653ed76f7d913966fef4b52f03c30b27407ffa6de0694976293b43a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.list_project_files: MethodTooLong \u2014 list_project_files 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":"src/tool_runtime/files/inspection.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"067d1dfbad0ab36f62eced33865a6a52ce23492ba6cfae928d7b968c76e55a95"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.workspace_hygiene_check: MethodTooLong \u2014 workspace_hygiene_check 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":"src/tool_runtime/hygiene.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea0bf3287311c8b0ff88ea4454cc930574ac02a87e9882163234f9611fea1c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_runtime/session_context.rs: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d390935debef08176cce06fcb5dbfaeeacd3c1c6285d0529f3ec69ae6fc56ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/job_terminal_wait.rs: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/job_terminal_wait.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9cf1eff599e03a7d92bd699b31a83c6ebda5c8d640f58568fb7758bc5f8f1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: platform/unix.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":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5ccf5a612551c88e071b912506d3b2cd54e696fb5e995d79192c1d0e3d6378"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: coding_task/projection.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":"src/tool_runtime/coding_task/projection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"393a1adaaa74a320f8159a9e5b9ee131b6179269978f44e86549ee0564326256"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UpdateManager: ClassTooLong \u2014 409 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 33 methods, 2 blocks, lines 151-669. The bar is 400 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/download.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1c226414074e158256581b177fcd222a7dbc7e95792c1750253ba5cedc3826"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: service/mod.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b13cf1fed0f9c0ed9fe744d8d9b6dc813572dfe59c7acf78e8c0623c0d7d21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \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). The bar is 500 significant lines; this is 10 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":"apps/desktop/src-tauri/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5f49db60e652fd0d473dd4f80230ba94a7fe74fa0a19cb93fca04739b0912e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useRuntimeUpdates.useRuntimeUpdates: FunctionTooLong \u2014 useRuntimeUpdates runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"apps/desktop/src/hooks/useRuntimeUpdates.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2443631dfba12dda4f8c4ad4a8dede21e4e3ab81dd52a8d072adf6ce39d62b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::files::handle_skill_read_file_request: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::files::handle_skill_read_file_request runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/files.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"09532c9f9287bf2b606f7191452ee7977bd33b5f877c62baa9cf0264bb15ea13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::mcp::cli::text::native::render: FunctionTooLong \u2014 webcodex::mcp::cli::text::native::render 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":"src/mcp/cli/text/native.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"678a893c015fe0006cc62960e67e83a7cd23f9e0cc042eb888c9aef1b3106853"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::oauth_http::token::handle_refresh_token_grant: FunctionTooLong \u2014 webcodex::oauth_http::token::handle_refresh_token_grant 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":"src/oauth_http/token.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5eb66c32915f0596f5134004f3f0d4dc54bc53de5aa96472279a0fe955fc717"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::runtime_console_http::workflow_session_detail_with_windows: FunctionTooLong \u2014 webcodex::runtime_console_http::workflow_session_detail_with_windows 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":"src/runtime_console_http.rs"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c72c368b93a9c81e19d43b10e59adad08b899fd34bce1f419e372fff5f5300"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/remote_shell.rs: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/remote_shell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8897108c638d695190c1678bc77b9d7f886f75f72b9d8ace79d25d6d7d6036fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopCore.save_persistent_tunnel_profile: MethodTooLong \u2014 save_persistent_tunnel_profile 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":"apps/desktop/src-tauri/src/state/connections.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8576c1027589f7996c7b1d826cd8baebc4c093f82aa7f1e1394da6861bf52d36"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex_runner::webcodex_runner::config::validate_acp_config: FunctionTooLong \u2014 webcodex_runner::webcodex_runner::config::validate_acp_config runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbad96968ba2d9dab7565ad8108fae14d55a8fd88aec7b2f335cef9f5cdb8de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShellExecutionContext.run_script: MethodTooLong \u2014 run_script runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"6646d4ef630f746b2b5fdf177f9cfdab741220a3c7d924728c268486d0388a2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::oauth_http::managed_authorize::oauth_authorize_consent: FunctionTooLong \u2014 webcodex::oauth_http::managed_authorize::oauth_authorize_consent 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":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f096bf57688d314753099d0d7ffaf2bb17d8f7f4e8421b328a820d49601634"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::coding_task::project::project_resolution_from_runner_result: FunctionTooLong \u2014 webcodex::tool_runtime::coding_task::project::project_resolution_from_runner_result 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":"src/tool_runtime/coding_task/project.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4e0f15a86de6cf57d6c33cd6a362eff0455e903d8013727afcfe0d6bc6036a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.bootstrap_agent_conversation: MethodTooLong \u2014 bootstrap_agent_conversation 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":"src/tool_runtime/communication.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8dad710cc916a91c0960ff9ee7383c84e8733df6fbb5d4efacd189fb2f4664"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.wait_for_job_readiness: MethodTooLong \u2014 wait_for_job_readiness 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":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbf737b82300ed6813559061490a8eac3eed60546695adf6b58ef91e0a1d626"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webcodex::tool_runtime::search_project_texts::apply_model_facing_output_budget: FunctionTooLong \u2014 webcodex::tool_runtime::search_project_texts::apply_model_facing_output_budget 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":"src/tool_runtime/search_project_texts.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b588b3246fe380329f0d318ba0c75e40201975548e07a21ab128f4290f888b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolRuntime.post_window_operator_message_with_options_for_principal: MethodTooLong \u2014 post_window_operator_message_with_options_for_principal 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":"src/tool_runtime/window_collaboration.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c476bb760c664c4e352d9a86500fdeabc92180eec9f415cf16d33344f851a2cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/models.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":"apps/desktop/src-tauri/src/models.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31e1865bcfa059e870d5f1f53975cb1caae8fca70a86c1a97f9bb4c6b15aceb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: output_schemas/testing.rs: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 3 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/testing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14623dffa63ba6d0d15f713696bfb77bca688a80eb31c0f8e7d8058af0fd1d57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: computer_tools/request.rs: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: ToolRuntime (37-658). The bar is 500 significant lines; this is 3 over it, 1.01\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":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc0d89d447c17748dc1733ab8ca182319e3e0e43fb0daf02c3688c6a2e7dc34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/browser.rs: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/browser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a2e88a81e614c33d747e8ddbfd0c758b93171aab37ccdb27cdd2696c2435af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcodex_runner/configured_skills.rs: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/configured_skills.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94df49f213303febc95bb57a517bff6f80a0ccd465efba96701f35fbde0ae4af"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 25 shared lines): crates/webcodex-runner-registry/src/requests.rs:739-823 | crates/webcodex-runner-registry/src/requests.rs:833-883 | crates/webcodex-runner-registry/src/requests.rs:1180-1231 | crates/webcodex-runner-registry/src/requests.rs:1241-1283 | crates/webcodex-runner-registry/src/requests.rs:1293-1328 \u2014 These 5 members are variants of one another: a block of 25 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f19df12fb592518f2a24dcdb7009fe2abcd221b39da79ae466a317a71add70"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 37 shared lines): src/tool_runtime/skills.rs:1639-1744 | src/tool_runtime/skills.rs:1755-1834 | src/tool_runtime/skills.rs:1845-1919 \u2014 These 3 members are variants of one another: a block of 37 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/skills.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e4642c289c7652c7539e8da0b9826f1e2c455d5f4975e09d1b4e2a5ca2d13a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 23 shared lines): crates/webcodex-runner-registry/src/requests.rs:896-956 | crates/webcodex-runner-registry/src/requests.rs:969-1098 | crates/webcodex-runner-registry/src/requests.rs:1111-1170 \u2014 These 3 members are variants of one another: a block of 23 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"6326815babb4584284c9f43ae34fa08ad032013c41977c80b8bd5efc34ccb5b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (177 shared lines): crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs:269-536 | crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:292-544 \u2014 These two members are variants of one another: 177 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd5968f264727784018e26150ea762e34f0c885e57fbd923d7dda1039fe9b93"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (104 shared lines): src/mcp/tools/call/specialized.rs:58-201 | src/mcp/tools/call/specialized.rs:207-420 \u2014 These two members are variants of one another: 104 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":"src/mcp/tools/call/specialized.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f7de31074abdebad81dc85e0f146d637af354ac0c64f66c205b21c087fd1e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (63 shared lines): crates/webcodex-runner/src/webcodex_runner/shell/process.rs:171-304 | crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs:338-466 \u2014 These two members are variants of one another: 63 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/process.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcabf38d38255e245c3b6bf5666a0a1bf642a7cac1dab1e7bec6bd59f556b973"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (63 shared lines): crates/webcodex-computer/src/platform/macos/accessibility.rs:948-1060 | crates/webcodex-computer/src/platform/windows/accessibility.rs:748-867 \u2014 These two members are variants of one another: 63 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7d41c5399dde89766b43ee252c0c66e2f189c32682e9073267ab0d096a33a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (62 shared lines): crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:145-399 | crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:444-610 \u2014 These two members are variants of one another: 62 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3b17598872fab2478bb4e40c314bdc7ca48330495028fbfa6fa8ce39ba78aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (59 shared lines): src/oauth_http/project_share.rs:48-185 | src/oauth_http/shared_key_bridge.rs:434-598 \u2014 These two members are variants of one another: 59 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":"src/oauth_http/project_share.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"649f6c4c3529a3e10b55b0f90379067224a74a06593c6186741028863fa6eb21"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (57 shared lines): crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:232-353 | crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:416-583 \u2014 These two members are variants of one another: 57 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f120c5b93b7bff43d8b268aad3ca5b58264e873f47b76ec4f845280cab0b486"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (55 shared lines): crates/webcodex-store/src/goal.rs:314-396 | crates/webcodex-store/src/goal.rs:416-515 \u2014 These two members are variants of one another: 55 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c577f4a39f9257d1f06cd6fda418cdcd0e1d1039b1a4890adf25622a3de0ebff"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (55 shared lines): crates/webcodex-store/src/goal.rs:900-975 | crates/webcodex-store/src/goal.rs:1003-1085 \u2014 These two members are variants of one another: 55 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fee8cc5a3def9d139d6af0309023e3aae45490796d124de29e141c294b8070"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (50 shared lines): crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:264-345 | crates/webcodex-runner/src/webcodex_runner/validation/execute.rs:269-357 \u2014 These two members are variants of one another: 50 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4226564733b4c290742bc387de6e46c273cfb45c6ae35b7ccd325331d723ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (44 shared lines): src/tool_runtime/runtime_info.rs:448-633 | src/tool_runtime/runtime_info.rs:755-948 \u2014 These two members are variants of one another: 44 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runtime_info.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb1eda778f0f35997cc89d607decdd38c39a34c63a17644bbcc497eea1eb6c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): crates/webcodex-workflow-session/src/events.rs:1033-1139 | crates/webcodex-workflow-session/src/events.rs:1197-1279 \u2014 These two members are variants of one another: 36 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa041669ef637aeb4fcf9a9af053cbb1ed02663fc20b61af5f817bd34e86836"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (34 shared lines): crates/webcodex-cli/src/webcodex_cli/system.rs:161-286 | src/project_entry_windows.rs:179-224 \u2014 These two members are variants of one another: 34 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b173f0d9416f949ca61869f3eed8b0677b2b9e39f589f13c460fa6b3353d74e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (33 shared lines): crates/webcodex-browser/src/cdp.rs:2407-2541 | crates/webcodex-browser/src/cdp.rs:2636-2753 \u2014 These two members are variants of one another: 33 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":2407}}}],"partialFingerprints":{"codehealthFindingId/v1":"baacb7a74dc1ddde42ba6c544380f8c0a22a4c00e7650cf8150944c7855ab8f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (30 shared lines): src/tool_runtime/changes.rs:954-1040 | src/tool_runtime/changes.rs:1085-1166 \u2014 These two members are variants of one another: 30 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":"src/tool_runtime/changes.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d00b094f7dcae6212b93606222ed453e7d2a5c8f149eedc732610a019c07d34"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (26 shared lines): crates/webcodex-runner/src/webcodex_runner/artifacts.rs:212-268 | crates/webcodex-runner/src/webcodex_runner/patches.rs:71-118 \u2014 These two members are variants of one another: 26 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f22ba7a6cec23f5b9139cc49687d038e5aadda844330e6232ef83c6537cfdc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (21 shared lines): crates/webcodex-environment/src/privilege.rs:33-76 | crates/webcodex-environment/src/privilege.rs:95-161 \u2014 These two members are variants of one another: 21 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"650447a923d7304058a7028b7275a0c07f756a0dcddf80fd7785b61f3f5dbedc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): apps/desktop/src-tauri/src/diagnostics.rs:616-636 | apps/desktop/src-tauri/src/state/persistence.rs:139-167 | crates/webcodex-cli/src/webcodex_cli/connect/profile.rs:491-542 | crates/webcodex-cli/src/webcodex_cli/login.rs:167-179 | src/project_entry_cloudflared.rs:611-646 | src/project_entry_setup.rs:1141-1190 | src/project_entry_setup.rs:1203-1273 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/diagnostics.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"49896275bcdbacdc5a2ff78d7c60a48fd2e59c696bcb8bfc4cccd0182c775f05"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/webcodex-admin/src/commands.rs:832-873 | crates/webcodex-cli/src/webcodex_cli/http.rs:16-47 | crates/webcodex-cli/src/webcodex_cli/http.rs:54-83 | crates/webcodex-cli/src/webcodex_cli/token_commands.rs:52-100 | crates/webcodex-cli/src/webcodex_cli/token_commands.rs:127-157 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27c73cb3f8c048aa85d7b477cca19b802ed92f4571e0dc77c58a87656817f43"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/webcodex-browser/src/supervisor.rs:739-754 | crates/webcodex-browser/src/supervisor.rs:756-768 | crates/webcodex-browser/src/supervisor.rs:913-925 | crates/webcodex-browser/src/supervisor.rs:927-950 | crates/webcodex-browser/src/supervisor.rs:1028-1140 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9c7bea6d6b4bfaafca9f53f58c71c41f47ff9d80d441a5a4b1a4b3bc67c423"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/webcodex-computer/src/lib.rs:1570-1609 | crates/webcodex-computer/src/lib.rs:1631-1667 | crates/webcodex-computer/src/lib.rs:1669-1698 | crates/webcodex-computer/src/lib.rs:1706-1743 | crates/webcodex-computer/src/lib.rs:1772-1809 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e49a26b361a9339e60f7d0db4d70a847e3e5f498c635a6c66cf27c8eac337ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:315-411 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:540-720 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:742-999 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:1011-1107 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:1117-1191 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9226eb417ea430b74a03c557c5964798dd28eb6dc6b321fe909138c40f7eda0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/runner_http/handlers.rs:14-78 | src/runner_http/handlers.rs:81-147 | src/runner_http/handlers.rs:282-344 | src/runner_http/handlers.rs:351-415 | src/runner_http/handlers.rs:418-489 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runner_http/handlers.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b43b62259ec287962367460cc7f2438283d415e0e5f4cb63832e3c9fed35c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/tool_runtime/job_terminal_wait.rs:248-277 | src/tool_runtime/job_terminal_wait.rs:285-316 | src/tool_runtime/job_terminal_wait.rs:324-352 | src/tool_runtime/job_terminal_wait.rs:363-400 | src/tool_runtime/job_terminal_wait.rs:408-430 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/job_terminal_wait.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd03a35806bba0daa8d30288aa89a4cb6a6e25be88f08e3d05b40bdfdfd5c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): apps/desktop/src-tauri/src/state/path_inventory.rs:47-57 | apps/desktop/src-tauri/src/state/path_inventory.rs:62-74 | apps/desktop/src-tauri/src/state/path_inventory.rs:79-95 | apps/desktop/src-tauri/src/state/path_inventory.rs:100-116 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/path_inventory.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b584d21bba1a188f550c1b3798ce0217310b0967e90465ed3168c98d9fcd8b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): apps/desktop/src-tauri/src/state/persistence.rs:175-203 | crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs:325-355 | crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs:542-566 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:2154-2181 \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":"apps/desktop/src-tauri/src/state/persistence.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"99761c3e3219877ff557c1ec7240062783d36915b85e20b2cd8986312d6cb616"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/webcodex-admin/src/commands.rs:804-830 | crates/webcodex-cli/src/webcodex_cli/pairing.rs:7-48 | crates/webcodex-cli/src/webcodex_cli/server.rs:512-542 | crates/webcodex-runner-config/src/lib.rs:155-181 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ecbd705eeb8c18743ce7ebe59d55bc5b18af5d65b7a561fdbf5ab8ca634732"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/webcodex-browser/src/supervisor.rs:526-536 | crates/webcodex-browser/src/supervisor.rs:538-564 | crates/webcodex-browser/src/supervisor.rs:566-593 | crates/webcodex-browser/src/supervisor.rs:602-721 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0178f1a844080c99e12ffab6b910b114f810e374fb53ca2ca896f5902561d6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/webcodex-lsp/src/navigation.rs:450-494 | crates/webcodex-lsp/src/navigation.rs:559-610 | crates/webcodex-lsp/src/navigation.rs:622-674 | crates/webcodex-lsp/src/navigation.rs:711-940 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7a4f06a3dab397a59aef523a63cd89a74d0e4df999836cf41275bc3cffe0a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/webcodex-runner-registry/src/jobs.rs:368-406 | crates/webcodex-runner/src/webcodex_runner/detached_job/model.rs:540-567 | crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs:40-80 | crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs:82-116 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/jobs.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"805d545727a5034d0f40761d9ec57ddd483eb6e05f7110522118b7b28d6396c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/webcodex-runner-registry/src/projects.rs:200-215 | crates/webcodex-runner-registry/src/projects.rs:257-273 | crates/webcodex-runner-registry/src/runners.rs:718-738 | crates/webcodex-runner-registry/src/runners.rs:789-827 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/projects.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"73213fae90f135329e34afb9bb59941be43a0a6d7efee2e98f6a54b4adf9cc66"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/webcodex-runner-registry/src/requests.rs:1992-2048 | crates/webcodex-runner-registry/src/requests.rs:2060-2115 | crates/webcodex-runner-registry/src/requests.rs:2188-2245 | crates/webcodex-runner-registry/src/requests.rs:2259-2328 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcabe0f08ff751296d96bd695affc80432188218e3063abec74b1c4435d83f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/webcodex-store/src/artifact_handoff.rs:620-704 | crates/webcodex-store/src/artifact_handoff.rs:737-781 | crates/webcodex-store/src/artifact_handoff.rs:793-849 | crates/webcodex-store/src/artifact_handoff.rs:861-936 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/artifact_handoff.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee3d8ef392a30dba108fcf99043dc1c58108cd0e563b66ae92f4fad3a862468"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/webcodex-store/src/oauth.rs:539-682 | crates/webcodex-store/src/oauth.rs:686-716 | crates/webcodex-store/src/oauth.rs:781-812 | crates/webcodex-store/src/oauth.rs:919-1081 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ccaf9e76e5569c3c915a1d8cc1c6bae93ed1dcd9a8e73c76ff9799c6739c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/oauth_http/managed_authorize.rs:514-639 | src/oauth_http/managed_authorize.rs:646-787 | src/oauth_http/metadata.rs:23-57 | src/oauth_http/metadata.rs:64-98 \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":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2d028cd6449805429a85565bba99744c0c177925c36f09ff9a2cb57eb58fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/runner_tokens_http/routes.rs:66-150 | src/runner_tokens_http/routes.rs:162-252 | src/users_http/tokens.rs:78-147 | src/users_http/tokens.rs:150-219 \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":"src/runner_tokens_http/routes.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"41286055f0dfb97b3ff40e5709cdceaddefc43c59c5c73c5fa4ea1a97427f6aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/tool_runtime/process.rs:545-766 | src/tool_runtime/process.rs:814-1143 | src/tool_runtime/script.rs:56-299 | src/tool_runtime/shell.rs:370-729 \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":"src/tool_runtime/process.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"7802bdf5b68254bd05969b999cf4a070528d5b8c18d827d33dd36fef09cc3e20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (98 corresponding lines): crates/webcodex-tool-contracts/src/tool_call/parsing.rs:643-740 | crates/webcodex-tool-contracts/src/tool_call/parsing.rs:795-905 \u2014 These two members are one piece of code written twice and then edited apart: 98 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/parsing.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"96167789db6b92a707938f7089850e154911c0739f14fc6fa087296895e23866"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (101 corresponding lines): apps/desktop/src-tauri/src/webcodex/settings/acp.rs:31-154 | apps/desktop/src-tauri/src/webcodex/settings/mcp.rs:30-130 \u2014 These two members are one piece of code written twice and then edited apart: 101 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/settings/acp.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1e247ba04230c979332d79d550d8235b1c1b0578c459d6538b2724be31a8ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (89 corresponding lines): crates/webcodex-workflow-session/src/store.rs:2578-2682 | crates/webcodex-workflow-session/src/store/borrowed_projection_tests/reference.rs:8-96 \u2014 These two members are one piece of code written twice and then edited apart: 89 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed4a940ead795524c2dd5d913cb5480f55ab43b3c4e81266fd6047712764881"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): apps/desktop/src-tauri/src/ssh_resources.rs:330-410 | apps/desktop/src-tauri/src/workspace.rs:168-230 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/ssh_resources.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c13428cb1550bdff8f9c55509d547befd58177b3d768c59ddd015e9a43af648"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (90 corresponding lines): src/tool_runtime/result_projection.rs:601-690 | src/tool_runtime/result_projection.rs:787-879 \u2014 These two members are one piece of code written twice and then edited apart: 90 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/result_projection.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86c75d4144c4fcd3186b91e9e2425fe7511bd75eed52cf3f61657b878b92f53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (107 corresponding lines): src/tool_runtime/skills.rs:2017-2123 | src/tool_runtime/skills.rs:2135-2247 \u2014 These two members are one piece of code written twice and then edited apart: 107 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/skills.rs"},"region":{"startLine":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2fc053906171b4d86dbf49df7145f646d39082ce02ae28f7f27945e665db76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): crates/webcodex-store/src/activity.rs:125-181 | crates/webcodex-store/src/activity.rs:194-246 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/activity.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e7fd4909810e44a20653fdb91a0f4174eb2097fbc6035b2de7d5bd7e2551ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1004-1071 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1079-1139 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"38de4cd73a583a401acaa917ce07a3f5fcaaf404a6071d69f1120af7c884d891"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (90 corresponding lines): crates/webcodex-runner/src/webcodex_runner/configured_skills.rs:100-189 | crates/webcodex-runner/src/webcodex_runner/configured_skills.rs:194-292 \u2014 These two members are one piece of code written twice and then edited apart: 90 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/configured_skills.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f470fb19a00c56e1dc773a985a67d888103790f3d6c53bca5fcaf5c5d48dc5f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/webcodex-validation/src/adapters/rust.rs:208-256 | crates/webcodex-validation/src/adapters/rust.rs:258-316 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/adapters/rust.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"abac854ddb7da5cfc0b8d12286266ad8c77afc7dd62cd8c7eb9b6c45f65526a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/webcodex-cli/src/lib.rs:1247-1291 | crates/webcodex-cli/src/lib.rs:1293-1332 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96e6664c643495f9597b4e1fd738fd31e3c6f0e1cb9e5c0ace89de751732a7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (75 corresponding lines): src/tool_runtime/computer_tools/screens.rs:61-139 | src/tool_runtime/computer_tools/screens.rs:141-215 \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":"src/tool_runtime/computer_tools/screens.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f09ce6fda7580163472905525d8b5fe968c78a03bba9f6f181b46e0e4e6d0dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (74 corresponding lines): crates/webcodex-tool-runtime-contracts/src/tool_audit/result.rs:200-273 | crates/webcodex-workflow-session/src/audit.rs:103-187 \u2014 These two members are one piece of code written twice and then edited apart: 74 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/result.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f868d72bf8acc75d56e22dc13e3ac1d6b625dd85cd2f51f71bac30b69d43dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): crates/webcodex-persistent-shell/src/opening.rs:6-71 | crates/webcodex-persistent-shell/src/opening.rs:89-145 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/opening.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6edd88ef48493ef9e238ddbb1f09fd81ef05e4380d32679d9b51abc89cd9f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:188-256 | crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:740-806 \u2014 These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b20c3968de620a84140105a27584ae2612c289882e1917c12781411403e5208"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs:36-90 | crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:112-184 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"425708148832ff9d6ec524ead2b38a8d97b61e1dd06464afbf592ec27ac1d5ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/webcodex-store/src/window_collaboration.rs:216-261 | crates/webcodex-store/src/window_collaboration.rs:267-345 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/window_collaboration.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbcfb6c93948b04840d6918994fb47e23d061fd50859e9c91742a0ecdc8d7a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): src/tool_runtime/docx_document.rs:107-157 | src/tool_runtime/pdf_document.rs:177-224 \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":"src/tool_runtime/docx_document.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e1efe36b875eacb1ac9e2b3b4798174ee95937ccd8a1bab7403a330ae078b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (78 corresponding lines): crates/webcodex-environment/src/service/linux.rs:269-346 | crates/webcodex-environment/src/service/macos.rs:211-300 \u2014 These two members are one piece of code written twice and then edited apart: 78 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bb48a3133c0912cb6919c29df595bc785a3d4e4286f947e1268ec0deaa96b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/webcodex-cli/src/lib.rs:1385-1433 | crates/webcodex-cli/src/lib.rs:1774-1825 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cebf0cefd24695e5b76bf63c2a826cd94cd07901bea4222f832c9a88d2a16c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/webcodex-admin/src/commands.rs:204-236 | crates/webcodex-admin/src/commands.rs:311-356 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"af161bda4f04182e904a9af18d1a1233d8caccd754297ac1a9bf7b6f2113fec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): crates/webcodex-environment/src/storage.rs:381-456 | src/upgrade_maintenance_store.rs:67-129 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d42c647db99e7ecf91eae69e6cb00d7768532e735d41cf81c883aef4e4942de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/webcodex-cli/src/webcodex_cli/plugin.rs:558-611 | crates/webcodex-cli/src/webcodex_cli/plugin.rs:613-655 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/plugin.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d969087f138bda868062d81b083606237de0375d1315fd1dce16722ac2a4c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:82-119 | crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:368-414 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"34098a75e32204cea37ae6f57ba534aab0c49a50d73a77069a063dba18087820"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/webcodex-runner/src/webcodex_runner/exit_diagnostics.rs:372-426 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:2108-2146 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/exit_diagnostics.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"5625d39baf7717ed166c9cbfd633e36c28c5b2d28411e83c2e86317d35c8e6c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/webcodex-persistent-shell/src/unix.rs:76-122 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:227-286 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad4c1b2fcd3839ebeb730682296d2817f745166bb88486bf8c973fbebd78826"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): crates/webcodex-environment/src/storage.rs:471-518 | src/upgrade_maintenance_store.rs:15-64 \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":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b8d785ef026f234c52fccaffca4f06de6e42c530a7338cd29673a452400178"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/webcodex-admin/src/commands.rs:384-427 | crates/webcodex-admin/src/commands.rs:480-516 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbc46e3d88f0873a290bc4907d33a6f016ceacba433082658e688afeb6e4c14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): crates/webcodex-environment/src/service/windows.rs:647-700 | crates/webcodex-environment/src/session_service.rs:343-397 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/windows.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedfedd21cffa194e20d75915c45a8c93d444d1274593bcbfd0843e7c04efec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): src/runner_tokens_http/routes.rs:294-343 | src/users_http/tokens.rs:255-297 \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":"src/runner_tokens_http/routes.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"60196c4be383614cf0ceb5ae428916bc2cff07c6c5ee4584613fa3ee5e22372b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): src/tool_runtime/skills.rs:394-458 | src/tool_runtime/skills.rs:522-593 \u2014 These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/skills.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"28972135d57c5beb3dc1a744db44f9e0c580cc04abc347c1f5236baf6e4a3051"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): src/mcp/tools/invocation.rs:283-322 | src/mcp/tools/invocation.rs:326-362 \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":"src/mcp/tools/invocation.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adff1d78331e7875d4d1ecad0793f88d41be50a8c41d520e0b45a3b4d8dff39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): crates/webcodex-store/src/agent_continuation_reference.rs:52-122 | crates/webcodex-store/src/agent_task_attempt_reference.rs:80-167 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_continuation_reference.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf4916a20c045fb17ad721003182cefccd2b7d5bc42cf373c0cd3f2aaad03dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): src/tool_runtime/process.rs:190-262 | src/tool_runtime/shell.rs:252-315 \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":"src/tool_runtime/process.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ba1eb5b74ddae91702f261aea8b5fb58b388fb65ab3f66d6fec9e5d33248ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): apps/desktop/src-tauri/src/diagnostics.rs:359-385 | crates/webcodex-environment/src/inventory/model.rs:148-186 \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":"apps/desktop/src-tauri/src/diagnostics.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5d455063d37f8020b0d23c31f48136b1a9c4921818d8e2679c5e7582738c86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/webcodex-cli/src/webcodex_cli/system.rs:475-514 | crates/webcodex-cli/src/webcodex_cli/system.rs:517-556 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ff2dd528a6c5ccd339d098ead178c404fa9254c5a217308f5111ab9645b6d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): src/mcp/resources.rs:185-224 | src/mcp/resources.rs:342-381 \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":"src/mcp/resources.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bfa3e60d2a3c02fb1e0c6893b8d523c25da6104194a895013dc5bfd646fdb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): src/mcp_gateway.rs:531-587 | src/plugin_gateway.rs:928-985 \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":"src/mcp_gateway.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fff21e7366a9e90d5b037391a6ea1937acba0da84e1ce55e4694bb1176e301"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:1292-1335 | crates/webcodex-runner/src/webcodex_runner/plugin.rs:1907-1948 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"228ab2bcf43a6dd9f4f3e9943c2d644f267bd2583e307c1532619df1f0ff1992"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/webcodex-validation/src/adapters/go.rs:84-127 | crates/webcodex-validation/src/adapters/go.rs:163-194 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/adapters/go.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c0b5b26b72057754cdc78599e5ed0ae9376a101aa5f30c90b7fd636d2660f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/mcp/presentation/jobs.rs:156-183 | src/mcp/presentation/jobs.rs:242-284 \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":"src/mcp/presentation/jobs.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c959c41efec8bac1a7c09b961fc476f0596f646d1aa43c7c852c48cdd2fa3a7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): src/oauth_http/project_share.rs:220-274 | src/oauth_http/shared_key_bridge.rs:635-679 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/project_share.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"932f26c9512deff64916dbb0509ba2d273957c419aee1a3b401a2cc80d57fd0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/webcodex-computer/src/lib.rs:1194-1234 | crates/webcodex-computer/src/lib.rs:1248-1289 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a76887080a6d2181a27aac0c38ae2e267f3e6a342373545df3964f78e8af015"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/webcodex-workflow-session/src/messages.rs:697-737 | src/tool_runtime/coding_agent.rs:2164-2214 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/messages.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"0490a0ca802d1a34364acb35c813b1a9eedee53484365a982cc94a54ce8e9993"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/webcodex-runner/src/webcodex_runner/project_build.rs:231-262 | crates/webcodex-runner/src/webcodex_runner/validation/project.rs:215-254 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a979fec67a639e3b146ac47b2447ddf9c05337e15582127bff6908d0f78756"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/webcodex-runner-registry/src/requests.rs:1373-1421 | crates/webcodex-runner-registry/src/requests.rs:1644-1696 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef7ae75a725e335627ca8f36c0651beee53a5f67ff2209944852235a9941fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): apps/desktop/src-tauri/src/webcodex/adapter.rs:424-466 | apps/desktop/src-tauri/src/webcodex/adapter.rs:475-526 \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":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"4938c16b2e5a4249f52420cd5183b73f6a8fdd3b69a4b56c22e7211ebabc8951"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs:112-132 | crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs:134-150 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"16912877fd5b26f67f3bcbe90b1120b66d91340e28bace2593e722e45d824d17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): src/tool_runtime/communication.rs:764-807 | src/tool_runtime/communication.rs:950-1000 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/communication.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39ce73f018e7d933884a3133a90eaa62a77654815d54d028d4244da7c5a68be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:618-678 | crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:683-734 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b7519492e2be04df0569056f7fc2bd8da448900ecad95bca5a6f4a1dd7d776"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 39\u002B corresponding lines): src/tool_runtime/docx_document.rs:57-99 | src/tool_runtime/pdf_document.rs:49-87 | src/tool_runtime/pdf_document.rs:130-169 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 39 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":"src/tool_runtime/docx_document.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2437f8d29ef0b8b9229a310f0b1acd0da8e4a3a2ced78bd0671b8ad2e748ac0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/webcodex-computer/src/platform/macos/accessibility.rs:693-722 | crates/webcodex-computer/src/platform/macos/accessibility.rs:787-812 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"683662080c770dd69321b46ca6327a64eb738eac62c0768ea3fa49ac822aa46c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/webcodex-store/src/agent_task/endpoint_loss.rs:15-85 | crates/webcodex-store/src/agent_wake.rs:2247-2296 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/endpoint_loss.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1d3490136a9ab24d5bd3a9fc072004ce534c0f6648161dc7900c4207af5fa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): apps/desktop/src-tauri/src/webcodex/adapter.rs:665-697 | apps/desktop/src-tauri/src/webcodex/adapter.rs:705-738 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe526947f537f6d39220017e3b6f77d81258a75ce0d0fbbd8623c4df2e6255f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/webcodex-core/src/mcp_gateway.rs:674-713 | crates/webcodex-core/src/plugin.rs:1489-1519 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"564e707eb0c8acc3c8662f71e0ca120bf44f42e71ad09bbdce4dc0b5e7e777fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/webcodex-runner/src/webcodex_runner/config.rs:1733-1773 | crates/webcodex-runner/src/webcodex_runner/config.rs:1828-1866 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bc965ccc97fb2a027210b02ecfec4b8d01f68bfd2753777952ce1fbd4cbc86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): src/tool_runtime/coding_agent.rs:2100-2122 | src/tool_runtime/git/diff_hunks.rs:235-256 | src/tool_runtime/git/diff_hunks.rs:264-286 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2a005a9f86a93198f6eb63fdd88443f4c36cfd52920a3a5ecb308adcfc252c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/webcodex-persistent-shell/src/unix.rs:148-176 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:330-363 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63aad721491322b045097c0a3fe64bba927efec499b83c414ed25c3d17aff01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): apps/desktop/src-tauri/src/state/desktop_core.rs:1290-1351 | apps/desktop/src-tauri/src/state/desktop_core.rs:1359-1414 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"088f6bba14dbfdbdcd248d72ee0290e06e356762ade5eb031f4e5b497adfb863"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/webcodex-persistent-shell/src/framing.rs:131-159 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:654-683 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/framing.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac57e03ab470780f73f046ddce3c7b3a9fdf0a19988c14812f27896604e8a0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/webcodex-runner-config/src/paths.rs:111-145 | crates/webcodex-runner-config/src/paths.rs:155-181 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-config/src/paths.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"238ed87b5b82e184ef194d76c8b2c0fb04c2616a49b70cd9d8a36fa0ad7df153"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/mcp/tools/invocation.rs:235-263 | src/mcp/tools/invocation.rs:364-403 \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":"src/mcp/tools/invocation.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c18733bf6abe4496d4d7a15b6ef0d78165bc32678e88ef9af56bfc9949347a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): crates/webcodex-persistent-shell/src/unix/readers.rs:30-67 | crates/webcodex-persistent-shell/src/windows.rs:354-390 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:531-568 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix/readers.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8454fc5f5dd8ffb4f0ce420621e7da223660abb70fae0c469cddcbfabdf87134"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/webcodex-tool-contracts/src/registry/output_schemas/browser.rs:4-38 | crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs:30-61 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/browser.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6fe3b3945d62530afd63060594093b0c34f2461399d05d59ea7e399d32042a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/webcodex-process/src/bin/process_tree_helper.rs:95-113 | crates/webcodex-runner/src/webcodex_runner/validation/validation_tree_helper.rs:135-158 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa91c70c76922aba93e189abfd83e0f9a29beaf614670a6dfedf34c509b42753"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:1239-1267 | crates/webcodex-runner/src/webcodex_runner/plugin.rs:1873-1901 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"279ae5496eb823eb75c09d6b022e30e2a5448bf611d1280792a45ec23e32ea71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/webcodex-tool-contracts/src/registry/output_schemas/edits.rs:175-208 | crates/webcodex-tool-contracts/src/registry/output_schemas/edits.rs:233-268 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/edits.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"5039a662f16b5f5396687261e1e881e5f25ed3d4ccf49300ad4c32f5a38d6ed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/admin_project_lifecycle.rs:133-167 | src/admin_project_lifecycle.rs:173-215 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/admin_project_lifecycle.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb868db3351afab9fd4fa7da496585cb812ecb6276c755453d5b9988fe5a015"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): crates/webcodex-cli/src/lib.rs:1661-1693 | crates/webcodex-cli/src/lib.rs:1695-1724 | crates/webcodex-cli/src/lib.rs:1726-1755 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a481ed80932c5ce9f5fe43f57eddae9302b5903de340e2f698b96c352edf38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): apps/desktop/src-tauri/src/coding_agents.rs:260-279 | apps/desktop/src-tauri/src/mcp_providers.rs:585-604 \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":"apps/desktop/src-tauri/src/coding_agents.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfbe48e76e1dee47412a6366aefd30ef139c272a297dfc290720ae805ac82be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/runner_tokens_http/routes.rs:260-286 | src/users_http/tokens.rs:226-247 \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":"src/runner_tokens_http/routes.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd4428a28205a777d5d9e6886ab3a44d395ae4913216fd2895e87ad45fb4d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): src/mcp/discovery.rs:131-177 | src/mcp/discovery.rs:279-329 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/discovery.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9a3d3d7cca1a37241d3f10763aab6401bbdde4179dce06b704fcf745bbc4ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/webcodex-core/src/runner_skill.rs:438-464 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1919-1943 | src/tool_runtime/skills.rs:2626-2648 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_skill.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e773cbcb335db0941d033fe55ed3ffd412531df7711123a734d70e02742ef528"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/tool_runtime/files/artifacts.rs:525-565 | src/tool_runtime/files/artifacts.rs:833-858 \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":"src/tool_runtime/files/artifacts.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc42b4e8e1979fb5408fb797e06070fa0475d61a87d9da94b1dff3ded9e51b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/webcodex-runner/src/webcodex_runner/projects/registration.rs:134-157 | src/tool_runtime/projects.rs:1474-1500 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/registration.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e653e6460c0bf0ec67966aed03437646559dd2971b2acba9fc1f4dae6dd96031"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/plugin_gateway.rs:532-563 | src/plugin_gateway.rs:569-603 \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":"src/plugin_gateway.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5878e2c2daf49b1fa192c93c9c4a9a56b7ef24444bb043206684c02e7818fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/tool_runtime/git/diff_hunks.rs:174-195 | src/tool_runtime/git/diff_hunks.rs:204-228 \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":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c8cfb45e23fd92c0a103c05a286f9817c095658e7b208e27643b85d7568143"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/webcodex-workspace/src/project_recipe.rs:811-844 | crates/webcodex-workspace/src/project_recipe.rs:1010-1042 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc1ebcdd751e43e9a5b1ae1b155c62c3f08b89fe7bca3c7d34cff4de921c35c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/ssh_resource_gateway.rs:485-520 | src/ssh_resource_gateway.rs:526-558 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ssh_resource_gateway.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"a512fa566bbe4d5316e8f13bf76e14525ca656df619c46c48d6760c3a3e75648"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/webcodex-runner/src/webcodex_runner/persistent_shell/results.rs:9-36 | src/tool_runtime/session_shell.rs:971-1008 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/persistent_shell/results.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcfb12c5e1c722f1921dd77da8cdd636e98eeb91ca550bd03b7dd078bc7fef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/webcodex-admin/src/commands.rs:429-448 | crates/webcodex-admin/src/commands.rs:450-478 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ce126ae65ace6272dd2808cbfa550e838db88aae814b38bc6fb05dc73afd17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/webcodex-cli/src/webcodex_cli/ops.rs:1219-1241 | crates/webcodex-cli/src/webcodex_cli/ops.rs:1425-1449 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/ops.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad8b7be937b5055dc74f666de8a630a47b3d1b24d8241593e166d9b915b722c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 24\u002B corresponding lines): src/tool_runtime/computer_tools/input_receipts.rs:107-133 | src/tool_runtime/computer_tools/input_receipts.rs:142-165 | src/tool_runtime/computer_tools/input_receipts.rs:172-197 | src/tool_runtime/computer_tools/input_receipts.rs:244-268 | src/tool_runtime/computer_tools/input_receipts.rs:322-347 | src/tool_runtime/computer_tools/input_receipts.rs:354-385 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/input_receipts.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7d538ac90fe3fbcf2a71b2da2da90a7f7215c6b6b8e44c0fed3945110934f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): apps/desktop/src-tauri/src/state/workspace_settings.rs:33-55 | apps/desktop/src-tauri/src/state/workspace_settings.rs:60-83 \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":"apps/desktop/src-tauri/src/state/workspace_settings.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d75a2fadbbb6196bb718d95fdd4146f65e795cfb19a3dd2bd49bba16c482a44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/webcodex-tool-runtime-contracts/src/tool_audit/execution_identity.rs:182-205 | crates/webcodex-tool-runtime-contracts/src/tool_audit/execution_identity.rs:234-264 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/execution_identity.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2e6f027dd97e0b41ff201e4c309029d599d1cd38dd993431a8dc412e1de337"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/webcodex-core/src/lsp_bridge.rs:580-616 | crates/webcodex-core/src/validation_bridge.rs:460-497 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/lsp_bridge.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c50935a24ea5db843c7a76657d04dc57d8c11fc3f3dbf0a8e68382124a5c36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/webcodex-store/src/oauth.rs:1117-1137 | crates/webcodex-store/src/oauth.rs:1139-1156 | crates/webcodex-store/src/oauth.rs:1158-1176 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a895c9b8ffd3e9ac89182228351090f5131b137e61a4f4461185d8c9717c094f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tool_runtime/runner_instructions.rs:20-36 | src/tool_runtime/runner_instructions.rs:42-58 \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":"src/tool_runtime/runner_instructions.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"44538dcf046bd452bd4ecae34a4485b57a10294107dd113a7b5bff1b8c2cda6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/webcodex-environment/src/service/linux.rs:480-500 | crates/webcodex-environment/src/service/linux.rs:502-521 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7be7b9f5723a642be541ab458042ac19e60349408c2da27c8bf875d493ca08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/tool_runtime/goal.rs:1510-1531 | src/tool_runtime/goal.rs:1539-1568 \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":"src/tool_runtime/goal.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c9df3f78f4d9b3f7cd2cee81c252ee7624a7318261eb9c299889de8f776779"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/webcodex-cli/src/webcodex_cli/project.rs:380-405 | crates/webcodex-cli/src/webcodex_cli/project.rs:412-439 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b77159fa393fa492c51c2374df4a63ced42bb9284204ba9f2e2c550133f393"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/tool_runtime/communication.rs:1346-1371 | src/tool_runtime/communication.rs:1377-1403 \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":"src/tool_runtime/communication.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bf5f5e1fce52966d4fe6dbadaaea27a49d0563b79f8b9f2a1ad36942e45834"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/tool_runtime/docx_document.rs:18-49 | src/tool_runtime/pdf_document.rs:94-122 \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":"src/tool_runtime/docx_document.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede31cff7e0a91c5d9adeeebb202244f9d8b50442754b88087a4cd3a891f4249"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs:327-357 | crates/webcodex-runner/src/webcodex_runner/projects/registration.rs:507-531 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce4da1174a33361f613b0ab9430c8bd4a21f8872c6cdf8cb5381d061848d5b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): apps/desktop/src-tauri/src/updates/install/native.rs:68-97 | crates/webcodex-cli/src/environment/update/launcher.rs:89-116 \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":"apps/desktop/src-tauri/src/updates/install/native.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d366482c5673ca1a39092850c84674b958c845a99582461def4f8bac93b8c0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/tool_runtime/goal.rs:1391-1427 | src/tool_runtime/goal.rs:1469-1502 \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":"src/tool_runtime/goal.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab39b4751fd3574c8595ba7097ddfb0f5a7ed089a3905d42ed72d82249910485"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/webcodex-environment/src/native.rs:1935-1957 | crates/webcodex-runner/src/webcodex_runner/config.rs:1617-1632 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae824114f47d2d39dd2b33cc778dd1f4b8a0dade6fa8370e570a2a13d0f8514"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/webcodex-runner/src/webcodex_runner/dispatch.rs:142-170 | crates/webcodex-runner/src/webcodex_runner/persistent_shell/results.rs:119-150 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/dispatch.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b122b421ca09ae060c2c410e10098b9ba058a0f4215264a2b1cbff4ec5d2d964"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): apps/desktop/src-tauri/src/state/runtime_shell.rs:77-98 | apps/desktop/src-tauri/src/state/runtime_shell.rs:100-128 \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":"apps/desktop/src-tauri/src/state/runtime_shell.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d9f82eccadd96ce0c186b1e752995bc21d0b2406eab35949c93dd68c4330e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/webcodex-store/src/model_reference.rs:176-206 | crates/webcodex-store/src/project_reference.rs:173-196 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/model_reference.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5a5a83a552edf40827c60e2a314ca24e379d99e33a7ad504efcd4548c5b130"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/tool_runtime/files/mutations/preflight.rs:65-92 | src/tool_runtime/helpers.rs:526-547 \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":"src/tool_runtime/files/mutations/preflight.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bc5b71fdd415a09714a38efc7192c7302aa55876f6323648f9b5e94ec008d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/project_entry_windows.rs:69-90 | src/project_entry_windows.rs:100-118 \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":"src/project_entry_windows.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d935120f70ce9e1382a12bb4d1230222d7a43d921ee9011b28e6ef7aee238565"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/tool_runtime/files/mutations/preflight.rs:123-149 | src/tool_runtime/files/mutations/text_edits.rs:361-384 \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":"src/tool_runtime/files/mutations/preflight.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"04335b695667f6c7d7c718de76c0b62a26dc9adb94fba4c3b28b941e18f25dc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): crates/webcodex-admin/src/commands.rs:182-202 | crates/webcodex-admin/src/commands.rs:251-270 | crates/webcodex-admin/src/commands.rs:518-535 | crates/webcodex-admin/src/commands.rs:540-559 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d955f7c050c3f3bd0fabbb60387f3e014e063fd4871c4f1d68961ad5e47de062"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/project_entry_cloudflared.rs:528-556 | src/project_entry_setup.rs:1111-1139 \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":"src/project_entry_cloudflared.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ab050c6b64795c5f01414fadbd02ef69ad656ab81f606d2b40996b65ba0607"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): apps/desktop/src-tauri/src/webcodex/adapter.rs:980-1004 | src/project_entry_regular_tunnel.rs:281-306 \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":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"983fa3d8f04c54c3862e7ed3f829d0c0ca4c520f424fb189ef82e39bc5b1ef4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/webcodex-computer/src/platform/macos/accessibility.rs:383-403 | crates/webcodex-computer/src/platform/macos/accessibility.rs:459-479 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"7481623aab3e187283cbf6b611776718c348502201cd2277aea137d26fd732f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/webcodex-workflow-session/src/messages.rs:665-692 | src/tool_runtime/coding_agent.rs:2129-2157 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/messages.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e870f3b78baac070022085b749fe129f17f3e27c9cf7a101976bf4c6924e3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/admin_http.rs:19-34 | src/runner_http/mod.rs:32-45 \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":"src/admin_http.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"190e46c27dfda4cb5590cb8e4b57f925400a6f0ff105ecbce1305f7602c65e19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-core/src/project_build.rs:199-219 | crates/webcodex-core/src/project_validation.rs:218-232 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_build.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff148ce3b2d1292a344290cc2380cb9edd41b0462361d12ae5d8987a7593ccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/tool_runtime/edit_tool_telemetry.rs:216-237 | src/tool_runtime/edit_tool_telemetry.rs:239-263 \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":"src/tool_runtime/edit_tool_telemetry.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4a432137325a85df695fd8f870986ec24a905874047165a720feada6bbca5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): apps/desktop/src-tauri/src/webcodex/cli.rs:758-776 | apps/desktop/src-tauri/src/webcodex/cli.rs:782-800 \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":"apps/desktop/src-tauri/src/webcodex/cli.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"5542304937b578d2e629dabec273e5dbca36fd21f72f0c6f6d89abffbcba86a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:425-454 | crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:459-480 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/execution.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b927fbec494d03c8659233525bbdb509bb0dd9b6e32ecc84826155b83f477cb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/webcodex-store/src/goal.rs:1394-1415 | crates/webcodex-store/src/store_primitives.rs:83-104 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3f8f576f6e27f2e8376374199f4b374f30e05f7a4f45b78db34de441ad17f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-tool-contracts/src/registry/output_schemas/skills.rs:9-26 | crates/webcodex-tool-contracts/src/registry/output_schemas/skills.rs:58-72 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/skills.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2002e09cb762411a52dea6485aeccb46312b2a6df9279d2d2448565b272677c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/tool_runtime/git/mutations.rs:193-211 | src/tool_runtime/git/mutations.rs:217-235 \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":"src/tool_runtime/git/mutations.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b786e2725f0776b5e37b6b01bf3ec3b1100df493974106b7e9b58ffd8e43f4dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): apps/desktop/src-tauri/src/diagnostics.rs:105-121 | apps/desktop/src-tauri/src/webcodex/settings.rs:122-137 | crates/webcodex-environment/src/upgrade.rs:798-816 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/diagnostics.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc82b7df3300373c8af3dbef642fc304c5f939c988b8a45d33533c5d4294590"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): apps/desktop/src-tauri/src/webcodex/settings.rs:353-372 | apps/desktop/src-tauri/src/webcodex/settings.rs:377-395 | apps/desktop/src-tauri/src/webcodex/settings.rs:400-424 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/settings.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"764e803448294b94c05071a96f16cdf86c966129eb717940201cc5963920a8ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/webcodex-environment/src/service/linux.rs:58-84 | crates/webcodex-environment/src/service/macos.rs:57-83 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"017c439549483b643416a4f5487df6f85b42c15277f0ae8b38323858410df95b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tool_runtime/git/diff_hunks.rs:954-970 | src/tool_runtime/git/diff_hunks.rs:972-991 \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":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"149cf7bbdbeb8e4f8cf0fa0ed680941bd74ddae84fabd2e3e4cc1913f9796e20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:220-249 | crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs:197-217 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0df972e980215810f82b85635c5bf6ce8b85ebe859d3e107cb301294fddff72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-persistent-shell/src/windows.rs:89-103 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:394-416 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/windows.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"466292b8d6f0d62c4b7f39b14c9c925a91ad664c3099cf360bbf283231b50cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): src/mcp/tools.rs:561-584 | src/mcp/tools.rs:659-682 | src/mcp/tools.rs:734-753 \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":"src/mcp/tools.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"151081423903374e1493b6fd70f8589f6ab4544807dc186366bc7535d9f252cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): src/oauth_http/html.rs:91-132 | src/oauth_http/html.rs:142-191 \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":"src/oauth_http/html.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"67112b6dd216841e96e5802f80134eeab71ce8c236851a20bef5a51465cceff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:303-327 | crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:335-359 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0bce8dd2e5a89435257ae9696835a0b747d2beb949062cba5744c472aa4a98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/webcodex-computer/src/platform/macos/accessibility.rs:598-611 | crates/webcodex-computer/src/platform/macos/accessibility.rs:618-631 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3e3da09a97fd6e6fc5ec72bc2f82a9659e045a04e93221b80e5938bb31d3e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-runner/src/webcodex_runner/artifacts.rs:108-120 | crates/webcodex-runner/src/webcodex_runner/artifacts.rs:122-136 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ad5321654dbdc26dc541062a900fb7f9c3dba40e0f6d4a921f798fa978c0eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs:127-143 | crates/webcodex-runner/src/webcodex_runner/detached_job/store.rs:34-51 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f03dd9b28c0e78a07257c13b2e63fce957d9ea6501face07a6e372d04a161a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:1092-1114 | crates/webcodex-runner/src/webcodex_runner/plugin.rs:1776-1792 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3724444e0d58665ef5d73ae4643cf0cf252fab18fe4a77f351533eb9f6b91b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/webcodex-workflow-session/src/assignment.rs:231-241 | crates/webcodex-workflow-session/src/messages.rs:640-654 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/assignment.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecb6281e87195d6dae906f38f1638c3a88e076e258d688a24141289db4deee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): apps/desktop/src-tauri/src/runner_capability_grant.rs:114-128 | src/cloudflare_transport.rs:451-470 \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":"apps/desktop/src-tauri/src/runner_capability_grant.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b130b1af95e78e62724476072bbf976ddd52fbdb058df133087aea5653b0506"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tool_runtime/closeout_projection.rs:10-26 | src/tool_runtime/closeout_projection.rs:32-55 \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":"src/tool_runtime/closeout_projection.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"96564fe25f2dd9018e1ac29b7550d0a4cfa8d0b5086d746e056b221d6adf0db2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/webcodex-core/src/coding_agent.rs:754-769 | crates/webcodex-runner/src/webcodex_runner/coding_agent/protocol.rs:445-460 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46be669083a17d1bcd54be395b6d5055f9b46c811bdcdb854af3817a1d83b45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/webcodex-environment/src/unified_update/discovery.rs:118-144 | crates/webcodex-environment/src/unified_update/network.rs:22-41 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/discovery.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"baac3ca494ae0d63217adf3c0f6ca91f50fe6b40c5d41e7729249afc0c6aff90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/webcodex-runner/src/webcodex_runner/coding_agent/protocol.rs:84-103 | crates/webcodex-runner/src/webcodex_runner/shutdown.rs:330-347 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/protocol.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c5091eea438ad95bd81d37551573d2e99ea229c0805fa69c25be71f821d306"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/tool_runtime/read_files.rs:495-515 | src/tool_runtime/search_project_texts.rs:115-137 \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":"src/tool_runtime/read_files.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5bac2e2fce8378bdbbf734ea97bcdb17408cd39a70c19b6db037c326c0bd11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/webcodex-cli/src/webcodex_cli/connect/profile.rs:279-298 | crates/webcodex-cli/src/webcodex_cli/connect/profile.rs:630-643 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f036e287d53cd057d47a3a0e0d9cdb35cf6a23808df44a68a5532600ad51b608"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/webcodex-workspace/src/workspace_checkpoint.rs:838-856 | src/tool_runtime/checkpoint.rs:837-856 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/workspace_checkpoint.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9e88e19ca1ed8642a90bc2d540d2916c1476d430f9b90cad63616fcfaee654"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/webcodex-persistent-shell/src/lifecycle.rs:57-78 | crates/webcodex-persistent-shell/src/lifecycle.rs:80-101 | crates/webcodex-persistent-shell/src/lifecycle.rs:103-123 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/lifecycle.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51c31262b89dd8eff87ec38efa8eb5216e425a374bee39687db24719855dba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/webcodex-runner-registry/src/job_updates/start.rs:861-888 | crates/webcodex-runner-registry/src/validation.rs:594-628 | src/tool_runtime/process.rs:319-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 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates/start.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fb2fc41ee68753cafd17c89b26aa291002bb6febafd258cc74000664c9af66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/webcodex-admin/src/output.rs:3-26 | crates/webcodex-cli/src/webcodex_cli/http.rs:88-105 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/output.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ff8b270477486237f240efcb2b5a9ad90207934319e76736f8874402ed2595"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/webcodex-core/src/runner_operation.rs:170-183 | crates/webcodex-core/src/runner_operation.rs:185-198 | crates/webcodex-core/src/runner_operation.rs:200-213 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc226a062893793b3719a0ddeda3d750eabcf69eb18dcc69c6de068992c24fa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/webcodex-runner/src/webcodex_runner/transport/listeners.rs:27-45 | crates/webcodex-runner/src/webcodex_runner/transport/listeners.rs:51-70 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/listeners.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a078110c17d851bb1e874778d8e82526e93ca0a7c971021c1e3250bd639f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 25\u002B corresponding lines): src/tool_runtime/browser_tools.rs:153-177 | src/tool_runtime/browser_tools.rs:185-209 | src/tool_runtime/computer_tools/gateway.rs:102-127 | src/tool_runtime/computer_tools/gateway.rs:135-160 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a00ca644bc3691710c6dfdeab179a05e1a66747c5f5c937486f14e65d9b6dd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/webcodex-core/src/coding_agent.rs:1188-1204 | crates/webcodex-core/src/plugin.rs:453-469 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5834b82d908cc6c40430fb4f98a80f7f561b178fd6b39d405cc9b481561de69d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-runner-registry/src/jobs.rs:408-424 | src/tool_runtime/files/inspection.rs:634-648 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/jobs.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8e7586d458fbcbfe145da4cd508074c83895d456b4a11f65609d82d45dad2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/webcodex-tool-contracts/src/tool_definition/documents.rs:22-48 | crates/webcodex-tool-contracts/src/tool_definition/docx.rs:21-47 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_definition/documents.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b4edae59a2295d853dae3d0a1215576b3c475f58ff52c6f812b2e7bd611a05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): src/project_entry_regular_tunnel.rs:337-353 | src/project_entry_share.rs:1048-1064 | src/server_shutdown.rs:212-232 \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":"src/project_entry_regular_tunnel.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab7df51f132cf0c64a81fbff3e5cc63f862781d7d2df7f41a9887e7718484ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-code-mode/src/runtime.rs:1164-1178 | crates/webcodex-code-mode/src/runtime.rs:1183-1199 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-code-mode/src/runtime.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2048cb3cf1b2db4a04f29f2cdbb5cc70e06f234bbeb1b47169cb17487c0446dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/webcodex-core/src/model_reference.rs:21-36 | src/tool_runtime/project_resolution.rs:297-312 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/model_reference.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afeb2ded4c3211ee6766be3ff7cfc30b7235744d4fb52c6df464cb05f478d90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/webcodex-persistent-shell/src/unix.rs:391-411 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:759-779 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04c68fdd25799d27f6ff685434fe4ba3e4b47acacedd633ba167460f9772244"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs:416-438 | crates/webcodex-store/src/server_instance.rs:20-39 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"692023ab6d8a9a9776e7be7995a54a11aa1c0c294db91ee59f8beddc67dfa0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/mcp_gateway.rs:591-615 | src/mcp_gateway.rs:617-650 \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":"src/mcp_gateway.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a4928894d30dbd520ee2f89fce701b83b74933a41f83f01753723a8f6e0373"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/webcodex-computer/src/lib.rs:1017-1039 | crates/webcodex-computer/src/lib.rs:1043-1064 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec7de06933a612ae5607930a2cfb21382360c9727de0d0d33ba8f371fadefb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/webcodex-store/src/communication.rs:1635-1658 | crates/webcodex-store/src/communication.rs:1672-1695 | crates/webcodex-store/src/communication.rs:1708-1733 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba5792f4a8b05642a717bed6fe2625d45bd1b14cc9dce3409f52c61526c8349"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/webcodex-workspace/src/project_overview.rs:411-431 | crates/webcodex-workspace/src/project_overview.rs:688-709 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_overview.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cb4ea588a9303c4dbf42367fe9fa0289bdee7db9336bac8e3a79ff7b964f56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/auth/scopes.rs:61-81 | src/auth/scopes.rs:85-102 \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":"src/auth/scopes.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"641183db25f0869d34c1a727c657fbdf10f04d250c0dcb23e8c1621701511fd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): src/mcp_gateway.rs:42-57 | src/plugin_gateway.rs:57-77 | src/ssh_resource_gateway.rs:76-96 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_gateway.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd617d30f86f118c7f14ccedc064c64fd1701bc868a753b041d2061b413c4e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): apps/desktop/src-tauri/src/tunnel_config.rs:372-389 | apps/desktop/src-tauri/src/tunnel_config.rs:396-412 \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":"apps/desktop/src-tauri/src/tunnel_config.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"02691f740cdd8afe17768074ad5bad24165081d35b67aa29b6b1dfe4a1d6cd74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): apps/desktop/src-tauri/src/webcodex/settings/acp.rs:16-29 | apps/desktop/src-tauri/src/webcodex/settings/mcp.rs:11-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":"apps/desktop/src-tauri/src/webcodex/settings/acp.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6861f3f2f75b202cad547bcaa8a80914ada0618962047aa5b92a15b711e21749"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/webcodex-cli/src/webcodex_cli/connect/process.rs:219-242 | crates/webcodex-runner/src/webcodex_runner/computer_session/platform/windows.rs:101-111 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/process.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4d0dbee50f95e6f1d2216cedf0c16ee5d725ed45ea29cf0105940d2abbfe7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-cli/src/webcodex_cli/service.rs:1756-1770 | crates/webcodex-cli/src/webcodex_cli/service.rs:1775-1793 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdb64c6239d623f2a257d63aab201795668c0bdca62d8b81ef070d72f42884a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/webcodex-persistent-shell/src/unix.rs:178-195 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:365-386 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"582fa0e2bfceeb3c010af548f6e7a8fbfacf5bd0c0449a8b05c4eb92d80372f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/tool_runtime/edit_tool_telemetry.rs:102-124 | src/tool_runtime/edit_tool_telemetry.rs:126-146 \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":"src/tool_runtime/edit_tool_telemetry.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21a681adb878bb7f447f4f1667d181c86efcc95db5335ccd01d987f2d4ae669"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-cli/src/webcodex_cli/ops.rs:492-504 | crates/webcodex-cli/src/webcodex_cli/ops.rs:617-629 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/ops.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"5298be8c1fb94c9db7dfe935c9b5470c615c91e83b4451377a91b019ad8c8c6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/webcodex-computer/src/platform/windows/display.rs:72-92 | crates/webcodex-computer/src/platform/windows/display.rs:154-171 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/display.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4757f6aa38049137bddec18eaa0d026dd8892dc4cf59f0741fc9f76a1e40fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): src/tool_runtime/agent_wait.rs:201-217 | src/tool_runtime/communication.rs:499-521 | src/tool_runtime/communication.rs:532-553 | src/tool_runtime/communication.rs:1259-1285 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/agent_wait.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ed2d2d71e565bf5065f920a5a0f3589c8c77fbd9abe6205f4aa6d990b0fc39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-runner/src/webcodex_runner/transport/quic.rs:80-92 | src/runner_quic.rs:87-99 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/quic.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"44875bf121f1c9b7b50851db9e5edfbb5b11723bf5489bb6d39368ad467220cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/webcodex-computer/src/lib.rs:1611-1624 | crates/webcodex-computer/src/lib.rs:1750-1765 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"9988dd05503b825734651aaf67b7e6aa7d54dcfe70ae5fc0740bfeb7ca3c51e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-environment/src/installer_authorization.rs:246-258 | crates/webcodex-environment/src/installer_authorization.rs:323-339 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/installer_authorization.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1a584f7e6166714d78d860a93923579be18cd2df18a55157a178598f7af32f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/webcodex-core/src/lsp_bridge.rs:734-749 | crates/webcodex-lsp/src/navigation.rs:1121-1141 | crates/webcodex-lsp/src/navigation.rs:1680-1700 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/lsp_bridge.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ba3f46a6144d375e4ac0db4e06f548c97be52aee28e9d35bf227df8a7041ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tool_runtime/agent_task.rs:28-39 | src/tool_runtime/communication.rs:42-53 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/agent_task.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a868ecf3aa2459e7f074d56db891158ad73724fe2b7973f19428f841459c6d8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 19\u002B corresponding lines): src/tool_runtime/communication.rs:299-320 | src/tool_runtime/communication.rs:378-400 | src/tool_runtime/communication.rs:1321-1340 | src/tool_runtime/communication.rs:1458-1477 | src/tool_runtime/communication.rs:1483-1501 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/communication.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"58176f43b1a7dae19e3ba4d2079a07fce096bb08d91c47e818dee89052f060dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/webcodex-workflow-session/src/handoff_brief.rs:981-1002 | crates/webcodex-workflow-session/src/handoff_brief.rs:1004-1023 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"1205626db44720c6c9aba0906ba4cb94d69ff8fc42c23f2ec5ae3b328510d761"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): src/admin_http.rs:261-271 | src/admin_http.rs:274-284 | src/admin_http.rs:291-301 | src/admin_http.rs:317-327 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/admin_http.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6505e019b90000d7c01468c9693998b68c6129d11feb01ece6cece11a1fa5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/admin_project_lifecycle.rs:222-251 | src/admin_project_lifecycle.rs:258-284 \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":"src/admin_project_lifecycle.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a63705b3808d7caad28df3d1a447bdc10bb282f2fe210b674e682be05ece403"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tool_runtime/agent_wait.rs:157-169 | src/tool_runtime/agent_wait.rs:175-194 \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":"src/tool_runtime/agent_wait.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"572647de2f078150c51e4fd713f9f8c043a13fec56a104fcde939adab7a0ca48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/webcodex-cli/src/webcodex_cli/connect/process.rs:332-348 | crates/webcodex-cli/src/webcodex_cli/connect/profile.rs:96-115 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/process.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40cf6db48729242db7949d5f6d7f4fe53798b673e3f21a15a16d9830d706351"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:789-800 | crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:114-125 | crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:270-281 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"c929bb606c374e93d5e7ecd9099edf2db04424211623ac163bbfc79f6101fcca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/webcodex-runner/src/webcodex_runner/project_format.rs:126-147 | crates/webcodex-runner/src/webcodex_runner/project_format.rs:149-169 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_format.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"77122f1f16a4517f174efccd124e94c2ca0efb04cdb6bef371bf20480d6c1945"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/webcodex-runner/src/webcodex_runner/transport/metrics.rs:101-130 | src/runner_http/telemetry.rs:85-116 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/metrics.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99ce62c8f1449aa1e95c4f3eba8980793575bfe3fe2ac044422e7141963be08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/runner_quic.rs:53-67 | src/runner_quic.rs:71-79 \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":"src/runner_quic.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fb8fe61ac34b7f4c1e76cd4d0b947517343b672ffddf791b76d2d5b6010b77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tool_runtime/git/log.rs:182-192 | src/tool_runtime/git/show_changes.rs:1736-1745 \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":"src/tool_runtime/git/log.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e5173783e80af14f15d66f1ff03536858e5f7a4711fd23f4e57ea5a1ce5cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/webcodex-cli/src/webcodex_cli/service.rs:812-830 | crates/webcodex-cli/src/webcodex_cli/service.rs:1730-1754 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe740a59ae5f6abf63d9a82c092615b75de4e76af35f9fe993c9b4dfc6a13fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-environment/src/service/log.rs:218-232 | src/upgrade_maintenance_store.rs:143-159 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/log.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"649a2a766b243e190b13a21b388707bbc1c7d267518126aab91b9f272bf24540"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-runner/src/webcodex_runner/coding_agent.rs:123-135 | crates/webcodex-runner/src/webcodex_runner/coding_agent.rs:137-149 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"060f413907c49fc7275a23ddd3cae0d478f85220395d822417e8a4d26a6db35b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/oauth_http/project_share.rs:192-213 | src/oauth_http/shared_key_bridge.rs:607-626 \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":"src/oauth_http/project_share.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1347748c61420680949c20ef12e75bfed3b092014d9f7b402e0293047b32c0e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tool_runtime/files/mutations/preflight.rs:156-172 | src/tool_runtime/files/mutations/text_edits.rs:413-424 \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":"src/tool_runtime/files/mutations/preflight.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5c87241443149769c2fe6ace2b72ee66772a879d7c15972e020f10935cd523"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): apps/desktop/src-tauri/src/updates/install/native.rs:51-65 | crates/webcodex-cli/src/environment/update/launcher.rs:71-86 \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":"apps/desktop/src-tauri/src/updates/install/native.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf10d52c5a29b07f2aeaf683672474d5cd7609845b75e7b68498a24f3f5bcad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/webcodex-admin/src/commands.rs:238-249 | crates/webcodex-admin/src/commands.rs:371-382 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"619734a88089168734fd874de29550daffe64c93fe2a6bb08ef876d232272579"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/webcodex-store/src/artifact_handoff.rs:1001-1016 | crates/webcodex-store/src/artifact_handoff.rs:1035-1056 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/artifact_handoff.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6a9f4b5e86a36a303e3aa3ba5bcc354d656d4841b9c30ce6ac7ae75f6479dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): src/tool_runtime/session_tools.rs:875-899 | src/tool_runtime/session_tools.rs:906-930 | src/tool_runtime/session_tools.rs:999-1024 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_tools.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd4bb065f740351ea831a3423ac735fb5219bce0cca162cd6310ddb3ca9ac71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): apps/desktop/src-tauri/src/webcodex/adapter.rs:860-871 | crates/webcodex-cli/src/webcodex_cli/project.rs:362-373 \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":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99f8337324322f540325db3d83a0d4b834655bcb765922f46f86182bec4c896"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/webcodex-cli/src/webcodex_cli/login.rs:108-125 | src/auth/pat.rs:150-168 | src/auth/pat.rs:196-208 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1737c66716ab70e714d276c7d3f6d3e82cf1e45dc44a4d2d9a6b058d087e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/webcodex-core/src/runner_protocol/job.rs:421-439 | crates/webcodex-core/src/runner_protocol/job.rs:762-780 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1fc56cd4d6dc37b32fe59e19dac3dc70c919da7ebef1e7ca0f34edc4c93de1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/webcodex-core/src/validation_evidence.rs:123-143 | crates/webcodex-core/src/validation_evidence.rs:221-239 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"386278cb08c43d1cf08cf090ccb8fb740e4bd10f5635d00104773ef62b2a6176"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs:253-263 | crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:276-286 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbad19c9a84d18e8ef88df334e9936bae1b3dc215e6b8b5aeab0bd6f9b2e59e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/webcodex-lsp/src/supervisor.rs:2690-2706 | crates/webcodex-runner/src/webcodex_runner/external_tools.rs:1362-1375 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":2690}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6080e930013caa7b9935a5f1c96930100fc0a9c9bbf52cd30d74e5fed76056"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/webcodex-store/src/window_collaboration.rs:353-376 | crates/webcodex-store/src/window_collaboration.rs:384-398 | crates/webcodex-store/src/window_collaboration.rs:406-425 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/window_collaboration.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d1dd5a2bc5554c1d4953063c4913ee3213dbd8bea446805d6bd498a1875d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/tool_request_trace/store.rs:70-88 | src/tool_request_trace/store.rs:93-111 \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":"src/tool_request_trace/store.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"536c56d5767079cf6db22cb42b8aacb273c15b7c4f67132c5cef9865186194b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/tool_runtime/agent_task.rs:376-399 | src/tool_runtime/agent_task.rs:483-495 | src/tool_runtime/agent_task.rs:830-854 \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":"src/tool_runtime/agent_task.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e389c7693d4b6d242b01a2558937891cc9f7dcb82943135d6e765b4d885a0805"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/tool_runtime/structured_execution.rs:158-178 | src/tool_runtime/validation.rs:193-221 \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":"src/tool_runtime/structured_execution.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1aea1227b7f99bd9088d931060a2cf8f2998cca8c96f68f202306e37ea82fe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/webcodex-runner-registry/src/runners.rs:1309-1319 | crates/webcodex-runner-registry/src/runners.rs:1328-1343 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a5a106b70ee36ff4e74cb2e7d71a0ce0f99ea73e13587d242b634f45ae79cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/webcodex-store/src/agent_continuation_reference.rs:128-144 | crates/webcodex-store/src/agent_task_attempt_reference.rs:173-190 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_continuation_reference.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25263c25c053409da8574c98aa6e26f22cb3be02a97f51c4be848521b3e8b09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-persistent-shell/src/unix/launch.rs:63-75 | src/server_listener.rs:147-164 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix/launch.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcd24b503d5fe0e0d1c175441911cd231817cc6a78c213564c590a74d10ef7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-store/src/communication.rs:3117-3139 | crates/webcodex-store/src/communication.rs:3141-3155 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":3117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9af790cfa64a45d6b3dee11347d7a7c0fd42983570cecea15efd6d14e668f87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tool_runtime/files/artifacts.rs:966-985 | src/tool_runtime/files/artifacts.rs:992-1011 \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":"src/tool_runtime/files/artifacts.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a742ae2c1daf2a75a081e7fca12f1179fe94a3fb54d08ac73df422d9916ac6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): src/tool_runtime/goal.rs:638-659 | src/tool_runtime/goal.rs:698-710 | src/tool_runtime/goal.rs:719-737 | src/tool_runtime/goal.rs:746-764 | src/tool_runtime/goal.rs:766-778 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/goal.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9b5da13a983aac9acb38e59997833210fb2fe4464ce276c9cafd66c89e7480"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/webcodex-tool-contracts/src/registry/output_schemas/communication.rs:193-215 | crates/webcodex-tool-contracts/src/registry/output_schemas/communication.rs:217-230 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/communication.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e4ab7dd621342d1b1321ca5418088d468137c5cbd938f236c99013939c2800"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/webcodex-workflow-session/src/console.rs:1077-1091 | src/tool_runtime/patch.rs:95-105 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/console.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee63de9c74bb3cb398e57713c97fafb0c6906dc97d906f0c6163904b92ab80f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/cloudflare_transport.rs:433-449 | src/oauth_http/managed_authorize.rs:29-42 \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":"src/cloudflare_transport.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1e3b81a99581234ec99934aa42cf0265408c4ff55ff3195278586092c504ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/webcodex-workflow-session/src/incarnation.rs:13-24 | src/agent_wake.rs:146-157 | src/project_entry_setup.rs:785-795 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/incarnation.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"311df8d2708eab3b7674e8d63a31419e06e4105bc98f2da33b974cbc6eb8ab88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-runner/src/webcodex_runner/ssh.rs:1058-1068 | src/tool_runtime/session_shell.rs:957-965 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe947923331218af04d588fafd39c4dc0e2cb9e56e6a01ce077d44a0e1008e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-workflow-session/src/store.rs:2177-2191 | crates/webcodex-workflow-session/src/store.rs:2197-2211 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":2177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73ea7e40af5f48a39ee10f3f4a1b591a1f62a8eed4466f0baf4bf9e8e483c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-cli/src/webcodex_cli/connect/profile.rs:248-263 | src/tool_runtime/checkpoint.rs:621-635 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdba3287bd168b91a9810b6ae637b8a339d62f8e446b7ee01d522b17c6e03a84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/webcodex-cli/src/webcodex_cli/system.rs:367-382 | crates/webcodex-cli/src/webcodex_cli/system.rs:384-403 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a664dbe1b525d3e5a032e886238f8a053091f142c3eea7107e3abd722491fdea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/webcodex-runner-registry/src/job_updates.rs:957-969 | crates/webcodex-runner-registry/src/job_updates.rs:975-989 | crates/webcodex-runner-registry/src/job_updates.rs:1218-1231 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"20eaf51cbe6b6d2c8210a0eb38fc24d24ed14b94e1f570bbe48962e6024747a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/webcodex-runner/src/webcodex_runner/artifacts.rs:142-151 | crates/webcodex-runner/src/webcodex_runner/artifacts.rs:157-166 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"837b391ecb56d9d47b809874f7265117a6eddf8c3c775739fd6720655f7cde63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/webcodex-runner/src/webcodex_runner/exit_diagnostics.rs:428-439 | crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs:498-507 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/exit_diagnostics.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7c85792a74c4057f51fd25822ca471a4f1011fbbfd7e8c58174f21ae327505"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-tool-runtime-contracts/src/tool_audit.rs:76-88 | src/tool_runtime/session_tools.rs:779-792 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6658dddef9ae10c23623b9ca1fd0355e1dae998d81da663bc9190cdebd148e49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): apps/desktop/src-tauri/src/mcp_providers.rs:473-489 | crates/webcodex-process/src/program.rs:233-249 \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":"apps/desktop/src-tauri/src/mcp_providers.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"500a41cbf7d8f23d4af4b21817b5eed5d18667ddc58701cabadbaa1cf7c821f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:303-322 | crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:330-349 | crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:358-377 | crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:385-404 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"080634d608e74d4261daf3ec8997f9c5926d04f82bf5a71e63dc832cb8eca59c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/webcodex-store/src/agent_wake.rs:2901-2915 | crates/webcodex-store/src/communication.rs:3210-3226 | crates/webcodex-store/src/store_primitives.rs:137-155 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f0ac347a971ef85ed6b39ca9fcfffad6bcd5b592a31a4b4d78b23081547433"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/webcodex-store/src/artifact_handoff.rs:1076-1092 | crates/webcodex-store/src/job_terminal_wait.rs:623-638 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/artifact_handoff.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"87537c7ad7313347403de431a1f4189ba6e642303b448b07c9be1e4c9e4d4411"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/webcodex-runner/src/webcodex_runner/artifacts.rs:189-199 | crates/webcodex-runner/src/webcodex_runner/artifacts.rs:201-210 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5984666f0954f50dd7dd3c871268f46d40640ec6c4a7b492ef483fdf62558b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/webcodex-runner/src/webcodex_runner/ssh.rs:910-925 | crates/webcodex-runner/src/webcodex_runner/ssh.rs:931-945 | crates/webcodex-runner/src/webcodex_runner/ssh.rs:947-964 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6539cb9d131c772a1ed644ad217fdd7c2d06731a2ec4388dd48e0f56b8beb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-workflow-session/src/messages.rs:309-323 | crates/webcodex-workflow-session/src/messages.rs:328-342 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/messages.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"f937d28ce34e3e6e6ae90abeb938e4c40288c3bc4e6a97a9104fe2f01e9a6eae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/tool_runtime/agent_task.rs:568-588 | src/tool_runtime/communication.rs:561-579 \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":"src/tool_runtime/agent_task.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"5177a47270d5b841ae0bb94561d460b034b8d5123a56223b6660d9b44b8e604f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): apps/desktop/src-tauri/src/webcodex/adapter.rs:82-98 | apps/desktop/src-tauri/src/webcodex/adapter.rs:104-120 \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":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ab85784d3cdaeca33900824d3ae69682b1ab17c0ba41231d72242de6e1c9af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/webcodex-cli/src/webcodex_cli/connect/probe.rs:46-57 | crates/webcodex-cli/src/webcodex_cli/connect/probe.rs:63-78 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/probe.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b362d429ad14bcac486640fce7105bcfb414a1c4dc0f20a87c755932b0f94346"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/webcodex-core/src/runner_operation.rs:2384-2397 | crates/webcodex-core/src/runner_operation.rs:2399-2414 | crates/webcodex-core/src/runner_operation.rs:2416-2431 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":2384}}}],"partialFingerprints":{"codehealthFindingId/v1":"b303b4b7e18956666052ec72b753d168371a8f3f83e3d6f6b9a172b72f4cc3ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/webcodex-validation/src/adapters/mod.rs:193-208 | crates/webcodex-validation/src/adapters/mod.rs:210-230 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/adapters/mod.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6d908a0b71baf9f47566df06311c76abd9c0ee0505ac9819f18bdf9a80b9a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/webcodex-browser/src/supervisor.rs:792-807 | crates/webcodex-browser/src/supervisor.rs:815-830 | crates/webcodex-browser/src/supervisor.rs:838-853 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d6d9b2f0f58087a0fec5a6412759cc1d8db3dff08a7e254906faee7143d372"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/webcodex-runner/src/webcodex_runner/project_build.rs:213-225 | crates/webcodex-runner/src/webcodex_runner/project_format.rs:368-380 | crates/webcodex-runner/src/webcodex_runner/validation/project.rs:197-209 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"821b122c6522697315f721ba4649b0f660ab4bbe9187eedb944dc8cf909ddd6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/tool_runtime/read_files.rs:288-306 | src/tool_runtime/result_projection.rs:423-444 \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":"src/tool_runtime/read_files.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a310650fccdbdd1d3f96320e424e15d5aa0dff454f0ba36e86187e4ed4a5be6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/webcodex-store/src/accounts.rs:6-17 | crates/webcodex-store/src/accounts.rs:365-376 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/accounts.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6de7b1a92c1613c24879be909ffb4994c3e584708c05acf89fdd4c23947db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/webcodex-store/src/accounts.rs:49-61 | crates/webcodex-store/src/accounts.rs:316-327 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/accounts.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daf0b0ea88e2d9ef9e8ec5247d80290012cc2e139630b7f689d0bdb5f5818bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-store/src/audit.rs:41-55 | crates/webcodex-store/src/audit.rs:96-113 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/audit.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f0b464319dc9f02b7d13fa65db285c6497c4e2f875660b04a58f6148f25051"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-store/src/oauth.rs:158-170 | crates/webcodex-store/src/oauth.rs:187-199 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de79c54e1dd1790974d2ae9636aeb45646eef3f337f29d777fec4604cb46bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-store/src/oauth.rs:432-446 | crates/webcodex-store/src/oauth.rs:491-505 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a00d8755fe4b93e6ca45e914688f053cc7d937977877795ea32eddff503368"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-store/src/oauth.rs:817-831 | crates/webcodex-store/src/oauth.rs:878-892 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddde634cd41097295cd75be17949416ae4d6763e6e0d732ccdd921438ac2374"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs:75-87 | crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs:152-164 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5deb2dc11ce96222c4846b5949837af054b43d0476ab4129bb9ff251963b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/mcp/tools/invocation.rs:221-233 | src/mcp/tools/invocation.rs:265-279 \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":"src/mcp/tools/invocation.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"49564b905a94c6cc6739fec601f9d1a8646cf9f24eb66f1b0ac7cc3685ed4529"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/webcodex-core/src/runner_operation.rs:2341-2353 | crates/webcodex-core/src/runner_operation.rs:2355-2368 | crates/webcodex-core/src/runner_operation.rs:2370-2382 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a7902f6a9e9914128aee0b9083665d6f41bca2774c6eab6cdf4eab1c67ec96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/webcodex-store/src/agent_task/invariants.rs:752-783 | crates/webcodex-store/src/agent_task_attempt_reference.rs:40-65 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/invariants.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"8933a5924decb249d65e18cf7341df3ce9e90aca8bd342411125d7ad9f7e2f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/webcodex-cli/src/webcodex_cli/service.rs:173-186 | src/oauth_http/html.rs:4-17 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"536519f6ec8a81a77800f5231b32a061d478c652e5de7b898144b986cf25834f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-runner-registry/src/reconciliation.rs:671-687 | crates/webcodex-runner-registry/src/reconciliation.rs:795-807 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cc042e1bb8fd2ca345ce286c83089e5ab7af6371f8806fb3e79815fc7b03ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-runner-registry/src/validation.rs:248-267 | crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:34-48 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8e9255dc4c9971fa33e8aecb2a2147211b4ecfc93f6f78f4fa417413bf29cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tool_request_trace/store.rs:176-187 | src/tool_request_trace/store.rs:189-198 \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":"src/tool_request_trace/store.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b8bce5875aef9a028ce188752e47b8540e8da7c0db7e0108b69865e702cfaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): src/tool_runtime/goal.rs:136-155 | src/tool_runtime/goal.rs:157-176 | src/tool_runtime/goal.rs:178-197 \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":"src/tool_runtime/goal.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd2259bfa87035c5977538fc78193efce8d834c0778758e297488575848d805"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:411-426 | crates/webcodex-runner/src/webcodex_runner/plugin.rs:906-920 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff9d07ad4b281b722691365c4cecfdbf9a1be65fc9965af374542c035787972"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/webcodex-runner/src/webcodex_runner/skill_store.rs:2031-2040 | src/tool_runtime/model_ergonomics_telemetry/job_convergence.rs:49-58 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"4004abae9ba0e101860617e190a6b440279a3c6560a21710bb01ba73e070426f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-cli/src/webcodex_cli/service.rs:974-986 | crates/webcodex-cli/src/webcodex_cli/service.rs:988-1000 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dccde3cdac7145cc444025a74c1444edd44ca2732f1713a7a3738fb75f9cec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/webcodex-environment/src/service/linux.rs:523-538 | crates/webcodex-environment/src/service/macos.rs:385-398 | crates/webcodex-environment/src/service/macos.rs:400-413 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"027af68ac78443ebdeaeb6c137e685303c81f1878dd63f5c5970e399e5a0c732"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/webcodex-runner-registry/src/jobs.rs:29-48 | crates/webcodex-runner-registry/src/requests.rs:114-137 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/jobs.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3187314d60e7b68e921de8e4da3eaa169244bbbc8725350419b1c404b892d7b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/webcodex-store/src/agent_task/models.rs:105-118 | crates/webcodex-store/src/agent_wake.rs:67-82 | crates/webcodex-store/src/agent_wake.rs:97-111 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/models.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f611800cafd7e233859d7211a4919c816a259ff814b1d24a90bec01cb5bde171"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-validation/src/adapters/mod.rs:552-566 | crates/webcodex-validation/src/adapters/mod.rs:570-587 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/adapters/mod.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a300bfe67d8ec9a50924be95e138d146dbdc56822d4bac666977c5d7ecf41d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/webcodex-environment/src/installer_authorization.rs:22-37 | crates/webcodex-environment/src/installer_authorization.rs:50-68 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/installer_authorization.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cceb5b31127584518aca208181e0e2757c64eb3262db5aa4f04fe463d63fcb1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/webcodex-store/src/agent_task/invariants.rs:687-733 | crates/webcodex-store/src/agent_wake.rs:2525-2566 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/invariants.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffe4412d03215874fb3f420098502fff29de9d8aac5aefcf728877b23c42753"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs:153-166 | crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs:177-190 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1793d6faeaeab00911837637c16acdaaeaeadcafbeb2c76bb0b703cbaf34085e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs:313-329 | crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs:359-374 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f77936a442fff26626907e11f8d56504c7963b30c276032a58d92b34122892"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-store/src/accounts.rs:292-300 | crates/webcodex-store/src/accounts.rs:304-312 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/accounts.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd5436f9514cf67a03527192e1574f9bd3122442e65c72517f608160df11fa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/mcp/presentation.rs:76-87 | src/mcp/tools.rs:956-968 | src/mcp/tools.rs:1049-1058 \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":"src/mcp/presentation.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f814240d5a3d1f7803c958e4dc476ee699b0294b8b02c8d737ee8efc57d518"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 23\u002B corresponding lines): src/tool_runtime/agent_task.rs:750-772 | src/tool_runtime/agent_task.rs:870-899 | src/tool_runtime/agent_task.rs:1173-1197 | src/tool_runtime/agent_task.rs:1257-1283 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/agent_task.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"63498065698477a3ade44bc908f43ac389388921ada082d3827871287a16aa75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs:510-520 | crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs:403-413 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d829339ed161da96ce2bb34be75f8db48eca6ae62423a0287fef5fda53a2670f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/webcodex-runner/src/webcodex_runner/output.rs:69-77 | crates/webcodex-runner/src/webcodex_runner/output.rs:80-88 | crates/webcodex-runner/src/webcodex_runner/projects.rs:56-67 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/output.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e02d0b1b3d723d432b21bc90e3ede407cff43e1d35500e36720f09acb81556"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tool_request_trace/lifecycle.rs:240-248 | src/tool_request_trace/lifecycle.rs:255-270 \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":"src/tool_request_trace/lifecycle.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1979fe6a2efaeebdb5d7b6f4dd1f321297fb14e354303b86957647cdaa631e48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tool_runtime/job_terminal_wait.rs:436-449 | src/tool_runtime/job_terminal_wait.rs:456-470 \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":"src/tool_runtime/job_terminal_wait.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf272b78293e719b387b4b5ccab2611931d32260f26735e484bce000dc572933"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): src/tool_runtime/jobs.rs:1250-1270 | src/tool_runtime/jobs.rs:1272-1292 | src/tool_runtime/jobs.rs:1298-1322 | src/tool_runtime/jobs.rs:1329-1354 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/jobs.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c7e7d503909b611d0dcf0a886350c5c6b07917199c68f4b40bf09d9db9eeab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tool_runtime/semantic_navigation.rs:136-159 | src/tool_runtime/semantic_navigation.rs:183-198 \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":"src/tool_runtime/semantic_navigation.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cf0bbe30b9e6c38906de3e486231965bf6bfa7a6954655036a934fb50b13d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/webcodex-core/src/authority.rs:69-81 | crates/webcodex-core/src/plugin.rs:574-586 | crates/webcodex-store/src/store_primitives.rs:161-176 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/authority.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e065ff859b57dc0635f44dcb5bc94d9ea4aa013ce2d22b727ea2d1efb240d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/runtime_console_http/goals.rs:381-388 | src/runtime_console_http/goals.rs:391-398 \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":"src/runtime_console_http/goals.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfab825bf43d495fdec56c9324ba9d245c31a425067b12b9b28fd2a01daa669"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/webcodex-cli/src/webcodex_cli/connect/process.rs:245-255 | crates/webcodex-cli/src/webcodex_cli/connect/process.rs:290-301 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/process.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9b9da63c02f9f456cc4886fcba0785ec877a86c6ee6cda828cd011285ed5b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-runner-registry/src/runners.rs:1434-1442 | crates/webcodex-runner-registry/src/runners.rs:1454-1470 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f4caef7b6122d680fe88308129f0d1f03dbf44131aa4e1a107bd24e6cafe56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-runner-registry/src/runners.rs:1472-1480 | crates/webcodex-runner-registry/src/runners.rs:1514-1522 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf616f371825293ad0b6fe9de058f78745d2a2d54c9e07325b5d1d5ffa282c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/webcodex-store/src/oauth.rs:212-221 | crates/webcodex-store/src/oauth.rs:227-238 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"708a28fcb28a3fac26913a0763ab35265ddaa85fe5b837ef9233fdcfb0183ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/auth/pat.rs:220-229 | src/pairing_http.rs:76-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":"src/auth/pat.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"242b50cd9f0172da226cbe3e8cf893746e496cc16cc94f6628b05b4e0d12584d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): src/tool_runtime/memory.rs:165-176 | src/tool_runtime/memory.rs:233-243 | src/tool_runtime/memory.rs:245-257 | src/tool_runtime/skills.rs:2426-2439 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/memory.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dc9b06d2896efacb9de033c779d0c00eb5d2030bd7c3ba8f06c42d69b4cc40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/mcp_gateway.rs:673-685 | src/plugin_gateway.rs:1256-1269 \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":"src/mcp_gateway.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"370553d83018478d35c7b6da801b11b4d4edd46819a70ddf33c3ca37d6b2da89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-cli/src/webcodex_cli/connect/profile.rs:480-489 | crates/webcodex-cli/src/webcodex_cli/connect/profile.rs:546-554 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"164e1d089e9e7ef2bb318b35244c91bffacf4ea5e8379909faca624dfba13d41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/webcodex-core/src/authority.rs:55-67 | src/auth/project_credential.rs:196-206 | src/auth/project_credential.rs:208-218 | src/auth/project_credential.rs:220-231 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/authority.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f16ff9fdf570726856a90e87cf43e60005b832299a04d67432064a1202481c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/webcodex-core/src/mcp_gateway.rs:647-657 | src/tool_runtime/computer_tools/snapshot_receipts.rs:173-183 | src/tool_runtime/files/artifacts.rs:42-52 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"7817bc77ac1846081bec0e7a22fd58a494f36623dc081f4374df2ed4b87da6a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): crates/webcodex-store/src/agent_attention.rs:277-295 | crates/webcodex-store/src/agent_task/invariants.rs:334-353 | crates/webcodex-store/src/communication.rs:2800-2821 | crates/webcodex-store/src/goal.rs:1316-1336 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_attention.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"0314bd97458fd2c46bfe47d43f0c66cbb12ef3e3846416ffc49ad4b7b4239328"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/runner_tokens_http/responses.rs:6-20 | src/users_http/tokens.rs:58-70 \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":"src/runner_tokens_http/responses.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd87df170dea0be2f45983232c472dfc55ed79d290cfa00ee0a1e75ca2b3e29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): apps/desktop/src-tauri/src/desktop_locale.rs:53-63 | apps/desktop/src-tauri/src/desktop_shell.rs:91-101 \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":"apps/desktop/src-tauri/src/desktop_locale.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e17e96fd1d9d0ab6caa3deea2a78984b7dfe0463473761d28cf1c83350b0d2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-core/src/mcp_gateway.rs:659-667 | crates/webcodex-core/src/plugin.rs:1474-1482 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9457d0da428068c842b8095e4736a3def36bd5a308d790c1e516b2b399ca8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-code-mode/src/runtime.rs:1263-1271 | crates/webcodex-code-mode/src/runtime.rs:1277-1285 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-code-mode/src/runtime.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3b8c14cc31c52bae81d38216adb997675eb56404bd6ee54273d15efc4ba487"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-environment/src/process/unix.rs:48-54 | crates/webcodex-persistent-shell/src/unix/readers.rs:6-19 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/process/unix.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"134cb3d0d279855fbdc24e2af612d498913acb38515b5ba627ee7ecdc05c46d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/webcodex-tool-contracts/src/registry/output_schemas/edits.rs:276-287 | crates/webcodex-tool-contracts/src/registry/output_schemas/edits.rs:289-305 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/edits.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d552d241b9f2830e9e17773209e0e17568f6f4a41f7824b7690dffaabe7b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/tool_runtime/startup_brief.rs:519-529 | src/tool_runtime/startup_brief.rs:548-555 | src/tool_runtime/startup_brief.rs:557-567 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4dceb9497eda49de56baed10f5dcc049249bb4ed8ec64ac9e9e62bae186838"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): apps/desktop/src-tauri/src/mcp_providers.rs:232-243 | apps/desktop/src-tauri/src/tunnel_config.rs:414-427 \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":"apps/desktop/src-tauri/src/mcp_providers.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1998eab5a9ec3b91c76207c7257d0eea4c6c465f6ac3f65b6e7f254bf7fd623f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/webcodex-cli/src/webcodex_cli/connections.rs:340-354 | crates/webcodex-cli/src/webcodex_cli/service.rs:188-202 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connections.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2f637973f44c08019de8c391780ffed94b200c885949e3e3a10a57b26b93b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/webcodex-core/src/coding_agent.rs:1171-1181 | crates/webcodex-core/src/plugin.rs:1462-1472 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5a24a2b28e95f7c14b713b81c028f16206943b2776427d6f1420c29768c102"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/mcp/resources.rs:254-262 | src/mcp/resources.rs:405-413 \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":"src/mcp/resources.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"675a0f08c7483774857147d2565cc351d1cda13df666f0610ed81aed61b4f80d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): src/plugin_gateway.rs:989-1000 | src/plugin_gateway.rs:1002-1013 | src/plugin_gateway.rs:1017-1028 \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":"src/plugin_gateway.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c135811b03164b1849f9c65467d380718c9355cc15ee967fd80d5ed2a59b55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): apps/desktop/src-tauri/src/process/supervisor.rs:614-626 | apps/desktop/src-tauri/src/webcodex/cli.rs:842-853 \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":"apps/desktop/src-tauri/src/process/supervisor.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f273eff2db221e5344b3ea31b4cc56740a733ccd47fdd353b2f7a501764bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-cli/src/webcodex_cli/service.rs:492-504 | crates/webcodex-cli/src/webcodex_cli/service.rs:1538-1550 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"68eb482d58962855fb25dfed2026bd1916b55c3789ea3ffb427dd2cb65f567e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-runner-registry/src/validation.rs:129-137 | crates/webcodex-runner/src/webcodex_runner/external_tools.rs:1548-1559 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1baa9a97ee542d2dbbe25b1af67f0d65f5d53e86c43a602898c2a40efbf2403"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tool_runtime/git/show_changes.rs:1220-1226 | src/tool_runtime/git/show_changes.rs:1232-1246 \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":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"77818886984310c5b7c0adee62cea429f38de4db892cbb3a619cd37d72f6068f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): src/tool_runtime/resource_references.rs:248-267 | src/tool_runtime/workbench_execution.rs:49-71 | src/tool_runtime/workbench_state.rs:428-451 \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":"src/tool_runtime/resource_references.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"617c922d54f7c7b5d930a7d6fe0342fc1590b8586e54515cc3b83c51a4888b91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/webcodex-cli/src/webcodex_cli/connect/process.rs:303-313 | crates/webcodex-runner/src/webcodex_runner/patches.rs:1046-1052 | src/project_entry_setup.rs:1277-1287 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/process.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cccf97595cda68bd14522db3643b8701f40cec6f9380df930a07d655ef531c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/webcodex-core/src/project_build.rs:171-183 | crates/webcodex-core/src/project_validation.rs:192-204 | crates/webcodex-store/src/artifact_handoff.rs:954-965 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_build.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d55c472bebde2bb0f0ec021ae4c2f164d010caac1f5de334e25573f0576889"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/webcodex-core/src/runner_protocol.rs:1887-1903 | crates/webcodex-core/src/ssh_resource.rs:50-62 | crates/webcodex-store/src/agent_task/invariants.rs:302-316 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aced1a404dd79f7b5d22bda2b52942ccddaa57e177f18a84d6222e74dd081b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/webcodex-core/src/validation_evidence.rs:717-732 | crates/webcodex-validation/src/adapters/node.rs:28-45 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b224329a1d9e3bdf90d84c7f9f0456fe5931bf182d4d8ee5e15ec21a3876109"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): crates/webcodex-lsp/src/fake_server.rs:795-802 | crates/webcodex-lsp/src/fake_server.rs:882-889 | crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs:502-508 | crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs:395-401 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47bfae2c2364990e982597b2e6a0bb261824da1dd450bd7b55842e5909e44b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-lsp/src/supervisor.rs:1591-1603 | crates/webcodex-runner/src/webcodex_runner/external_tools.rs:1507-1515 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"133ceffe9badb3168628e156588188c1d6822688a0d283905481b6447fa03094"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/webcodex-process/src/unix.rs:99-110 | crates/webcodex-process/src/unix.rs:137-148 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/unix.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1d557cca8d63e2d94c2a6b0ad9a8f15ceefb0db286704db1fb85ac4c915c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-store/src/communication.rs:3182-3194 | crates/webcodex-store/src/communication.rs:3196-3208 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":3182}}}],"partialFingerprints":{"codehealthFindingId/v1":"774b3c4124107a8d1976d47cc848075b538eaf88a01e6157e40a8e4cce406bd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/webcodex-store/src/workbench_preferences.rs:192-208 | crates/webcodex-store/src/workbench_preferences.rs:214-225 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/workbench_preferences.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5acf44049e5f550e17e8d92f6327cb3025243b22d7fee8471d9faed5257acb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/webcodex-tool-contracts/src/registry/output_schemas/agent_waits.rs:102-120 | crates/webcodex-tool-contracts/src/registry/output_schemas/goals.rs:276-319 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/agent_waits.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c7f92b35507a77a581ec4ab4e0602e8f4f34aaebc44a37860704822a6a9111"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/webcodex-workflow-session/src/messages.rs:349-359 | crates/webcodex-workflow-session/src/messages.rs:367-382 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/messages.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6022b413d3c74ec1a7ef921c3839099a2e60d5a8e055279199b12b5eed18993"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): src/tool_runtime/process.rs:350-356 | src/tool_runtime/project_build.rs:41-48 | src/tool_runtime/script.rs:30-37 | src/tool_runtime/shell.rs:739-746 \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":"src/tool_runtime/process.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33e3ce5e28617542ee4a83ef7c8ad5a106647c029ebd1e5471f1383c410c4d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/desktop/src-tauri/src/state/app_state.rs:234-243 | apps/desktop/src-tauri/src/state/app_state.rs:328-337 \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":"apps/desktop/src-tauri/src/state/app_state.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"03036660c926a953e591a147bb369878d6a7a2dbdb7acb2ccee8816e1e418158"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/webcodex-browser/src/cdp.rs:1513-1528 | crates/webcodex-browser/src/cdp.rs:1535-1550 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"2169170cb4958209a371beb6cbd4281a512cc710d3e91c53811107f0a4ed1510"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/webcodex-lsp/src/fake_server.rs:871-880 | crates/webcodex-runner/src/webcodex_runner/fake_claude_mcp.rs:297-306 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef22f2b63524a5cb18d66c99f1f3207802cf7dde37b653d4ea10b4b8e92cd191"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-runner-config/src/paths.rs:33-39 | crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:156-162 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-config/src/paths.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca78425a7a343f891a7273a3f95d9100ce428f738044b096e955b7503ce9ae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-runner/src/webcodex_runner/fake_claude_mcp.rs:240-249 | crates/webcodex-lsp/src/fake_server.rs:366-374 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_claude_mcp.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f760ca549e89f308c3bdd1d256ad202d4ce1347bc6e130fc00f26a07f17a7d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/tool_runtime/agent_task.rs:183-192 | src/tool_runtime/code_mode.rs:160-172 | src/tool_runtime/session_context.rs:544-553 \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":"src/tool_runtime/agent_task.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a921d3420359ab1e5c445d5e44717411230345aa67a514ca8063fd75c8475ca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tool_runtime/communication.rs:221-233 | src/tool_runtime/agent_task.rs:123-134 \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":"src/tool_runtime/communication.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc758711d03cf9f291fd110e1b8e5ed27b2143d81de74e944a59141dfb326450"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tool_runtime/communication.rs:235-247 | src/tool_runtime/goal.rs:448-460 \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":"src/tool_runtime/communication.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"19717f01689d4939e3068274207fe9768261edd636adeea781db72c78d0a52cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/webcodex-lsp/src/supervisor.rs:2673-2683 | crates/webcodex-runner/src/webcodex_runner/shell/preparation.rs:43-56 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":2673}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0e1aa59718dd4ff2d6c23e427a8211013e0c9dbd6185c7b2899b960a90ba29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/webcodex-store/src/agent_task/invariants.rs:256-266 | crates/webcodex-store/src/agent_task/invariants.rs:282-297 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/invariants.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc893ea3738a71da0ff00ae0d331fb55be5918e03f18f0232ec1f9bc49a9a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:727-746 | crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:748-763 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"da88e50af01de1887e93a65a7e05dce142790c058e95aed8033132a0ede6bcec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tool_runtime/runtime.rs:21-27 | src/tool_runtime/coding_agent.rs:2015-2021 \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":"src/tool_runtime/runtime.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed29757fd5ac91264e718895ce08113b216cf09ae850135c631919769066ebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): crates/webcodex-runner/src/webcodex_runner/configured_skills.rs:619-629 | crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs:265-272 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:317-327 | src/tool_runtime/coding_agent.rs:1735-1745 | src/tool_runtime/session_context.rs:674-681 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/configured_skills.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d0c019cc5e5c7a831e1fa4868ea83817e50fb77a8d2eeba5c27d9e9535e825"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/auth/project_share.rs:28-35 | src/oauth_http/managed_authorize.rs:408-415 \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":"src/auth/project_share.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"79734372144e57ba96dfc49473a3781b0895fdfac47f1712a50ac04a16ab9973"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/runtime_console_http.rs:2401-2413 | src/runtime_console_http.rs:2437-2449 \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":"src/runtime_console_http.rs"},"region":{"startLine":2401}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd4a1ff2f3f8ff23633b9a256fe4d7031845dfccedbb6811d3aab3cfe1bd419"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/tool_runtime/helpers.rs:785-805 | src/tool_runtime/validation.rs:353-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":"src/tool_runtime/helpers.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"036aabd0ea2ac0b995ec8a565aad44be3e1176ef9342cf69f7eddc6430d84644"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-runner/src/webcodex_runner/artifacts.rs:100-106 | crates/webcodex-runner/src/webcodex_runner/patches.rs:141-147 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"11484685ff33d7e10b228dc326c92aeb249e993b2bbf90d91bbf7dcbe40c64a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): crates/webcodex-store/src/agent_task/models.rs:31-43 | crates/webcodex-store/src/agent_task/models.rs:69-81 | crates/webcodex-store/src/agent_wait.rs:47-59 | crates/webcodex-store/src/communication.rs:69-80 | crates/webcodex-store/src/goal.rs:138-149 \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":"crates/webcodex-store/src/agent_task/models.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"27794cff35b36aec25e4883b2fb016d973425d43bc46a76b58ed3c9e17f28885"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-workflow-session/src/events.rs:216-226 | src/tool_runtime/job_audit.rs:63-69 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5abbcf12a8610da972203c96e2d2591de75ea5f95003584d24e7217a3b69f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-core/src/project_format.rs:293-307 | crates/webcodex-core/src/project_build.rs:466-478 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_format.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be7aacc8e9bbec0372abac15359c6e9435333d172a21edb4b795516692370ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/webcodex-persistent-shell/src/framing.rs:188-200 | crates/webcodex-runner/src/webcodex_runner/config.rs:463-473 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/framing.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e326749e0c81c47f6878d282dc0e40b0dc09b12e59792ada379dce9ceb5f54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-runner-registry/src/validation.rs:794-802 | src/auth/pat.rs:182-191 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"0675c69c410712d6515617638451abc7fd6df73abce19d21ae1e27b15df56c36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/webcodex-workflow-session/src/events.rs:206-214 | src/runtime_http.rs:567-574 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a166953f87895aa081228aa668ef2e5e9587947a9b9a126aa01b40c4ab324376"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/project_entry_openai_tunnel.rs:331-338 | src/project_entry_share.rs:455-462 \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":"src/project_entry_openai_tunnel.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2d9151cfc9ab49d15a14f053cdbaf3f092dcc7f6a015ee99cc18c52863a452"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): src/tool_runtime/files/mutations/patch.rs:14-32 | src/tool_runtime/files/mutations/preflight.rs:98-113 | src/tool_runtime/files/mutations/text_edits.rs:9-25 | src/tool_runtime/files/mutations/write.rs:108-120 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/patch.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"810a818fc8a01f38d7b41ab414970529b3b0aff292af4700f69e8103c21b6df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/oauth_http/shared_key_bridge.rs:108-129 | crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs:118-134 \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":"src/oauth_http/shared_key_bridge.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47cbae0febbeec9f6a98607e264f8cabc51bb6138e07d2cca192b3469cfe69a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apps/desktop/src-tauri/src/desktop_locale.rs:72-80 | apps/desktop/src-tauri/src/desktop_shell.rs:110-118 \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":"apps/desktop/src-tauri/src/desktop_locale.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1abad29dfe4511607c8c65f55bfb1646f33a3d188083f25ec941908f3bc28b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/webcodex-cli/src/webcodex_cli/ops.rs:1680-1689 | crates/webcodex-cli/src/webcodex_cli/runner_service.rs:322-331 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/ops.rs"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f68e696ff90db17ed48f7497b2e1b8d4e3878008e8b74b03653fbd0af950557"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/webcodex-runner-registry/src/runners.rs:1528-1536 | crates/webcodex-runner-registry/src/runners.rs:1542-1552 | crates/webcodex-runner-registry/src/runners.rs:1619-1627 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ca18a9cb46a721ec3d812dc4f9976bcc3caeadc4cfaf590044f3f3ebf8e93d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/webcodex-browser/src/types.rs:651-660 | crates/webcodex-runner/src/webcodex_runner/detached_job/model.rs:525-534 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/types.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"86855e4a7cb85cd9a281afb7d5a4e2c28b2fdf89567d252b416e493ad24b1ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/webcodex-computer/src/platform/macos/display.rs:203-214 | crates/webcodex-computer/src/platform/windows/display.rs:105-114 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/display.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab3408a01315c5ffa1aaab34a4b2bb0521705a796dbf0315b0053e1fbb1578d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/agent_wake.rs:128-139 | src/job_terminal_attention.rs:547-558 \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":"src/agent_wake.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e696d21fa6a56e1db085ce38183cef352d4a126e90c50d60ee5de7c96fcdf1d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-computer/src/platform/windows/accessibility.rs:156-164 | crates/webcodex-computer/src/platform/windows/accessibility.rs:516-531 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/accessibility.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6980df006f1f3fc47e7573643f1b93ed4c65dea7f4597f91a2b36da826c351b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/webcodex-core/src/ssh_resource.rs:36-46 | crates/webcodex-environment/src/tunnel.rs:261-270 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/ssh_resource.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ba18149b7f23b78048f4fc5e989e51856e1d81dfb68cf0237f2133385cdc2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/webcodex-lsp/src/fake_server.rs:489-499 | crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs:496-500 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"885c9f98841f5b1b4494605b1dcf17476f2e058c1551507cd5e65190b3c39a61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/webcodex-runner/src/webcodex_runner/configured_skills.rs:637-644 | src/tool_runtime/skills.rs:2650-2657 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/configured_skills.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2a4177a08c70f09e7095e95d53100f332a532c472f8ebdcace3098217f298b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/webcodex-store/src/communication.rs:3248-3259 | crates/webcodex-store/src/goal.rs:1349-1358 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":3248}}}],"partialFingerprints":{"codehealthFindingId/v1":"87342ace845bd8814bc8a60961226bd129ef9021a5b13e29a8dddc9ab0793784"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): apps/desktop/src-tauri/src/lifecycle_log.rs:209-219 | crates/webcodex-browser/src/profiles.rs:28-38 \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":"apps/desktop/src-tauri/src/lifecycle_log.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"81955fddad0e2f711a125844ed14781bfabd1ba99dcffad87b892633c36578b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/webcodex-environment/src/service/linux.rs:89-96 | crates/webcodex-environment/src/service/macos.rs:98-105 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5617968229c5285b2dc4b9d4f7ad9df7bf31a72e74ae099c01c4197eb04ae8c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-runner/src/webcodex_runner/external_tools.rs:433-441 | crates/webcodex-runner/src/webcodex_runner/lsp/adapter.rs:113-123 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/external_tools.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b37968a524c51d6e42e16e5e93c8eed1492d29f3b64c2197186548a31a9369"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/desktop/src-tauri/src/activity.rs:178-187 | src/tool_runtime/projects.rs:1531-1542 \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":"apps/desktop/src-tauri/src/activity.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b26d540f0239b929180254102b11e9d3523815bb61ac54563bbc4988aca08bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/webcodex-browser/src/bridge.rs:94-101 | src/tool_runtime/git/diff_hunks.rs:322-329 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/bridge.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0027ceff070970b8766c0bd94aa86ad96b2edff6440e35768d4625e7e411c91f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/webcodex-store/src/goal.rs:1425-1443 | crates/webcodex-store/src/store_primitives.rs:114-133 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"323612eaf17b94608d58423838e1e5844e1799d043a55c085ee37d16430daa4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/webcodex-validation/src/adapters/node.rs:47-60 | crates/webcodex-validation/src/adapters/python.rs:124-141 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/adapters/node.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83c01579513b908ee1fd032f599a2bb9ee57392c093d4c710638833cd6bd1aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tool_runtime/search_and_read.rs:144-159 | src/tool_runtime/search_project_texts.rs:829-835 \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":"src/tool_runtime/search_and_read.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"26265c55553df8589ac867d0673749283bcb3717e835f3085334ac04baf5b7dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/webcodex-cli/src/webcodex_cli/connect/process.rs:1079-1090 | crates/webcodex-runner/src/webcodex_runner/runner_instructions.rs:128-135 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/process.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f372207b8528ac47f70c4bfefdcbc454afaefc9110d9a82390d1511fb1ee92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/webcodex-environment/src/service/windows.rs:715-723 | src/tool_runtime/workbench_state.rs:480-484 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/windows.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d3b21484eabcfce04bff45ca0d15fd803e440c891ee21da3f6a9aadd99b521"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-runner/src/webcodex_runner/ssh.rs:1119-1126 | src/admin_project_lifecycle.rs:940-946 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"667fda4a6c9b686c994426926f58b3ea83b86665f065b34519c284ad81d83ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/runtime_console_http.rs:930-938 | src/tool_runtime/work_result.rs:1416-1422 \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":"src/runtime_console_http.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"372b0409c17ef0942c196324b4fe4aa5af7c0dc8be59acaca6b29c700d7c68e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-core/src/runner_skill.rs:466-472 | src/tool_runtime/files/search.rs:1113-1121 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_skill.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"7976171352f6715a897608f57e9e7b7d33da3f0e2c614959fafb7298011f1d46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-runner/src/webcodex_runner/project_build/rust.rs:242-250 | crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:482-490 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build/rust.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9d53bc01e521a4a3bbc255a25efe951cda01bab299e6f8d56c2af39552b575"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-cli/src/environment/cloudflare.rs:355-361 | crates/webcodex-environment/src/native.rs:2242-2254 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/cloudflare.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d59bd0e7cfab42162fd6019797e54e6bca20b18f90c19bfd9045d857dfaff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-core/src/desktop_runtime_contract.rs:97-103 | crates/webcodex-environment/src/unified_update/cache.rs:36-44 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/desktop_runtime_contract.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"79da728dcf5ba8d9c708bf590c3c8660128a3321ca2046c8e28fb116089ad7d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/webcodex-runner/src/webcodex_runner/config.rs:1159-1171 | src/tool_runtime/runner_config.rs:39-51 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eab1f3170b432fd6fc29722fdd81fe271fbba1724f66da0ce1ab117fcbff33c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-workflow-session/src/persistence.rs:620-626 | src/tool_runtime/files/mutations/patch_result.rs:8-16 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/persistence.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f84f8c2ed168f37910c1e39cfcfb45e31320e7043785d3014d61e4d0891fa74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs:222-228 | crates/webcodex-workflow-session/src/events.rs:66-72 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"df59a055abefd2d0493fd23669225ace1d04298e35c172ee238cdb58c50be56e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-runner/src/webcodex_runner/validation/execute.rs:359-365 | crates/webcodex-runner/src/webcodex_runner/validation/pyright.rs:404-411 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/execute.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d40466e7ba5cecbf9fc4c2f2f76af98611b0a6843c609a1f10fb8746eb94b04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): crates/webcodex-workflow-session/src/continuation.rs:2015-2020 | crates/webcodex-workflow-session/src/handoff_brief.rs:469-473 | src/tool_runtime/project_resolution.rs:102-106 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/continuation.rs"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c963e0fc31e10c259a126daee4c1b18fa1f14b9365de940087735c630a2cef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/admin_project_lifecycle.rs:960-967 | src/tool_request_trace.rs:125-133 | src/tool_runtime/work_result.rs:636-644 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/admin_project_lifecycle.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"6feaac8052fb13fc45f4175dbd35af5c869ee89f7b09b2599be670269e12acbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tool_runtime/git/shared.rs:12-17 | src/tool_runtime/git_committed.rs:128-133 \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":"src/tool_runtime/git/shared.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9f64112f9a1e4ef9bd8ec81377033b9c562428cff9b510dfc2a81533f39c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/webcodex-environment/src/inventory.rs:52-57 | crates/webcodex-environment/src/inventory/diagnostic_configuration.rs:159-166 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/inventory.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e7bbb3c3fd0b2b9f116d1460d04b4a440e1df9c5dff08bc035909e6ba6d82d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:185-193 | crates/webcodex-runner/src/webcodex_runner/plugin.rs:607-615 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de7dd241dca5b1587633ceaeabeb282b626971eb84be160b788ad9ac3fd6b8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-runner/src/webcodex_runner/output.rs:91-99 | crates/webcodex-runner/src/webcodex_runner/ssh.rs:1482-1490 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/output.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4614b31c59cf5a77de9ebe6085acb6c0ba62d873b17bf6c271e43d4f66b83aa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-store/src/accounts.rs:126-134 | crates/webcodex-store/src/oauth.rs:737-745 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/accounts.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1428edad875d390f1ef7d65cc78ff114aa16c8a35ea0bd6c8d396d19c25d228e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apps/desktop/src-tauri/src/coding_agents.rs:249-257 | apps/desktop/src-tauri/src/mcp_providers.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":"apps/desktop/src-tauri/src/coding_agents.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd33fec5467b6782a7907080c964b8a750e24e34ca25c34a11d3406292199b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-core/src/validation_evidence.rs:1029-1036 | src/runtime_console_http.rs:916-922 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50bf5a4639314653a68fb05a0dcaf30bda258364c470dddd58adf131f3e4094"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/webcodex-store/src/memory.rs:363-373 | crates/webcodex-store/src/store_primitives.rs:260-273 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/memory.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f64d41ab64e1d28fe5bd5d8b601ba9530c9435059f77464e467566638cb08e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/webcodex-workflow-session/src/handoff_brief.rs:937-943 | src/tool_runtime/git_review.rs:732-736 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6da5a4bc3f5dfc939849f676affd779acb649ad4bfce9269846ddeee5fff46a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/webcodex-workspace/src/project_context.rs:1115-1120 | src/auth/project_credential.rs:98-103 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_context.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e299a26c7940d5c748e974156a4029c38e2cff9fbb5cdb44f5203d600e5605f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tool_runtime/git_review.rs:322-328 | src/tool_runtime/surface/discovery.rs:172-177 \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":"src/tool_runtime/git_review.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4ca655403ca6a27c593ae70870718813e0f241b42d553a671f19bcc206d36c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-store/src/agent_task/invariants.rs:322-328 | crates/webcodex-store/src/goal.rs:1303-1310 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/invariants.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b421e918c2eb1921b7924b733f2a34dc50e20d18d5d6b9ae09904ee4bfb75b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tool_runtime/control_sidecar.rs:428-439 | src/tool_runtime/kernel.rs:153-164 \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":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b195a921aec428d1ab0f338f1993ff39ab21e5bcd09668f3899b7ee92ff9ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-computer/src/lib.rs:287-293 | src/tool_runtime/computer_tools/inputs.rs:66-74 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf84bc4df555de2a4f490020ddb392239e4b8002de88d53e5ebb6554a1cb2c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-environment/src/native.rs:1806-1817 | crates/webcodex-environment/src/upgrade.rs:919-925 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5d3ff8d4694836584ccdbe93ffca4f740cd043ee733d8d70c312d1d49e9d66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs:10-19 | crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:90-98 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a96ef57ba19debdc633a9c00c6ec2d62c9736cae3f03795cc1901119e518911"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tool_runtime/files/artifacts.rs:174-184 | src/tool_runtime/permissions/mod.rs:213-224 \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":"src/tool_runtime/files/artifacts.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3b3feb7b023f88025f155b9f25040068a003b1771343d8ab5269d85b5ae961"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-core/src/mcp_gateway.rs:164-170 | crates/webcodex-core/src/plugin.rs:151-158 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd4f584c1f66c50e54865d21fe3616392575f74c29dc45531b1ae7bbd2db528"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/webcodex-runner/src/webcodex_runner/transport/metrics.rs:15-23 | src/runner_http/telemetry.rs:31-39 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/metrics.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc2e8bd7ff15fcd1051a44c09d4bc269301fd96e9cb66788d9296b4de36a301"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/oauth_http/managed_authorize.rs:18-24 | src/oauth_http/responses.rs:23-30 \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":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4693ce34d7a5218541fdbf098006103e4a1fda35ab154541e7fa1bc6c5b4d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-cli/src/lib.rs:85-91 | crates/webcodex-environment/src/service/scope.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":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd1a0e39d43115e2b44deb4c88f65aa020f29649e07b346d3841efc877446ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/webcodex-runner-registry/src/validation.rs:665-667 | crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:523-525 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd627ecf0169da9f82145937826f2fd8a96a7087cbb3a53b50a655dee686497"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/webcodex-validation/src/adapters/go.rs:145-156 | crates/webcodex-validation/src/adapters/node.rs:82-95 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/adapters/go.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8682662a320c1f8fcee4ceddd133a0b8fb11ce1d9a3e34c3b46d10dd054d339"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-core/src/validation_bridge.rs:294-300 | crates/webcodex-workflow-session/src/console.rs:1068-1075 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_bridge.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c4965c0f94ff775f1444b6c552e15a9b8cf7b880f79b9dd7ce36b54f0ab1fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apps/desktop/src-tauri/src/operation.rs:284-291 | apps/desktop/src-tauri/src/runtime_selection.rs:106-113 \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":"apps/desktop/src-tauri/src/operation.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a87c5a06f671be2e4672299138f9b5192f41a891d13993c094dbaa0f36ac41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/webcodex-runner/src/webcodex_runner/transport/bootstrap.rs:66-73 | src/tool_runtime/git/show_changes.rs:840-847 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/bootstrap.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc5290515ca0f362f9022363649e9e8f979a5ebdc077e47fe4e2a349502635a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/webcodex-environment/src/native.rs:2260-2266 | src/pairing_http.rs:101-107 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":2260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11073d2d87909bab30c9436c5aaf93248e54b5bbdd2217051e6c6c1740bab48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/webcodex-runner-registry/src/job_updates.rs:82-89 | src/tool_runtime/observe_jobs.rs:49-57 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9e48a8d821f2e4e1435af3c629d2e618bd1db650ea2b4c8969a831272ca9e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/admin_http.rs:36-39 | src/upgrade_http.rs:31-34 \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":"src/admin_http.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f42f49f5bc47502aea69548c89e146106ddac0264d40e0b7b7ee3d83a61a5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tool_runtime/agent_task.rs:136-141 | src/tool_runtime/files/inspection.rs:237-242 \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":"src/tool_runtime/agent_task.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c54b510ceb7438ae4639ac017ceebae6b45372dcddc48e60756833f8e1bfb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (63\u201365 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs:339-403 | crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:355-417 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:354\u0060 calls \u0060child_mut\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs:338\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b655b0c66b89136c8aaf5269d5863628c608e799f1b0e6b8b9d1b01bd0de8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (61\u201365 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs:457-521 | crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:471-531 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8073f2a2002feed1ba7e23092ade44bbc4f67ac581e9401dcbe83bd3c6810eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (65 lines \u00D7 2): crates/webcodex-store/src/oauth.rs:613-677 | crates/webcodex-store/src/oauth.rs:1006-1070 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/oauth.rs:613\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"8055fe331eadfd01c0c28ce656e0a523b7fa9f1cc3de8f94dcf74034429fa7f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (64\u201365 lines \u00D7 2): crates/webcodex-workflow-session/src/store.rs:2584-2648 | crates/webcodex-workflow-session/src/store/borrowed_projection_tests/reference.rs:18-81 \u2014 before extracting anything, compare \u0060crates/webcodex-workflow-session/src/store.rs\u0060 and \u0060crates/webcodex-workflow-session/src/store/borrowed_projection_tests/reference.rs\u0060 as WHOLE FILES: 83% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-workflow-session/src/store.rs:2584\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0c42ad4c76ad797e48e693adac88890b856e233064f780d6042c7a7f3056c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/configured_skills.rs:110-162 | crates/webcodex-runner/src/webcodex_runner/configured_skills.rs:199-251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/configured_skills.rs:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/configured_skills.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b550ab9c1e112a49e0a0f9bf208c3c72f3763a175337c7807bd9624bdd2e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): src/mcp/tools/call/specialized.rs:127-174 | src/mcp/tools/call/specialized.rs:343-390 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp/tools/call/specialized.rs:127\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, \u0060src/mcp/tools/call/specialized.rs:342\u0060 calls \u0060capture_payload_lazy\u0060, \u0060audit_projection\u0060 and \u0060src/mcp/tools/call/specialized.rs:126\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":"src/mcp/tools/call/specialized.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb12914c3cc8c69efdbf71d9b8baf8d533d6b2d951cf2020b0c055ea3d4b7e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): src/tool_runtime/process.rs:908-950 | src/tool_runtime/script.rs:109-151 \u2014 before extracting anything, compare \u0060src/tool_runtime/process.rs\u0060 and \u0060src/tool_runtime/script.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 104 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 \u0060src/tool_runtime/process.rs:908\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/process.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"275360d6f05c123c176f436b0e43ad16e05999406c36637a730ba13215245a98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): crates/webcodex-computer/src/platform/macos/accessibility.rs:1004-1045 | crates/webcodex-computer/src/platform/windows/accessibility.rs:812-853 \u2014 \u0060crates/webcodex-computer/src/platform/macos/accessibility.rs\u0060 and \u0060crates/webcodex-computer/src/platform/windows/accessibility.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 64 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-computer/src/platform/macos/accessibility.rs:1004\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-computer/src/platform/macos/accessibility.rs:1046\u0060 calls \u0060ensure_remaining\u0060 and \u0060crates/webcodex-computer/src/platform/windows/accessibility.rs:854\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"278b81fd6e823f7327ba89f4a7b4339fa5bf3b9458b20650f91ab31e641ba4dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs:909-946 | crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs:1048-1085 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs:909\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"391fd1b2028f9f719f8f4beff6ddc6241fd0bbd7e6d4c9480a612eae49709618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): src/tool_runtime/skills.rs:1771-1806 | src/tool_runtime/skills.rs:1857-1892 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/skills.rs:1771\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":"src/tool_runtime/skills.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5a27480d9dc8ff475f4bd651bf1e59c4541f6e1882e6d1a622d56b3cc4e135"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201335 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs:37-71 | crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:113-144 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.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":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb176cd3ff9d3ba7e56b438190d24879366beae43e00fcce2473ef7e3b301f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:754-787 | crates/webcodex-runner-registry/src/requests.rs:1029-1062 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"1499ef9a0b126d33f7d919e142708804bb217e5303091c2878759b2837af9377"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:292-325 | crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:488-521 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:292\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"177fc3678054f8ca537cc2123ee0ac7076a1786018568bb991bad0c7dbdb75dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): crates/webcodex-tool-contracts/src/tool_call/parsing.rs:658-690 | crates/webcodex-tool-contracts/src/tool_call/parsing.rs:819-851 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/parsing.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"651a80e6179611a2bb0a3b06039cebe0ca431e84544f2d30608e147a3c22d8ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): src/tool_runtime/coding_agent.rs:806-838 | src/tool_runtime/coding_agent.rs:1049-1081 \u2014 both copies are in the same file, so extract the block 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 \u0060run_id\u0060 to \u0060\u0026str\u0060 in one and \u0060String\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tool_runtime/coding_agent.rs:804\u0060 calls \u0060unwrap_or\u0060, \u0060min\u0060 and \u0060src/tool_runtime/coding_agent.rs:1048\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":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d8df8ae56bb2daa4b5ac668c8de9fb8ac8e04bba4534e912b70555377eec61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 2): src/tool_runtime/process.rs:1039-1070 | src/tool_runtime/script.rs:206-238 \u2014 before extracting anything, compare \u0060src/tool_runtime/process.rs\u0060 and \u0060src/tool_runtime/script.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 104 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 \u0060src/tool_runtime/process.rs:1039\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":"src/tool_runtime/process.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"750598176b28d8bffdd252e3af1eacea2ff8577f5948be6b0f27f4c855b4e65a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/runner_tokens_http/routes.rs:196-224 | src/users_http/tokens.rs:171-199 \u2014 before extracting anything, compare \u0060src/runner_tokens_http/routes.rs\u0060 and \u0060src/users_http/tokens.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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 \u0060src/runner_tokens_http/routes.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":"src/runner_tokens_http/routes.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"da578bc2ca8d1faefaf322e0f78914f67a09aa2c2287064a1ef27c0baf37e501"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/tool_runtime/agent_wait.rs:115-143 | src/tool_runtime/communication.rs:700-728 \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":"src/tool_runtime/agent_wait.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac7ec9cb736555d2a503813efb3fe051d291f3060db5462030361bc7a3804ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:76-103 | crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs:56-83 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ada1becf8929743bd7be3ca17737d1ed2244f44881333840d6c9632d7048f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): src/agent_wake.rs:620-647 | src/agent_wake.rs:972-999 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agent_wake.rs:620\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent_wake.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f823dba63ee82fc2be6d6f928043cf7ab544743d98322cd6286b9159ddcbbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/mcp/tools/call/specialized.rs:175-201 | src/mcp/tools/call/specialized.rs:394-420 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp/tools/call/specialized.rs:175\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/mcp/tools/call/specialized.rs:391\u0060 calls \u0060capture_payload_lazy\u0060, \u0060audit_arguments\u0060 and \u0060src/mcp/tools/call/specialized.rs:174\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call/specialized.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"73918ee4ff0bef25e457cbcec14a6e71115ce3d343d3fb840031da3c7368031e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): src/oauth_http/project_share.rs:250-274 | src/oauth_http/shared_key_bridge.rs:653-679 \u2014 before extracting anything, compare \u0060src/oauth_http/project_share.rs\u0060 and \u0060src/oauth_http/shared_key_bridge.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 112 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 \u0060src/oauth_http/project_share.rs:250\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":"src/oauth_http/project_share.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd09dcdf7084c6df9cabb82bce785b6b0a95aa0c570594067cafb874e75c00c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3): crates/webcodex-lsp/src/navigation.rs:451-476 | crates/webcodex-lsp/src/navigation.rs:561-586 | crates/webcodex-lsp/src/navigation.rs:624-649 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-lsp/src/navigation.rs:451\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-lsp/src/navigation.rs:560\u0060 calls \u0060clamp\u0060 and \u0060crates/webcodex-lsp/src/navigation.rs:450\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"518817484c3b04c4ce0ad1a7736f3377a121e2b19a39fbc81ea4527ddbf724d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/connect/disconnect.rs:74-99 | crates/webcodex-cli/src/webcodex_cli/connect/mod.rs:79-104 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/connect/disconnect.rs:74\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/disconnect.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b413e12c4575597a230d323f09afff166abb64799c177d14356c9912feb56cda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/skill_store.rs:846-871 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:915-940 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/skill_store.rs:846\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbba50dcd5291aafe3ef0872921a28fdd0133dd4f0178749beb5ee959012ccac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): src/oauth_http/project_share.rs:302-326 | src/oauth_http/shared_key_bridge.rs:1006-1031 \u2014 before extracting anything, compare \u0060src/oauth_http/project_share.rs\u0060 and \u0060src/oauth_http/shared_key_bridge.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 112 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 \u0060src/oauth_http/project_share.rs:302\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/project_share.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"77374b3f56a6f87c50eb9af0cec4013fb302c703ce2dc116cd3d78fd4423c327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/tool_runtime/read_files.rs:1061-1086 | src/tool_runtime/search_project_texts.rs:660-685 \u2014 before extracting anything, compare \u0060src/tool_runtime/read_files.rs\u0060 and \u0060src/tool_runtime/search_project_texts.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 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":"src/tool_runtime/read_files.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc98cd2ada202822f8bd30e0ef9e93cb9e07b4c349b822ea7d3ee8e3f488473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/tool_runtime/search_project_texts.rs:731-756 | src/tool_runtime/search_project_texts.rs:795-820 \u2014 both copies are in the same file, so extract the block 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":"src/tool_runtime/search_project_texts.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc420f3cf0d2b80645bd856432b78c2a6c1f1064b7a2a84dd5fe268268c9d5f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 3): apps/desktop/src-tauri/src/webcodex/cli.rs:516-540 | apps/desktop/src-tauri/src/webcodex/cli.rs:558-581 | apps/desktop/src-tauri/src/webcodex/cli.rs:628-652 \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 \u0060apps/desktop/src-tauri/src/webcodex/cli.rs:516\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/cli.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5922a4e62cbf04d1fad65c20f2701a5de2dd6a8c83e92b20b394202743801fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201325 lines \u00D7 2): apps/desktop/src-tauri/src/webcodex/adapter.rs:431-450 | apps/desktop/src-tauri/src/webcodex/adapter.rs:482-506 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/desktop/src-tauri/src/webcodex/adapter.rs:431\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bde3b0c767891e63ce5fc7dcc90daf86c45ec28e376d93f015c64c42137eaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:169-193 | crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs:226-250 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:169\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f0317d73aa6410dd68e188cfba6df7328094eeac6d829ea59a4bbf1a0dd76f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:731-755 | crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:757-780 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:731\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43f86cc0683dde1dfec03a5de3e74d125740d19d09e0794fc0194f6cfd7707e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201325 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs:405-429 | crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:421-441 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:421\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ac9f91ea8010ef1613c7fd117c2a10006f7d64f28b959a02bb300ca09eb09b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201325 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs:187-211 | crates/webcodex-runner/src/webcodex_runner/job_manager/ssh.rs:161-182 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/ssh.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs:187\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d2297b7cf531a94e226d62152e7f6c4950675cfd117320d16ae90549df51cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/webcodex-store/src/goal.rs:354-378 | crates/webcodex-store/src/goal.rs:465-489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/goal.rs:354\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0159f18f297683b3e8a50ddf5219406435656614cbf48b7b872aad4130b275"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:605-628 | crates/webcodex-cli/src/lib.rs:642-665 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/lib.rs:605\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e15b656c00a2e203c0c72faec5fa25b91700c4e04f5775938f6cbc10688e04e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/webcodex-persistent-shell/src/unix.rs:77-100 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:228-251 \u2014 before extracting anything, compare \u0060crates/webcodex-persistent-shell/src/unix.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/remote_shell.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-persistent-shell/src/unix.rs:77\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-persistent-shell/src/unix.rs:101\u0060 calls \u0060clear_expected_token\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:252\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"af609951de3e22c3ffee6410b826786f4c31aa89175719ee8ef4729803c2189c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/polling.rs:222-245 | crates/webcodex-runner/src/webcodex_runner/transport/polling.rs:357-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport/polling.rs:222\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/polling.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99e1320ee445b6e69311c803ede03a529dce036c2888f2a29c8ab12b4c8b635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/webcodex-validation/src/adapters/rust.rs:231-254 | crates/webcodex-validation/src/adapters/rust.rs:288-311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-validation/src/adapters/rust.rs:231\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-validation/src/adapters/rust.rs:312\u0060 calls \u0060unwrap_or\u0060, \u0060push\u0060, \u0060Literal\u0060 and \u0060crates/webcodex-validation/src/adapters/rust.rs:255\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/adapters/rust.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7048caae3b2bd81ed945c29665169835388cdffd8ff473e544889328297f3c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:991-1015 | crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:1146-1170 | crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:1310-1334 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2b3c2e51c8851820019a2154f7bcac1085f2d9a9fef991c939199fc1906d04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:792-811 | crates/webcodex-runner-registry/src/requests.rs:1057-1079 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:1057\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff06c5b448c83fec9601206baa1d893521ab448923026e3f9f2c55a22d7c25fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/webcodex-store/src/agent_task/invariants.rs:753-775 | crates/webcodex-store/src/agent_task_attempt_reference.rs:41-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/invariants.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"239f5f11a93e8679dec1177d92d235ec595a471a8b3efbde6847d461133d7b09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): src/tool_runtime/runtime_info.rs:567-589 | src/tool_runtime/runtime_info.rs:897-915 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/runtime_info.rs:567\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tool_runtime/runtime_info.rs:589\u0060 calls \u0060to_string\u0060, \u0060runtime_build_info\u0060 and \u0060src/tool_runtime/runtime_info.rs:915\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":"src/tool_runtime/runtime_info.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13e46b0e433573dff18fd4deb3d589f6b2f007507218156b524ab4aa4f665a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 3): src/tool_runtime/skills.rs:1664-1685 | src/tool_runtime/skills.rs:1773-1792 | src/tool_runtime/skills.rs:1859-1878 \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 \u0060src/tool_runtime/skills.rs:1664\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":"src/tool_runtime/skills.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"325edff12c46ba0ddcc9097c591bb958778b5f3f8e2e6b5e87f97d71b1cfa290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs:305-326 | crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:323-340 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs:305\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:322\u0060 calls \u0060id\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs:304\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4ab3cf2ec78c21b0cdcd72d930d21c896e6778b8341ae83a43efd45e0ff401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/tool_runtime/session_shell.rs:457-478 | src/tool_runtime/session_shell.rs:524-545 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/session_shell.rs:457\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_shell.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8339d05718446b88da8fdc301f92c2a4fe00f87f7ce1e133de320f66ab3e1168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:734-754 | crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:759-779 | crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:782-802 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:782\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"b465da4912aa1c49ced473973ee73fa266604f53b724f20dd93b13715f3508b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/webcodex-persistent-shell/src/opening.rs:14-34 | crates/webcodex-persistent-shell/src/opening.rs:95-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-persistent-shell/src/opening.rs:14\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/opening.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a61fd715a9feeeee098cc54ed6d5fa564baf3a092fe570803ff5be3dc4dcace"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/webcodex-persistent-shell/src/unix.rs:320-342 | crates/webcodex-persistent-shell/src/windows.rs:286-308 \u2014 before extracting anything, compare \u0060crates/webcodex-persistent-shell/src/unix.rs\u0060 and \u0060crates/webcodex-persistent-shell/src/windows.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f151f9ac6c86fd51d13c9fadb762b87d7660830286c953f76cd9e5363be38da0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/webcodex-persistent-shell/src/unix.rs:344-364 | crates/webcodex-persistent-shell/src/windows.rs:309-329 \u2014 before extracting anything, compare \u0060crates/webcodex-persistent-shell/src/unix.rs\u0060 and \u0060crates/webcodex-persistent-shell/src/windows.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-persistent-shell/src/unix.rs:344\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-persistent-shell/src/unix.rs:343\u0060 calls \u0060sync_channel\u0060 and \u0060crates/webcodex-persistent-shell/src/windows.rs:308\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f72421f4103901efc77cc0f82a87540701e111929af5affc5cdbb18dc55465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201321 lines \u00D7 2): crates/webcodex-runner-registry/src/polling.rs:514-534 | crates/webcodex-runner-registry/src/polling.rs:831-844 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/polling.rs:514\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-runner-registry/src/polling.rs:830\u0060 calls \u0060normalize_persistent_shell_result\u0060 and \u0060crates/webcodex-runner-registry/src/polling.rs:513\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/polling.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1b7d25622b737628125b16cff6b89b0c677c358751762d2d9ef3d3a234b748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts.rs:67-87 | src/tool_runtime/files/artifacts.rs:120-140 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e2b706b1dd37e855cefa5270c456d1709b6aedf74289af734887415902d4e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/persistent_shell/ssh.rs:144-164 | crates/webcodex-runner/src/webcodex_runner/persistent_shell/ssh.rs:230-250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/persistent_shell/ssh.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0aa58cfb253d6ca01df4aa0f2af76a1fd66e8d86d970c1aa52bceb144cbff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/shell/process.rs:181-201 | crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs:339-359 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/shell/process.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/shell/process.rs:181\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/process.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f718a3f09406415cb828ac10a93003b3a44706cc62d489937057021c728997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/webcodex-store/src/agent_wake.rs:687-707 | crates/webcodex-store/src/agent_wake.rs:1067-1087 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31138d4d60d52a2cec709465a8fa6c584cfdb6d0ba390e76e6d9914c8c97fd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/webcodex-store/src/goal.rs:930-950 | crates/webcodex-store/src/goal.rs:1033-1053 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/goal.rs:930\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6fd27deea03f115b9bb08886b899465277c3d08aae964163722fc369ec8c76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/webcodex-workspace/src/project_recipe.rs:886-905 | crates/webcodex-workspace/src/project_recipe.rs:1058-1078 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-workspace/src/project_recipe.rs:886\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f5c2c00621a459866bbcdac1f5c6ed97242ec9eee612fcc5966e140d422f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/oauth_http/project_share.rs:62-82 | src/oauth_http/shared_key_bridge.rs:458-478 \u2014 before extracting anything, compare \u0060src/oauth_http/project_share.rs\u0060 and \u0060src/oauth_http/shared_key_bridge.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 112 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":"src/oauth_http/project_share.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5457a74dfc7fcb110e526363f4ed73cdc62315458b6e2d4c8e3e7c2fd2e2c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): crates/webcodex-runner-registry/src/job_updates/start.rs:862-881 | crates/webcodex-runner-registry/src/validation.rs:597-616 | src/tool_runtime/process.rs:321-340 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-runner-registry/src/validation.rs:595\u0060 calls \u0060validate_id\u0060, \u0060validate_process_argv\u0060 and \u0060crates/webcodex-runner-registry/src/job_updates/start.rs:861\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates/start.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d8d2194d4b5918cbe450a2b52adbe3672cef3c47f5dd716f3b344576e81675"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/webcodex-lsp/src/navigation.rs:591-610 | crates/webcodex-lsp/src/navigation.rs:655-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-lsp/src/navigation.rs:591\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4dc8a31351ca5305eaa592cec6e6642416106acf4af84088429850d3fd483a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/webcodex-persistent-shell/src/unix.rs:50-69 | crates/webcodex-persistent-shell/src/windows.rs:134-153 \u2014 before extracting anything, compare \u0060crates/webcodex-persistent-shell/src/unix.rs\u0060 and \u0060crates/webcodex-persistent-shell/src/windows.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-persistent-shell/src/unix.rs:50\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5067cde3a2a288860e3c1c16447264e49007f64895c00fb3d56d893b5d974997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:1191-1210 | crates/webcodex-runner-registry/src/requests.rs:1252-1271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dcd7418edae58adc3c043b7124dda9c436f6bc4b52d0e152d629b6c98fe292"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:209-228 | crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:328-347 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:209\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/execution.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b4cf1aedc61041a661113f5b5581f06ce564ab315d39faf0d80f0abe2bc06a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/webcodex-workspace/src/project_overview.rs:58-77 | crates/webcodex-workspace/src/project_overview.rs:781-800 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_overview.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f49987532fa0383ea462ed5cc2c329dd8fe766ebe0446e76ec7c014c35a68d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/mcp/discovery.rs:150-169 | src/mcp/discovery.rs:302-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp/discovery.rs:150\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/discovery.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d336ce46becc7a785403590b493a2332199a1146d1a4c88783252f8dc9c4252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): src/mcp/tools/call/specialized.rs:59-74 | src/mcp/tools/call/specialized.rs:208-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/mcp/tools/call/specialized.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b7babbcd51f31e025ae842075be77381472c4b1d7439ff6cb33a9add17fffc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/oauth_http/shared_key_bridge.rs:815-834 | src/oauth_http/shared_key_bridge.rs:922-941 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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, \u0060src/oauth_http/shared_key_bridge.rs:814\u0060 calls \u0060allowed_scopes_vec\u0060 and \u0060src/oauth_http/shared_key_bridge.rs:921\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":"src/oauth_http/shared_key_bridge.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"df426c87c6b66858af4255d29644259b65153c5b176e30c28500a150e85574b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:734-752 | crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:759-777 | crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:782-800 | crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:814-832 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef452a84e520b41dbcf4b933042da7ecdd776f63b47e89b06453f176684a6f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 4): crates/webcodex-computer/src/lib.rs:1572-1590 | crates/webcodex-computer/src/lib.rs:1634-1649 | crates/webcodex-computer/src/lib.rs:1672-1687 | crates/webcodex-computer/src/lib.rs:1709-1724 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-computer/src/lib.rs:1572\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-computer/src/lib.rs:1632\u0060 calls \u0060native_effect_guard\u0060 and \u0060crates/webcodex-computer/src/lib.rs:1570\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe7f60e0d2d95e6f48ab0def3f131a1340a39fc655efd2ba099dc9c441f5334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): src/tool_runtime/files/artifacts.rs:500-518 | src/tool_runtime/files/artifacts.rs:547-565 | src/tool_runtime/files/artifacts.rs:841-858 \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 \u0060src/tool_runtime/files/artifacts.rs:500\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/artifacts.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"102f0b3abb4277a68b30d924901964df246f7d5e6c9724bd72108a09242e9c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): apps/desktop/src-tauri/src/state/environment.rs:381-399 | apps/desktop/src-tauri/src/state/environment.rs:1049-1067 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/desktop/src-tauri/src/state/environment.rs:381\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":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa67305e6e86fcd1e7ec07940ccb0ea3ab69d171171eb15c48afa4fd1e8fa2ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/webcodex-environment/src/service/linux.rs:66-84 | crates/webcodex-environment/src/service/macos.rs:65-83 \u2014 before extracting anything, compare \u0060crates/webcodex-environment/src/service/linux.rs\u0060 and \u0060crates/webcodex-environment/src/service/macos.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/service/linux.rs:66\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade3db14cab167f047b35b3276dedfe2c863f27c86f0b36a13829c9f1a761333"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/webcodex-runner-registry/src/job_updates.rs:1397-1415 | crates/webcodex-runner-registry/src/job_updates.rs:1425-1443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/job_updates.rs:1397\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3fd303798cefbd2f64f7637c7efc5b25556e75fd71b69b5e542e4413c8b9cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:936-954 | crates/webcodex-runner-registry/src/requests.rs:1078-1096 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:936\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"97068aca173a6820403996f8a3cf7a5fc634512098050da1437d8a6ce61d2731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs:50-68 | crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs:90-108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"898ce7929ed644c3cdb386fb9dc60ab9fedca9de39243bcaddec58cb0fa3a0aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/shell/run.rs:153-171 | crates/webcodex-runner/src/webcodex_runner/shell/run.rs:183-201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/run.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c701b9b34bd517b5c1bdb885ec05ac9442fb74206e2627fb24a375f570b586e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/webcodex-store/src/agent_wake.rs:525-542 | crates/webcodex-store/src/agent_wake.rs:757-775 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/agent_wake.rs:757\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64ccb5eafa182c444af20df9310fa3b2d27fde809dc678bc862a253e36b03fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/webcodex-store/src/agent_wake.rs:816-834 | crates/webcodex-store/src/agent_wake.rs:979-996 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/agent_wake.rs:816\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb765577a2607c5cc9489cab486c1b634511082f3682fa0e73bb41757c265306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:434-452 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:472-490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:453\u0060 calls \u0060copy_keys\u0060 and \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:491\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb279b05a40d232ee4512a736f42577ed5b01165bff7add0555d91e06261aba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/mcp/tools/call/specialized.rs:239-257 | src/mcp/tools/call/specialized.rs:275-293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp/tools/call/specialized.rs:239\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call/specialized.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6d014edc9d46d7a6fc571784531a2e7fe5f31a7d2877f3ac53770b716025b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): src/mcp_gateway.rs:729-747 | src/plugin_gateway.rs:1320-1335 \u2014 before extracting anything, compare \u0060src/mcp_gateway.rs\u0060 and \u0060src/plugin_gateway.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060src/mcp_gateway.rs:729\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":"src/mcp_gateway.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dabb88eee44f57f6d54e206b8a81a61935e5b1a6a0dcb32c8612bdb87580242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/oauth_http/managed_authorize.rs:807-825 | src/oauth_http/shared_key_bridge.rs:980-998 \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":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22614d8184d1085936fffa23f41f9c49b837ccc4afca0d9444d01c583469dab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): src/tool_request_trace/store.rs:282-297 | src/tool_request_trace/store.rs:367-385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_request_trace/store.rs:282\u0060 it does not close everything it opens, so those exact 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, \u0060src/tool_request_trace/store.rs:391\u0060 calls \u0060Err\u0060 and \u0060src/tool_request_trace/store.rs:302\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":"src/tool_request_trace/store.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb05e507aca7ced9606b34a07342fd006c14e4c11704ebe14804ecc90bf6d587"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): src/tool_runtime/read_files.rs:913-931 | src/tool_runtime/search_project_texts.rs:226-242 \u2014 before extracting anything, compare \u0060src/tool_runtime/read_files.rs\u0060 and \u0060src/tool_runtime/search_project_texts.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 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":"src/tool_runtime/read_files.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"5699a03895de29b0cdce8de8534ab5a0c73955db3a277a2f43af03b0db191baf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/tool_runtime/skills.rs:769-787 | src/tool_runtime/skills.rs:1515-1533 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/skills.rs:769\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/skills.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"be226ae20a160f6976cff55825b91a01b2f7711792bcd5ae7c01525d95a12d32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/webcodex-persistent-shell/src/lifecycle.rs:61-78 | crates/webcodex-persistent-shell/src/lifecycle.rs:84-101 | crates/webcodex-persistent-shell/src/lifecycle.rs:106-123 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-persistent-shell/src/lifecycle.rs:61\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-persistent-shell/src/lifecycle.rs:60\u0060 calls \u0060filter\u0060 and \u0060crates/webcodex-persistent-shell/src/lifecycle.rs:105\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/lifecycle.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb77c64dfbbc24b33cf6be63c1fc65fa253f09669a4d4f02d090e573eca4188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 3): crates/webcodex-store/src/agent_wait.rs:1079-1092 | crates/webcodex-store/src/agent_wait.rs:1229-1245 | crates/webcodex-store/src/communication.rs:3039-3056 \u2014 before extracting anything, compare \u0060crates/webcodex-store/src/agent_wait.rs\u0060 and \u0060crates/webcodex-store/src/communication.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/agent_wait.rs:1079\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wait.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe88bbf423cf02e9299e6d03692e4955fb46e0a5dbfd1104dc0ccef4d1cb0aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/webcodex-browser/src/cdp.rs:2423-2440 | crates/webcodex-browser/src/cdp.rs:2659-2676 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-browser/src/cdp.rs:2423\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":2423}}}],"partialFingerprints":{"codehealthFindingId/v1":"0501415da776cbfc1e755dbbf950bb910ec243349645772ef30a6ac38896f398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/webcodex-environment/src/service/linux.rs:303-320 | crates/webcodex-environment/src/service/macos.rs:251-268 \u2014 before extracting anything, compare \u0060crates/webcodex-environment/src/service/linux.rs\u0060 and \u0060crates/webcodex-environment/src/service/macos.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/service/linux.rs:303\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9aaff393e8f38700886cc598730cbc9d46129468cb92b89288fcac0bf1266c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/webcodex-environment/src/storage.rs:499-516 | src/upgrade_maintenance_store.rs:45-62 \u2014 before extracting anything, compare \u0060crates/webcodex-environment/src/storage.rs\u0060 and \u0060src/upgrade_maintenance_store.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/storage.rs:499\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c480e793e86ca5f62b803423096dc20d3ebcd954fcc248c721bfff08fb428e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:221-238 | crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:771-788 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:221\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"099dbc50d2f1b4b6ba12e7edcb5b2a6a171cab275c187a677a69f90763702ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/webcodex-store/src/activity.rs:153-170 | crates/webcodex-store/src/activity.rs:217-234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/activity.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fafaa02686b86f51dae525faf6243db6af38f2f90279fe65ceba5e979558a0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/webcodex-store/src/artifact_handoff.rs:758-774 | crates/webcodex-store/src/artifact_handoff.rs:814-831 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/artifact_handoff.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20d4c1f8a48731bf0d8c769bd665d56175c63e2e6c6ed7d8833d3dba568ef71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:772-789 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:806-823 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:826\u0060 calls \u0060copy_keys\u0060 and \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:790\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"56469f08c5e14c80c1a3b6c3e68dd78ea401287f96aaf000b990a58ceedd185b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/webcodex-workspace/src/project_context.rs:434-451 | crates/webcodex-workspace/src/project_context.rs:453-470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-workspace/src/project_context.rs:434\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_context.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01e1245f672c717783ba174861cf010ae69c497212cfd3ea10a0875f7fa5a4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/runner_tokens_http/routes.rs:323-340 | src/users_http/tokens.rs:277-294 \u2014 before extracting anything, compare \u0060src/runner_tokens_http/routes.rs\u0060 and \u0060src/users_http/tokens.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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 \u0060src/runner_tokens_http/routes.rs:323\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":"src/runner_tokens_http/routes.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"468928bf3939118bf558ca8870ab5f45bb046f7ee1c45e830f3d34ab723c8fb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/ssh_resource_gateway.rs:503-520 | src/ssh_resource_gateway.rs:541-558 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/ssh_resource_gateway.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ssh_resource_gateway.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6a0afcf7b18c1da2f964c089ab48f92ceb7307ea1fea4dd9be5643f6c03f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/tool_runtime/communication.rs:787-804 | src/tool_runtime/communication.rs:899-916 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/communication.rs:787\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":"src/tool_runtime/communication.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd10f06ad4c58eae789c69cd5c91603f59ba663b67c8b5fc49e88897ae9b1665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/tool_runtime/files/inspection.rs:1167-1184 | src/tool_runtime/files/inspection.rs:1447-1464 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/files/inspection.rs:1167\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":"src/tool_runtime/files/inspection.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d8871bd57a2964405219893667181fa8a7d6c1796e83876543233028e02765"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): crates/webcodex-computer/src/lib.rs:1642-1658 | crates/webcodex-computer/src/lib.rs:1680-1696 | crates/webcodex-computer/src/lib.rs:1717-1733 | crates/webcodex-computer/src/lib.rs:1784-1800 \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 matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-computer/src/lib.rs:1783\u0060 calls \u0060validate_input_text\u0060 and \u0060crates/webcodex-computer/src/lib.rs:1641\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e93a9f6810d34b9560132215965ce7750093c59ae6820781f1095241b34d6bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/pairing.rs:8-24 | crates/webcodex-runner-config/src/lib.rs:156-172 \u2014 before extracting anything, compare \u0060crates/webcodex-cli/src/webcodex_cli/pairing.rs\u0060 and \u0060crates/webcodex-runner-config/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/pairing.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e879aa15bcdb086e20227c4f806afb269f1f2858332dbbf7b1a51d255d6c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/webcodex-core/src/mcp_gateway.rs:697-713 | crates/webcodex-core/src/plugin.rs:1503-1519 \u2014 before extracting anything, compare \u0060crates/webcodex-core/src/mcp_gateway.rs\u0060 and \u0060crates/webcodex-core/src/plugin.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/mcp_gateway.rs:697\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf3f36096ec5bad0a426106cd276b4c0b20711cb8b17460a8745f2e76d837e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs:83-99 | crates/webcodex-runner/src/webcodex_runner/job_manager/ssh.rs:111-127 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/ssh.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3f63c330173fce1c73587a4a67e4174486691800f052600d62c53c0192f968"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/shell/process.rs:203-219 | crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs:361-377 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/shell/process.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/shell/process.rs:203\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/process.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6b7b808ce052e90d5e5f8916a9ac5e1625b3988ca66c1dd237e51ef335f03a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/webcodex-workflow-session/src/store.rs:3010-3026 | crates/webcodex-workflow-session/src/store.rs:3218-3234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3010}}}],"partialFingerprints":{"codehealthFindingId/v1":"52488fde235f8a436134c959b72cf7638deeb2b3746248773ba41546dc00ba90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/oauth_http/project_share.rs:161-177 | src/oauth_http/shared_key_bridge.rs:573-589 \u2014 before extracting anything, compare \u0060src/oauth_http/project_share.rs\u0060 and \u0060src/oauth_http/shared_key_bridge.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 112 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 \u0060src/oauth_http/project_share.rs:161\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/project_share.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"767adff050097ede4bd228da59b44cd2bdda954e90b1bea6d7a5857e7cb61765"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 2): src/runner_http/auth.rs:105-121 | src/runner_http/auth.rs:186-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/runner_http/auth.rs:105\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runner_http/auth.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4595dcd3722aa39c4e23206dd962e4af47bc7560e45d13313bebb3ed8c055a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/runner_tokens_http/routes.rs:303-318 | src/users_http/tokens.rs:259-275 \u2014 before extracting anything, compare \u0060src/runner_tokens_http/routes.rs\u0060 and \u0060src/users_http/tokens.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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 \u0060src/runner_tokens_http/routes.rs:303\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runner_tokens_http/routes.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a5d08e7aafd63fd813beacef67f2562d07b6db9dc558d7631c8d8cbd8e50e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/tool_runtime/artifact_transfer.rs:833-849 | src/tool_runtime/artifact_transfer.rs:952-968 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/artifact_transfer.rs:833\u0060 it does not close everything it opens, so those exact 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":"src/tool_runtime/artifact_transfer.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"d156837081705392ab2d442f7598b136e215e13e6e680f0fe77b62b1ad3320d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/tool_runtime/coding_agent.rs:572-586 | src/tool_runtime/coding_agent.rs:1285-1301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/coding_agent.rs:572\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77cc0f4d6d60011ef5cb3474d427a289c6cae7fa4fbb17e544031836e1e7d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): src/tool_runtime/resource_references.rs:163-176 | src/tool_runtime/resource_references.rs:455-471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/resource_references.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b87713129301fcbe07557c19c02b36e686eb99c0da357f0b44e3adc42c30af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/tool_runtime/startup_brief.rs:1159-1175 | src/tool_runtime/startup_brief.rs:1259-1273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/startup_brief.rs:1159\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e43315aaaeb042bd3214cbd7958d03352793a54b0d773c382b0c6c0d4c1b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): src/runner_tokens_http/routes.rs:96-111 | src/runner_tokens_http/routes.rs:192-206 | src/users_http/tokens.rs:96-111 | src/users_http/tokens.rs:167-181 \u2014 before extracting anything, compare \u0060src/runner_tokens_http/routes.rs\u0060 and \u0060src/users_http/tokens.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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 \u0060src/runner_tokens_http/routes.rs:96\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/runner_tokens_http/routes.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d704915ead8d97495c575a0be3bd3d7cea6ff7a968b425709663d6a44d0e7b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/plugin.rs:1341-1356 | crates/webcodex-runner/src/webcodex_runner/plugin.rs:1358-1373 | crates/webcodex-runner/src/webcodex_runner/plugin.rs:1375-1390 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c05826e041329664b7894092203424b8b3a6a5186930b95f01efb95e39074d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/webcodex-store/src/oauth.rs:620-635 | crates/webcodex-store/src/oauth.rs:698-713 | crates/webcodex-store/src/oauth.rs:1013-1028 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/oauth.rs:620\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1a8e5530d5738bb59d9c7c7c917cf791cc4bf37ce68161ecb3b4a77e3cb582"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/webcodex-store/src/oauth.rs:646-661 | crates/webcodex-store/src/oauth.rs:794-809 | crates/webcodex-store/src/oauth.rs:1039-1054 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/oauth.rs:646\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa89a30d8fc96240034aed329d7e111e3cbbf97f089a8ea2318c59d4736c5f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/mcp/tools/call/specialized.rs:37-52 | src/mcp/tools/call/specialized.rs:253-268 | src/mcp/tools/call/specialized.rs:289-304 \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 \u0060src/mcp/tools/call/specialized.rs:37\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call/specialized.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd437b247ce4ef2ea24d322d39d8d445e083605c3baf167395069a0438502362"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 3): src/tool_runtime/communication.rs:786-798 | src/tool_runtime/communication.rs:898-910 | src/tool_runtime/communication.rs:978-993 \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":"src/tool_runtime/communication.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24f55b026d29652afee378c7fc94b3a669b1302215db476dfb81ccf3f3a7346"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/tool_runtime/goal.rs:140-155 | src/tool_runtime/goal.rs:161-176 | src/tool_runtime/goal.rs:182-197 \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 \u0060src/tool_runtime/goal.rs:140\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":"src/tool_runtime/goal.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f17643beecca5d44b02102726667d334c717def94b24ad1b32b64dd34f9b8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apps/desktop/src-tauri/src/webcodex/settings.rs:151-166 | apps/desktop/src-tauri/src/webcodex/settings.rs:174-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"apps/desktop/src-tauri/src/webcodex/settings.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e25ece673d9311da53888ac61f4aebe1a9278120a5ecd6f0876e60fac44778"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/connect/mod.rs:147-161 | crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:616-631 \u2014 before extracting anything, compare \u0060crates/webcodex-cli/src/webcodex_cli/connect/mod.rs\u0060 and \u0060crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/connect/mod.rs:147\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1260db0952da320674b3df87f519175bf73bb179b74557bd2057679f7549e961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/connect/mod.rs:210-225 | crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:868-883 \u2014 before extracting anything, compare \u0060crates/webcodex-cli/src/webcodex_cli/connect/mod.rs\u0060 and \u0060crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/connect/mod.rs:210\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/mod.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c887d78b3e301187827dfdd603e1a6094e4b8062ec34edff12356934c9545b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/webcodex-computer/src/platform/macos/accessibility.rs:957-971 | crates/webcodex-computer/src/platform/windows/accessibility.rs:754-769 \u2014 \u0060crates/webcodex-computer/src/platform/macos/accessibility.rs\u0060 and \u0060crates/webcodex-computer/src/platform/windows/accessibility.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 64 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-computer/src/platform/macos/accessibility.rs:957\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-computer/src/platform/macos/accessibility.rs:972\u0060 calls \u0060ensure_remaining\u0060 and \u0060crates/webcodex-computer/src/platform/windows/accessibility.rs:770\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6303ba810168f7683a5f56f0c4d82b20794b40a8870b44321dfa1bbc0bb68ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/webcodex-environment/src/service/linux.rs:273-288 | crates/webcodex-environment/src/service/macos.rs:223-238 \u2014 before extracting anything, compare \u0060crates/webcodex-environment/src/service/linux.rs\u0060 and \u0060crates/webcodex-environment/src/service/macos.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/service/linux.rs:273\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f2708b0038da133497d1c8e4bc2508ed14934b73196a9e7640e89f4e4b20c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/webcodex-environment/src/upgrade.rs:1929-1944 | crates/webcodex-environment/src/upgrade.rs:2226-2241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca7020ee9fb0fe94a9bd77d3e931b8964129431d45904190d0907b2cb190f45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:926-941 | crates/webcodex-runner-registry/src/requests.rs:1140-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 \u0060crates/webcodex-runner-registry/src/requests.rs:926\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"667693208f2d99f0cf72f578c4878e1c5c5d32dac55dd1f3b8c027213379d645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/webcodex-tool-contracts/src/tool_definition/documents.rs:33-48 | crates/webcodex-tool-contracts/src/tool_definition/docx.rs:32-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-contracts/src/tool_definition/documents.rs:33\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_definition/documents.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"38030b3710dec177c732e4983cb748ab0808ebd55f9842c0708d3ca505eb3ba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:1156-1171 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:1173-1188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e68ab074eda622e9c86e506efba01454d135161b118a479e2192628e03109fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/webcodex-workspace/src/project_recipe.rs:756-771 | crates/webcodex-workspace/src/project_recipe.rs:920-935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-workspace/src/project_recipe.rs:917\u0060 calls \u0060starts_with\u0060 and \u0060crates/webcodex-workspace/src/project_recipe.rs:755\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aedf056e821bc693fc5c85fbaa53a3b1a0423fef58bdf8acd21f6c9c29b9e5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201316 lines \u00D7 2): src/runtime_console_http/window_collaboration.rs:37-52 | src/runtime_console_http/window_queries.rs:345-353 \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 \u0060src/runtime_console_http/window_collaboration.rs:37\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime_console_http/window_collaboration.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"15483875140a4ed3cefb736d0c5b7dc3a90aa5886c7a72361fc3e5627ad9f957"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/tool_runtime/agent_task.rs:1127-1142 | src/tool_runtime/agent_task.rs:1331-1346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/agent_task.rs:1127\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/agent_task.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a81f0851761538e02bf0581ef31435482a882908c458f3fe9afc1c0dc0d4db7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/tool_runtime/browser_tools.rs:417-432 | src/tool_runtime/browser_tools.rs:469-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 \u0060src/tool_runtime/browser_tools.rs:417\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":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21262a3a8c118672d0cfcdb8483d3402168ff3974da0ed9539bbfc2e7fcb4df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/tool_runtime/coding_agent.rs:897-912 | src/tool_runtime/coding_agent.rs:1088-1103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/coding_agent.rs:897\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65f6312bf5eca9a04ea768afba48b83e5387df9b51a01ccb8b27b91519e09ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/tool_runtime/coding_task/project.rs:422-436 | src/tool_runtime/coding_task/project.rs:437-452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_task/project.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"5491a30def9c574b9932870b1f83ab420d8f2a7a63c34f012f786d20ac006921"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/tool_runtime/review_changes.rs:287-302 | src/tool_runtime/review_changes.rs:378-393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/tool_runtime/review_changes.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4efbaa47a66b3478e26f555f62dd7bc12be31f643bc3968b3a58b09c1ba06b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/tool_runtime/runtime_info.rs:608-623 | src/tool_runtime/runtime_info.rs:932-946 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/runtime_info.rs:608\u0060 it begins part-way through the construct above it, so those exact 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, \u0060src/tool_runtime/runtime_info.rs:606\u0060 calls \u0060to_string\u0060, \u0060into_value\u0060 and \u0060src/tool_runtime/runtime_info.rs:932\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":"src/tool_runtime/runtime_info.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"8535d8ab1fc72536551d9c3f68f6c5a098b4cb395bf149fec52299ae200b887b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): crates/webcodex-runner-registry/src/requests.rs:809-823 | crates/webcodex-runner-registry/src/requests.rs:869-883 | crates/webcodex-runner-registry/src/requests.rs:1217-1231 | crates/webcodex-runner-registry/src/requests.rs:1269-1283 | crates/webcodex-runner-registry/src/requests.rs:1314-1328 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:809\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"606957c4957f9293a250298a6d888e2dbe3528e7382c569633ea57d495de022c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): src/tool_runtime/process.rs:599-613 | src/tool_runtime/process.rs:937-951 | src/tool_runtime/script.rs:138-152 | src/tool_runtime/shell.rs:467-481 \u2014 before extracting anything, compare \u0060src/tool_runtime/process.rs\u0060 and \u0060src/tool_runtime/script.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 104 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 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":"src/tool_runtime/process.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"8299455d2ce3ea014270490c0d1a47579d03c4028fa2b75895d0ae1159dde3c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:903-917 | crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:1131-1145 | crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:1295-1309 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"52eb390cfdf2ec33894709b442b3aa96bf79d20afb71421a09bcb7e06bbcaebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apps/desktop/src-tauri/src/mcp_providers.rs:475-489 | crates/webcodex-process/src/program.rs:235-249 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060apps/desktop/src-tauri/src/mcp_providers.rs:475\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":"apps/desktop/src-tauri/src/mcp_providers.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce68aeeee283956afb3e3b3e7eee668494abac2e3f4aaee1d356b54dae0c2563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apps/desktop/src-tauri/src/tunnel_config.rs:119-133 | apps/desktop/src-tauri/src/tunnel_config.rs:542-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 \u0060apps/desktop/src-tauri/src/tunnel_config.rs:119\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/tunnel_config.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fb7210d686dae014e5a0c52350cd1a2b7f39bc1da8d91dc168712e4a50881f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/profiles.rs:123-137 | crates/webcodex-runner/src/webcodex_runner/config.rs:1306-1320 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/profiles.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65079e87969c7f8427cc3e27665acd1e3d3bd8c1d4eb76e30f1f9b252484c97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/system.rs:414-428 | crates/webcodex-cli/src/webcodex_cli/system.rs:456-470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/system.rs:414\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee4f8b11324568ea32fc4160e097f93d443ba4650a6ea4848ddfdabb86aff1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-environment/src/upgrade.rs:2121-2135 | crates/webcodex-environment/src/upgrade.rs:2313-2327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/upgrade.rs:2121\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8638b9a120f8e1153be65837aa38816c52810cb8aff6440391f9f22db5ca6cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/webcodex-lsp/src/supervisor.rs:521-533 | crates/webcodex-lsp/src/supervisor.rs:819-833 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-lsp/src/supervisor.rs:521\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bd5e0cb87aea81e07032bbaec5de7da9fc8a928aaecc22ebff4ddaf29f720a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:657-671 | crates/webcodex-runner-registry/src/requests.rs:1811-1822 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:657\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"40566544aa7b3bca975b3341ae87b6f64673d31b4f084dcc70ceb8a449f10b55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:999-1013 | crates/webcodex-runner-registry/src/requests.rs:1137-1151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"63540c4c4d880843363e55ee5d6e1cf4d0fa2a0404b829855decc2bd9e51509c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/configured_skills.rs:403-417 | crates/webcodex-runner/src/webcodex_runner/configured_skills.rs:468-481 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/configured_skills.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/configured_skills.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d85676ec0bcef61195cf36f15f6cde2ffff458873005f5717549001f07f710"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs:370-384 | crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs:390-404 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs:370\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"4226cfd736970f5af308247eab214dad1a154b592b0acc7b944fc9c8e7b6f7d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/patches.rs:2215-2229 | crates/webcodex-runner/src/webcodex_runner/patches.rs:2262-2276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/patches.rs:2215\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":2215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9c47d39eb12525c3340be72e007553e7cc71279f1856b8930a70e7ee47ee20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/quic.rs:225-239 | crates/webcodex-runner/src/webcodex_runner/transport/websocket.rs:97-111 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/transport/quic.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/transport/websocket.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/quic.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b959126596d8203aeab68eaf221dce32c01c9eb81e9fa4067b01a55e7e6e97f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-store/src/artifact_handoff.rs:738-752 | crates/webcodex-store/src/artifact_handoff.rs:794-808 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/artifact_handoff.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8f2dfe0cfa19efa1afd322d214fec4641a94e420de8d271e1c3a4ae5b8c9e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-tool-contracts/src/tool_call/parsing.rs:700-714 | crates/webcodex-tool-contracts/src/tool_call/parsing.rs:864-878 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/parsing.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff889294b399890ebedcb1e6e01f62d4cfd9ea57ca5ab09212a78c0bcfb9677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/webcodex-tool-runtime-contracts/src/tool_audit.rs:363-377 | crates/webcodex-tool-runtime-contracts/src/tool_audit.rs:431-444 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit.rs:363\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b1719a08c33e0e55632ae297c46beebd15ec5ca82400b4ee8347b62b8572ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:486-500 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:699-713 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:486\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"14979c2afac5d2eaa282e13743f818fc6d9f5e190fc36ccc0bae434b935ddc99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-workflow-session/src/events.rs:1125-1139 | crates/webcodex-workflow-session/src/events.rs:1265-1279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-workflow-session/src/events.rs:1125\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81e5d41ddd5522de0dcc990e08c329a2d9fad8abcf3e37111f764fd36ac55ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/webcodex-workflow-session/src/store.rs:3146-3159 | crates/webcodex-workflow-session/src/store.rs:3467-3481 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-workflow-session/src/store.rs:3146\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1826c9e61b9e1c494ce0016742d47ba976a03916ed3b8fc613107dedfa0cf6f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/project_entry.rs:518-531 | src/project_entry.rs:562-576 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/project_entry.rs:518\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c674f1a0a9edaf8afe8c8dfae695610fa9dd8a61168772430b9926c3427bd38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tool_runtime/communication.rs:1347-1361 | src/tool_runtime/communication.rs:1378-1392 \u2014 both copies are in the same file, so extract the block 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 \u0060ListConversationsInput\u0060 in one and \u0060ReadConversationInput\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":"src/tool_runtime/communication.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ff26172a5d94daaf9fa2c925185f8abbef904e9ef47e67652b9c5a9890cade"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tool_runtime/docx_document.rs:114-128 | src/tool_runtime/pdf_document.rs:184-198 \u2014 before extracting anything, compare \u0060src/tool_runtime/docx_document.rs\u0060 and \u0060src/tool_runtime/pdf_document.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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":"src/tool_runtime/docx_document.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ef60a1a9ff8a165562ccdeb17885b2631cbca67b96e55e1229410378979091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/tool_runtime/files/mutations/preflight.rs:130-144 | src/tool_runtime/files/mutations/text_edits.rs:367-380 \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 \u0060src/tool_runtime/files/mutations/preflight.rs:130\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/tool_runtime/files/mutations/preflight.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00b2431c50fed24d3db59533517db80a4b56a3c469e0accc1729bf053af8298"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tool_runtime/session_shell.rs:642-656 | src/tool_runtime/session_shell.rs:704-718 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/session_shell.rs:642\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_shell.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2a4dbaea79647ae2821c77e3fa9ce62c354dfc0913b9a593aed1cdedae2bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tool_runtime/work_result.rs:746-760 | src/tool_runtime/work_result.rs:844-858 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/work_result.rs:746\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/work_result.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed158d034cff1bb71f8365e2b6a26b1c4e30510600fc815d814abce89d62eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 3): crates/webcodex-runner-registry/src/jobs.rs:391-401 | crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs:62-75 | crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs:102-112 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/jobs.rs:391\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/jobs.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9230cf796c8e94f61ec01885eac6fb253661f36ec7f7b198ca73e05dd4d6ba8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/webcodex-runner-registry/src/requests.rs:943-956 | crates/webcodex-runner-registry/src/requests.rs:1085-1098 | crates/webcodex-runner-registry/src/requests.rs:1157-1170 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:943\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb56d8bd27d2a653fcdf48c9aec60f451eab0c310304f6e15ff826c06d201d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/webcodex-store/src/agent_wake.rs:526-539 | crates/webcodex-store/src/agent_wake.rs:759-772 | crates/webcodex-store/src/agent_wake.rs:936-949 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/agent_wake.rs:526\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d1aff6c592ed0d30e7e1745785eb7948fa1befd8d8fe6e338264214e06ce64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apps/desktop/src-tauri/src/webcodex/adapter.rs:451-464 | apps/desktop/src-tauri/src/webcodex/adapter.rs:511-524 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/desktop/src-tauri/src/webcodex/adapter.rs:451\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"af862f4dc3018b9dba5e43985d39793d0bf01efe4bcd59cb11e248c69b4e5d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apps/desktop/src-tauri/src/webcodex/cli.rs:761-774 | apps/desktop/src-tauri/src/webcodex/cli.rs:785-798 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/desktop/src-tauri/src/webcodex/cli.rs:761\u0060 it begins part-way through the construct above it, so those exact 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 \u0060task\u0060 to \u0060\u0026mut Option\u003CJoinHandle\u003Cstd::io::Result\u003C()\u003E\u003E\u003E\u0060 in one and \u0060\u0026mut Option\u003CJoinHandle\u003CVec\u003Cu8\u003E\u003E\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/cli.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2b12e11bd01d537104fa8b8b236bbbe2ba9a0154177f1c4495c33006322898"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/project.rs:237-250 | crates/webcodex-cli/src/webcodex_cli/project.rs:324-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6892eec297fe4fc849093c70974aece5b60bcc587df15c89f77bd123492ec0ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/system.rs:189-202 | src/project_entry_windows.rs:142-153 \u2014 before extracting anything, compare \u0060crates/webcodex-cli/src/webcodex_cli/system.rs\u0060 and \u0060src/project_entry_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/system.rs:189\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"822c90e7cd25157b1a6fb5b4f114045b6d887e9aa0b26dba0ca34012b5210361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-core/src/coding_agent.rs:756-769 | crates/webcodex-runner/src/webcodex_runner/coding_agent/protocol.rs:447-460 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/coding_agent.rs:756\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda1f4a10b58b90a32d6321e8423b6daab307fc84c6e30bf5e087874c9e486f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:2955-2968 | crates/webcodex-runner-registry/src/requests.rs:3105-3118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:2955\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":2955}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1209b419f97aaa71c308135c1478e93d93bac0be430d6ffcdfa4d1110c02acd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-runner/src/main.rs:117-130 | crates/webcodex-runner/src/main.rs:145-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/main.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe8b644d705b02f8e7c5f24ab5db4464ed73583280a647e81c94401401d9ffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:332-345 | crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:561-574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:331\u0060 calls \u0060read_ooxml_content_types_entry\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:560\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f91e6788e7141136648d0d35dd4c4c58e87e1c23d66035e22e68dac2b4d173"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:56-69 | src/tool_runtime/files/artifacts.rs:198-211 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2e91aea6764fd01f3f262ce77fcea501fa7c9d36a5b7776d171b9d014b87df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs:133-146 | crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs:158-171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa7265bab21b7c2a9ee0573dc129cdf6175b90e0191e16eb6a20f9ef426924f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs:286-299 | crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:300-313 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ae203471b3964e6d4e7ba3d57d9037248ca94feded31f7b776a58597b6a0ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/dispatch.rs:189-202 | crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs:303-316 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/dispatch.rs:189\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/dispatch.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0712c7e18e923605b1482e06f0b6a378061ffb3f9c8b5dc0b07731135d5c03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs:68-81 | crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs:70-83 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs:68\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"53011211439a0be0e932617a372f86cc129fff7b6d02a59433bcb4cfc31a8b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/shell/commands.rs:99-112 | crates/webcodex-runner/src/webcodex_runner/shell/commands.rs:161-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/commands.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d87f3b36ac9a94e46fe6156fb9008f914ab8b07e6e28b0639fafa110a0309fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/shell/process.rs:227-240 | crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs:384-397 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/shell/process.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/shell/process.rs:227\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/process.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdc1ec43f9c25ceb3f14bd30059da94385cfe4a3983ca49ff5e473f656badd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/webcodex-store/src/activity.rs:126-141 | crates/webcodex-store/src/activity.rs:195-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/activity.rs:126\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/activity.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27da4ef53d0e2997bf85015a0fed0e2f33f5cc03a145421d12d1cf15f2acb3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-store/src/agent_wake.rs:2117-2130 | crates/webcodex-store/src/agent_wake.rs:2649-2662 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/agent_wake.rs:2117\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":2117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1e0ea2d45991f693d446ad8ac9b12b2199c8ce17ce8eb0a80d1fe461f3a86d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/webcodex-store/src/agent_wake.rs:2115-2128 | crates/webcodex-store/src/agent_wake.rs:2182-2193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/agent_wake.rs:2115\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaae00da455cba5027458d94816b4aae3bb96e544f483f40ac6b9df8fec617b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-store/src/goal.rs:383-396 | crates/webcodex-store/src/goal.rs:502-515 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/goal.rs:383\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5018784a71d0a51061981a8fa66ef079d047b360b92f72c9d2189b6f04c914b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-store/src/goal.rs:962-975 | crates/webcodex-store/src/goal.rs:1072-1085 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/goal.rs:962\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2935bd415abcfc3d61292a5966ce9661fb12bf68695dfe78d8223163386999"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-store/src/memory.rs:954-967 | crates/webcodex-store/src/memory.rs:1217-1230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/memory.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9f141588d945c18c828140b487e2e54d960deef6823ec73bbb51ae19194855"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/webcodex-store/src/oauth.rs:540-553 | crates/webcodex-store/src/oauth.rs:920-931 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/oauth.rs:540\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c602ac900aae3dc452db0f276366ad2e22192a520b915f5421bae5682e9c68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-workflow-session/src/handoff_brief.rs:724-737 | crates/webcodex-workflow-session/src/handoff_brief.rs:762-775 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-workflow-session/src/handoff_brief.rs:724\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b61ce47a4233a0ace7c58ae4f5029725bac4b9b863d274d065c01824c589150"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/oauth_http/metadata.rs:27-40 | src/oauth_http/metadata.rs:68-81 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/oauth_http/metadata.rs:27\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":"src/oauth_http/metadata.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"401ba167eda756227863ebcb6660924874c5905b375930b73972c1e122ee0d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tool_request_trace/writer.rs:123-136 | src/tool_request_trace/writer.rs:165-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_request_trace/writer.rs:123\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":"src/tool_request_trace/writer.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8724d7cf539ec25338cafa0eed3e3d75fa15dc4025838f99224f85af9bb1c4fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tool_runtime/changes.rs:982-995 | src/tool_runtime/changes.rs:1115-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 \u0060src/tool_runtime/changes.rs:982\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/changes.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb727bd80e1576b5075e7a319f3ef57775401fb3a5cf3b6ba6a99143d6c94799"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/tool_runtime/code_mode.rs:406-418 | src/tool_runtime/code_mode.rs:422-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/code_mode.rs:422\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/code_mode.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"0335edf28757fa826fc42064d766d418a2a3473accda1e0261b925a0a2295d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tool_runtime/files/artifacts.rs:967-980 | src/tool_runtime/files/artifacts.rs:993-1006 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/files/artifacts.rs:967\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/artifacts.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4f78ace4fba91e39ef431deb00c281a59d4239f7e3e2f7b84a7e0aac423938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/tool_runtime/job_terminal_wait.rs:259-272 | src/tool_runtime/job_terminal_wait.rs:297-309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/job_terminal_wait.rs:259\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":"src/tool_runtime/job_terminal_wait.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7728f664c2218647a85985dd93a4fc551c5b9bcc8249f63a13735e841b9297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tool_runtime/kernel/recording.rs:189-202 | src/tool_runtime/kernel/recording.rs:303-316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/kernel/recording.rs:189\u0060 it begins part-way through the construct above it, so those exact 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":"src/tool_runtime/kernel/recording.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83c5069de7c7b2dd39b49e7886ce9fc9cd0cac340b18a14861017cdad33af9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tool_runtime/observe_jobs.rs:417-430 | src/tool_runtime/observe_jobs.rs:581-594 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7692de953ad1d899411fe1342556d4e975c4365eb6495dcf2804ff8ee3904a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tool_runtime/runner_instructions.rs:23-36 | src/tool_runtime/runner_instructions.rs:45-58 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/runner_instructions.rs:23\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runner_instructions.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5965c227323c039303a9dbd55cc7e6e38d48a13a4b515b3320f3f3abdecb8d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tool_runtime/script.rs:186-199 | src/tool_runtime/shell.rs:608-621 \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 \u0060src/tool_runtime/script.rs:186\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":"src/tool_runtime/script.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"df56ceb5f62c759c19686eb518a7dc780734961a3592a55b5303bb1fb8acff61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tool_runtime/startup_brief.rs:1206-1219 | src/tool_runtime/startup_brief.rs:1305-1318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/startup_brief.rs:1206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa52c87277dfacce8874695ee0e0b305b6b0fcf7c2e7d40ba430d0476d6a24cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/webcodex-lsp/src/navigation.rs:458-470 | crates/webcodex-lsp/src/navigation.rs:568-580 | crates/webcodex-lsp/src/navigation.rs:631-643 | crates/webcodex-lsp/src/navigation.rs:741-753 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cdfc7ad9c5d0a611787036305f672e87d0a384508e49f52ed9d2b54d6e5870"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): apps/desktop/src-tauri/src/state/persistence.rs:176-188 | crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs:543-554 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:2155-2166 \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":"apps/desktop/src-tauri/src/state/persistence.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"702a6b2bcb5d643ec1b5b0c758d960976050a451edda4547fc68cc24b199ad5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/webcodex-cli/src/webcodex_cli/connect/disconnect.rs:73-84 | crates/webcodex-cli/src/webcodex_cli/connect/mod.rs:78-89 | crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:523-535 \u2014 before extracting anything, compare \u0060crates/webcodex-cli/src/webcodex_cli/connect/mod.rs\u0060 and \u0060crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/disconnect.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb599ee3f71169ce13006eed9bf0fd70d022c9ca7a3352eb23b545b4655b3288"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apps/desktop/src-tauri/src/webcodex/cli.rs:585-597 | apps/desktop/src-tauri/src/webcodex/cli.rs:599-611 \u2014 both copies are in the same file, so extract the block 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":"apps/desktop/src-tauri/src/webcodex/cli.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f05f5b7d9f4c172a5642b372c3b1f4a8c3a0a3f5fa353fbcc673120c100c5fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/connect/process.rs:570-582 | crates/webcodex-cli/src/webcodex_cli/connect/process.rs:699-711 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/connect/process.rs:570\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/process.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27c4115987e325d16b4175df558563f2b7a838bfd1c5f0279cd26b6b2fdb73e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/system.rs:492-504 | crates/webcodex-cli/src/webcodex_cli/system.rs:534-546 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/system.rs:492\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6415f6cc9afd2dbc3b7dadf1195f719ad02171a25f09fd977532d6622313f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-core/src/apply_patch_shared.rs:361-373 | crates/webcodex-core/src/apply_patch_shared.rs:417-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/apply_patch_shared.rs:361\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_patch_shared.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88c29a21de7b954ee46dcfc53de477332b5129ff507749bebea57cc207e8c48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-core/src/coding_agent.rs:1192-1204 | crates/webcodex-core/src/plugin.rs:457-469 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/coding_agent.rs:1192\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd01e7f79d0d2e8da4fcd90652a61900ec2fa6e43ae4f4b7d2e2106d471bc144"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-core/src/runner_protocol/job.rs:422-434 | crates/webcodex-core/src/runner_protocol/job.rs:766-778 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-core/src/runner_protocol/job.rs:436\u0060 calls \u0060Err\u0060 and \u0060crates/webcodex-core/src/runner_protocol/job.rs:779\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"7196e1d264660dda5fc01dcbb97decefa4b0802036518e91ed50bbf8a8b831ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-core/src/validation_identity.rs:379-391 | crates/webcodex-core/src/validation_identity.rs:406-418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_identity.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"1998d7392a8b3ca5a2ffd7342bdd611617b6bcdfef608262afd1331184682122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/webcodex-runner-registry/src/polling.rs:237-249 | crates/webcodex-runner-registry/src/requests.rs:2015-2024 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/polling.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/polling.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee3c9a731e9d88834fd46a25cdd3f54fc6b703685f58d8496efc598b080dd6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:146-158 | crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:548-560 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:146\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbda13f48555ed0913aacb2060b7aa2157556835b7b935e972330b6450c3f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs:375-387 | crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs:443-456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs:375\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"edffbede0606fb7eefe37d9e73a378b1e39aaedac9134dba10be3d6f7049500f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/patches.rs:1718-1730 | crates/webcodex-runner/src/webcodex_runner/patches.rs:1749-1762 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/patches.rs:1749\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea354c4ed9ece893a6f0f24bd0237402b73b35ee29498d4de6a671604f0d886"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/plugin.rs:1404-1416 | crates/webcodex-runner/src/webcodex_runner/plugin.rs:1424-1436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/plugin.rs:1404\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/plugin.rs:1403\u0060 calls \u0060store\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/plugin.rs:1423\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"15525c4949f98195ae24dcf57257ec1fc3800dd1d23297ab695d309907e9286b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs:872-884 | crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs:982-994 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs:872\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3e8fc855b1436eac5aac6bb976e2d112cc9a1349ca34293793c87f52badac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:538-548 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:595-607 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:538\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/remote_shell.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"f698caaf17733057a1f77535dea6a2a628d1e00bae368393153272f6933730f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-store/src/communication.rs:1638-1650 | crates/webcodex-store/src/communication.rs:1675-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/communication.rs:1638\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9ff8180fba8edf4b1e90ca38b21e5a5e228752884087761e63ba2f3ddd089c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-store/src/goal.rs:901-913 | crates/webcodex-store/src/goal.rs:1004-1016 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/goal.rs:901\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ae3f120a78c481d05013ce598937748f937cd84dd4d38422733160f7f7e7cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:353-365 | crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:563-575 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:353\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:576\u0060 calls \u0060schema_type\u0060 and \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:366\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cc8a0499b799339be61d9646cf6b74dee96a9fc17068d4beef3867371bc95c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/webcodex-workflow-session/src/continuation.rs:881-893 | crates/webcodex-workflow-session/src/handoff_brief.rs:321-332 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-workflow-session/src/continuation.rs:881\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/continuation.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b048c6fc72607284494b37526e151d957d63c11f1155fbb1df7d984ef77cbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cloudflare_host.rs:92-104 | src/cloudflare_ingress.rs:486-498 \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 \u0060src/cloudflare_host.rs:92\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cloudflare_host.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcfb814834a8bf615d394fcca2391ceec9ca59b3527ecc63c7065c25b6cf9ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/mcp.rs:872-882 | src/runtime_http.rs:159-171 \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 \u0060src/mcp.rs:872\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":"src/mcp.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"c937cf1fb352477f8e829b43c7a543c1960c01c41354e2f92a4ce3f2b745cf0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/oauth_http/managed_authorize.rs:1268-1280 | src/oauth_http/managed_authorize.rs:1385-1397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"31dc2427b452cda9deae3220f83ba051683a753e2cd1848a38593e4b111de32a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/project_entry_cloudflared.rs:622-632 | src/project_entry_setup.rs:1164-1176 \u2014 before extracting anything, compare \u0060src/project_entry_cloudflared.rs\u0060 and \u0060src/project_entry_setup.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 \u0060src/project_entry_cloudflared.rs:622\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_cloudflared.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbf987957480a534dd5cdaee57562ff6b3db6ada172a468c4b57acd73f00fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/project_entry_regular_tunnel.rs:341-353 | src/project_entry_share.rs:1052-1064 \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 \u0060src/project_entry_regular_tunnel.rs:341\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_regular_tunnel.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65d7438556f3909c39f625672a13599c1759a71ba894d47b1c1c1771a54b132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/runner_tokens_http/routes.rs:71-81 | src/runner_tokens_http/routes.rs:166-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runner_tokens_http/routes.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"82782bde9c6c7f0188293f17411ca5c7dd2371419f67716ca9007b51022c9971"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tool_runtime/artifact_transfer.rs:560-572 | src/tool_runtime/artifact_transfer.rs:923-935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/artifact_transfer.rs:560\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/artifact_transfer.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"526eb8f8cdeba048a0bf4a94b9689a3805bae8e9b80ac2f6c189c0fb6243eef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tool_runtime/coding_agent.rs:879-891 | src/tool_runtime/coding_agent.rs:1026-1038 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/coding_agent.rs:1026\u0060 it begins part-way through the construct above it, so those exact 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":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7dc765b7ede575d99b982efb1d1d2081bfbbf4c22b4544a6f660a4b387b3c62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tool_runtime/projects.rs:912-924 | src/tool_runtime/projects.rs:1011-1023 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/projects.rs:912\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/tool_runtime/projects.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccc8a2d362b48b58c6baf2b97e9f82db8107dafb652fb43e6aeb5a0cc61847b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tool_runtime/read_files.rs:496-508 | src/tool_runtime/search_project_texts.rs:116-128 \u2014 before extracting anything, compare \u0060src/tool_runtime/read_files.rs\u0060 and \u0060src/tool_runtime/search_project_texts.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 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 \u0060src/tool_runtime/read_files.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":"src/tool_runtime/read_files.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab26b1a606243c3cb3da9b47a783e40f7af113771216e02d5bacc229e755bdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tool_runtime/skills.rs:2045-2057 | src/tool_runtime/skills.rs:2168-2180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/skills.rs:2045\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/skills.rs"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cc25e78446e56f99cb11369dbcc39e1920927f107f7266a60b40b070f6a7b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 11): crates/webcodex-cli/src/lib.rs:2790-2801 | crates/webcodex-cli/src/lib.rs:2803-2814 | crates/webcodex-cli/src/lib.rs:2902-2913 | crates/webcodex-cli/src/lib.rs:2989-3000 | crates/webcodex-cli/src/lib.rs:3002-3013 | crates/webcodex-cli/src/lib.rs:3044-3055 | crates/webcodex-cli/src/lib.rs:3057-3068 | crates/webcodex-cli/src/lib.rs:3070-3081 | crates/webcodex-cli/src/lib.rs:3083-3094 | crates/webcodex-cli/src/lib.rs:3096-3107 | crates/webcodex-cli/src/lib.rs:3109-3120 \u2014 all 11 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2790}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b75ec4b28d097336a8e3925d51eba2196f76a9f107059dfb49e9b0dd117f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): crates/webcodex-runner/src/webcodex_runner/shell/process.rs:229-240 | crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs:386-397 | crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs:409-420 | crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs:423-433 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/shell/process.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/shell/process.rs:229\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/process.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f7435411653eb8531a26930d8333caae43d0e19edf7569e0f5c1b0c1005168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 4): src/runner_tokens_http/routes.rs:69-80 | src/runner_tokens_http/routes.rs:165-176 | src/runner_tokens_http/routes.rs:262-270 | src/runner_tokens_http/routes.rs:296-304 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runner_tokens_http/routes.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4b67911e49672617d7ac38bd68288ff498467aa46324516c7acebba9bb182c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/webcodex-core/src/coding_agent.rs:1189-1200 | crates/webcodex-core/src/mcp_gateway.rs:297-308 | crates/webcodex-core/src/plugin.rs:454-465 \u2014 before extracting anything, compare \u0060crates/webcodex-core/src/mcp_gateway.rs\u0060 and \u0060crates/webcodex-core/src/plugin.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/coding_agent.rs:1189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb1a072a3d5939c12db495dcb25beb57d606212748142b543498d02693b782f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/webcodex-runner-registry/src/requests.rs:1392-1403 | crates/webcodex-runner-registry/src/requests.rs:1485-1495 | crates/webcodex-runner-registry/src/requests.rs:1572-1583 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:1392\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea905313ab1f108b25a059c88cb3d00b8879e838b8ace3d30efc14a9259d7f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/webcodex-store/src/memory.rs:958-969 | crates/webcodex-store/src/memory.rs:1007-1018 | crates/webcodex-store/src/memory.rs:1221-1232 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/memory.rs:958\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/memory.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"8647498b1ad93aa3a046f74465ff997436a97b84f7ad60d3e782452c1cec944d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/webcodex-workflow-session/src/continuation.rs:1581-1592 | crates/webcodex-workflow-session/src/continuation.rs:1598-1609 | crates/webcodex-workflow-session/src/continuation.rs:1614-1625 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/continuation.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d2c0afdb5df28c1c4de028fa8183e7fd1ccb74ca3b5a0d549785c5125584df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/project_entry.rs:997-1008 | src/project_entry_regular_tunnel.rs:371-382 | src/project_entry_share.rs:1073-1084 \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. 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":"src/project_entry.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c680be5d7652288a94ef521786b1179775ba70a4018edd30223dced1b51380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/desktop/src-tauri/src/lifecycle_log.rs:250-261 | crates/webcodex-browser/src/profiles.rs:93-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":"apps/desktop/src-tauri/src/lifecycle_log.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8aa8d0af6df1f7ded3842eed496d2514bbe1b5b1839fd91497a8c94a7d123a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/desktop/src-tauri/src/state/connections.rs:522-533 | apps/desktop/src-tauri/src/state/connections.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. 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) async fn start_connection_process( \u0026mut\u0060 in one and \u0060super) async fn stop_connection_process( \u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/desktop/src-tauri/src/state/connections.rs:521\u0060 calls \u0060check\u0060 and \u0060apps/desktop/src-tauri/src/state/connections.rs:642\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":"apps/desktop/src-tauri/src/state/connections.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"8223b15fc26bf0e137998ae5939d3b6c358a8034cf4a16ca2f909ee8be7e9c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-admin/src/commands.rs:214-226 | crates/webcodex-admin/src/commands.rs:322-334 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-admin/src/commands.rs:320\u0060 calls \u0060value\u0060 and \u0060crates/webcodex-admin/src/commands.rs:212\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e9465b5e44fd882340caa51e806bbc4b0e6995c985de1572cec3dd3adda804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-browser/src/supervisor.rs:553-564 | crates/webcodex-browser/src/supervisor.rs:582-593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-browser/src/supervisor.rs:553\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4d9cd4afec8b1cc507c0f5630c3615525a9961c2153159a31d54b4e937ea2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:977-988 | crates/webcodex-cli/src/lib.rs:1094-1105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/lib.rs:977\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf135553cfe1ff99c44b8329df582ae572a6118ce375950e497959ceba59e4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/connect/process.rs:555-566 | crates/webcodex-cli/src/webcodex_cli/connect/process.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/process.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cc12a79d30ee3149efa0a57a080069524a34aacc90372040d5e99bebe23b53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/system.rs:243-254 | src/project_entry_windows.rs:193-201 \u2014 before extracting anything, compare \u0060crates/webcodex-cli/src/webcodex_cli/system.rs\u0060 and \u0060src/project_entry_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/system.rs:243\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"52edb480143f7914ff24298a40c2c4b597c5b001538ea9f900af53b72b18242e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/token_commands.rs:83-93 | crates/webcodex-cli/src/webcodex_cli/token_commands.rs:142-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/token_commands.rs:83\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/token_commands.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"863ca2464bd3832b1ac411dd3a7d599207a51cb7a2dc32a76399cb172cb00d8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/webcodex-environment/src/process/unix.rs:99-110 | crates/webcodex-environment/src/process/windows.rs:80-90 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/process/unix.rs:99\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/process/unix.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b199713f9d083b945b4c51f8a36c04bd7bc285d79dc7f44a3dba16e35826fd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-persistent-shell/src/unix.rs:396-407 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:764-775 \u2014 before extracting anything, compare \u0060crates/webcodex-persistent-shell/src/unix.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/remote_shell.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-persistent-shell/src/unix.rs:396\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"662abd140c0c848e0bc7b62b36954389f1777b12862ffc1fb1bbd54f52c591c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-persistent-shell/src/unix/readers.rs:56-67 | crates/webcodex-persistent-shell/src/windows.rs:379-390 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-persistent-shell/src/unix/readers.rs:56\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix/readers.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecd3e440fe54a572b8f833a6497fcfe605ed94dcf3193a8556c1af409011ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): crates/webcodex-runner-registry/src/job_updates.rs:295-306 | crates/webcodex-runner-registry/src/job_updates.rs:311-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 \u0060crates/webcodex-runner-registry/src/job_updates.rs:295\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e23d818f58393d67ac2bea62350bbd977c45d16cc3fbfe85c0ca8e67a2b57b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:2671-2682 | crates/webcodex-runner-registry/src/requests.rs:2870-2881 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:2671\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf044ae1598c13ff642e2b968d84f6c667b935afec9e662eac3a561bc7d8993f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts.rs:802-813 | crates/webcodex-runner/src/webcodex_runner/artifacts.rs:924-935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"9770102a3c88de3988fbf4521bfdfed27d3a3519f85b230833da65e1a9fcb7ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/configured_skills.rs:172-183 | crates/webcodex-runner/src/webcodex_runner/configured_skills.rs:271-283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/configured_skills.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":"crates/webcodex-runner/src/webcodex_runner/configured_skills.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9296654d73364c0eadb7ff63d33f9a80f69e1e63a6e102d086bc4c2df294d3eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/plugin.rs:1722-1733 | crates/webcodex-runner/src/webcodex_runner/plugin.rs:1746-1757 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/plugin.rs:1722\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"402cf1aa34e3b54e73958cf97674ead58f0f27cdbbcb528637ae93287a66c10c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/projects/registration.rs:135-146 | src/tool_runtime/projects.rs:1475-1486 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/projects/registration.rs\u0060 and \u0060src/tool_runtime/projects.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/registration.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b0f05658d266c5f1f0c97eba555979a801648dcb4c972c5ba4f95305289dc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/shell/search.rs:50-61 | crates/webcodex-runner/src/webcodex_runner/shell/search.rs:70-81 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/shell/search.rs:50\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/search.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f33954d157ffa8ac73e6d2bb772e5a1af274aac53ae42a295fc6728558c02b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:601-612 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:650-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 \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:601\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f35e0d077233893bd8a5194fb1283bd4f38f403c9901266ccd0587f79ccc49d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-workflow-session/src/events.rs:1097-1108 | crates/webcodex-workflow-session/src/events.rs:1237-1248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-workflow-session/src/events.rs:1097\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"087f935b29ce093f1dbb3fc12b4047ce086c8d19b807b7a6b25148a69fa4f5d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/admin_project_lifecycle.rs:138-149 | src/admin_project_lifecycle.rs:178-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/admin_project_lifecycle.rs:138\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060request\u0060 to \u0060RegisterProjectRequest\u0060 in one and \u0060CreateProjectRequest\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":"src/admin_project_lifecycle.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7860e712df611166368bb523dc920a46e949336e608bc7512031fc7f4495ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/mcp.rs:438-449 | src/tool_runtime/job_audit.rs:226-237 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/mcp.rs:438\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcfea868eb67812095bc3e678cb4f9f1d2bf2bee618fced5a32ba9a08443f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/mcp_gateway.rs:225-236 | src/mcp_gateway.rs:320-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_gateway.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e52c458dee2daf20e084e7cfee2cba1a7927fab64a231327b5d993d6ab0a116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tool_runtime/agent_task.rs:807-819 | src/tool_runtime/agent_task.rs:843-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/agent_task.rs:807\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":"src/tool_runtime/agent_task.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4c5d5262766370ecc7f456bbfa699562100da048c46af287baf7f75261c938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tool_runtime/checkpoint.rs:267-278 | src/tool_runtime/checkpoint.rs:393-404 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/checkpoint.rs:267\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/checkpoint.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"761af1a88b6d79ab1ec37227074c63c91c00f498af555104bd9b1b14687c600a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tool_runtime/files/mutations/preflight.rs:72-83 | src/tool_runtime/helpers.rs:534-545 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/preflight.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44191f8ee8f785bbf3711b2faba294a2f1d1cfc6d5d743a705f7963567a780f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/tool_runtime/files/mutations/preflight.rs:157-168 | src/tool_runtime/files/mutations/text_edits.rs:414-423 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/preflight.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1652b6db1867634551ca12b275901b48e21582e3e1c63d7b6546d065c5644a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tool_runtime/goal.rs:1392-1403 | src/tool_runtime/goal.rs:1470-1481 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/goal.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"752d574829b77127b15e74f99a945309425aec77eed9b076933aa2bd1d6ce56d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tool_runtime/project_resolution.rs:583-594 | src/tool_runtime/project_resolution.rs:613-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/project_resolution.rs:583\u0060 it begins part-way through the construct above it, so those exact 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":"src/tool_runtime/project_resolution.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a195b55624d7097683c5db8792e03aee45c98f5b94b6ea40a6745484159471"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tool_runtime/review_changes.rs:244-255 | src/tool_runtime/review_changes.rs:459-470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/review_changes.rs:244\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/review_changes.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea0f036a73da2909b6aff83e1fb63cadece5b7784a30bfc82d311ac59b35d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tool_runtime/skills.rs:2075-2086 | src/tool_runtime/skills.rs:2200-2211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/skills.rs:2075\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/skills.rs"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b3f92e717884ea5b386d073f7cd63484823858ea95277a7b97ec38d4e6a2e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/users_http/tokens.rs:119-130 | src/users_http/tokens.rs:196-206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/users_http/tokens.rs:119\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":"src/users_http/tokens.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc7fe2a03d5c8d4cfc181c63b982eca996276ed9e1625bc42e9f1732c18015d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): crates/webcodex-runner/src/webcodex_runner/shell/process.rs:230-240 | crates/webcodex-runner/src/webcodex_runner/shell/process.rs:254-264 | crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs:387-397 | crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs:410-420 | crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs:423-433 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/shell/process.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/process.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fffb04d5fbc63b01ab9195657c4478906430de1969a975ecd960dae82f9ada5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/webcodex-cli/src/webcodex_cli/http.rs:27-37 | crates/webcodex-cli/src/webcodex_cli/http.rs:64-74 | crates/webcodex-cli/src/webcodex_cli/token_commands.rs:79-89 | crates/webcodex-cli/src/webcodex_cli/token_commands.rs:138-148 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/http.rs:27\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/http.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6acd705bfa11ceb2dda77b5858193b3cc87436edb362337638de6f5c93f0ce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): src/oauth_http/managed_authorize.rs:515-524 | src/oauth_http/managed_authorize.rs:647-656 | src/oauth_http/metadata.rs:24-34 | src/oauth_http/metadata.rs:65-75 \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. 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":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d0f9b9ede21c2c09d6d47a1d819c48b143951b52d5e44d50f138847fe6122e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/webcodex-workflow-session/src/store.rs:2838-2848 | crates/webcodex-workflow-session/src/store.rs:3075-3085 | crates/webcodex-workflow-session/src/store.rs:3342-3352 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn close_session( \u0026mut\u0060 in one and \u0060super) fn replace_message( \u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-workflow-session/src/store.rs:3086\u0060 calls \u0060validate_message_text\u0060 and \u0060crates/webcodex-workflow-session/src/store.rs:2849\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":2838}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c794ccf52a1a3a4dabde0738827e22a7decb78c3effa9aba8708267199ebdc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/webcodex-workflow-session/src/store.rs:3006-3016 | crates/webcodex-workflow-session/src/store.rs:3214-3224 | crates/webcodex-workflow-session/src/store.rs:3275-3285 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3006}}}],"partialFingerprints":{"codehealthFindingId/v1":"daaf239b36f0a8fe3b4066d98731825c4cead6f5c2139fdcbdd5206a4b34fe88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/runner_tokens_http/routes.rs:218-228 | src/users_http/tokens.rs:116-126 | src/users_http/tokens.rs:193-203 \u2014 before extracting anything, compare \u0060src/runner_tokens_http/routes.rs\u0060 and \u0060src/users_http/tokens.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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 \u0060src/runner_tokens_http/routes.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":"src/runner_tokens_http/routes.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0c86ce32057037d124027d65748e7eff599614e513e4d3b75c15d5016ed3de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/tool_runtime/changes.rs:982-992 | src/tool_runtime/changes.rs:1053-1063 | src/tool_runtime/changes.rs:1115-1125 \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 \u0060src/tool_runtime/changes.rs:982\u0060 it begins part-way through the construct above it, so those exact 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":"src/tool_runtime/changes.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3740ae537e70a0dc5194e42dd931d225dbb6aeae29f9b0f9b713c45bf1598f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): src/tool_runtime/skills.rs:1689-1699 | src/tool_runtime/skills.rs:1794-1802 | src/tool_runtime/skills.rs:1880-1888 \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 \u0060src/tool_runtime/skills.rs:1689\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. 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":"src/tool_runtime/skills.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18ca8d2e6cfd6649d07830624944d8ff498153d19bd2a466d317261b61ffba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/desktop/src-tauri/src/runtime_selection.rs:281-291 | apps/desktop/src-tauri/src/runtime_selection.rs:329-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/runtime_selection.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"402b0a5406187f2a3c7d96f1b39377b391cfd9f79f0936d8e2a65c0bf43c1940"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/desktop/src-tauri/src/state/environment.rs:144-154 | apps/desktop/src-tauri/src/state/environment.rs:174-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/desktop/src-tauri/src/state/environment.rs:144\u0060 it does not close everything it opens, so those exact 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060request\u0060 to \u0060crate::models::EnvironmentUserCredentialRequest\u0060 in one and \u0060crate::models::EnvironmentServiceRequest\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":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2050d3c419a1e78e95748b7ad3808ba596d9d59b5336af3843c4fb5e93d2919"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/desktop/src-tauri/src/state/workspace_settings.rs:34-44 | apps/desktop/src-tauri/src/state/workspace_settings.rs:61-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/desktop/src-tauri/src/state/workspace_settings.rs:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/workspace_settings.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e329335fa3e6aec5d5b43a44da97da4eb77600e9f449a7b5f8ccde3db41ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/desktop/src-tauri/src/tray.rs:186-196 | apps/desktop/src-tauri/src/tray.rs:328-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/desktop/src-tauri/src/tray.rs:186\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":"apps/desktop/src-tauri/src/tray.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba7151861fdf9ea9e47bc57837fd751442210f2b61b120b4ca4f55a319ca527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): apps/desktop/src-tauri/src/webcodex/adapter.rs:861-871 | crates/webcodex-cli/src/webcodex_cli/project.rs:364-373 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/project.rs:364\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"834a4e6f03f35f2854af1188c28b29852254b2f6f27a24617f8e8ad9adaf5c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/desktop/src-tauri/src/webcodex/cli.rs:502-512 | apps/desktop/src-tauri/src/webcodex/cli.rs:614-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/desktop/src-tauri/src/webcodex/cli.rs:502\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/cli.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6b52e74bfea4dbbbf5c754c3e0b3766876b8fa12bf6d77b5bcdad50fb23ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/webcodex-browser/src/cdp.rs:2448-2458 | crates/webcodex-browser/src/cdp.rs:2681-2690 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-browser/src/cdp.rs:2448\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":2448}}}],"partialFingerprints":{"codehealthFindingId/v1":"936f036e53cd482f1852a9e54b100f4c41e832a7843703c13fc270b326d9b2e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:1262-1272 | crates/webcodex-cli/src/lib.rs:1304-1314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59515cfa5d550545c868a52d47b977b18b51be0da7bd94506d702b33f0cd132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:2201-2211 | crates/webcodex-cli/src/lib.rs:2442-2452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-cli/src/lib.rs:2198\u0060 calls \u0060Some\u0060, \u0060next_value\u0060 and \u0060crates/webcodex-cli/src/lib.rs:2441\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6d298f4c864db0086b227d9409bcc70af5daee70835068e3ee5e9341d760a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/service.rs:976-986 | crates/webcodex-cli/src/webcodex_cli/service.rs:990-1000 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/service.rs:976\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3975a55733effbd5a74e4f30760f3e2bf6216fba03110e9ff6b1c1e0116c67e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/system.rs:228-238 | src/project_entry_windows.rs:180-190 \u2014 before extracting anything, compare \u0060crates/webcodex-cli/src/webcodex_cli/system.rs\u0060 and \u0060src/project_entry_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/system.rs:228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"11de974449ac14c59435982d97d5410c5cbe44bd6f41647397f8c88afd1bb0ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-core/src/model_reference.rs:26-36 | src/tool_runtime/project_resolution.rs:302-312 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/model_reference.rs:26\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/model_reference.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fad24e7a3063250006239e764dfbcdfca0a4cff4c20b4e17a8e77c207c15e71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/webcodex-core/src/runner_operation.rs:838-847 | crates/webcodex-core/src/runner_operation.rs:1189-1199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc77e5c395651b7e57f90e693370c1920c5e0fc791af38ec5debab0fb6ae69c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/webcodex-environment/src/cloudflare_tunnel.rs:253-263 | crates/webcodex-environment/src/cloudflare_tunnel.rs:295-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/cloudflare_tunnel.rs:253\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b745387163033f8424f69e20a59facf0536b3d10f1561df05bea9324c136dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-environment/src/cloudflare_tunnel.rs:752-762 | crates/webcodex-environment/src/upgrade.rs:806-816 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/cloudflare_tunnel.rs:752\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"20aff12382a8f89c4a9e98165706f6f692f943c750becfbbb0a208221f3af6c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-environment/src/service/linux.rs:541-551 | crates/webcodex-environment/src/service/windows.rs:1050-1060 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"c108dbbd77b27684cbfdf0c5038013c6e68aeca87880597d5e7441288dac4fcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/webcodex-environment/src/tunnel_recovery.rs:42-52 | src/project_entry_openai_tunnel.rs:377-386 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel_recovery.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"280e20cf3f192b0ae5b793e1c6db6b04384201c913ba6c112159e39e5f35366a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-environment/src/unified_update/download.rs:218-228 | crates/webcodex-environment/src/unified_update/download.rs:398-408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/unified_update/download.rs:218\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/download.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0876763b060b2f0d1ffc253369a89385e9cf5103023a21c5ddf99ee8041768d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-lsp/src/navigation.rs:1122-1132 | crates/webcodex-lsp/src/navigation.rs:1681-1691 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec2752b78e47dc0b38ab55c542d2ebb3b9523d78139d7680e62f084541531db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-persistent-shell/src/windows.rs:112-122 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:294-304 \u2014 before extracting anything, compare \u0060crates/webcodex-persistent-shell/src/windows.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/remote_shell.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/windows.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b09b558458b1e7e5dc2140f23e847177cdeb85829dcf51ffac7fec7e5ea61e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner-registry/src/reconciliation.rs:868-878 | crates/webcodex-runner-registry/src/reconciliation.rs:950-960 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4c207b7d1a47f8f12dd3f30b1e21b40b4f69fa64345accbba38c392b564733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner-registry/src/runners.rs:719-729 | crates/webcodex-runner-registry/src/runners.rs:798-808 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-runner-registry/src/runners.rs:809\u0060 calls \u0060Some\u0060 and \u0060crates/webcodex-runner-registry/src/runners.rs:730\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"60db266ab2da88f7919941d4af08fbb9087211b906b5562c4734142ecfd48fa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner-registry/src/validation.rs:470-480 | crates/webcodex-runner-registry/src/validation.rs:493-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 \u0060crates/webcodex-runner-registry/src/validation.rs:470\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad96fae1826d2d3b68f70828ba7f8cd2b6ee83dbcd6e3bfd30a1ff2b50121ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts.rs:256-266 | crates/webcodex-runner/src/webcodex_runner/patches.rs:106-116 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/artifacts.rs:256\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f143c7dfc69a7d03d0c3c2ef6550661ce9242f6af1c80363d3bac0a678a187e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:95-105 | crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:382-392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c10e979ce3b20ba51605b1c1652a4435ace2a68b2c2f07fc259199eca4389a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/computer.rs:260-270 | crates/webcodex-runner/src/webcodex_runner/computer.rs:360-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 \u0060crates/webcodex-runner/src/webcodex_runner/computer.rs:260\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/computer.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"211d79fe1c5c39f1e28adcbc8b941e791cded2c6c0b55ca6984bb6213f76110d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs:172-182 | crates/webcodex-runner/src/webcodex_runner/job_manager/ssh.rs:147-157 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/ssh.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs:172\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e518b52c4eefd466d9db51b275b4facc6361b371e8176db604b02f281519a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/job_manager/shutdown.rs:184-194 | crates/webcodex-runner/src/webcodex_runner/job_manager/shutdown.rs:205-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/shutdown.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a2b3159482bcd2b65ab17d9a511e20eb75c0196fc73d80ba5d8cc7c349aee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:297-307 | crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:321-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:297\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7073acd7dd0907cf2868f13d93fa8923ed0b67e527057b4f175ee378bc0efc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:1011-1021 | crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:1076-1086 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:1011\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31e2ccd4c1077f309032e305e8d8e22924b3721eda3af174029684ca1607b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:1104-1114 | crates/webcodex-runner/src/webcodex_runner/plugin.rs:1782-1792 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/plugin.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:1104\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fa446f7018c50706463555e56ab8f2dc0bfaa4a9ad7e5446f6592dcdfd112d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/projects/registration.rs:161-171 | src/tool_runtime/projects.rs:1505-1515 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/projects/registration.rs\u0060 and \u0060src/tool_runtime/projects.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/registration.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63ca902377e42a016b02f565a430c6b1b6cd3920290231fc5de3b9e8c61cdff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/shell/commands.rs:118-128 | crates/webcodex-runner/src/webcodex_runner/shell/commands.rs:179-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/commands.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec8f6f48663b51252384cc609c0e37cd8c4a8c277e60f29f7ace8fc32a95423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/shell/commands.rs:371-380 | crates/webcodex-runner/src/webcodex_runner/shell/commands.rs:441-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/shell/commands.rs:371\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/commands.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6cfe78aa5959afb33848909ea5d85a17c33eb1dfc6cd2f28b4463852fb1530"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/quic.rs:254-264 | crates/webcodex-runner/src/webcodex_runner/transport/quic.rs:288-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/quic.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d8fb1ab565fab745ee81ee820ce4d9b808941ec915ac15fb99b56eb95b1401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:619-629 | crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:684-694 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:619\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6efb7b2605279af74c10d1c5017a9a5ce315edf0ed2c87dda29007b4beafb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/webcodex-store/src/communication.rs:933-942 | crates/webcodex-store/src/communication.rs:1121-1131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/communication.rs:933\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5d6ddb1286cafcfd9f3626c9dd9d2348a197badbdae26046fe8a00c9aa5b97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-store/src/memory.rs:1393-1403 | crates/webcodex-store/src/memory.rs:1426-1436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/memory.rs:1393\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/memory.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b4bbe33b47708b805858f2cb8a7af0bb687bd532f551e5a0c244bf58532793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-tool-contracts/src/registry/output_schemas/browser.rs:5-15 | crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs:31-41 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/browser.rs:5\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/browser.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b79f69a0d1ff63e34c4dc400e336e073afdd3b3a2b084d3fb390a73f7c1313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:341-351 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:378-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 \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:341\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5c6e54519bae20c36b7099f539d254ca7c5784cd5180bf371bc444e0cabffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-validation/src/recipe.rs:608-618 | crates/webcodex-validation/src/recipe.rs:621-631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-validation/src/recipe.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":"crates/webcodex-validation/src/recipe.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"7244e0865284759f7e539b59c950d4458389189d177691346aa70c67c8e34f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-workflow-session/src/continuation.rs:1701-1711 | crates/webcodex-workflow-session/src/continuation.rs:1712-1722 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/continuation.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1a3036f0a59545bb91082025ade52ac6e7032c760ff18d0f48ed31c700851a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-workflow-session/src/store.rs:3017-3027 | crates/webcodex-workflow-session/src/store.rs:3292-3302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3017}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8998d60613f63bb4b9a5caeb797102104f919367da3702343c74b8faa773ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-workspace/src/file_read_range.rs:204-214 | src/tool_runtime/files/inspection.rs:427-437 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/file_read_range.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe84abdffd12d5d719af62196934dd722406130db673e627c034bbb23da4f46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/auth/tokens.rs:88-98 | src/auth/tokens.rs:127-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/tokens.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5cfbf864ba39cac97638fce6228976c909c162d0bb59658a086f9239f1474e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/mcp/resources.rs:194-204 | src/mcp/resources.rs:351-361 \u2014 both copies are in the same file, so extract the block 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060record\u0060 to \u0060McpArtifactExportRecord\u0060 in one and \u0060McpSnapshotResourceRecord\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":"src/mcp/resources.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"65632af022d6f6f05c52272021bbe24b332ac7957befa554e06a84ecfec591e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/mcp_gateway.rs:559-569 | src/plugin_gateway.rs:957-967 \u2014 before extracting anything, compare \u0060src/mcp_gateway.rs\u0060 and \u0060src/plugin_gateway.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060src/mcp_gateway.rs:559\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_gateway.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3ac8371a74c4fb347051d15e4c7dd2cc951c794d98e3843bfe6de34362674f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/oauth_http/token.rs:134-143 | src/oauth_http/token.rs:327-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/oauth_http/token.rs:134\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/token.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d354bb1d3851accac018e0d84f689dcc308b030ddaae71c586d5ea5e99a4d712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/runner_tokens_http/routes.rs:231-241 | src/users_http/tokens.rs:206-216 \u2014 before extracting anything, compare \u0060src/runner_tokens_http/routes.rs\u0060 and \u0060src/users_http/tokens.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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 \u0060src/runner_tokens_http/routes.rs:231\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runner_tokens_http/routes.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e35a213524972954633ea5b6d35e6b8c951c2bfdb8a9ba9366f7901d52a37f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/tool_request_trace/payload.rs:32-40 | src/tool_request_trace/reader.rs:12-22 \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 \u0060src/tool_request_trace/payload.rs:32\u0060 it does not close everything it opens, so those exact 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":"src/tool_request_trace/payload.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"311b94a07837b7ce374ddd3dbabefabf83122e93bbd8fa72dd7c3f957133ccd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tool_runtime/checkpoint.rs:339-349 | src/tool_runtime/checkpoint.rs:377-387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/checkpoint.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d45afa50777f5bec99d2acbc497be84e88fc0be2934f9a3d19487707d084b34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/tool_runtime/coding_task/project.rs:455-464 | src/tool_runtime/coding_task/project.rs:586-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/coding_task/project.rs:455\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":"src/tool_runtime/coding_task/project.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"be907ec8a104f48419d56d6595253493c3914ada2c08178afeccb9a5466e1168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tool_runtime/goal.rs:1511-1521 | src/tool_runtime/goal.rs:1540-1550 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/goal.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eac23d5dbc3f92deb07f3aa41be76e5a46013833e9be2f072d22623b68f18ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tool_runtime/shell.rs:201-211 | src/tool_runtime/shell.rs:226-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/shell.rs:201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/shell.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9ae864f89e4281ba8c23d18e25bd5846a644befbbd93eca1ef33593c0b82ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/webcodex-admin/src/commands.rs:217-226 | crates/webcodex-admin/src/commands.rs:325-334 | crates/webcodex-admin/src/commands.rs:395-404 | crates/webcodex-admin/src/commands.rs:490-499 | crates/webcodex-cli/src/lib.rs:1263-1272 | crates/webcodex-cli/src/lib.rs:1305-1314 \u2014 there are 6 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-cli/src/lib.rs:1273\u0060 calls \u0060Err\u0060, \u0060to_string\u0060 and \u0060crates/webcodex-admin/src/commands.rs:227\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"13217e35fa65d51fe4dbdb6c6ce87de21783ac75037f0d87c99a1a36aaea86b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/webcodex-admin/src/commands.rs:844-853 | crates/webcodex-cli/src/webcodex_cli/http.rs:26-35 | crates/webcodex-cli/src/webcodex_cli/http.rs:63-72 | crates/webcodex-cli/src/webcodex_cli/token_commands.rs:78-87 | crates/webcodex-cli/src/webcodex_cli/token_commands.rs:137-146 \u2014 there are 5 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"64df141c9b5df0e9020feac2b4181d8d94520a82ead45b3f3fc1eedc85d09548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): apps/desktop/src-tauri/src/state/persistence.rs:181-190 | crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs:326-335 | crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs:547-556 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:2159-2168 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs:336\u0060 calls \u0060now\u0060, \u0060from_millis\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/skill_store.rs:2169\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":"apps/desktop/src-tauri/src/state/persistence.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"273221e8595336297ea0a96fc50754bc84f4032ce0ac0368bc8669fd204a612e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/webcodex-runner-registry/src/projects.rs:202-211 | crates/webcodex-runner-registry/src/projects.rs:258-267 | crates/webcodex-runner-registry/src/runners.rs:720-729 | crates/webcodex-runner-registry/src/runners.rs:799-808 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-runner-registry/src/runners.rs:809\u0060 calls \u0060Some\u0060 and \u0060crates/webcodex-runner-registry/src/runners.rs:730\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/projects.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a688222b3cbf933de7ec986e13da23105d6100c028a3afc9fef8903a83b2b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/webcodex-store/src/artifact_handoff.rs:629-638 | crates/webcodex-store/src/artifact_handoff.rs:747-756 | crates/webcodex-store/src/artifact_handoff.rs:803-812 | crates/webcodex-store/src/artifact_handoff.rs:871-880 \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 matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-store/src/artifact_handoff.rs:627\u0060 calls \u0060validate_idempotency_key\u0060, \u0060validate_request_hash\u0060 and \u0060crates/webcodex-store/src/artifact_handoff.rs:746\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/artifact_handoff.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"989dc739a7978aebcb14809b34225c00c0fbbdca94adce62117ca35ce9c0d606"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): apps/desktop/src-tauri/src/state/workspace_settings.rs:46-55 | apps/desktop/src-tauri/src/state/workspace_settings.rs:73-83 | apps/desktop/src-tauri/src/state/workspace_settings.rs:118-127 \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 \u0060apps/desktop/src-tauri/src/state/workspace_settings.rs:46\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/workspace_settings.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"040e81351d20ff253ee44e2f6793f09048e89d82caf61ef3a26bc2236791538d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): crates/webcodex-browser/src/supervisor.rs:742-751 | crates/webcodex-browser/src/supervisor.rs:758-765 | crates/webcodex-browser/src/supervisor.rs:929-938 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae0753b9d997402d75e3bab1f0846c884a696f60f9b5b3d8558a5735da88210"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/webcodex-cli/src/lib.rs:2048-2057 | crates/webcodex-cli/src/lib.rs:2182-2191 | crates/webcodex-cli/src/lib.rs:2339-2348 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/lib.rs:2048\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6005d5a2615e9338da98df8019ba01b73874f3582be33a8c1e6af6e3cf39e75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): crates/webcodex-computer/src/platform/windows/accessibility.rs:885-892 | crates/webcodex-computer/src/platform/windows/accessibility.rs:1200-1209 | crates/webcodex-computer/src/platform/windows/input.rs:593-602 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-computer/src/platform/windows/accessibility.rs:885\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/accessibility.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f867d4600f2a63317c23e54aee91728373d2700e98996f8b80b6e000e78eef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/webcodex-core/src/runner_operation.rs:2344-2353 | crates/webcodex-core/src/runner_operation.rs:2359-2368 | crates/webcodex-core/src/runner_operation.rs:2373-2382 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/runner_operation.rs:2344\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c56255a67348df0ff0a632bb0ca41755ac9718bc104f03d119851695fcb01b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 3): crates/webcodex-core/src/validation_identity.rs:143-152 | crates/webcodex-core/src/validation_identity.rs:161-167 | crates/webcodex-core/src/validation_identity.rs:195-201 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/validation_identity.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-core/src/validation_identity.rs:202\u0060 calls \u0060get\u0060, \u0060and_then\u0060, \u0060Some\u0060 and \u0060crates/webcodex-core/src/validation_identity.rs:153\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_identity.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae985101502f67facebf87a17d0f320d5688a2e73c48387a079dfad33668550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/webcodex-runner-registry/src/job_updates.rs:912-921 | crates/webcodex-runner-registry/src/job_updates.rs:958-967 | crates/webcodex-runner-registry/src/job_updates.rs:999-1008 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd010e67f06b7e4a04b5aec508019f8e8f54b41cce1d677051d6f8d4fb21e4ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/webcodex-runner-registry/src/job_updates.rs:1944-1953 | crates/webcodex-runner-registry/src/job_updates.rs:1992-2001 | crates/webcodex-runner-registry/src/job_updates.rs:2039-2048 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/job_updates.rs:1944\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab040fa695d44a70a31b42bd2319b03cbde986ef8d4abc771be7db120fb09074"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/webcodex-runner-registry/src/job_updates.rs:2270-2279 | crates/webcodex-runner-registry/src/polling.rs:523-532 | crates/webcodex-runner-registry/src/polling.rs:833-842 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-runner-registry/src/polling.rs:830\u0060 calls \u0060normalize_persistent_shell_result\u0060 and \u0060crates/webcodex-runner-registry/src/polling.rs:513\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":2270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbd44f67fa00bbb79f82bc31a4385e98bc34f4256ae8c995d8a648203c86256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/webcodex-runner-registry/src/validation.rs:465-474 | crates/webcodex-runner-registry/src/validation.rs:488-497 | crates/webcodex-runner-registry/src/validation.rs:505-514 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"2095c350c9279e45b1b64da1d2928cb48e42e47bd4c1772af80048d299d075a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/dispatch.rs:507-516 | crates/webcodex-runner/src/webcodex_runner/dispatch.rs:529-538 | crates/webcodex-runner/src/webcodex_runner/dispatch.rs:544-553 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/dispatch.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdaf9fe6c6343b3e40f2877fd2564f409d92fed1acbd2b33f0311c13a5c7aa51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:331-340 | crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:359-368 | crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:386-395 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:331\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f9ed6070235477e40c87236e3e1948dfd568cd8f0d46540d6c770efbe290bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/webcodex-store/src/window_collaboration.rs:367-376 | crates/webcodex-store/src/window_collaboration.rs:390-398 | crates/webcodex-store/src/window_collaboration.rs:417-425 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/window_collaboration.rs:367\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/window_collaboration.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ddcea38a125e7dcd5a401ba308134da41b163fc405e1d4a33331479bc6ab4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:390-399 | crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:601-610 | crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs:940-949 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:390\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abe1ab084599ca340d1e43d922f66b59d7cbb885a13d4ef51a9025d41ad4101"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:785-794 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:851-860 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:925-934 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:785\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e732a815c0e634d93d035c3f2f688e325b387542284bcd27543b7d9df69dafc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/tool_runtime/coding_agent.rs:879-888 | src/tool_runtime/coding_agent.rs:914-923 | src/tool_runtime/coding_agent.rs:1026-1035 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/coding_agent.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. 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":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa9b6af2913b0f70bcc7869244130ee8ed85741e897f4eee11ea3af64c1edb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/tool_runtime/communication.rs:765-774 | src/tool_runtime/communication.rs:818-827 | src/tool_runtime/communication.rs:951-960 \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":"src/tool_runtime/communication.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e8bdc90ee37725e0c9cf2976b4547552a20dfd6afff9fb56d2be07c0c06f38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/tool_runtime/git_review.rs:203-212 | src/tool_runtime/git_review.rs:257-266 | src/tool_runtime/git_review.rs:292-301 \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 \u0060src/tool_runtime/git_review.rs:203\u0060 it does not close everything it opens, so those exact 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060stdout\u0060 to \u0060\u0026str) -\u003E (Vec\u003CNameStatusRecord\u003E\u0060 in one and \u0060\u0026str) -\u003E (Vec\u003CNumstatRecord\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":"src/tool_runtime/git_review.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bffc321401f467c39298512d8110bfeb2d92c4c6053a142d2af05ade898a615"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): apps/desktop/src-tauri/src/coding_agents.rs:271-279 | apps/desktop/src-tauri/src/mcp_providers.rs:595-604 \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 \u0060apps/desktop/src-tauri/src/coding_agents.rs:271\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/coding_agents.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea52d38385656e87119c985b522bd245bffcb2a25a52a0177733954580ca72f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/desktop/src-tauri/src/state/connections.rs:209-218 | apps/desktop/src-tauri/src/state/connections.rs:351-360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/desktop/src-tauri/src/state/connections.rs:209\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"apps/desktop/src-tauri/src/state/connections.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8547dfd9c8a24419b893c1256b9d670bface29de9adf33cd67dbd126ede41468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/desktop/src-tauri/src/state/path_inventory/export.rs:110-119 | src/upgrade_maintenance_store.rs:243-252 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"apps/desktop/src-tauri/src/state/path_inventory/export.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd9cf953811757c74af8a618e2014a48075126d7814c19a692623852c5c0eb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/desktop/src-tauri/src/webcodex/adapter.rs:987-996 | crates/webcodex-environment/src/native.rs:1940-1949 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060apps/desktop/src-tauri/src/webcodex/adapter.rs:987\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c22405f5e77327401e403b9dc08a662b7c2e89912441b6dc37196355ef4f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:505-514 | crates/webcodex-cli/src/lib.rs:936-945 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/lib.rs:505\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58b24c6caaa54d4b105daafac862898163eb7287fbe5ad6a635ba47cd5ae8c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:772-781 | crates/webcodex-cli/src/lib.rs:832-841 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/lib.rs:772\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"9899b6d6ed3b0ebfcf1fd2e1ce832d1389a2d514ef4894a2b5d0d70aa3471f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/login.rs:60-69 | crates/webcodex-runner/src/webcodex_runner/config.rs:2553-2562 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea0753f639e04283a385bd20544fe8e24804ff50751d3bb0aeaee324efdc263"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/server.rs:104-113 | crates/webcodex-cli/src/webcodex_cli/server.rs:570-579 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/server.rs:104\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/server.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f7806aeaa6e78f437135a0255f7bddc8d0c3d199a25618883d4ee56e43e84f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/system.rs:451-460 | crates/webcodex-cli/src/webcodex_cli/system.rs:478-487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"9409dfccdd5dc7dcb0a68782369e28534da15e0f7b7ac9b8a1f06201465267a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-computer/src/lib.rs:1613-1622 | crates/webcodex-computer/src/lib.rs:1818-1827 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"8632d0cf18b6f5f92894ddad31b10260b019e1b78c894582d9d8f8bfef82af71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-environment/src/migration.rs:403-413 | crates/webcodex-environment/src/migration.rs:432-442 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/migration.rs:403\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"7135fc71f029f77d2ec67ca53d3977476526dc13078fe00f07f3e35b9e32c134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/webcodex-environment/src/migration.rs:519-526 | crates/webcodex-environment/src/native.rs:1502-1511 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/migration.rs:519\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca668412944628b36120da4d9a3b1839e1cc2f6b53281f2976fe2ca34bb0585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-lsp/src/navigation.rs:1750-1759 | crates/webcodex-lsp/src/navigation.rs:1776-1785 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-lsp/src/navigation.rs:1750\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a1ddb4d85e53f467e6862b9f763df95f395c0f90b48210f14ad2acf0e3c0b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-openai-tunnel/src/run_fence.rs:299-308 | crates/webcodex-openai-tunnel/src/run_fence.rs:406-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 \u0060crates/webcodex-openai-tunnel/src/run_fence.rs:299\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd08900fbb076d3e3a523a549ca50fc7c96b4fc193b63be7fd7e315f88788f17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-persistent-shell/src/framing.rs:11-20 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:511-520 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/framing.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2138fb777d1799d7695fa29f53c200b51230ec7c5e4b4377b2df4174b1798f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/webcodex-runner-registry/src/reconciliation.rs:505-514 | crates/webcodex-runner-registry/src/reconciliation.rs:531-539 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8c69bd26ebab151b5c2a69c3d1e2e154cda0dc679a00fafbabac16c15c13fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/configured_skills.rs:431-440 | crates/webcodex-runner/src/webcodex_runner/configured_skills.rs:515-524 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/configured_skills.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"36244dcfd5cbe6007b2025cb74a95a6e7175310f85e07fd6f7bea575c70bb9c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs:175-184 | crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:263-272 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e441118358458fa066d6fe1c5bf1e5b102e20bdef9d735102d14d3882040bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/execution_io.rs:40-49 | crates/webcodex-runner/src/webcodex_runner/execution_io.rs:61-70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/execution_io.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"315df49e83172273e3c867bd654f42f94741819210638a558d15a027283f043e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:265-274 | crates/webcodex-runner/src/webcodex_runner/validation/execute.rs:270-279 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/validation/execute.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:265\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda302bf2d20c3f09c5e7c68e716c6811f817024d85eb4ac4e24212a469a23c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:307-316 | crates/webcodex-runner/src/webcodex_runner/validation/execute.rs:317-326 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/validation/execute.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:307\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cdd8c56a8a6bba790b473e693ddb9d39e4eb04eafc06542713b0857d230288"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs:150-159 | crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs:339-348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8019c6d2ae8e5f805033b737a8fd43188bcb82b26aa471728e413082abcbdaa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/projects/registration.rs:148-157 | src/tool_runtime/projects.rs:1491-1500 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/projects/registration.rs\u0060 and \u0060src/tool_runtime/projects.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/projects/registration.rs:148\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/registration.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2dd479a615caaa0fa442f98ada9b7a7dd793d94bdd6b693a3d255e5e02c661"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-store/src/job_terminal_wait.rs:314-323 | crates/webcodex-store/src/job_terminal_wait.rs:350-359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/job_terminal_wait.rs:314\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/job_terminal_wait.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dba45b39b8069286a5d925cbc0220a4f052b273c7d374648f20e6a87ecd0965"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:369-378 | crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:580-589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:369\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"7299fd12ad9d46ee648c964ea9c98a0469ae149c0061edad89ef1efd0d09dc25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:380-393 | crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:591-604 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:380\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef48f15e9c5b2b04220d2deb4dec1440d76f593619058edbcb791cc6f4edeea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:495-504 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:574-583 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:495\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91eefadf924aaa74d9e8347d17ccd1dcb800afaaa55f55dcaa7404257b7f837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-workspace/src/project_recipe.rs:822-831 | crates/webcodex-workspace/src/project_recipe.rs:1022-1031 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-workspace/src/project_recipe.rs:822\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b5982f7e4fff462c70f35c7e2d9feffe7ec08ab9b712c81ac304019b6065c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cloudflare_ingress.rs:1270-1279 | src/cloudflare_ingress.rs:1293-1302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cloudflare_ingress.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaeceffb6fd82c0536574faacb895343435c3528b3efb319a6f6fe87cf26372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/mcp/presentation/jobs.rs:168-176 | src/mcp/presentation/jobs.rs:270-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp/presentation/jobs.rs:168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/presentation/jobs.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5f355c0cc84861ebc4854a58c13d5ee36e504e197af735f40237412e10bf79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/runner_http/handlers.rs:32-41 | src/runner_http/handlers.rs:97-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/runner_http/handlers.rs:32\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runner_http/handlers.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"501f0325b8b9fa48e9f6f4650f6d86c7c07c1b5bc0412b7010592393cb696194"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tool_runtime/agent_task.rs:30-39 | src/tool_runtime/communication.rs:44-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/agent_task.rs:30\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/agent_task.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f0265ef5710c399bbaec1a4146da11a86a159e34ddae154228b0a59dbeede2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tool_runtime/coding_agent.rs:588-597 | src/tool_runtime/coding_agent.rs:1303-1312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/coding_agent.rs:588\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cf18b088dabce55e12faf67b644f1bfc5b67e081369d6a11498fcb2c8994cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tool_runtime/coding_task/closeout.rs:147-156 | src/tool_runtime/coding_task/closeout.rs:201-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/coding_task/closeout.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":"src/tool_runtime/coding_task/closeout.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e69a771384a135b3714b2660bdc7d4bc6386bd2bf170ae1f697593a318bc13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tool_runtime/memory.rs:167-176 | src/tool_runtime/memory.rs:248-257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/memory.rs:167\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/memory.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8b850ba6917c2ae4d62dd3bddbd73a6c54f0984a4778fe80cd42e1656d8308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/tool_runtime/result_projection.rs:613-622 | src/tool_runtime/result_projection.rs:796-804 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/result_projection.rs:613\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/result_projection.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c4f549f93d690dcb4d9298a396845c193b5babacca89f6d1d6764bdfda6b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tool_runtime/result_projection.rs:638-647 | src/tool_runtime/result_projection.rs:817-826 \u2014 both copies are in the same file, so extract the block 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":"src/tool_runtime/result_projection.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"576eb156e2ebae02b00f0ceb814a6144a3669e77b9737af6809029880c4677b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tool_runtime/runtime_info.rs:592-601 | src/tool_runtime/runtime_info.rs:917-926 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runtime_info.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb3fb7799acc1eb5e26d653456bda8ec1f0adcf64d19a16c3ba43c31b8aa109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/tool_runtime/session_tools.rs:449-457 | src/tool_runtime/validation_events.rs:67-76 \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 \u0060src/tool_runtime/session_tools.rs:449\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":"src/tool_runtime/session_tools.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d57f2f37b472967d420ba8b823e8d6011e7b0cbb1e7bbff036b99d51a33be7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): src/auth/middleware.rs:316-324 | src/auth/middleware.rs:356-364 | src/auth/middleware.rs:388-396 | src/auth/middleware.rs:416-424 | src/auth/middleware.rs:452-460 | src/auth/middleware.rs:480-488 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/middleware.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc071c5b26f4784aba496793bed2caccb3f145c3c328f08febae0334ce0b399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/webcodex-computer/src/lib.rs:1571-1579 | crates/webcodex-computer/src/lib.rs:1633-1641 | crates/webcodex-computer/src/lib.rs:1671-1679 | crates/webcodex-computer/src/lib.rs:1708-1716 | crates/webcodex-computer/src/lib.rs:1774-1782 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-computer/src/lib.rs:1632\u0060 calls \u0060native_effect_guard\u0060 and \u0060crates/webcodex-computer/src/lib.rs:1570\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad6f07e5c47d5f06e30304ff21256cb848df6af7cde4a0fc857a10e1b66bcbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/webcodex-runner-registry/src/validation.rs:452-460 | crates/webcodex-runner-registry/src/validation.rs:469-477 | crates/webcodex-runner-registry/src/validation.rs:492-500 | crates/webcodex-runner-registry/src/validation.rs:509-517 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/validation.rs:452\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7fc021b4a8df4ada1180779dcb52f24d75799ad91520bfdd1c2838d3cad5db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs:97-105 | crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs:133-141 | crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs:259-267 | crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs:293-301 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs:97\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df8e357a1ed70b2040e75a325459b28828d5019574bd0dda6ba4d7cf5799153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:607-615 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:627-635 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:656-664 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:686-694 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:607\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad407de47c9d570025bc4085b2025b70ac99b1b1701b23e10cf88e50f0ae20d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): apps/desktop/src-tauri/src/state/persistence.rs:146-152 | crates/webcodex-cli/src/webcodex_cli/connect/profile.rs:512-520 | src/project_entry_setup.rs:1231-1237 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/persistence.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fae960379ef608aaa9e44b3a9f31251ca17a22e3cf6e2442883907681983b45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/webcodex-runner-registry/src/jobs.rs:378-386 | crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs:53-61 | crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs:93-101 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/jobs.rs:378\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/jobs.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4b6e98b9cd4cd2cdedaed648b88a24062811c5ace4c0553df9e7c984809632"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/job_manager/delivery.rs:81-89 | crates/webcodex-runner/src/webcodex_runner/job_manager/delivery.rs:602-610 | crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs:23-31 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/delivery.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2086545c0d117e123327c1b83ec9d1f4d3a6c2f8c5e06a155b46cb6dc56deb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/skill_store.rs:853-861 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:922-930 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:979-987 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/skill_store.rs:853\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd43fdb2385c643671947bb3d815ae3fdb3386ee0eb7caf2f44de9c24121e5cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/mcp/tools/call/specialized.rs:76-84 | src/mcp/tools/call/specialized.rs:90-98 | src/mcp/tools/call/specialized.rs:307-315 \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 \u0060src/mcp/tools/call/specialized.rs:90\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call/specialized.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1baa0425ed8fb9bb34a78f8e89510aa7f0ce752843bbacb7a110393230f29b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/project_entry_cloudflared.rs:622-630 | src/project_entry_setup.rs:1166-1174 | src/project_entry_setup.rs:1229-1237 \u2014 before extracting anything, compare \u0060src/project_entry_cloudflared.rs\u0060 and \u0060src/project_entry_setup.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 \u0060src/project_entry_cloudflared.rs:622\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_cloudflared.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51bdfac0b0fda16e7901bb0bfb84cca17f846c16ba7329cd2e2750bbf1ebf3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/tool_runtime/coding_agent.rs:2101-2109 | src/tool_runtime/git/diff_hunks.rs:236-244 | src/tool_runtime/git/diff_hunks.rs:265-273 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8fdc8c7d1558b231cab48a751241ce740c3b134731dd1155794ba927ec357b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/desktop/src-tauri/src/diagnostics.rs:568-576 | apps/desktop/src-tauri/src/diagnostics.rs:582-590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/diagnostics.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"82be2f6288cc7ee400df81b7443235ea9f9fba009896458a2a1d575280742873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): apps/desktop/src-tauri/src/diagnostics.rs:623-631 | crates/webcodex-cli/src/webcodex_cli/login.rs:168-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"apps/desktop/src-tauri/src/diagnostics.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f72571a09c6c07a004027ac34478453a653af287ed5f33164b1bf50efeeee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/desktop/src-tauri/src/updates/install/native.rs:121-129 | crates/webcodex-cli/src/environment/update/launcher.rs:137-145 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/desktop/src-tauri/src/updates/install/native.rs:121\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/updates/install/native.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4d4cfcb7889cb89860df631a837064349e20fd58ce6c3fdb8695074c756b61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-browser/src/cdp.rs:3677-3685 | crates/webcodex-browser/src/cdp.rs:3699-3707 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-browser/src/cdp.rs:3677\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":3677}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b9b895abd85bb9282e4f29e3d9ce6c27a1db6441ce9e754eb422d9043f4efd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-browser/src/profiles.rs:52-60 | crates/webcodex-environment/src/storage.rs:164-172 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-browser/src/profiles.rs:52\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-environment/src/storage.rs:162\u0060 calls \u0060pub\u0060, \u0060ensure_private_directory\u0060, \u0060validate_directory_ancestors\u0060 and \u0060crates/webcodex-browser/src/profiles.rs:51\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/profiles.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfe65efce848fb02f69933c4b14834f144e2aa9ae8d0e3b24619bd950547885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:501-509 | crates/webcodex-cli/src/lib.rs:720-728 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/lib.rs:501\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64d6d21c191abb55374f442a5bd1d9bca371b0070830e55c5c3f25152068636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:3139-3147 | crates/webcodex-cli/src/lib.rs:3156-3164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060args\u0060 to \u0060\u0026[String]\u0060 in one and \u0060Vec\u003CString\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":3139}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa383880838b4731b11da8d5f406a9bf0f32ff1d17bf2b2fb56aa16d7998d2b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/runner_service.rs:43-51 | crates/webcodex-cli/src/webcodex_cli/server.rs:419-427 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/runner_service.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"45adbb6e29746aed943e920d731a7d25ae29ac5ec5700d8a4d8f9ff6a9b4bf45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/system.rs:216-226 | src/project_entry_windows.rs:161-169 \u2014 before extracting anything, compare \u0060crates/webcodex-cli/src/webcodex_cli/system.rs\u0060 and \u0060src/project_entry_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/system.rs:216\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c47e46d60f1879f67fef7a5ebc90efada01db962527fe4ead42ef6e8ac64b9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-computer/src/platform/macos/accessibility.rs:385-393 | crates/webcodex-computer/src/platform/macos/accessibility.rs:461-469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-computer/src/platform/macos/accessibility.rs:385\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e808aae1ed62270cab84e896f0faa83f6ff35737013406b28e98f875cd66c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-core/src/mcp_gateway.rs:449-457 | crates/webcodex-core/src/plugin.rs:1043-1051 \u2014 before extracting anything, compare \u0060crates/webcodex-core/src/mcp_gateway.rs\u0060 and \u0060crates/webcodex-core/src/plugin.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/mcp_gateway.rs:449\u0060 it begins part-way through the construct above it, so those exact 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 \u0060tools\u0060 to \u0060\u0026[McpGatewayTool]\u0060 in one and \u0060\u0026[PluginTool]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f92e14bc2462fe37a3c75629aa4a1e7d43c6f7ad7e59f7240edd0c933edcfcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-core/src/project_instructions.rs:222-230 | crates/webcodex-core/src/project_instructions.rs:400-408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/project_instructions.rs:222\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_instructions.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"626a70338b101e9acd9b9662105ea47605c2bad6d83ae6beb9d98fe527be4581"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-core/src/runner_protocol/job.rs:615-623 | crates/webcodex-core/src/runner_protocol/job.rs:643-651 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/runner_protocol/job.rs:615\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ad4a01486ce93f7c377453f7c5cc88f63b3372359fa6d437c2cbd58e1ee574"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-core/src/validation_evidence.rs:737-745 | crates/webcodex-workflow-session/src/continuation.rs:1984-1992 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/validation_evidence.rs:737\u0060 it begins part-way through the construct above it, so those exact 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 \u0060left\u0060 to \u0060\u0026CargoDiagnostic\u0060 in one and \u0060\u0026FailureIdentity\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3807a79499db07f1c7a3e6c3e0b29ff404dacbbeb64aad6a562cd086e741554"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-environment/src/migration.rs:486-494 | crates/webcodex-environment/src/migration.rs:1012-1020 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ad78603784e60cc1a2213156a3615c1e9de3d4165802af6c0d21b122d1d475"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-environment/src/native.rs:954-962 | crates/webcodex-environment/src/native.rs:998-1006 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c41bb3d234f89a8dd97e7a08bf12c12fe5e3bcd90c0c0490cc3496b60f36dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/webcodex-environment/src/privilege.rs:52-58 | crates/webcodex-environment/src/privilege.rs:135-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 \u0060crates/webcodex-environment/src/privilege.rs:52\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa0b319c5eb3fc7d3691f1100140875752d74bebd30f5e6eca4fc9e4f6a7497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-environment/src/privilege.rs:61-69 | crates/webcodex-environment/src/privilege.rs:146-154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/privilege.rs:61\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec8a6186d4b92f177c59bf1aeb7af983731a3c7b5d1251f261c60f4639a9476"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-environment/src/session_service.rs:435-443 | crates/webcodex-environment/src/session_service.rs:453-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/session_service.rs:435\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/session_service.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5646cc3f9998a4e44efbed9d7512bc583c18791d53cf2f74ae9e6b75780a8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/webcodex-environment/src/tunnel.rs:1748-1756 | crates/webcodex-environment/src/tunnel.rs:1841-1847 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/tunnel.rs:1748\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ce0d907d6ab3f4487f34fbf413c77bc5ea2e131eb4227ae255777c5a5c8ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/webcodex-environment/src/upgrade.rs:2025-2032 | crates/webcodex-environment/src/upgrade.rs:2168-2176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e8b659842cc4097b89e3f47b0f5a0e1bc96929ac1c318c7e67af62ab6322e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-persistent-shell/src/framing.rs:151-159 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:675-683 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-persistent-shell/src/framing.rs:151\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/framing.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e4feff3ce2ea4ac3aab2f309faa4de29fb6a0739889f4bd84acbb19ebb90e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-persistent-shell/src/unix.rs:99-107 | crates/webcodex-persistent-shell/src/windows.rs:174-182 \u2014 before extracting anything, compare \u0060crates/webcodex-persistent-shell/src/unix.rs\u0060 and \u0060crates/webcodex-persistent-shell/src/windows.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 90 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":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cf669adc0ac016bfa269aca88ac036515efd0f90de1f994864a49d6514708c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-persistent-shell/src/unix/readers.rs:34-42 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:534-542 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-persistent-shell/src/unix/readers.rs:34\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix/readers.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6ffdca69ad19293c13d4594ce2b2ed65832d3ff0d7e5d9af7e4df09768eb2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-persistent-shell/src/windows.rs:95-103 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:407-415 \u2014 before extracting anything, compare \u0060crates/webcodex-persistent-shell/src/windows.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/remote_shell.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-persistent-shell/src/windows.rs:95\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/windows.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccdcaa8cfc5f43c38ffe27b717b373f029216b3709106958158d00a77afe1b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-process/src/unix.rs:389-397 | crates/webcodex-runner/src/webcodex_runner/detached_job/platform/macos.rs:14-22 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-process/src/unix.rs:389\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/unix.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"66760fc8109852e9317c3b9df99842fc774126ec91ac04488d85be1308ad5645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner-registry/src/jobs.rs:388-396 | crates/webcodex-runner/src/webcodex_runner/detached_job/model.rs:552-560 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/jobs.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa11d3414ffc6876d0cc70487555b176540a9e9d422575fefa032bdad5c33515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:2006-2014 | crates/webcodex-runner-registry/src/requests.rs:2078-2086 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ad5f575e4f9239d6c7478ddab1ba0620fed6cfa4f8eeca94e758292b76742e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:2937-2945 | crates/webcodex-runner-registry/src/requests.rs:3084-3092 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:2937\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":2937}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6976f411c3071347cf901125ed7600620e877d55798b5474530190adc95594"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts.rs:813-821 | crates/webcodex-runner/src/webcodex_runner/artifacts.rs:948-956 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/artifacts.rs:813\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d6e60ee46e20c46018631a9fe286d5c1d7552e9f482f53ee1e4d57bc8e3b06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:282-290 | crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:478-486 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fab3810749a106b81ceb1024e017d28553b8fbadbd05823a82b0b4ac6827ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:149-157 | crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:691-699 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/projects/catalog.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:701\u0060 calls \u0060now\u0060, \u0060timestamp\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:158\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb573e8ac2b18a861ce9f23df82b161dc3280109e95487ae393e27364dcd6c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:553-561 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:624-632 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:553\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/remote_shell.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb1eb026b13b2035a0a60108d58b7bdf4be3cfc07181e6107944e16eff6d6e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:233-241 | crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:271-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:233\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/execution.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2d67511f5caae8cdd0aa2bafd0090e6660eb8d4b7fbc9ce6a28770fabd16b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1041-1049 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1114-1122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1041\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1050\u0060 calls \u0060clone\u0060, \u0060as_deref\u0060, \u0060Some\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1123\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b6e62592028b5ebe89d35103184523befd6e6ff24b425cfb28cf2286e0f8ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): crates/webcodex-store/src/agent_wait.rs:570-578 | crates/webcodex-store/src/communication.rs:2769-2774 \u2014 before extracting anything, compare \u0060crates/webcodex-store/src/agent_wait.rs\u0060 and \u0060crates/webcodex-store/src/communication.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/agent_wait.rs:570\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wait.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7e266102cbae86d481e232d4bfb1da32186fda6c31649e192e6cc42f273ee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-store/src/goal_stall.rs:253-261 | crates/webcodex-store/src/goal_stall.rs:390-398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/goal_stall.rs:253\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal_stall.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6695c731abe06676058da814ecf53209fa5087cc8177cbe77421914c9bdf23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20139 lines \u00D7 3): crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:328-336 | crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:545-553 | crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs:830-832 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:328\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"872860eb495032135cbd01b84a5ee51fe2987d1837112b72406359ea46a32d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-tool-contracts/src/tool_call/parsing.rs:691-699 | crates/webcodex-tool-contracts/src/tool_call/parsing.rs:853-861 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/parsing.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85101c7b419763ef859f4973d3e1ba04a44d1c184ea74f50b930a167dbf3dce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-tool-runtime-contracts/src/tool_audit.rs:1948-1956 | crates/webcodex-tool-runtime-contracts/src/tool_audit.rs:1969-1977 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit.rs:1948\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit.rs"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a49b7ef3f15481dd9ffe4885d30551c584f898600f8bc8b7d1aa5e0ffc4a40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-validation/src/adapters/go.rs:86-100 | crates/webcodex-validation/src/adapters/go.rs:166-180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-validation/src/adapters/go.rs:165\u0060 calls \u0060is_some\u0060 and \u0060crates/webcodex-validation/src/adapters/go.rs:85\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/adapters/go.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"922bf7c4ec495dc0c1f4f69974884e865d0e3cf6d2e686fa1ec8f9ed0b7a5500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/webcodex-validation/src/adapters/rust.rs:212-220 | crates/webcodex-validation/src/adapters/rust.rs:264-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-validation/src/adapters/rust.rs:212\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-validation/src/adapters/rust.rs:263\u0060 calls \u0060validate_filter\u0060, \u0060validate_arg\u0060 and \u0060crates/webcodex-validation/src/adapters/rust.rs:212\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/adapters/rust.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"287f9ee167d23e88b2cbb109b830eb1afce16a7a76f14612a6878875f37edaff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-workflow-session/src/console.rs:1083-1091 | src/tool_runtime/patch.rs:97-105 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-workflow-session/src/console.rs:1083\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/console.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1fadfa898d4812804e83de8feb630a2c8785d8348f5de7ddece942d9cb3721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-workflow-session/src/events.rs:1065-1073 | crates/webcodex-workflow-session/src/events.rs:1221-1229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-workflow-session/src/events.rs:1065\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"97320592e239d0bbf0ad4303d4697065b59d044d9e3f44f16a4f9754b79fb03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-workflow-session/src/store.rs:2424-2432 | crates/webcodex-workflow-session/src/store.rs:2535-2543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-workflow-session/src/store.rs:2424\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-workflow-session/src/store.rs:2433\u0060 calls \u0060as_str\u0060 and \u0060crates/webcodex-workflow-session/src/store.rs:2544\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"a975e046aebc2fe245e27c8c61face0acab5f442190064fc3a3b93e2afd50524"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-workspace/src/project_recipe.rs:251-259 | crates/webcodex-workspace/src/project_recipe.rs:411-419 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-workspace/src/project_recipe.rs:251\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb293ccbccd857d790fb96573575754e6a9c82193d5e187bb5f4095df933c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/agent_wake.rs:657-665 | src/agent_wake.rs:1547-1555 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agent_wake.rs:657\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent_wake.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"583c956f964363a1228e25d65710854f684d7bfacbff53bd104af303f559629c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/mcp/tools/call.rs:244-252 | src/mcp/tools/call.rs:286-294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp/tools/call.rs:244\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7f64c05fc2ca9101d4e2ac30cd1ef226c81d7d1f12017b174c3d3340117a8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/oauth_http/managed_authorize.rs:526-534 | src/oauth_http/managed_authorize.rs:662-670 \u2014 both copies are in the same file, so extract the block 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":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f6c41332040eb116781cadcbf561746cd14e67d750c815c9f5faeeb2a243c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/oauth_http/token.rs:236-244 | src/oauth_http/token.rs:366-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 \u0060src/oauth_http/token.rs:236\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/token.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"60156d464ef19f57cced4ffd8b49aebeaf2690cc93daa1e91e9bcc7b3685f680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/runner_tokens_http/routes.rs:114-122 | src/users_http/tokens.rs:114-122 \u2014 before extracting anything, compare \u0060src/runner_tokens_http/routes.rs\u0060 and \u0060src/users_http/tokens.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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 \u0060src/runner_tokens_http/routes.rs:114\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runner_tokens_http/routes.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a720aa5dc20c37e61dd5ca3cb94e386417781674a83a163493f9c042c51487"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/tool_runtime/context_projection.rs:185-193 | src/tool_runtime/session_context.rs:482-489 \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 \u0060src/tool_runtime/context_projection.rs:185\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/context_projection.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"91014d99918bd66735d35a914a502b40db4daad0c18199add3bef744b3ad77ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/tool_runtime/context_projection.rs:186-193 | src/tool_runtime/permissions/mod.rs:67-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/tool_runtime/permissions/mod.rs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/tool_runtime/context_projection.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a44d1cd359caf8446ba59ad716636cddaafc0da282dfbf163b83297c5f4918"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tool_runtime/files/inspection.rs:1126-1134 | src/tool_runtime/files/inspection.rs:1282-1290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/files/inspection.rs:1126\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/inspection.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e41e656560c50724904cf8a643935ae2fadb3d07727ba854769c188b8e9a5ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tool_runtime/review_changes.rs:232-240 | src/tool_runtime/review_changes.rs:444-452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/review_changes.rs:232\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/review_changes.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97c484330593943aad0aa9d1daae0d092610ede6cee25663c0f45c3c80b9f4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tool_runtime/skills.rs:1817-1825 | src/tool_runtime/skills.rs:1903-1911 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/skills.rs:1817\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/skills.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34b434b7e3bc5a1da013f4df528a6604f5ecd08862a4407852748ca0b3a8dba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tool_runtime/startup_brief.rs:335-343 | src/tool_runtime/work_result.rs:1022-1030 \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":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8308e98efb48b8c3667ba202b86603160ccb85949f077059072f47898fc9f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:316-323 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:541-548 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:743-750 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:1012-1019 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:1118-1125 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:316\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e4f2dea3995a773cd295bd2affa3f38eecb32f9e3bf381d3dc32f6630b3aff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/webcodex-runner-registry/src/job_updates.rs:1222-1229 | crates/webcodex-runner-registry/src/job_updates.rs:1943-1950 | crates/webcodex-runner-registry/src/job_updates.rs:1991-1998 | crates/webcodex-runner-registry/src/job_updates.rs:2038-2045 \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 matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-runner-registry/src/job_updates.rs:2037\u0060 calls \u0060is_err\u0060 and \u0060crates/webcodex-runner-registry/src/job_updates.rs:1990\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3475714d8cd267bc0c8bc0bd104e94c327d83d978d783e82ddc22841c4db5137"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): crates/webcodex-runner-registry/src/requests.rs:2004-2011 | crates/webcodex-runner-registry/src/requests.rs:2076-2083 | crates/webcodex-runner-registry/src/requests.rs:2217-2223 | crates/webcodex-runner-registry/src/requests.rs:2279-2286 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:2004\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-runner-registry/src/requests.rs:2085\u0060 calls \u0060Err\u0060, \u0060to_string\u0060 and \u0060crates/webcodex-runner-registry/src/requests.rs:2287\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"108cf80c8fcb7f6b8935f7ab3d64bc9b8dfce5cea39552c71848f043dbd44678"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/oauth_http/token.rs:222-229 | src/oauth_http/token.rs:239-246 | src/oauth_http/token.rs:352-359 | src/oauth_http/token.rs:369-376 \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":"src/oauth_http/token.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7869cfbe3ef08687c87941fa3d8f8fa799e0b0fd09df484485fb4b1eca0518f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/webcodex-cli/src/webcodex_cli/pairing.rs:15-22 | crates/webcodex-cli/src/webcodex_cli/server.rs:513-520 | crates/webcodex-runner-config/src/lib.rs:163-170 \u2014 before extracting anything, compare \u0060crates/webcodex-cli/src/webcodex_cli/pairing.rs\u0060 and \u0060crates/webcodex-runner-config/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/pairing.rs:15\u0060 it does not close everything it opens, so those exact 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060opts\u0060 to \u0060\u0026ServerStatusOptions\u0060 in one and \u0060\u0026RunnerInitOptions\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/pairing.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"16575e9961d37375cea68fc965c7b8a270da90c55abd76a00a2c88f428d48c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/webcodex-cli/src/webcodex_cli/system.rs:452-459 | crates/webcodex-cli/src/webcodex_cli/system.rs:479-486 | crates/webcodex-cli/src/webcodex_cli/system.rs:521-528 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"0902faa565ac837c59f8339033eddb9c84d85ddc346500aeb5c261020182fde0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/webcodex-runner-registry/src/requests.rs:911-919 | crates/webcodex-runner-registry/src/requests.rs:985-993 | crates/webcodex-runner-registry/src/requests.rs:1127-1135 \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, \u0060crates/webcodex-runner-registry/src/requests.rs:984\u0060 calls \u0060apply_text_edits_capability_requirements\u0060 and \u0060crates/webcodex-runner-registry/src/requests.rs:910\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb45bfdf58db857d475b651ed596fc5505d53cc999d8e9cf092ff25a6cb7bac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/shell/commands.rs:289-296 | crates/webcodex-runner/src/webcodex_runner/shell/commands.rs:368-374 | crates/webcodex-runner/src/webcodex_runner/shell/commands.rs:438-444 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/shell/commands.rs:289\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/commands.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"2498534b2ee35e14ce76ffaaeaa363138807cf4e79690c6bc9bac3164b358641"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:215-222 | crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:312-319 | crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:334-341 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:215\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/execution.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1184aaa423364772569e4c413ea3fd3340465d2a63ccb75945c67002c9bf050d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 3): src/mcp/tools.rs:569-576 | src/mcp/tools.rs:667-674 | src/mcp/tools.rs:742-747 \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 \u0060src/mcp/tools.rs:569\u0060 it does not close everything it opens, so those exact 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":"src/mcp/tools.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90010bbed3223e869cb01409ff2add844757e3c73eaec9abba77db234ce9903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/runtime_console_http/window_collaboration.rs:46-53 | src/runtime_console_http/window_queries.rs:235-242 | src/runtime_console_http/window_queries.rs:347-354 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime_console_http/window_collaboration.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b000d9b76e00c80d98166b62a28e62f90b62755892a4f6fc46ce19a761037382"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tool_runtime/docx_document.rs:79-86 | src/tool_runtime/pdf_document.rs:73-80 | src/tool_runtime/pdf_document.rs:149-156 \u2014 before extracting anything, compare \u0060src/tool_runtime/docx_document.rs\u0060 and \u0060src/tool_runtime/pdf_document.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 \u0060src/tool_runtime/docx_document.rs:79\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/docx_document.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca4fc9c4430796b736393af4aef06889876153d2f4c2945b39ebd8e8fd8cf07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tool_runtime/skills.rs:1707-1714 | src/tool_runtime/skills.rs:1808-1815 | src/tool_runtime/skills.rs:1894-1901 \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":"src/tool_runtime/skills.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fb986ca3fe416e4648bcb60bad2d290a6e301198995067cf42eb420a802d8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/desktop/src-tauri/src/state/updates.rs:226-233 | apps/desktop/src-tauri/src/state/updates.rs:310-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/updates.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"557c238752eaa549f686af39b125e11c4cb085deb82491d6e2b2f77c083b833e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/desktop/src-tauri/src/tray.rs:474-481 | apps/desktop/src-tauri/src/tray.rs:485-492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/desktop/src-tauri/src/tray.rs:474\u0060 it begins part-way through the construct above it, so those exact 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, \u0060apps/desktop/src-tauri/src/tray.rs:472\u0060 calls \u0060text\u0060 and \u0060apps/desktop/src-tauri/src/tray.rs:483\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":"apps/desktop/src-tauri/src/tray.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c108bfe83798615fda5e0d9bf02a65cff3bcf53e828619f7a2ba4785e99735"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/desktop/src-tauri/src/webcodex/settings/acp.rs:112-119 | apps/desktop/src-tauri/src/webcodex/settings/mcp.rs:99-106 \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 \u0060apps/desktop/src-tauri/src/webcodex/settings/acp.rs:112\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/settings/acp.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d617340ba76b941c7de18036d8881475c052bf01306cc978a67f3ccfedfc32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-admin/src/commands.rs:286-293 | crates/webcodex-admin/src/commands.rs:315-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-admin/src/commands.rs:286\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c79e0e3cc303a42cf58926e515aa533bab8b3a431fc51d99182ad30d798570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-admin/src/commands.rs:835-842 | crates/webcodex-cli/src/webcodex_cli/token_commands.rs:128-135 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a17694ce5f8396c02347d539c1f16b8e9209d35052d50202663afabbd255ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-browser/src/cdp.rs:1883-1890 | crates/webcodex-browser/src/cdp.rs:2337-2344 \u2014 both copies are in the same file, so extract the block 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 \u0060raw_nodes\u0060 to \u0060\u0026[Value]) -\u003E (Vec\u003CBackendNode\u003E\u0060 in one and \u0060\u0026[Value]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa3e973d782da0d4f4abcac63367d56ddade5bc5c9b9942f6f1ce6aa2a3d416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-browser/src/cdp.rs:3025-3032 | crates/webcodex-browser/src/cdp.rs:3062-3069 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":3025}}}],"partialFingerprints":{"codehealthFindingId/v1":"212817341580ac087ab495aef5935e84eb78a52b07babc6763d86555e7bb4085"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:554-561 | crates/webcodex-cli/src/lib.rs:729-736 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"807f30ce46e27f33e6bf7fb83314b9d8414edfced259e97074e0e0f4032f8e2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:2177-2184 | crates/webcodex-cli/src/lib.rs:2426-2433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/lib.rs:2177\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2177}}}],"partialFingerprints":{"codehealthFindingId/v1":"df21437e8bedc9276b72f5859a1f00a39f146968f24a708bcec15db4f809ae62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:3016-3024 | crates/webcodex-cli/src/lib.rs:3027-3035 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/lib.rs:3016\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":3016}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4f18c7cdea7bbd27af6ccaf314f7a8dac4916fa7c44e95f0b6ea767c53d722"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/controller.rs:382-388 | crates/webcodex-cli/src/webcodex_cli/controller.rs:1844-1851 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/controller.rs:382\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bd05f116f9a1d722f3401ec64b68c9b0f3e7ecfaeb6d8c6c52bf0c681f05af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-core/src/mcp_gateway.rs:650-657 | src/tool_runtime/computer_tools/snapshot_receipts.rs:176-183 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/mcp_gateway.rs:650\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dcb63e619b043f1391c9746ae7e112df1e531e189b6d7520ed8c6fd87ad433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-core/src/mcp_gateway.rs:660-667 | crates/webcodex-core/src/plugin.rs:1475-1482 \u2014 before extracting anything, compare \u0060crates/webcodex-core/src/mcp_gateway.rs\u0060 and \u0060crates/webcodex-core/src/plugin.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"939703df1082ada0de451ca604ef69c08d5a1244a4a6233ce0380f07f1b944af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-core/src/project_build.rs:172-179 | crates/webcodex-core/src/project_validation.rs:193-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 \u0060crates/webcodex-core/src/project_build.rs:172\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_build.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac51dbf96151ec4832a764b59b9d1821a0beafec1afc185400ad35f4709ad37b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-core/src/project_build.rs:212-219 | crates/webcodex-core/src/project_validation.rs:225-232 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/project_build.rs:212\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_build.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e05a24760a764f066016dab4a29d24458a085a5940f486f48eaaf64dc33585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/webcodex-core/src/runner_operation.rs:2387-2393 | crates/webcodex-core/src/runner_operation.rs:2401-2408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/runner_operation.rs:2387\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":2387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f540fd98f986e96f61116b1cd0e934dc3887025e4f43d8fcedc3aa2f323d2726"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-environment/src/process/unix.rs:65-72 | crates/webcodex-environment/src/process/windows.rs:45-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/process/unix.rs:65\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060stream\u0060 to \u0060\u0026mut impl Read\u0060 in one and \u0060\u0026mut (impl Read \u002B AsRawHandle)\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-environment/src/process/unix.rs:73\u0060 calls \u0060Err\u0060, \u0060kind\u0060, \u0060Ok\u0060 and \u0060crates/webcodex-environment/src/process/windows.rs:53\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/process/unix.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"742690a5254974621821193d20306f6f8a4570ec54edee829b4386be4dea592e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-persistent-shell/src/unix.rs:159-166 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:343-350 \u2014 before extracting anything, compare \u0060crates/webcodex-persistent-shell/src/unix.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/remote_shell.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-persistent-shell/src/unix.rs:159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23202136f75289578d1b65eab31ba61a0c56b4f893d9ce0acc86be583f48a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner-registry/src/job_updates.rs:1421-1428 | crates/webcodex-runner-registry/src/job_updates.rs:1648-1655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c4c1c89d0cf09c35756577e4e51113bc8d7351a8936ab68ffabd55f161ce61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:1671-1678 | crates/webcodex-runner-registry/src/requests.rs:2385-2392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:1671\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b88f0529788d6a359aba3b5bad9210c49711860f7e9e81a98a9af699a62893b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts.rs:226-233 | crates/webcodex-runner/src/webcodex_runner/patches.rs:88-95 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/artifacts.rs:226\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94e5e93ccc95bd889dd2ca2577d4630274ddce479b3524fdddccd4ac0921fc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:217-224 | crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:225-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":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea5e6ce7ea2d56de9d7c6679aa5a729bdd8de2d3a3b398744cffd8d5220a401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/computer.rs:236-243 | crates/webcodex-runner/src/webcodex_runner/computer.rs:295-302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/computer.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"113071803ddceceafad05b903764cc2e5702865b858a0b32a523ecf009412b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/files.rs:445-452 | crates/webcodex-runner/src/webcodex_runner/files.rs:769-776 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/files.rs:445\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/files.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ce69d685c32cd7a2b599008024bd552a54c5a77732b2ab34be051a1d40eeec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs:261-268 | crates/webcodex-runner/src/webcodex_runner/job_manager/ssh.rs:226-233 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/ssh.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"735ef937bc76880411984f182a94eb046d9d2dc664803d2616a8ddb05c5f29c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/job_manager/shutdown.rs:35-42 | crates/webcodex-runner/src/webcodex_runner/job_manager/shutdown.rs:143-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/shutdown.rs:35\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/shutdown.rs:152\u0060 calls \u0060with_capacity\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/shutdown.rs:43\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/shutdown.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d11ca943565afee1334b08d65d614f9ff36143bac0d8d42ec7f7c837ea5daa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs:422-429 | crates/webcodex-store/src/server_instance.rs:23-30 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"5602e6f19eacbdbbdf3f4581418f32a74cc44b1c281ecaf17ec3512fa374437e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:1197-1205 | crates/webcodex-runner/src/webcodex_runner/plugin.rs:1863-1871 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/plugin.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:1197\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac9777c49e219f9256efc2f71b73c17728ab1b76c17b639397040a3efa12ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/project_build.rs:237-244 | crates/webcodex-runner/src/webcodex_runner/validation/project.rs:225-232 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/project_build.rs:237\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16b7ab154877671a224e9786ad8bf8131c98f2d12dddca81cebf04d935a49a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-store/src/agent_wake.rs:2316-2323 | crates/webcodex-store/src/goal_stall.rs:391-398 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/agent_wake.rs:2316\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"200ec9ce03a4cf96454f055b829b3170c194af9787ebec59137ff79cee152fd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-store/src/artifact_handoff.rs:757-764 | crates/webcodex-store/src/artifact_handoff.rs:886-893 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/artifact_handoff.rs:757\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/artifact_handoff.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9f7882fc389decf96667a56e6229e3fb4530c156b89b377f13b992a5e39b38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-store/src/communication.rs:1364-1371 | crates/webcodex-store/src/communication.rs:1431-1438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"737502eb876864146d4b32e31ee5ef07b71e4c8bcd77086d982e5da55192d315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-store/src/memory.rs:998-1005 | crates/webcodex-store/src/memory.rs:1212-1219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/memory.rs:998\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/memory.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"f858d1632e34f362da1f612b4a025c0be6468f363207ccbf67c4106110ccfa0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-store/src/window_collaboration.rs:217-224 | crates/webcodex-store/src/window_collaboration.rs:268-275 \u2014 both copies are in the same file, so extract the block 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 \u0060NewWindowOperatorMessage\u0060 in one and \u0060NewWindowModelReply\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/window_collaboration.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"75199c1bc91a0363a51fe95004cd78bdca5fbb0c624075095c9ae30862c477fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-validation/src/adapters/go.rs:85-92 | crates/webcodex-validation/src/adapters/python.rs:190-197 \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, \u0060crates/webcodex-validation/src/adapters/python.rs:199\u0060 calls \u0060is_some\u0060 and \u0060crates/webcodex-validation/src/adapters/go.rs:93\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/adapters/go.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"361f1210517eedbea2e767702c723857b68f0773192370366c50ebe19453500f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/cloudflare_transport.rs:438-444 | src/cloudflare_transport.rs:458-465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cloudflare_transport.rs:438\u0060 it does not close everything it opens, so those exact 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":"src/cloudflare_transport.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"17287b946dbdb5b8d0c8449458c2de9c1c3a9486389b7ce54bdcfcf6c4602fd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/mcp/cli/text/compact.rs:152-159 | src/mcp/cli/text/compact.rs:206-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 \u0060src/mcp/cli/text/compact.rs:152\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":"src/mcp/cli/text/compact.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b31bcef17e95d3082e490c6823c91086b933bc12c05329150d5052c5da28d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/mcp/resources.rs:215-222 | src/mcp/resources.rs:372-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp/resources.rs:215\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 \u0060record\u0060 to \u0060McpArtifactExportRecord\u0060 in one and \u0060McpSnapshotResourceRecord\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":"src/mcp/resources.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18c80ecae40f0cc922d0e8c3618fac174d021ee6907c416962ad39b97a64c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/mcp/tools.rs:957-964 | src/mcp/tools.rs:1050-1056 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp/tools.rs:957\u0060 it does not close everything it opens, so those exact 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":"src/mcp/tools.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efd12ae6185ca721c93231772fb1e8303ac7ca60f14b0174357a589e304e5fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/oauth_http/html.rs:92-99 | src/oauth_http/html.rs:143-150 \u2014 both copies are in the same file, so extract the block 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, \u0060src/oauth_http/html.rs:153\u0060 calls \u0060unwrap_or_default\u0060 and \u0060src/oauth_http/html.rs:100\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":"src/oauth_http/html.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1c80b6e7ca009f67eb415b06d0c9de564475ec2f4ddc40e8845efe33922a72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/runner_http/handlers.rs:30-36 | src/runner_http/handlers.rs:434-441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/runner_http/handlers.rs:30\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":"src/runner_http/handlers.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c63563b7978fe822a2ecb3ecc9efeebe93ea8e77068351f1b5c8dc263d78c69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/runtime_console_http/window_collaboration.rs:127-134 | src/runtime_console_http/window_collaboration.rs:163-170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/runtime_console_http/window_collaboration.rs:127\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":"src/runtime_console_http/window_collaboration.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1dc3cb0cf6c1a7cd71895730f7240cccbd03e1e21792d8c6aa53c1f1800ddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tool_request_trace/writer.rs:113-120 | src/tool_request_trace/writer.rs:146-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_request_trace/writer.rs:113\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":"src/tool_request_trace/writer.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"563916d75d940ecaa45d2b5410ad6da1846b48078d4104a7eb1960ab01d86df0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/tool_runtime/files/artifacts.rs:479-486 | src/tool_runtime/files/artifacts.rs:529-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 \u0060src/tool_runtime/files/artifacts.rs:479\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/artifacts.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"8797466af1bff1b977bf94c63a8a0d91207e3146b18dfebc0822ad42779bdc4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tool_runtime/goal.rs:767-774 | src/tool_runtime/goal.rs:1296-1303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/goal.rs:767\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/goal.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f79f356f3c7acd1777249daea327a217e12c3fe63635e9788e8ce445538ab4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tool_runtime/hygiene.rs:170-177 | src/tool_runtime/hygiene.rs:214-221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/hygiene.rs:170\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/hygiene.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"128d2c4437ea87edc5813145d3a422f5aed33dc1667762c51481432d73ccbad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tool_runtime/skills.rs:2415-2422 | src/tool_runtime/skills.rs:2430-2437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/skills.rs:2415\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/skills.rs"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70a3caa4441924899bf6ed3ebf7f5170699532f1adb3e3aaa5a0455dd6b0edb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): crates/webcodex-admin/src/commands.rs:185-191 | crates/webcodex-admin/src/commands.rs:207-213 | crates/webcodex-admin/src/commands.rs:254-260 | crates/webcodex-admin/src/commands.rs:285-291 | crates/webcodex-admin/src/commands.rs:314-320 | crates/webcodex-admin/src/commands.rs:543-549 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-admin/src/commands.rs:185\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-admin/src/commands.rs:321\u0060 calls \u0060value\u0060 and \u0060crates/webcodex-admin/src/commands.rs:214\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d0436e4314e2c87d21bba8cb439dd6603fe9a5efc4051cf43561af4dbef58c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/webcodex-browser/src/supervisor.rs:742-748 | crates/webcodex-browser/src/supervisor.rs:758-764 | crates/webcodex-browser/src/supervisor.rs:915-921 | crates/webcodex-browser/src/supervisor.rs:929-937 | crates/webcodex-browser/src/supervisor.rs:1036-1042 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-browser/src/supervisor.rs:741\u0060 calls \u0060validate_navigation_url\u0060 and \u0060crates/webcodex-browser/src/supervisor.rs:914\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"200cb52026d51174cdf120da2e23e23f9fff2e66f3a92b5912381981b6039364"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/webcodex-runner-registry/src/requests.rs:744-753 | crates/webcodex-runner-registry/src/requests.rs:838-847 | crates/webcodex-runner-registry/src/requests.rs:1185-1194 | crates/webcodex-runner-registry/src/requests.rs:1246-1255 | crates/webcodex-runner-registry/src/requests.rs:1298-1307 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:744\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-runner-registry/src/requests.rs:1195\u0060 calls \u0060assert_runner_access\u0060 and \u0060crates/webcodex-runner-registry/src/requests.rs:848\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"f376f219194c3e903df6fc57b4df0d883768a720c8103bf8492afaf668b306e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/tool_runtime/job_terminal_wait.rs:249-255 | src/tool_runtime/job_terminal_wait.rs:286-292 | src/tool_runtime/job_terminal_wait.rs:325-331 | src/tool_runtime/job_terminal_wait.rs:374-380 | src/tool_runtime/job_terminal_wait.rs:409-415 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/job_terminal_wait.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f04a1a2a6af41f92d6ea7d154120b41809e66c22642b6eb87878f2b990a476f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): apps/desktop/src-tauri/src/state/path_inventory.rs:48-54 | apps/desktop/src-tauri/src/state/path_inventory.rs:65-71 | apps/desktop/src-tauri/src/state/path_inventory.rs:80-86 | apps/desktop/src-tauri/src/state/path_inventory.rs:101-107 \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":"apps/desktop/src-tauri/src/state/path_inventory.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba03647cda082ed1c64fa4a0801a1395a7b6e1f002bae9f5caa70c86ac3f2f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/webcodex-browser/src/supervisor.rs:527-533 | crates/webcodex-browser/src/supervisor.rs:539-545 | crates/webcodex-browser/src/supervisor.rs:567-573 | crates/webcodex-browser/src/supervisor.rs:603-609 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"524fe299fd5c96c0dace0a613aada122f9b3e0a74e93e7a7a994748941420eb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): apps/desktop/src-tauri/src/webcodex/adapter.rs:989-995 | crates/webcodex-environment/src/native.rs:1942-1948 | crates/webcodex-runner/src/webcodex_runner/config.rs:1620-1626 \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":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3d28338c2f77e6cfece27847f56e1d6cef4002bd85efa89ee42e88f70f2455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/webcodex-admin/src/commands.rs:432-438 | crates/webcodex-admin/src/commands.rs:458-464 | crates/webcodex-admin/src/commands.rs:483-489 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-admin/src/commands.rs:432\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c7c7b77f09f0dc2480fc19a5de0eb397acc85b793665ea7d6747f7a26a25d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/webcodex-admin/src/commands.rs:808-814 | crates/webcodex-cli/src/webcodex_cli/pairing.rs:13-19 | crates/webcodex-runner-config/src/lib.rs:161-167 \u2014 before extracting anything, compare \u0060crates/webcodex-cli/src/webcodex_cli/pairing.rs\u0060 and \u0060crates/webcodex-runner-config/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-admin/src/commands.rs:808\u0060 it begins part-way through the construct above it, so those exact 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 \u0060opts\u0060 to \u0060\u0026AdminOptions\u0060 in one and \u0060\u0026RunnerInitOptions\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"513709d6b2eda541162500e0080e584eb67004471cf64cf2c59264d42552e99c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/webcodex-cli/src/webcodex_cli/system.rs:414-419 | crates/webcodex-cli/src/webcodex_cli/system.rs:455-461 | crates/webcodex-cli/src/webcodex_cli/system.rs:482-488 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/system.rs:414\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"01059cd12a0f7ca78d7481a5c9119e05ef076ff49476b6eeb5777656c640df91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/webcodex-core/src/runner_operation.rs:1529-1535 | crates/webcodex-core/src/runner_operation.rs:1549-1555 | crates/webcodex-core/src/runner_operation.rs:1573-1579 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/runner_operation.rs:1529\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b33d91ca84dcf9e9aa3efdd488188e0ab87b9fc122695961932f88167dd4fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/shell/process.rs:204-210 | crates/webcodex-runner/src/webcodex_runner/shell/run.rs:95-101 | crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs:362-368 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/shell/process.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/shell/scripts.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/shell/process.rs:204\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/process.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1730b954af9870e6e9957d833ed5b0802648f7c6dab47f6508df0af7d14ecbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/desktop/src-tauri/src/diagnostics.rs:368-374 | crates/webcodex-environment/src/inventory/model.rs:157-163 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060apps/desktop/src-tauri/src/diagnostics.rs:368\u0060 it does not close everything it opens, so those exact 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 \u0060info\u0060 to \u0060\u0026MachineBuildInfo\u0060 in one and \u0060\u0026webcodex_core::desktop_runtime_contract::MachineBuildInfo\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":"apps/desktop/src-tauri/src/diagnostics.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9f7c0b5e389f5f5aa831aed5618056ed4cfae747579f495ca3712c8c7fb918"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/desktop/src-tauri/src/lifecycle_log.rs:274-280 | crates/webcodex-runner/src/webcodex_runner/file_access.rs:39-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060apps/desktop/src-tauri/src/lifecycle_log.rs:274\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/lifecycle_log.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05f544c986217e4fd9904581e5349a2f77d86ca11d004e6fc6732ee9693a28a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/desktop/src-tauri/src/webcodex/settings/acp.rs:104-110 | apps/desktop/src-tauri/src/webcodex/settings/mcp.rs:91-97 \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 \u0060apps/desktop/src-tauri/src/webcodex/settings/acp.rs:104\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/settings/acp.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"807a30bf07167cb801899fa9da6072c8ad290aac2ef2677d4c7e2e810704320d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/desktop/src-tauri/src/webcodex/settings/mcp.rs:51-57 | apps/desktop/src-tauri/src/webcodex/settings/mcp.rs:86-93 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/desktop/src-tauri/src/webcodex/settings/mcp.rs:51\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060apps/desktop/src-tauri/src/webcodex/settings/mcp.rs:94\u0060 calls \u0060and_then\u0060 and \u0060apps/desktop/src-tauri/src/webcodex/settings/mcp.rs:58\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":"apps/desktop/src-tauri/src/webcodex/settings/mcp.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a42f71203c700b7aa04165d8c6fbc2581e87672d47a3ddc74b8c84241e1da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-browser/src/profiles.rs:110-116 | crates/webcodex-environment/src/storage.rs:265-271 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-browser/src/profiles.rs:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/profiles.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"91daf40defd6dd6a22010d3bf38b14978f26b0b82393c7eff270e4893814c5da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:1321-1327 | crates/webcodex-cli/src/lib.rs:2578-2584 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cddcb501248867760c70c5837c4c3932bbe80e2dfc42398888ce049156795cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-core/src/runner_skill.rs:444-456 | src/tool_runtime/skills.rs:2628-2640 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_skill.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2c663c98e4c18517bbbb640e39fc36ba7b4f5eb3d24035f05800e7f0a9ae99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-environment/src/migration.rs:987-994 | crates/webcodex-environment/src/native.rs:1557-1564 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"23924580c5c23acab66a31481cc6f899ad97f471458fc8530998678642c0cb9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-environment/src/privilege.rs:219-225 | crates/webcodex-environment/src/privilege.rs:242-248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/privilege.rs:219\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e74c617fa01bd41678d197d082ff93c9901d2a567771fcbd87a8b425dc40c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-environment/src/privilege.rs:384-390 | crates/webcodex-environment/src/storage.rs:286-292 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"9547629afc639c41d0d06893a4b6ae2dc258880c779c3870bdbdb0afd59dc41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-environment/src/privilege.rs:391-397 | crates/webcodex-environment/src/storage.rs:261-267 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/privilege.rs:391\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb8ad4dd09b535fdfec2fd44a2b9936e749c050739824b0988272d14ae0d70b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-environment/src/storage.rs:354-360 | src/upgrade_maintenance_store.rs:279-285 \u2014 before extracting anything, compare \u0060crates/webcodex-environment/src/storage.rs\u0060 and \u0060src/upgrade_maintenance_store.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/storage.rs:354\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed8e677e94707eb261df0ec5469cddabe0f279c011fdd9d8d9aea161cfa6be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-lsp/src/supervisor.rs:511-517 | crates/webcodex-lsp/src/supervisor.rs:558-564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0850da216f044ac87372186ab1be3d8f0fda438565da1102567ac0cfe6f423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner-registry/src/job_updates.rs:1315-1322 | crates/webcodex-runner-registry/src/job_updates.rs:1643-1650 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a35323d9fce404c7cb5789dd6c417725e7948282fe8d8b5f50082bf2613cb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-runner-registry/src/job_updates.rs:1647-1653 | crates/webcodex-runner-registry/src/job_updates.rs:1825-1831 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17d395affd7ebc6eabd3a9a3b37c10ba00deb29413e7f10d5fef41f6f17415e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-runner-registry/src/reconciliation.rs:1057-1063 | crates/webcodex-runner-registry/src/reconciliation.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 \u0060crates/webcodex-runner-registry/src/reconciliation.rs:1057\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0dd454f10bd1496a1fa34ba089511895ec45f8d26b0b77731f7fa13c7a9ac69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/coding_agent.rs:127-133 | crates/webcodex-runner/src/webcodex_runner/coding_agent.rs:139-145 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/coding_agent.rs:146\u0060 calls \u0060saturating_add\u0060, \u0060now\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/coding_agent.rs:134\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2d970241e78435f5107a8a3c71f666f34c956e38a4a803bb9899073801b66f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/patches.rs:569-576 | crates/webcodex-runner/src/webcodex_runner/patches.rs:651-657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/patches.rs:569\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/patches.rs:657\u0060 calls \u0060canonicalize_apply_text_line_endings\u0060, \u0060map_err\u0060, \u0060plain\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/patches.rs:576\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1eb1f984661776c7ed2e2f5aad4240deb1457be9e5c16b0e97e7a302d477f34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1445-1452 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1469-1475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1445\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"b817100311176c0f1a5779a111b9452564f7efdf0162ebe6f50c36e91c6c9dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/project_inventory.rs:150-156 | crates/webcodex-runner/src/webcodex_runner/transport/project_inventory.rs:172-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport/project_inventory.rs:150\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/project_inventory.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31e110cef516b0f0c52d229c2da5d186ad09da7fc7515f2127dd95a865da420"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-store/src/goal.rs:316-322 | crates/webcodex-store/src/goal.rs:419-425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/goal.rs:316\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-store/src/goal.rs:418\u0060 calls \u0060validate_workflow_session_id\u0060, \u0060map_err\u0060 and \u0060crates/webcodex-store/src/goal.rs:315\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"290f50e3389f3b390ad1446e3bad8335ac2fb36d70c65a0ceaffe037fb9e31a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-store/src/goal.rs:915-921 | crates/webcodex-store/src/goal.rs:1018-1024 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/goal.rs:915\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9c555d51bfc33a7e0837d5ae9a229b2ce007600095ca8403866f045faa0c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-tool-contracts/src/registry/output_schemas/edits.rs:180-187 | crates/webcodex-tool-contracts/src/registry/output_schemas/edits.rs:238-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/edits.rs:180\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/edits.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f65c72c372fbca42a38ca39e3f90e9f6ad5435a652c5220576d2c168039705d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/webcodex-tool-contracts/src/registry/output_schemas/sessions.rs:33-39 | crates/webcodex-tool-contracts/src/registry/output_schemas/sessions.rs:87-92 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/sessions.rs:33\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/sessions.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dca84f7004208894586bf35563fd95268f63cb8d4149b1aa10707386289991b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/config.rs:9-14 | src/console_web.rs:262-268 \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 \u0060src/config.rs:9\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78ff4381079922648320625f3062ba12fa9b2dfcabf19ca50b92cb8e94a4abb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/mcp.rs:1216-1222 | src/mcp.rs:1244-1250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp.rs:1216\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":"src/mcp.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"172da2ec3f37353b84666104f7c2a95cff5b2bcd06e729b41af99a2a3e05ca31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/mcp/tools/call.rs:624-630 | src/mcp/tools/call/specialized.rs:89-95 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/mcp/tools/call.rs:624\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce4f6add6d47c332509b8ba01c21be5571a46e0a3395abdce8dfb1163cb5114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/project_entry_windows.rs:79-85 | src/project_entry_windows.rs:110-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/project_entry_windows.rs:79\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/project_entry_windows.rs:86\u0060 calls \u0060is_err\u0060, \u0060remove_file\u0060 and \u0060src/project_entry_windows.rs:117\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":"src/project_entry_windows.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfd5c067eb60c2c59321d7dbfa6dfc67af798c47576a7e14e70def1f5507fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/runner_http/handlers.rs:95-101 | src/runner_http/handlers.rs:296-302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/runner_http/handlers.rs:95\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":"src/runner_http/handlers.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc64ae25c61fec67dd41c9f7f16332f57c9158be37c3b064f4c639c9c1e7910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tool_runtime/changes.rs:999-1005 | src/tool_runtime/changes.rs:1147-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/changes.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"276bc6687ae2076827bfa0fc1b02af74e35f951f025b6d41bac0709ffccc2073"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tool_runtime/git/diff_hunks.rs:250-256 | src/tool_runtime/git/diff_hunks.rs:280-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/git/diff_hunks.rs:250\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, \u0060src/tool_runtime/git/diff_hunks.rs:279\u0060 calls \u0060update\u0060, \u0060to_be_bytes\u0060 and \u0060src/tool_runtime/git/diff_hunks.rs:249\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":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28af6f2837f6d0fe3354b873b6411ee8ad96fc13562ae1a64af83d0a607af52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tool_runtime/project_format.rs:25-31 | src/tool_runtime/project_format.rs:59-65 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/project_format.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd64d55000dfa7b74fc4a979de11b35512b25cd8edc445751ea102656d2b6e1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tool_runtime/surface.rs:1194-1200 | src/tool_runtime/surface.rs:1270-1276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/surface.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a670c36606f03834cab37969927830fcd04080ef3c2e782c7309483a16fc8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tool_runtime/validation_events.rs:256-262 | src/tool_runtime/validation_events.rs:540-546 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/validation_events.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5862ab4db125987511e9469ebbdc25f9266854e430df931fa82e8230604a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): src/users_http/tokens.rs:82-88 | src/users_http/tokens.rs:154-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. 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":"src/users_http/tokens.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1736d0af85dababda70e3f24879cae8063a6f733bdfa40178460abca01d8db0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): apps/desktop/src-tauri/src/diagnostics.rs:624-631 | src/project_entry_cloudflared.rs:625-630 | src/project_entry_setup.rs:1169-1174 \u2014 before extracting anything, compare \u0060src/project_entry_cloudflared.rs\u0060 and \u0060src/project_entry_setup.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 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":"apps/desktop/src-tauri/src/diagnostics.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"22387eaeeea35cb5ac8195a5a967fadee26c7154d7596a4b9420feeac795726e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/webcodex-core/src/mcp_gateway.rs:649-654 | src/mcp/resources.rs:557-562 | src/tool_runtime/computer_tools/snapshot_receipts.rs:175-180 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/mcp_gateway.rs:649\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a8f685e1b5ff3b5fe572f3268a56c7a8111ab63eb166c2d3bcb6c00eaf87f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/webcodex-environment/src/migration.rs:367-372 | crates/webcodex-environment/src/migration.rs:404-409 | crates/webcodex-environment/src/migration.rs:433-438 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/migration.rs:367\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e00c26d4499f77526e2b0b88d79565c82542ede54f9a1e9cf864377a26b45e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/webcodex-store/src/agent_wait.rs:574-579 | crates/webcodex-store/src/communication.rs:2510-2515 | crates/webcodex-store/src/communication.rs:2770-2775 \u2014 before extracting anything, compare \u0060crates/webcodex-store/src/agent_wait.rs\u0060 and \u0060crates/webcodex-store/src/communication.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/agent_wait.rs:574\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wait.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"a445ce1ab9a797b52e3dd6b93358059e0d6498a51a419d6d97e26297cc348d8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/tool_runtime/external_observations.rs:98-103 | src/tool_runtime/session_tools.rs:440-447 | src/tool_runtime/validation_events.rs:56-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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/external_observations.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. 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":"src/tool_runtime/external_observations.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2280a2d42a7334daec10e8ee5510d6d2ebdc483905de9af9b6a705aae54d7966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/tool_runtime/memory.rs:169-174 | src/tool_runtime/memory.rs:250-255 | src/tool_runtime/runtime_info.rs:1036-1041 \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 \u0060src/tool_runtime/memory.rs:169\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/memory.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f535e00d7a72ea6e422fde0889d28ff4716371f5316694dff36c3cebcc6ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/desktop/src-tauri/src/runner_capability_grant.rs:134-139 | apps/desktop/src-tauri/src/state/persistence.rs:314-322 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060apps/desktop/src-tauri/src/runner_capability_grant.rs:134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"apps/desktop/src-tauri/src/runner_capability_grant.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67e92d97490af6ee989c5b3e45ee6d5df546ca124b8a6833a4c6316563d9793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/desktop/src-tauri/src/webcodex/settings/acp.rs:80-85 | apps/desktop/src-tauri/src/webcodex/settings/mcp.rs:62-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/desktop/src-tauri/src/webcodex/settings/acp.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":"apps/desktop/src-tauri/src/webcodex/settings/acp.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca29ddb3cd534b810304fc355d79a11643003c7c7aa1c278603dfc4179257060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-admin/src/output.rs:4-10 | crates/webcodex-cli/src/webcodex_cli/http.rs:89-95 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-admin/src/output.rs:4\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/output.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9df8266620786939020f611a45d05f8f0e6e6dde2ecf6ecca0a56d29615585a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-computer/src/platform/macos/accessibility.rs:599-604 | crates/webcodex-computer/src/platform/macos/accessibility.rs:619-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0968358862936ef3e44bbc0fed72b931be5ca71cd8e28847392d0afe9736f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-computer/src/platform/macos/accessibility.rs:981-986 | crates/webcodex-computer/src/platform/windows/accessibility.rs:779-784 \u2014 \u0060crates/webcodex-computer/src/platform/macos/accessibility.rs\u0060 and \u0060crates/webcodex-computer/src/platform/windows/accessibility.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 64 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":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"468b7f675ab12ce5e8e725d49115d8d307ced2c34c67564e6a62de32cc965af0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-environment/src/storage.rs:473-478 | src/upgrade_maintenance_store.rs:18-23 \u2014 before extracting anything, compare \u0060crates/webcodex-environment/src/storage.rs\u0060 and \u0060src/upgrade_maintenance_store.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ae4cf3f0fced5966df0c8f70ffb75fb8781819aa110345c3681057779cf676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-environment/src/upgrade/windows_package.rs:465-471 | crates/webcodex-environment/src/upgrade/windows_package.rs:605-611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/upgrade/windows_package.rs:465\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-environment/src/upgrade/windows_package.rs:604\u0060 calls \u0060no_environment\u0060 and \u0060crates/webcodex-environment/src/upgrade/windows_package.rs:464\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/windows_package.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6c4d52a63e56960026ab738e8b11467745015a36f9c2dc0e4d46294a4971dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): crates/webcodex-lsp/src/supervisor.rs:569-573 | crates/webcodex-lsp/src/supervisor.rs:589-594 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-lsp/src/supervisor.rs:589\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd617cc2d96ac068b4437bb980121defcf1921e8d3c45a924ed8ab36febf662"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-runner-registry/src/job_updates.rs:540-545 | crates/webcodex-runner-registry/src/reconciliation.rs:283-291 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/job_updates.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":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9baa2abb6e8b4bf7e43a9ee5e6ac66c66b34bb3ab7bf429e6828c4bf1a813b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-runner-registry/src/jobs.rs:276-281 | crates/webcodex-runner-registry/src/reconciliation.rs:714-719 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/jobs.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fd967bc9788d0919dab500868f877aadbccdb5e2ce127f6a1aad48add04f58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:21-26 | src/tool_runtime/files/artifacts.rs:43-48 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs:21\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/inspection.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0473534aba56dbd6c2727ccd1733bee0891cda2726ed12f0f9aa01d2476be9f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:1243-1248 | crates/webcodex-runner/src/webcodex_runner/plugin.rs:1877-1882 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/plugin.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:1243\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b061939957e36542b2c6041dc3e814ad6d88ca983bb0ae50b367aca25c92b062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:1316-1322 | crates/webcodex-runner/src/webcodex_runner/plugin.rs:1932-1938 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/plugin.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs:1316\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dc2a2c4c025a3257cd9b55d091f73e793c6b880f8d1874e5117e918bf9025a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/output.rs:70-77 | crates/webcodex-runner/src/webcodex_runner/output.rs:81-88 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/output.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa5b375d61ebe4f5a0d2af14e65e4f1e97160b556e86dd6f973b8f61303ee99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/skill_store.rs:334-339 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:414-418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a4dc0089dfe5d17cae561225a12277bfbf937ff5a44fbcd10f2a5223eb2c2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/poll_dispatch.rs:570-575 | crates/webcodex-runner/src/webcodex_runner/transport/polling.rs:276-281 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport/poll_dispatch.rs:570\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/poll_dispatch.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fa8f0288c82225ec51ca2b050f6f55ad6086fac7f10e83f1daf45a900cddbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-store/src/agent_task/endpoint_loss.rs:37-42 | crates/webcodex-store/src/goal_stall.rs:374-379 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/agent_task/endpoint_loss.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":"crates/webcodex-store/src/agent_task/endpoint_loss.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5148e5bb42342c0e6ca4150da7f7500d279db03e61cef4612a079c3abb1a21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-store/src/agent_wait.rs:423-428 | crates/webcodex-store/src/agent_wait.rs:632-637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/agent_wait.rs:423\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wait.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"2170fe85121cd2e34300823d3f1a77d93cb0a8a2784e465e31ee5bc3c5447710"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-store/src/communication.rs:2505-2510 | crates/webcodex-workflow-session/src/persistence/database.rs:346-351 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/communication.rs:2505\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":2505}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ea4e19abcf2fa5fc3b0389ce6255ed6d1aa1bc67fcd5636ff2ccd7044cf166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-store/src/goal.rs:325-333 | crates/webcodex-store/src/goal.rs:429-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/goal.rs:325\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-store/src/goal.rs:334\u0060 calls \u0060Some\u0060, \u0060as_deref\u0060, \u0060require_owned_controller_agent\u0060 and \u0060crates/webcodex-store/src/goal.rs:438\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81d6daee16858a336251c5d9b95b5b537433b347d66c322a8d15c86f45c292e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-store/src/window_collaboration.rs:227-239 | crates/webcodex-store/src/window_collaboration.rs:283-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/window_collaboration.rs:227\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060input\u0060 to \u0060NewWindowOperatorMessage\u0060 in one and \u0060NewWindowModelReply\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/window_collaboration.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fd0a7fedb3e1794d28e61e679041e8b98de4a166f97c9b6fab5ed83343ea3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-validation/src/adapters/go.rs:120-125 | crates/webcodex-validation/src/adapters/go.rs:187-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-validation/src/adapters/go.rs:118\u0060 calls \u0060push\u0060, \u0060Value\u0060 and \u0060crates/webcodex-validation/src/adapters/go.rs:185\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/adapters/go.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf914e6dce99e6f3f5f2c13a385bc542a4ab512ba6a9a005887a03717d9c2a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/auth/middleware.rs:369-374 | src/auth/middleware.rs:494-499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/auth/middleware.rs:369\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/middleware.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"17af6dc9201c5ef7503251e4957a95f0aee4e013774372ff4f3e28eac8c07f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/mcp/tools/call.rs:627-632 | src/mcp/tools/call/response.rs:72-77 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/mcp/tools/call.rs:627\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcdd1323d714c5278aa4dd4f7a59218fd973551e1f26804b1f920e25f157b5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/plugin_gateway.rs:58-69 | src/ssh_resource_gateway.rs:77-88 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060PluginBinding\u0060 in one and \u0060Binding\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":"src/plugin_gateway.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f660a90e5c4510caf003a50f0679927d3ec1a7413249831dba729e3a6a8023a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/runtime_http.rs:291-296 | src/runtime_http.rs:385-394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/runtime_http.rs:385\u0060 it does not close everything it opens, so those exact 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":"src/runtime_http.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"26edb7350a9b13546162574e91bbff7d1df8e9a25ed4dd04527c5aac4520d086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): src/tool_runtime/files/mutations/patch_result.rs:146-151 | src/tool_runtime/files/mutations/patch_result.rs:491-495 \u2014 both copies are in the same file, so extract the block 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":"src/tool_runtime/files/mutations/patch_result.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48885c196a843d2d6d6b70c771bf1915b1fe95f28a773a4fab325da63b05510"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tool_runtime/git/mutations.rs:199-204 | src/tool_runtime/git/mutations.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 \u0060src/tool_runtime/git/mutations.rs:199\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/mutations.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a5b39de77a8183425559a0077980d30c5b8e0438cff592a8b7012b4a85114a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tool_runtime/work_result.rs:782-787 | src/tool_runtime/work_result.rs:881-886 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tool_runtime/work_result.rs:781\u0060 calls \u0060get\u0060, \u0060and_then\u0060 and \u0060src/tool_runtime/work_result.rs:880\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":"src/tool_runtime/work_result.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdb4d8823ee4783a3311f7798d6a8f694cc7a83e51474193cc00ee53fc32758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/webcodex-lsp/src/supervisor.rs:520-524 | crates/webcodex-lsp/src/supervisor.rs:568-572 | crates/webcodex-lsp/src/supervisor.rs:588-592 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa77e79bd2c8fe6c5efb81ca8e2c3a7986d1be85032be0c55e570cf1bdf9623"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/cloudflare_ingress.rs:1215-1219 | src/cloudflare_ingress.rs:1271-1275 | src/cloudflare_ingress.rs:1294-1298 \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 \u0060src/cloudflare_ingress.rs:1215\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":"src/cloudflare_ingress.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4c449f8b09f1abae5415a95466dc0c6b082bd80f1d2ccfcd4ab6c8d701a8ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/tool_runtime/computer_tools/input_receipts.rs:86-91 | src/tool_runtime/computer_tools/input_receipts.rs:118-123 | src/tool_runtime/computer_tools/input_receipts.rs:291-296 \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":"src/tool_runtime/computer_tools/input_receipts.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec00e8ce01f043cc159552e1709a6418f3930a8f6dc91f9074e257ecb8054765"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/desktop/src-tauri/src/coding_agents.rs:303-308 | apps/desktop/src-tauri/src/mcp_providers.rs:518-523 \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":"apps/desktop/src-tauri/src/coding_agents.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cac56479ed942fc20593bcd1811b00aec96da1583a67d57c58a3d7a355a2d16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/desktop/src-tauri/src/diagnostics.rs:138-143 | apps/desktop/src-tauri/src/diagnostics.rs:144-149 \u2014 both copies are in the same file, so extract the block 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":"apps/desktop/src-tauri/src/diagnostics.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca1e16f553c18732b982459c28b3bab292992547022357d0ebce93528f260c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apps/desktop/src-tauri/src/runner_capability_grant.rs:146-150 | crates/webcodex-lsp/src/supervisor.rs:1496-1500 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"apps/desktop/src-tauri/src/runner_capability_grant.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9173315f0f2d74c6f296714ee7a6d4751a57527cbbc16f59041d7bb8353f459b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-browser/src/supervisor.rs:580-584 | crates/webcodex-browser/src/supervisor.rs:694-698 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-browser/src/supervisor.rs:580\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4d83d2bea806f794fcc2fcd8ad87f0bc5007c90152853803dd415b9afce091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-cli/src/main.rs:2-7 | src/bin/webcodex-server.rs:31-36 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/main.rs:2\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/main.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7217ec90899bfbd9cf4786aab74284cae9df6dc1065826405ef48d19ea0fa198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/connect/mod.rs:117-122 | crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:572-576 \u2014 before extracting anything, compare \u0060crates/webcodex-cli/src/webcodex_cli/connect/mod.rs\u0060 and \u0060crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs:577\u0060 calls \u0060join\u0060 and \u0060crates/webcodex-cli/src/webcodex_cli/connect/mod.rs:123\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/mod.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaada9e484be310acbc4597372cc18d6179b63fa14f0e2417eee44ada91caf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/connect/process.rs:227-233 | crates/webcodex-runner/src/webcodex_runner/computer_session/platform/windows.rs:103-107 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/process.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0791f495551d4113b6ae2733c1b907a6d884b085060cf23eec537b70709ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/service.rs:527-531 | crates/webcodex-cli/src/webcodex_cli/service.rs:624-628 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-cli/src/webcodex_cli/service.rs:525\u0060 calls \u0060filter\u0060, \u0060as_os_str\u0060, \u0060is_empty\u0060 and \u0060crates/webcodex-cli/src/webcodex_cli/service.rs:622\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"1484f0cb9a61a3d306875e258e7947db0b382a4ae4e2d4a19b034a7dd9d6539d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-environment/src/privilege.rs:43-47 | crates/webcodex-environment/src/privilege.rs:125-129 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/privilege.rs:43\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd95b438fac1891a2332ddbeed431e0a4667ef5ff23c7a536950d1ee7f03a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-environment/src/unified_update/data_dir.rs:155-159 | crates/webcodex-runner/src/webcodex_runner/validation/path.rs:62-68 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/unified_update/data_dir.rs:155\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/data_dir.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"12452c7297c31a068034310ca746f40cc4e85fae044f989390def478b6b00fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:1167-1174 | crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:1331-1338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"130420c97d041ac45b5932ed0f652f13dcb3787a9f81ebdf1af72a0ffa89e0f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs:503-508 | crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs:396-401 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8217053f6859c69cff4bac887b4b85e99aa8e2134a2c5ba3866970fb957fbe8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1162-1166 | crates/webcodex-runner/src/webcodex_runner/skill_store.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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc2240713dcbd6e6997391bee7b8893bec4018401ea2b425f5917036b9fc6a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1887-1891 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1931-1935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1930\u0060 calls \u0060replace\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1886\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be77cc0d1b649438e6cd31a9fa18da5d299dd9ba5961629acce46e6a33e7700"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/quic.rs:337-342 | crates/webcodex-runner/src/webcodex_runner/transport/websocket.rs:152-157 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/transport/quic.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/transport/websocket.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport/quic.rs:337\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/quic.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7657518abc879a4b819d52898ae2f30db0373ded8314eda8396d250fbdfa96ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-store/src/communication.rs:745-750 | crates/webcodex-store/src/communication.rs:1982-1987 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/communication.rs:745\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dda86f895e66935d6dd26c2e918e3bf63d59fea8b106b9a8127d21844895591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-store/src/goal.rs:1548-1553 | crates/webcodex-workflow-session/src/persistence/database.rs:343-347 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/goal.rs:1548\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cc191343466b34843acb70a3c33eeccded1f9061b6a6179361c55522575b03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-store/src/peer_collaboration.rs:648-652 | crates/webcodex-workflow-session/src/store.rs:2714-2718 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-workflow-session/src/store.rs:2712\u0060 calls \u0060finalize\u0060 and \u0060crates/webcodex-store/src/peer_collaboration.rs:646\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/peer_collaboration.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd2ff09205972e3cedc7cfbb132bed34f2e8be86c150ec3bdecfc22fe976847"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-store/src/window_activity.rs:172-176 | crates/webcodex-store/src/window_activity.rs:284-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/window_activity.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"33436a2d680ad63b12a841c9b035403e966e9ee68a3e2b97782528315e788d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/runner_http/handlers.rs:299-303 | src/runner_http/handlers.rs:368-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 \u0060src/runner_http/handlers.rs:299\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":"src/runner_http/handlers.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"8259c18eecad0de6e1897cf122494934229e0fa2ccba9174a054b25cbc76eef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/runtime_console_http/workspace.rs:55-59 | src/runtime_console_http/workspace.rs:104-109 \u2014 both copies are in the same file, so extract the block 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":"src/runtime_console_http/workspace.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6adfbf4af2a4c46972e1c0e364e9bcaea246ab8139c275fea36b1812ed3e81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apps/desktop/src-tauri/src/platform/windows.rs:38-42 | crates/webcodex-runner/src/webcodex_runner/config.rs:1231-1235 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060path\u0060 to \u0060Option\u003C\u0026OsStr\u003E\u0060 in one and \u0060Option\u003C\u0026std::ffi::OsStr\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":"apps/desktop/src-tauri/src/platform/windows.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"059d09ebbb7f9fdbedd35620e3aed1f4cf994d9320f8e09879be5cc4de054180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/desktop/src-tauri/src/webcodex/settings/acp.rs:190-195 | apps/desktop/src-tauri/src/webcodex/settings/mcp.rs:165-170 \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":"apps/desktop/src-tauri/src/webcodex/settings/acp.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c2d133f0b53774c9ba424696ae514a1d157b8ebc1e765094e85bb01e561a17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-admin/src/commands.rs:33-39 | crates/webcodex-cli/src/lib.rs:1348-1354 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"62de805e60ef67f469fd305bcb7111cd8341456f7672b2b29e44b727b19c414c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs:110-116 | src/oauth_http/shared_key_bridge.rs:91-97 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33f86d9673a8b966ea60ab965936db70033802014fabab4c77cb326de2a3cae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/webcodex-cli/src/webcodex_cli/tokens.rs:31-35 | crates/webcodex-runner-registry/src/validation.rs:788-792 | src/auth/pat.rs:28-32 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/tokens.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4821a16a9f61c50618152984861ee60dff92bf2d64fb39f6a6ad8df37f4bed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-computer/src/lib.rs:48-54 | src/tool_runtime/computer_tools/inputs.rs:50-56 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4206f65473430664f1be5bc697857c7e3942f2d8e07921fb9d89f76b9755f9ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-computer/src/lib.rs:56-62 | src/tool_runtime/computer_tools/inputs.rs:58-64 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8226091767d73eff3b08da146efd7069f78f89702489283301488e0f42d5461e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-computer/src/lib.rs:2217-2223 | src/tool_runtime/computer_tools/effects.rs:591-597 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":2217}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3b98d1f59a2e963033639459de9d17e20950e22c6e9136a51df05189e685f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/webcodex-core/src/apply_edits_shared.rs:469-474 | crates/webcodex-core/src/project_instructions.rs:566-571 | crates/webcodex-core/src/runner_instruction.rs:132-137 | crates/webcodex-store/src/artifact_handoff.rs:1058-1063 | crates/webcodex-store/src/external_observations.rs:30-35 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_edits_shared.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8eea5415113933826e6e5803aaa27e9a6cbc1c417ce319031c1bfc37ec53cd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-core/src/mcp_gateway.rs:715-723 | crates/webcodex-core/src/plugin.rs:1521-1529 \u2014 before extracting anything, compare \u0060crates/webcodex-core/src/mcp_gateway.rs\u0060 and \u0060crates/webcodex-core/src/plugin.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b97eeb89e9af690479c2a8efdc9f9062b00cfd4af4f514f9d1ca7d3c0d29de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/webcodex-core/src/skill_store.rs:113-118 | crates/webcodex-workspace/src/file_read_range.rs:556-561 | src/tool_runtime/skills.rs:2666-2671 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/skill_store.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a49952503b2a88ab86325e4520fc6817cac58ecf311174340bda75b8ff722e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-environment/src/storage.rs:248-258 | crates/webcodex-environment/src/unified_update/cache.rs:45-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c028bd6a5a81deba7c9d37176e5d5754f931421d9d381ffe36da0ae5f180ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-environment/src/unified_update.rs:362-367 | src/tool_runtime/git/shared.rs:1-6 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4903fc82ba21848f2b278f05436ad86d70ff2f57ff93a79cb1889d2c9813bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-environment/src/upgrade/status.rs:83-89 | crates/webcodex-workflow-session/src/task_context.rs:186-192 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/status.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a47fe8fe7280f5ecfd9965614714d351046fcbe35bd44cb3649f624c7599b1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-lsp/src/fake_server.rs:891-897 | crates/webcodex-runner/src/webcodex_runner/fake_claude_mcp.rs:314-320 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"95232d02eecc0e95c30c2c8ad13ee53bc9c1816d300867ea70a5274189d2a3b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-persistent-shell/src/unix.rs:124-129 | crates/webcodex-persistent-shell/src/windows.rs:42-47 \u2014 before extracting anything, compare \u0060crates/webcodex-persistent-shell/src/unix.rs\u0060 and \u0060crates/webcodex-persistent-shell/src/windows.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"82488361a9132af74dc9b036fd3cbb7e509f3ca58ffadf556e4eac6dcc6a243f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-persistent-shell/src/unix.rs:197-201 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:388-392 \u2014 before extracting anything, compare \u0060crates/webcodex-persistent-shell/src/unix.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/remote_shell.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef01fcb817924db03e8370ab21035776b6b59b16b5cd1219bce59a96d9310e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-runner-registry/src/validation.rs:653-657 | crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:50-54 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"820382666719f89e5e1decf7c51071b07db74843ed8698c350a9bf7988a71f52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-runner-registry/src/validation.rs:659-663 | crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:527-531 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf85e96b310bac194524c3268f300022672f804d1f05c2ca02dfc46e423ce6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/webcodex-runner/src/webcodex_runner/configured_skills.rs:631-635 | crates/webcodex-runner/src/webcodex_runner/files.rs:13-17 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:2042-2046 | crates/webcodex-workspace/src/project_context.rs:1109-1113 | crates/webcodex-workspace/src/workspace_checkpoint.rs:871-875 | src/tool_runtime/files.rs:88-92 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/configured_skills.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"9042fcfde88de79356688978cd909e682bdb2704a884e42f57948cbab248366c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs:485-494 | crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs:384-393 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fdc169b4f5d5b9373054075c92595fad1af2eb57ef4030be616b3750d484e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/files.rs:137-145 | crates/webcodex-runner/src/webcodex_runner/files.rs:502-510 | crates/webcodex-runner/src/webcodex_runner/runner_skills.rs:505-513 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060code\u0060 to \u0060\u0026\u0027static str\u0060 in one and \u0060\u0026str\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/files.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd04b687edeffb529f6679709fad1c7e40c8e277b9ca3318267b1c9f6a0cc80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/files.rs:303-310 | crates/webcodex-workspace/src/file_read_range.rs:162-169 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/files.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"154c6c3e2bb01c89ae1e7e10b9febb74ff4867b6abcb44ee8b3566a31b2caf4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/output_text.rs:447-454 | crates/webcodex-runner/src/webcodex_runner/shell/output.rs:40-47 | crates/webcodex-workspace/src/file_read_range.rs:280-287 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/output_text.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3ecab1311d78bfff82916b6d3142501d65747e734b1260bbfba6f7f53d6f5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/projects/registration.rs:174-182 | src/tool_runtime/projects.rs:1518-1526 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/projects/registration.rs\u0060 and \u0060src/tool_runtime/projects.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/registration.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e90439c3ca67c06e0e8a9aabd96dc0c86551246a71f3e6076329f6e75b521c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/metrics.rs:36-49 | src/runner_http/telemetry.rs:42-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/metrics.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2db325d5027a6e0fe9333e8cc07a810f237fed6db7c970f901b0f7a75cc8646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-store/src/activity.rs:249-256 | src/workspace_activity_store.rs:75-82 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/activity.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd9991bffe6223f6aa3ac76852cd46d0f8e0539784a3e26a5e6c4c20cadd79a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-tool-runtime-contracts/src/tool_audit/result.rs:279-283 | src/tool_runtime/observe_jobs.rs:729-733 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/result.rs:279\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060key\u0060 to \u0060\u0026\u0027static str\u0060 in one and \u0060\u0026str\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/result.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cf9dee2ef72267b3a76df7382e7ba472fe9c08f5c378b09d5cac8832c55797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/webcodex-workflow-session/src/continuation.rs:2022-2026 | src/tool_runtime/closeout_facts.rs:401-405 | src/tool_runtime/git/show_changes.rs:2011-2015 | src/tool_runtime/hygiene.rs:542-546 | src/tool_runtime/startup_brief.rs:1078-1082 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/continuation.rs"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"718f9d1ff0526abab4ca3b532b7583e79606690336524000c74bb0cfa21de8cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/webcodex-workflow-session/src/events.rs:1000-1006 | crates/webcodex-workspace/src/workspace_checkpoint.rs:858-864 | src/tool_runtime/checkpoint.rs:858-864 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f6c883870849577c1bb622275e9172ebd3b06cd0e918b0b72231071e48e463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-workflow-session/src/handoff_brief.rs:392-400 | src/json_measurement.rs:9-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":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78558d412e76c8f787226c1418eacdfd883333c859c8fb36c13a0bbba53be33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-workflow-session/src/util.rs:169-179 | src/tool_runtime/handoff.rs:848-858 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/util.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"05814574d0dbef1dd2afa83487843e46cb7a35d0e1c66d35d9f645394dffd4f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/mcp.rs:409-415 | src/tool_runtime/job_audit.rs:153-159 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/mcp.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ebe4ad177099f91c635a461270d455a951e69564e428367dc41a4c986e8108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/mcp_gateway.rs:665-671 | src/plugin_gateway.rs:1219-1225 \u2014 before extracting anything, compare \u0060src/mcp_gateway.rs\u0060 and \u0060src/plugin_gateway.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"src/mcp_gateway.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af7022f1e64372a72b8e36570c09cd413b460d02673a3f25aceb9955e4738a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/mcp_gateway.rs:697-706 | src/plugin_gateway.rs:1299-1308 \u2014 before extracting anything, compare \u0060src/mcp_gateway.rs\u0060 and \u0060src/plugin_gateway.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"src/mcp_gateway.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"69224dad17dfbf939f9f91a383ed84f143c916a1fe3af46fc569ea05a779c2f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/plugin_gateway.rs:79-86 | src/ssh_resource_gateway.rs:98-105 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugin_gateway.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"70587fe9500e33ea9aeb3785c61253670d5d97d15c89b878813293ee740e69af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/plugin_gateway.rs:88-95 | src/ssh_resource_gateway.rs:107-114 \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":"src/plugin_gateway.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"413b6b4adb3900a5e8637fe1c12d1b693d765cad2ac225022a1af92a97651aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/runtime_console_http/store_read.rs:162-166 | src/runtime_console_http/window_queries.rs:56-60 \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":"src/runtime_console_http/store_read.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b95d646c294b66edc258505db73617f7570d4f61c50ecb63cea4dc631f53b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tool_runtime/agent_task.rs:41-50 | src/tool_runtime/communication.rs:55-64 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/agent_task.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1141819f8dca5a476a88de5bb891f2d68b1dbf9b5bb47437a62bba1c7e4fa7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tool_runtime/changes.rs:1432-1437 | src/tool_runtime/coding_task/observations.rs:368-373 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/tool_runtime/changes.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dedbf682f0c192c8fe709d8cb677d85cce56e3b7711942c2d2d098af9ba189"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tool_runtime/git/show_changes.rs:2438-2449 | src/tool_runtime/handoff.rs:945-956 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65e716e376b84c73e0d4282094b6f6342d83f745ec203dcc5e2406913a5ece2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-core/src/lsp_bridge.rs:560-570 | crates/webcodex-core/src/validation_bridge.rs:198-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/lsp_bridge.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"1953cdb05a1c701880060c3cede7185ee2894fc170ffdab6c452f53436d0d255"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-core/src/mcp_gateway.rs:257-266 | crates/webcodex-core/src/plugin.rs:409-418 \u2014 before extracting anything, compare \u0060crates/webcodex-core/src/mcp_gateway.rs\u0060 and \u0060crates/webcodex-core/src/plugin.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/mcp_gateway.rs:257\u0060 it begins part-way through the construct above it, so those exact 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 \u0060dispatch_state\u0060 to \u0060McpGatewayDispatchState\u0060 in one and \u0060PluginDispatchState\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b87b417937af3a7a0893a8c2a3c875b8403d8c5a2099868e13cf7e1c99c1a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-core/src/sensitive_paths.rs:116-120 | crates/webcodex-workspace/src/path_policy.rs:45-49 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/sensitive_paths.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"174244ef543ffd0eb159b11808882ec2e78c2afa6e4d72ad7aca36e6e40891bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-persistent-shell/src/windows.rs:105-109 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:307-311 \u2014 before extracting anything, compare \u0060crates/webcodex-persistent-shell/src/windows.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/remote_shell.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/windows.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"67282e9da031c4af1e66295330a38fc97a0b91ee44b844d3288db97fd1ba5fe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/plugin.rs:961-970 | src/tool_runtime/git/diff_hunks.rs:584-593 | src/tool_runtime/startup_catalog.rs:213-222 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20c56e90cdfb208c4b816ae5c1b757843c1febd4f9b44ab1cc43faf2fdb05fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/quic.rs:13-22 | crates/webcodex-runner/src/webcodex_runner/transport/websocket.rs:19-28 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/transport/quic.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/transport/websocket.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport/quic.rs:13\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/quic.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e85dc830c0a2e04c0f94726bb156c7c12d1cc1d524e59c68346d32a5a2248e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-store/src/peer_collaboration.rs:300-312 | crates/webcodex-store/src/window_collaboration.rs:446-458 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/peer_collaboration.rs:300\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/peer_collaboration.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f358eaf2b29cff4f50252188a31a96290b3a8334cb802ba62b146e0b0e59a529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/mcp_gateway.rs:97-104 | src/plugin_gateway.rs:123-130 \u2014 before extracting anything, compare \u0060src/mcp_gateway.rs\u0060 and \u0060src/plugin_gateway.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"src/mcp_gateway.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9b46df600742de0c24a275cfc4004042c1c17eddb053d5a44e962bf0652a1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tool_runtime/result_projection/reads.rs:7-13 | src/tool_runtime/result_projection/searches.rs:8-14 \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":"src/tool_runtime/result_projection/reads.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc63b4ca34924357841a47d0adf08a1f0fb9825d989c4a2d5c44a1ca9242920"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/webcodex-store/src/agent_task/invariants.rs:176-199 | crates/webcodex-store/src/agent_task/invariants.rs:206-229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/agent_task/invariants.rs:176\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/invariants.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1965e0e97c1b86256fe6fbab86ca88a8036214eab766d0b8b26c8f15b041c92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): crates/webcodex-store/src/agent_continuation_reference.rs:70-111 | crates/webcodex-store/src/agent_task_attempt_reference.rs:110-151 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/agent_continuation_reference.rs:70\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_continuation_reference.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cb40b4e16fe6c11ee6695a5ef2b65fad1180a68eb767856fd514bba1afe432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/project.rs:678-698 | crates/webcodex-cli/src/webcodex_cli/project.rs:711-731 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/project.rs:678\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32948622bda7432f7800c33b03b6ae6b95e14eda50ee73ae673dbfcf3bc2b65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/oauth_http/project_share.rs:97-117 | src/oauth_http/shared_key_bridge.rs:482-502 \u2014 before extracting anything, compare \u0060src/oauth_http/project_share.rs\u0060 and \u0060src/oauth_http/shared_key_bridge.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 112 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 \u0060src/oauth_http/project_share.rs:97\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":"src/oauth_http/project_share.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f54dfc854a9f48e834ad5c2d38d45be4a2ee43023720ec209cfa58067eb9d25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/project.rs:902-922 | crates/webcodex-cli/src/webcodex_cli/project.rs:929-949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/project.rs:902\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"921a12e25f174dcc3690adee86b5414ea90056900a699ffd2d577d172f29001e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/webcodex-computer/src/platform/macos/accessibility.rs:72-91 | crates/webcodex-computer/src/platform/macos/accessibility.rs:96-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-computer/src/platform/macos/accessibility.rs:72\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfdb4b5187768fa2e91844695b9ed7bd66f88807dbe163d45874e55506ec098"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/oauth_http/managed_authorize.rs:1027-1045 | src/oauth_http/managed_authorize.rs:1048-1066 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/oauth_http/managed_authorize.rs:1027\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":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"58eacabc713a12e9d83c9c3e59d7710a26e598216bdc1ceadce51bb1cb8a4753"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-store/src/communication.rs:3027-3044 | crates/webcodex-store/src/window_collaboration.rs:129-138 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/communication.rs:3027\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":3027}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcbef02e9c95817b9e1075ef200c27d0c4061358d58962145e8551c1640b320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/webcodex-cli/src/webcodex_cli/ops.rs:244-261 | crates/webcodex-cli/src/webcodex_cli/ops.rs:267-284 | crates/webcodex-cli/src/webcodex_cli/ops.rs:294-311 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/ops.rs:244\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-cli/src/webcodex_cli/ops.rs:286\u0060 calls \u0060smoke_preflight_target_ready\u0060, \u0060find_project\u0060, \u0060Some\u0060 and \u0060crates/webcodex-cli/src/webcodex_cli/ops.rs:312\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/ops.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a38c729e570ee2fdc9fddce90a0d0a2caca3e4ab320c8ada905fe6792495db6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): crates/webcodex-cli/src/webcodex_cli/ops.rs:244-261 | crates/webcodex-cli/src/webcodex_cli/ops.rs:267-284 | crates/webcodex-cli/src/webcodex_cli/ops.rs:294-311 | crates/webcodex-cli/src/webcodex_cli/ops.rs:318-335 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/ops.rs:244\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-cli/src/webcodex_cli/ops.rs:286\u0060 calls \u0060smoke_preflight_target_ready\u0060, \u0060find_project\u0060, \u0060Some\u0060 and \u0060crates/webcodex-cli/src/webcodex_cli/ops.rs:312\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/ops.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"269c7f97e9ef7354968f7a6332b30029af15a403ec3d13496dc1794ce404d9fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:318-333 | crates/webcodex-runner/src/webcodex_runner/validation/execute.rs:328-343 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/validation/execute.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:318\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64a2db570d634a50abe80db8563b43d8bd90e468e2bfd2dae9635df6d39f44f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/detached_job/store.rs:152-164 | crates/webcodex-runner/src/webcodex_runner/detached_job/store.rs:181-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/store.rs:152\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/store.rs:141\u0060 calls \u0060is_none\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/store.rs:179\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/store.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f68ced8365762ed9ee4bace6c380f2118a82cdad937e9593185ee93a173c28a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs:281-294 | crates/webcodex-runner/src/webcodex_runner/validation/execute.rs:289-304 \u2014 before extracting anything, compare \u0060crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/validation/execute.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/projects/catalog.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":"crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b591f49cd395b5e307d83615324298fc7c3fd6932a21bf54280ab47598c6f0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/tool_runtime/coding_task/observations.rs:267-282 | src/tool_runtime/files/inspection.rs:1167-1182 | src/tool_runtime/files/inspection.rs:1447-1462 \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 \u0060src/tool_runtime/coding_task/observations.rs:267\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":"src/tool_runtime/coding_task/observations.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d578d373c9b82565cbd6fe0fe81d5d83f1f4b6602a4747079e3b45554e1df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-store/src/window_activity.rs:77-91 | crates/webcodex-store/src/window_activity.rs:385-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 \u0060crates/webcodex-store/src/window_activity.rs:77\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-store/src/window_activity.rs:383\u0060 calls \u0060fetch_add\u0060 and \u0060crates/webcodex-store/src/window_activity.rs:75\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/window_activity.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bde0d84aa14a14600c98628019fbfcaeb44ecc81d75ae94b28c88cfb3a7f7af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tool_runtime/coding_task/project.rs:197-211 | src/tool_runtime/coding_task/project.rs:229-242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/coding_task/project.rs:197\u0060 it begins part-way through the construct above it, so those exact 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":"src/tool_runtime/coding_task/project.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7434912a7ad2bb97489aa289b83f2286b25e8eda611becbda7a6201fc17a7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-store/src/audit.rs:44-55 | crates/webcodex-store/src/audit.rs:99-113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/audit.rs:44\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/audit.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc3c28464c738036a449c0c6b3f3dae242e003d784a4feb98a83dac1976ca14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:135-149 | crates/webcodex-runner/src/webcodex_runner/exit_diagnostics.rs:400-412 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs:135\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5455f61a4889c67d6d7221c8352127782fac2affe3ea8948b8a408081674e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:1407-1421 | crates/webcodex-runner-registry/src/requests.rs:1615-1629 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:1407\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1116a9753f40ac831909bfc446718a71038bf52d2f06e91a72bad96d633e54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tool_runtime/coding_task/project.rs:484-498 | src/tool_runtime/coding_task/project.rs:500-513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/coding_task/project.rs:484\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/tool_runtime/coding_task/project.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"055dd392a6d27937cbb19b6a3ee18fb20c8861b966d10b5379376612286ce319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/ssh.rs:351-365 | crates/webcodex-runner/src/webcodex_runner/ssh.rs:479-490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/ssh.rs:351\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ac77f1b348a14d98e52a3d03937c1a6e47a51eb6a2cb41691ebc69b283176b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/system.rs:259-273 | src/project_entry_windows.rs:204-217 \u2014 before extracting anything, compare \u0060crates/webcodex-cli/src/webcodex_cli/system.rs\u0060 and \u0060src/project_entry_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/system.rs:259\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9b035707b191e5172b725555e170c092f6f80ea5b0207a64a02d70a80ebc61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:1183-1197 | crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:1203-1217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:1200\u0060 calls \u0060as_deref\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:1180\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a706b1032c80b5ec45f5bcaa934d6af2f2968544c151fa7f874dd8bfbe23ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tool_runtime/browser_tools.rs:303-316 | src/tool_runtime/browser_tools.rs:318-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/browser_tools.rs:303\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":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b52d1db82c8fb3714d16ffcd9b58622195faa094792366a66fa3ef2efb8a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:469-482 | crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:557-570 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs:469\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/request.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef79c90410f62732c916b6977156a5741561fb01e370a03c50123563bc4be499"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:431-444 | crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:553-566 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs:431\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"0403fa563c23dd941d92da54272ae5cd79fa6bf0c0daaeef3e37e35e20a946de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tool_runtime/browser_tools.rs:557-570 | src/tool_runtime/browser_tools.rs:767-780 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/browser_tools.rs:557\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":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c3120d089eca396ba785d1651f4b4f04abc0df2ad43e3605c8f298d864273f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/config.rs:1981-1993 | crates/webcodex-runner/src/webcodex_runner/config.rs:2143-2155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/config.rs:1981\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eda2d39ec0fbadfbf15a3db9bc44332fd0eb474f43cb195d0208348e8be984c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-environment/src/service/windows.rs:90-102 | crates/webcodex-environment/src/service/windows.rs:656-668 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/service/windows.rs:90\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/windows.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdab31252b191900ad91a0f59d436d8dc77b20da7c21a0f1a94ad571ca96d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:2093-2103 | crates/webcodex-runner-registry/src/requests.rs:2303-2315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:2093\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb831363ab41851b38fda4a3b114391366eea512e659cc73092dfa093545676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:252-261 | crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:293-305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/shell/execution.rs:252\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/execution.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c72670d15433fdd3d1c9e2ae7d1b3b6fda18250aff48ddfefea0dd3fd1407b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/tool_runtime/process.rs:585-597 | src/tool_runtime/process.rs:914-926 | src/tool_runtime/script.rs:115-127 \u2014 before extracting anything, compare \u0060src/tool_runtime/process.rs\u0060 and \u0060src/tool_runtime/script.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 104 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":"src/tool_runtime/process.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96a507837e818e3657364c87755a0847db0bef170be1ae3dbc861c81efee840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-lsp/src/fake_server.rs:187-199 | crates/webcodex-lsp/src/fake_server.rs:201-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7324bcb61b03a1d5bc2831cfa7c031d27563dad034f90048f25432fe6700fdd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/config.rs:1749-1761 | crates/webcodex-runner/src/webcodex_runner/config.rs:1845-1856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/config.rs:1749\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe2b562d0836b5f5b59f50e3120d931175fc476255a1c93a7eb59abf273b130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs:22-34 | crates/webcodex-runner/src/webcodex_runner/job_manager/detached.rs:17-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs:22\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"107a7a393f3df9a36a2f48c59bfe732a9d1b6464f7eb1373f2ab03caf85aba68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/mcp.rs:1227-1239 | src/mcp.rs:1255-1267 | src/mcp.rs:1297-1309 \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 \u0060src/mcp.rs:1227\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":"src/mcp.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b35493d9026b699028c679a804814c6e540d08642cda4ab6b2026e9474a188a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-store/src/agent_attention.rs:278-290 | crates/webcodex-store/src/agent_task/invariants.rs:336-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 \u0060crates/webcodex-store/src/agent_attention.rs:278\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-store/src/agent_task/invariants.rs:335\u0060 calls \u0060validate_id\u0060 and \u0060crates/webcodex-store/src/agent_attention.rs:277\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_attention.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b45dfa3345a156f1c8b0f852dfc16db6d8086ca246acf6de92bae1ed652717"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/webcodex-store/src/oauth.rs:586-608 | crates/webcodex-store/src/oauth.rs:966-988 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/oauth.rs:586\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de2ea5b7937002617566b7f7162495ecd326be5aa467cdaa8257a5bd5a10e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-store/src/goal.rs:782-794 | crates/webcodex-store/src/goal.rs:1179-1191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/goal.rs:782\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d3d206c401a99bd4374582dbd192c1d32eaafd690b1e43cdc9bb0c8e5da72d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/webcodex-core/src/runner_operation.rs:2389-2397 | crates/webcodex-core/src/runner_operation.rs:2403-2414 | crates/webcodex-core/src/runner_operation.rs:2420-2431 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/runner_operation.rs:2389\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":2389}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe65b62850850ae03698bba9a66c17ca368d95e25c3baacd430839b65fc6f16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-computer/src/platform/macos/accessibility.rs:1219-1230 | crates/webcodex-computer/src/platform/macos/accessibility.rs:1294-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-computer/src/platform/macos/accessibility.rs:1219\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"632ca45683da94eedd4fc07f5e74bc289ed4b3859f01d5e9683b2c5b64397479"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-store/src/oauth.rs:434-445 | crates/webcodex-store/src/oauth.rs:493-504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e6c9788124f720a8394f838d6aca7b06212eca53a426b78b6c26a548068988"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs:398-409 | crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs:466-474 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs:398\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/setup.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43d96fcb8a47afd5ac3f95dec5110a6675f33a9a06f29462b5ffbb898c6f69c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-environment/src/service/linux.rs:125-136 | crates/webcodex-environment/src/service/macos.rs:114-125 \u2014 before extracting anything, compare \u0060crates/webcodex-environment/src/service/linux.rs\u0060 and \u0060crates/webcodex-environment/src/service/macos.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/service/linux.rs:125\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"547f5fa4a4d8b54e5daa60fffac413755464d8b1eaad606e9421d3d60a1661fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-store/src/communication.rs:1402-1413 | crates/webcodex-store/src/communication.rs:1453-1464 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/communication.rs:1402\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e30982a9ec5f9423b3cc87d3069ed588fadf4ad0656d5a6eec23d6b6d44cb9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-store/src/communication.rs:1164-1175 | crates/webcodex-store/src/communication.rs:1212-1223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/communication.rs:1164\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f14c25a0c79aacfdaa6a343cab1c2167a68d36d847864a7a468c423edbd93a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tool_runtime/session_shell.rs:619-630 | src/tool_runtime/session_shell.rs:681-692 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/session_shell.rs:619\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_shell.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c053122d0b622b915e013f8bed38ffd8857e2d61404da1c2ee0fa3257dbfc8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tool_runtime/computer_tools/snapshot_receipts.rs:151-162 | src/tool_runtime/computer_tools/snapshot_receipts.rs:362-373 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/computer_tools/snapshot_receipts.rs:151\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":"src/tool_runtime/computer_tools/snapshot_receipts.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"011f59eb9b8acdd3817888230b52b31cbab2e68abb8aa0e67e8786532f0e9512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:573-584 | crates/webcodex-cli/src/lib.rs:980-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/lib.rs:573\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"323e5d4c9316217b9021760c3aea4031b31c84958441e964156d25966ddc9f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-store/src/oauth.rs:819-830 | crates/webcodex-store/src/oauth.rs:880-891 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7179c0883653a0b9e11f76edf578743f3dd65967cf40567aff3eccbd5ffedbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/polling.rs:113-124 | crates/webcodex-runner/src/webcodex_runner/transport/polling.rs:129-140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport/polling.rs:113\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/polling.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5e6a7d13c178601cc418c77399485bccc1ddc1968f0ad4599c35e1ef917723"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/quic.rs:317-326 | crates/webcodex-runner/src/webcodex_runner/transport/stream.rs:169-179 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport/quic.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":"crates/webcodex-runner/src/webcodex_runner/transport/quic.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f88f657192c310397490bf5cd5787c5cdc7891ed9a45d96c88919a14e60a71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/webcodex-persistent-shell/src/unix.rs:55-65 | crates/webcodex-persistent-shell/src/windows.rs:139-149 | crates/webcodex-runner/src/webcodex_runner/remote_shell.rs:206-216 \u2014 before extracting anything, compare \u0060crates/webcodex-persistent-shell/src/unix.rs\u0060 and \u0060crates/webcodex-persistent-shell/src/windows.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-persistent-shell/src/unix.rs:55\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57d5a94e77eb01ac179c501d05cb5ff4d2164035645456da4b842e50630644e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-store/src/oauth.rs:688-698 | crates/webcodex-store/src/oauth.rs:783-793 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/oauth.rs:688\u0060 it does not close everything it opens, so those exact 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 \u0060record\u0060 to \u0060\u0026OAuthAccessTokenRecord\u0060 in one and \u0060\u0026OAuthRefreshTokenRecord\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb2daf84e257eb95bd04b6af1f5fdc21a11817e185a2a00d3892a15583cde67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-computer/src/lib.rs:1312-1322 | crates/webcodex-computer/src/lib.rs:1373-1383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-computer/src/lib.rs:1312\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cab6afc7d4ede69570272a880e3d32a9b907938628d5d0aa03d8a36266249ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tool_runtime/coding_agent.rs:1228-1238 | src/tool_runtime/dispatch/governance.rs:250-260 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/tool_runtime/coding_agent.rs:1228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa7ecc5066995cd509e44b2598be27fdf3bf2c7b1712e4760a1ba22365ddd64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-workflow-session/src/store.rs:3037-3047 | crates/webcodex-workflow-session/src/store.rs:3127-3137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-workflow-session/src/store.rs:3035\u0060 calls \u0060Err\u0060 and \u0060crates/webcodex-workflow-session/src/store.rs:3125\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3037}}}],"partialFingerprints":{"codehealthFindingId/v1":"201a7ddb8e0263a73e382be527d68e230bca07467d8cd56a3220f679c2989c48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/project_entry_cloudflared.rs:536-546 | src/project_entry_cloudflared.rs:698-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_cloudflared.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"3225783e24a4de02c7c68507417da16080d5181b5356bfc0515ade74bdece9fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1005-1015 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1080-1090 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a52d88c74849fb07a189b7b01cfd1a4352e77e2ba83b387e347ee7dd5e203f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tool_runtime/computer_tools/screens.rs:127-137 | src/tool_runtime/computer_tools/screens.rs:206-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 \u0060src/tool_runtime/computer_tools/screens.rs:127\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/tool_runtime/computer_tools/screens.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d669b337f757ff08eabc574aca1cce43cf9036a282322bb73b019fc1b4bb1811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-core/src/validation_evidence.rs:133-143 | crates/webcodex-core/src/validation_evidence.rs:229-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-core/src/validation_evidence.rs:133\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e61d58fa8f65931ba58b6e4536cc918dcc045906cb535008de7ad93f53cf90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/webcodex-environment/src/service/macos.rs:282-292 | crates/webcodex-environment/src/service/windows.rs:828-838 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/service/macos.rs:282\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/macos.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbf13eda1b3665cef036508ec3782b2178937c085b06f739bd9e9f14314740f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-store/src/accounts.rs:52-61 | crates/webcodex-store/src/accounts.rs:319-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/accounts.rs:52\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/accounts.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc56d314ff04d81a0d703cdc12cae3dcba9be877debed264ce9b9afc46caad5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:235-244 | crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:507-516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:235\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b15b96083a8d3d1a38900b4504b3e9a8f4a97456381afd274550729ea108d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/ssh.rs:948-957 | crates/webcodex-runner/src/webcodex_runner/ssh.rs:989-998 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d78a3560017bda632c8f1fe6dc7f81ad1af3a4d2691beb06c6270784cebf7c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/mcp.rs:746-755 | src/mcp.rs:790-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 \u0060src/mcp.rs:746\u0060 it does not close everything it opens, so those exact 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":"src/mcp.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"466bf038b5bea641ebd02b0881172e78b90435439e639df1dc7d78ff84203db1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:901-910 | crates/webcodex-runner-registry/src/requests.rs:974-983 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:901\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-runner-registry/src/requests.rs:984\u0060 calls \u0060apply_text_edits_capability_requirements\u0060 and \u0060crates/webcodex-runner-registry/src/requests.rs:911\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"22913d52825bac4a107e14af46adcc1b05755c865426f9da079bf7c3da7ed676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-browser/src/supervisor.rs:115-124 | crates/webcodex-browser/src/supervisor.rs:201-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2567fea4d2407e18b4d6b446bd502a85cc2677bf6e2783b3fe77780941a047df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/config.rs:1937-1946 | crates/webcodex-runner/src/webcodex_runner/config.rs:2086-2095 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5013113df0c3fab6282b6e5a3c8d06ffb3d704f3b68ec4c1a6ea246fe57fc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs:200-209 | crates/webcodex-runner/src/webcodex_runner/job_manager/detached.rs:65-71 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs:200\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0066895646880252b177b51899c184f1e61fa931f329b297dc25164fad788a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-store/src/oauth.rs:161-170 | crates/webcodex-store/src/oauth.rs:190-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/oauth.rs:161\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/oauth.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e825d307892a6067dd43c63e4054fd186d427e1ebc8dd0d85d6e6335a80fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-store/src/accounts.rs:114-123 | crates/webcodex-store/src/accounts.rs:148-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":"crates/webcodex-store/src/accounts.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec9e89e0c4df5ceae74921675727de3ef681390aa20a02a016518ac702d01ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-runner-config/src/paths.rs:112-120 | crates/webcodex-runner-config/src/paths.rs:156-161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-config/src/paths.rs:112\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-config/src/paths.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c8f43e696121fe27538b8dbee4c8a5ca5a319619cefde61e6c32644179393b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): apps/desktop/src-tauri/src/webcodex/adapter.rs:229-236 | apps/desktop/src-tauri/src/webcodex/adapter.rs:569-577 | apps/desktop/src-tauri/src/webcodex/adapter.rs:807-815 \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 \u0060apps/desktop/src-tauri/src/webcodex/adapter.rs:569\u0060 it does not close everything it opens, so those exact 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":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4df2c2b22feae399998afd29a9691cd9c9bd1afd95c1bf2523190b2b30c44c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-core/src/runner_operation.rs:1597-1605 | crates/webcodex-core/src/runner_operation.rs:1618-1626 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3d1e3812091b019c9259c26e548060a0c656dd3f50137725276b38fd6efb25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/ssh.rs:933-941 | crates/webcodex-runner/src/webcodex_runner/ssh.rs:949-957 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/ssh.rs:933\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22639b470d7626aab17e54f3899bd72fd93fc3e25489c304921181eefe16d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-runner-config/src/paths.rs:127-135 | crates/webcodex-runner-config/src/paths.rs:169-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-config/src/paths.rs:127\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-config/src/paths.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a3f6cc8d7cf144d296df9e736e81a3f6f3d87c70b66b9f3acfc6ecf4d0426e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/mcp.rs:1032-1040 | src/mcp.rs:1227-1234 | src/mcp.rs:1255-1262 | src/mcp.rs:1297-1304 \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 \u0060src/mcp.rs:1032\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1b1436bff247e3c7cb61d3f3a3746c5a568b8fd140145d56fedcccf866552c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/tool_runtime/coding_task/closeout.rs:43-51 | src/tool_runtime/session_tools.rs:438-446 | src/tool_runtime/validation_events.rs:54-62 \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 \u0060src/tool_runtime/coding_task/closeout.rs:43\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_task/closeout.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2f28d021f0eb503ce4ad04ea909a2480b8c13ac91e11ffd58428c6e489053c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tool_runtime/changes.rs:956-964 | src/tool_runtime/changes.rs:1087-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 \u0060src/tool_runtime/changes.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 \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, \u0060src/tool_runtime/changes.rs:965\u0060 calls \u0060Some\u0060, \u0060Ok\u0060, \u0060unavailable\u0060 and \u0060src/tool_runtime/changes.rs:1096\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":"src/tool_runtime/changes.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"125a371a3ea04380df4cc13c54f15d581782f573deca266c72b38e3fd751b33f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/oauth_http/managed_authorize.rs:720-728 | src/oauth_http/project_share.rs:324-329 \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 \u0060src/oauth_http/managed_authorize.rs:720\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":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39cfe2fb72a79a0215493c68ccde8da55d24b0a831288381d700ae4e679427d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-store/src/accounts.rs:8-16 | crates/webcodex-store/src/accounts.rs:367-375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/accounts.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"59824216c013cb2f20e0ba898e9872eba1b5f3969468f524accabe5c270bf330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-tool-runtime-contracts/src/tool_audit/execution_identity.rs:197-205 | crates/webcodex-tool-runtime-contracts/src/tool_audit/execution_identity.rs:256-264 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/execution_identity.rs:197\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/execution_identity.rs:254\u0060 calls \u0060push\u0060 and \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/execution_identity.rs:195\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/execution_identity.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c5233aba689646e21bcc33de6fb54f38d3fc5f6d6cfa43f4dd632aa25b36ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tool_runtime/startup_brief.rs:521-529 | src/tool_runtime/startup_brief.rs:550-555 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/startup_brief.rs:521\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":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a30db016075fe99a2ebbd7bb8f11cedf68574077ae7e968c1c5c02117a6a08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/webcodex-environment/src/service/linux.rs:350-358 | crates/webcodex-environment/src/service/macos.rs:288-296 | crates/webcodex-environment/src/service/windows.rs:834-842 \u2014 before extracting anything, compare \u0060crates/webcodex-environment/src/service/linux.rs\u0060 and \u0060crates/webcodex-environment/src/service/macos.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/service/linux.rs:350\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"528656e9051f048829ab2b6d78852b9f04596afa4e95f06c984d5734ce2a8b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/connect/process.rs:668-676 | crates/webcodex-cli/src/webcodex_cli/connect/process.rs:728-736 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/process.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"2584e81151cf7c8f494efb5220e5c06f6f669b29739ce15b3fa190e885f6e892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs:135-143 | crates/webcodex-runner/src/webcodex_runner/detached_job/store.rs:43-51 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs:135\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0198d815744e9a6ff83eea85a4c890ee3a575758ef9074f1eb582eb13712196"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/desktop/src-tauri/src/webcodex/adapter.rs:582-589 | apps/desktop/src-tauri/src/webcodex/adapter.rs:818-825 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/desktop/src-tauri/src/webcodex/adapter.rs:582\u0060 it begins part-way through the construct above it, so those exact 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 \u0060identity\u0060 to \u0060\u0026RunnerRuntimeIdentity\u0060 in one and \u0060\u0026ProjectRuntimeIdentity\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/desktop/src-tauri/src/webcodex/adapter.rs:581\u0060 calls \u0060to_string_lossy\u0060, \u0060to_string\u0060 and \u0060apps/desktop/src-tauri/src/webcodex/adapter.rs:817\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":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17150e2e6dbf4eb16a4d087134767ad5a3af47b25588191175e1cd0378adb32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-environment/src/session_service.rs:682-689 | crates/webcodex-environment/src/session_service.rs:783-790 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/session_service.rs:682\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/session_service.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb297d9e07961133953b044852ae219d99ac0dadf56e955070eeedc2f507d7cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/exit_diagnostics.rs:386-393 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:2119-2126 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/exit_diagnostics.rs:386\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/exit_diagnostics.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc9176bf8f4ce42151057c11669211ed919392c81e51a95054575c927f8d6d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-store/src/goal.rs:1396-1403 | crates/webcodex-store/src/store_primitives.rs:85-92 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"6068d4f5e77ac58058494a088c97699c30c59e012d4c14033f3b067a3cb452f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tool_runtime/observe_jobs.rs:573-580 | src/tool_runtime/read_files.rs:808-815 \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":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"867ce2d8323d65d0c59c2adfaac953e4bb9abdc4cefa65c1f119a23bfa844a40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/project_entry_windows.rs:70-77 | src/project_entry_windows.rs:101-108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/project_entry_windows.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_windows.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e300c3620b5bf44cf901671ae42e91c1f9c3fdf1e76e520f624ede4204c4989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-environment/src/service/mod.rs:703-710 | crates/webcodex-environment/src/session_service.rs:75-82 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/service/mod.rs:703\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/mod.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa89175091944126177c564fafb5d51ce33aacec28e7c3aaea8962ca6e1a10b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tool_runtime/files/mutations/patch_result.rs:514-520 | src/tool_runtime/files/mutations/patch_result.rs:522-528 | src/tool_runtime/files/mutations/patch_result.rs:530-537 \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 \u0060src/tool_runtime/files/mutations/patch_result.rs:514\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/patch_result.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3291260fc13013d2fa0930352d638979e935029f6ac48723468d5888bd5bebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:2234-2241 | crates/webcodex-cli/src/lib.rs:2473-2480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/lib.rs:2234\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2234}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c59ba7ad0d69698c34c18eeea38e0452a2d920e111fc4c55653f51d1fafe6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/webcodex-environment/src/native.rs:378-390 | crates/webcodex-environment/src/native.rs:545-557 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/native.rs:378\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdecb27d08d7e6688a421776a8f265b67ac430141190c3898010569c336b465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:198-205 | crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:214-221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs:198\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"763dd975d5a42314bc860cfc446fa8c34b02a9235d0eff937e7c701d45c10fae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/webcodex-runner-registry/src/requests.rs:2605-2612 | src/tool_runtime/computer_tools/request.rs:162-169 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner-registry/src/requests.rs:2605\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":2605}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0cf1759ecbe240bb7587c10354e08bcde146877f545389b6ce469bee19da5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/webcodex-cli/src/lib.rs:774-780 | crates/webcodex-cli/src/lib.rs:834-840 | crates/webcodex-cli/src/lib.rs:1135-1141 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/lib.rs:774\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"2001457b969ced56943bc7d90e9bf71086b80c496e8961e5de0da7922292e3f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/plugin_gateway.rs:534-540 | src/plugin_gateway.rs:611-617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/plugin_gateway.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":"src/plugin_gateway.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f765ed2c41b93c82c6f44066962dd2ee05c871763d0765698779cc104bea6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-environment/src/native.rs:104-110 | crates/webcodex-environment/src/tunnel.rs:1176-1182 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/native.rs:104\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc164951407ca7f0c49b397928251fa644ee645d40ebdba0dc875305809ad3e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-admin/src/commands.rs:241-247 | crates/webcodex-admin/src/commands.rs:374-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":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a03441b1fd342f42b61356c7748cbbe80eccb5a339c29e782443998716b3e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/mcp/tools/invocation.rs:246-252 | src/mcp/tools/invocation.rs:377-383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp/tools/invocation.rs:246\u0060 it begins part-way through the construct above it, so those exact 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":"src/mcp/tools/invocation.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4267b36c643cb56b4d8f0a888379e74fdac1f2e9781f7c9d5181871f9d55ac72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts.rs:217-223 | crates/webcodex-runner/src/webcodex_runner/patches.rs:79-85 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/artifacts.rs:217\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"9422a508e58a9b3b7c79ec3a5b4e7c9b7eb8d4f876dd676ddfd33c2a9aae68a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/patches.rs:1067-1073 | crates/webcodex-runner/src/webcodex_runner/validation/path.rs:66-72 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/patches.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":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e40fc09fc7d709e549c959fc07898f940011d76bb46b7d1fb458322cb925fb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-store/src/agent_wait.rs:351-357 | crates/webcodex-store/src/agent_wake.rs:2609-2615 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/agent_wait.rs:351\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wait.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"074152f4aa03c2772cf93b21e64cc2a480b59d5ea2a4a7882e689a92af592d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-admin/src/commands.rs:262-268 | crates/webcodex-admin/src/commands.rs:294-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-admin/src/commands.rs:262\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-admin/src/commands.rs:291\u0060 calls \u0060value\u0060 and \u0060crates/webcodex-admin/src/commands.rs:259\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b070cb57bb171a2de01d3ac01a3a56663e5f967986891b301d2939499cbad84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/listeners.rs:105-110 | src/server_shutdown.rs:216-222 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport/listeners.rs:105\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/listeners.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5ca1265cf010095b870717242d632f1debc2f663d0a001e12790c92985d19b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-cli/src/lib.rs:1393-1399 | crates/webcodex-cli/src/lib.rs:1782-1788 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/lib.rs:1393\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddea3ed7ac6293e6c5741e298f1f20ff451e9ca9706b7a4dd7bb8caba5d91f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-tool-contracts/src/registry/output_schemas.rs:63-69 | crates/webcodex-tool-contracts/src/registry/output_schemas.rs:80-86 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-contracts/src/registry/output_schemas.rs:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3266e538c325826e5d75c2231660f883a7a73575818f8fd7c066631c18e93f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/auth/middleware.rs:309-314 | src/auth/middleware.rs:370-376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/auth/middleware.rs:309\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/middleware.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"32457be63ce0ecdb5168dc5f0f607d0b0b227da25db63ef73b93ef96e718172c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tool_runtime/docx_document.rs:151-157 | src/tool_runtime/pdf_document.rs:218-224 \u2014 before extracting anything, compare \u0060src/tool_runtime/docx_document.rs\u0060 and \u0060src/tool_runtime/pdf_document.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 \u0060src/tool_runtime/docx_document.rs:151\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":"src/tool_runtime/docx_document.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d20d1daea64d06ba959b360fcc7fe5835762ca73122f0929b5094ab38ff1df0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-store/src/accounts.rs:294-300 | crates/webcodex-store/src/accounts.rs:306-312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-store/src/accounts.rs:294\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/accounts.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cf0c426ea2b484eabe726ac4f93d28360d903f71a04f23142a418399c8147e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport/quic.rs:244-250 | crates/webcodex-runner/src/webcodex_runner/transport/quic.rs:282-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport/quic.rs:244\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/quic.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e416372f8c39f5a9f5be1b94f8a3a4386d25f3fc2530e525d1fa6bfab04eef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:221-227 | crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:449-455 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:221\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3cd55376c76c8a7632b5f3fba4b14f7444bb1f1aabe3587ebe1a7518cd377a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tool_runtime/surface.rs:1012-1017 | src/tool_runtime/surface.rs:1318-1323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/surface.rs:1012\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/surface.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"4030e320dbc43692f63453e0eb901665757f2ce6695764837d2adee067bfcb74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-core/src/project_build.rs:102-107 | crates/webcodex-core/src/project_validation.rs:117-122 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_build.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"086afb97f4dde72de6e02837948cba45d42a5c145f61bea66d0c44a31e3d069e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/runtime_http.rs:272-277 | src/runtime_http.rs:294-299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/runtime_http.rs:272\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime_http.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9020fc0adbc8e78be1a7e8bd22ac9f30f56fbb4907a7c4b84eb5b6af104e29e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1180-1185 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:1253-1258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d42bf3e864206a416fa0293e3208a17c9467515b17c1e3d94559bf4e8a13ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/webcodex-workspace/src/project_overview.rs:992-997 | crates/webcodex-workspace/src/project_overview.rs:1078-1083 | crates/webcodex-workspace/src/project_overview.rs:1120-1125 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-workspace/src/project_overview.rs:992\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_overview.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f3ca0f63d3b2e1fbf1ce9d9477d2f90fcfa7dad39e7064b3032e8998cf1e7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tool_runtime/peer_collaboration.rs:245-250 | src/tool_runtime/window_collaboration.rs:520-525 \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 \u0060src/tool_runtime/peer_collaboration.rs:245\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/peer_collaboration.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"795979c17436a9dc9bdd632c170bdd18dbc4348e9d5d5c8afcc88cb9e1f631e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tool_runtime/files/inspection.rs:376-381 | src/tool_runtime/files/inspection.rs:382-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 \u0060src/tool_runtime/files/inspection.rs:376\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/inspection.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"560629cfc9db65081bf783954020c458863f74205b075dc6d7c59e4e4d99f98b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-tool-runtime-contracts/src/tool_audit/result.rs:70-74 | crates/webcodex-tool-runtime-contracts/src/tool_audit/result.rs:118-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit/result.rs:70\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/result.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f0797f9cd4e47e023e8d6be2a85ecc796b5ee5f863aba429e17a414d2e67c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/patches.rs:556-560 | crates/webcodex-runner/src/webcodex_runner/patches.rs:625-630 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/patches.rs:556\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"d761c9cd58868719bb85f87063debbb478a233e8720cea75e727ce7ae6fc5beb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:116-121 | crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs:272-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/artifacts/upload.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b96fb4357311cd417c7052738170cd266492c11c995b52a153702614fb87866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-computer/src/platform/macos/accessibility.rs:697-701 | crates/webcodex-computer/src/platform/macos/accessibility.rs:788-793 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a81460cc80f880acdbe5cebb322ea58a4767d6425449af6c1e9405d7164fd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/webcodex-tool-runtime-contracts/src/tool_audit/execution_identity.rs:43-48 | src/agent_wake.rs:147-152 | src/tool_runtime/coding_agent.rs:1751-1756 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_audit/execution_identity.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f246c5a6f77b390cff1d6fa04ed94faf155230a22243d24ad82430f25b65c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/artifacts.rs:194-199 | crates/webcodex-runner/src/webcodex_runner/artifacts.rs:205-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/artifacts.rs:194\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/artifacts.rs:193\u0060 calls \u0060create_dir_all\u0060, \u0060map_err\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/artifacts.rs:204\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5283595d2e9453ad5518792206697e98262538845a4a906b75364731460b556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/config.rs:580-584 | src/config.rs:585-589 | src/config.rs:590-594 \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":"src/config.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c8e60223dea3be5e150416dc8b854ef5c93f4dc9a7df539d8b3e05df4819b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs:132-136 | crates/webcodex-runner/src/webcodex_runner/detached_job/store.rs:40-44 | crates/webcodex-runner/src/webcodex_runner/skill_store.rs:167-171 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bae3a10ff9020f76a4c333c1bfc4975b9c3467eb820a4f27fc138cf6cc46fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/project_entry_cloudflared.rs:426-430 | src/project_entry_cloudflared.rs:433-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/project_entry_cloudflared.rs:426\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/project_entry_cloudflared.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"549cca9521e2710c689c411f2e47a7783ede7571b1b8ec46f264e2903a4747d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apps/desktop/src-tauri/src/runner_capability_grant.rs:34-38 | apps/desktop/src-tauri/src/workspace.rs:169-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060apps/desktop/src-tauri/src/runner_capability_grant.rs:39\u0060 calls \u0060path\u0060, \u0060query\u0060, \u0060is_some\u0060 and \u0060apps/desktop/src-tauri/src/workspace.rs:174\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/runner_capability_grant.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb94bd79ad6415fa91967f803a29ba6b4c5938e2ac20b304457e55b678882ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-browser/src/cdp.rs:2408-2412 | crates/webcodex-browser/src/cdp.rs:2637-2641 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-browser/src/cdp.rs:2408\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":2408}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb778e6ab1fd7079c59de95ebf01e00bca11bf24170f72b48db54a008f50d04d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/connect/profile.rs:283-287 | crates/webcodex-cli/src/webcodex_cli/connect/profile.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":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5104e79ee3452f34ecd27db1142b3302dc69c1bfaac3b9af974d43f047f77ab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-cli/src/webcodex_cli/system.rs:36-40 | crates/webcodex-cli/src/webcodex_cli/system.rs:56-60 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-cli/src/webcodex_cli/system.rs:36\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-cli/src/webcodex_cli/system.rs:42\u0060 calls \u0060set_permissions\u0060, \u0060from_mode\u0060, \u0060map_err\u0060 and \u0060crates/webcodex-cli/src/webcodex_cli/system.rs:61\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e492cc63d3e36c2d04cf08c9a4f0db5f8731dfe1a53f33a76e45b9c7cdd1589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-environment/src/upgrade.rs:2192-2196 | crates/webcodex-environment/src/upgrade.rs:2629-2633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-environment/src/upgrade.rs:2192\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"294b40d0198a95048facd8a1d2f07d0d0ccacd94ba0411ebd8125d659f248c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/detached_job/model.rs:232-237 | crates/webcodex-runner/src/webcodex_runner/detached_job/model.rs:345-350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/detached_job/model.rs:232\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/model.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"00165cb93dbb43dc8ec1a4c0748a4c199e0760f06e37c5c6754f40f19a3bb526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs:606-610 | crates/webcodex-runner/src/webcodex_runner/projects/registration.rs:659-663 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs:606\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"db06aac71a7c865b1dcd9bf365adaebc5d31eaa2ebb387b845862e9bf7d22cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/webcodex-store/src/agent_wait.rs:1114-1118 | crates/webcodex-store/src/agent_wait.rs:1264-1268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wait.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd08d1895628e61a7acc303a18c50c5d4c1658738194ab4329f0a3a43771a5eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/mcp/presentation/jobs.rs:157-161 | src/mcp/presentation/jobs.rs:243-247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/presentation/jobs.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ef2476811325f7abd97773367816ac5542d5d5174ccf581030886ef283043f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tool_runtime/handoff.rs:796-800 | src/tool_runtime/handoff.rs:810-814 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tool_runtime/handoff.rs:796\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tool_runtime/handoff.rs:795\u0060 calls \u0060get\u0060, \u0060cloned\u0060, \u0060unwrap_or_else\u0060 and \u0060src/tool_runtime/handoff.rs:809\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":"src/tool_runtime/handoff.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d9e5e4de18460aab8971aa0c6db72b23b85cea6b6477a9371af13d8c1d01ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 2): plugins/project-knowledge/knowledge.py:474-503 | plugins/project-knowledge/knowledge.py:660-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. 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":"plugins/project-knowledge/knowledge.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bee4538848a9dfea98999061ead6fd9739e36c471937250f6c196c03f9f63ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): plugins/examples/python-raw/plugin.py:89-111 | plugins/project-knowledge/plugin.py:89-111 \u2014 before extracting anything, compare \u0060plugins/examples/python-raw/plugin.py\u0060 and \u0060plugins/project-knowledge/plugin.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 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. 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":"plugins/examples/python-raw/plugin.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9498aa958f2d392eb6375d06cba607b89b121602b0fe0a88db1d00ca55d80beb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): plugins/examples/python-raw/plugin.py:150-169 | plugins/project-knowledge/plugin.py:163-182 \u2014 before extracting anything, compare \u0060plugins/examples/python-raw/plugin.py\u0060 and \u0060plugins/project-knowledge/plugin.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 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. 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":"plugins/examples/python-raw/plugin.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eef80e8e20dacda81d148f6f6deade6a51d6e0b3447b3033d70b0f7340f06d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): plugins/examples/python-raw/plugin.py:71-85 | plugins/project-knowledge/plugin.py:71-85 \u2014 before extracting anything, compare \u0060plugins/examples/python-raw/plugin.py\u0060 and \u0060plugins/project-knowledge/plugin.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 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. 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":"plugins/examples/python-raw/plugin.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"668c7a4bf26c01f7332922887bc147c87e5c2f66d9b87b80299afb2a56c233a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): integrations/codex/external_observation_hook.py:106-111 | integrations/codex/read_handoff.py:182-188 | integrations/codex/session_recovery.py:124-129 \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 \u0060integrations/codex/read_handoff.py:182\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/codex/external_observation_hook.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f8221abe146165fb7a89179dd57d869c3013a6c8b597772d81bca19c92d45e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): plugins/project-knowledge/knowledge.py:378-384 | plugins/project-knowledge/knowledge.py:513-519 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/project-knowledge/knowledge.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73175e5ef0460fef1ea8f0f703218527c6a9811fd1468f6a074a6d555218160"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): integrations/codex/read_handoff.py:87-92 | integrations/codex/read_handoff.py:102-107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060integrations/codex/read_handoff.py:86\u0060 calls \u0060all\u0060, \u0060_bounded_text\u0060 and \u0060integrations/codex/read_handoff.py:101\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":"integrations/codex/read_handoff.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9169344431f407e66364e9a8d3e7738b37064a72d9f58857ead61fb8be248f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): plugins/examples/python-raw/plugin.py:141-146 | plugins/project-knowledge/plugin.py:154-159 \u2014 before extracting anything, compare \u0060plugins/examples/python-raw/plugin.py\u0060 and \u0060plugins/project-knowledge/plugin.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 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":"plugins/examples/python-raw/plugin.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"158f60f1f231cae05c3e67c885169d382249572313928991b107cb98b51151d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 13 shared lines): src/mcp_tests/file_import.rs:958-1037 | src/mcp_tests/file_import.rs:1046-1119 | src/mcp_tests/file_import.rs:1128-1213 | src/mcp_tests/file_import.rs:1220-1301 \u2014 These 4 members are variants of one another: a block of 13 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 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":"src/mcp_tests/file_import.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f16e0a2e2bce09080fd60c38aceb83b0104017e7eab3e8fe5074aba94d4d2c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/webcodex-runner/src/main_tests/apply_patch.rs:12-50 | crates/webcodex-runner/src/main_tests/apply_text_edits.rs:7-58 | crates/webcodex-runner/src/main_tests/file_read.rs:9-42 | crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:602-635 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/main_tests/apply_patch.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a8125adedb4e73d6f93fb4f9cbf84e96107c1929fa52bd7e40a04e62238def"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/mcp_tests/file_import.rs:828-949 | src/mcp_tests/file_import.rs:958-1037 | src/mcp_tests/file_import.rs:1046-1119 | src/mcp_tests/file_import.rs:1128-1213 \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":"src/mcp_tests/file_import.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b877edde20f943f9a2ec680441024a772711ebe8e6ff79922bf90c86cdcb39d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): src/mcp_tests/artifact_export.rs:13-70 | src/mcp_tests/file_import.rs:300-360 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/artifact_export.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0bd45e1aa1716a1daa282e83995ae9885015eafb86065d4a4e259374cada47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): src/mcp_tests/file_import.rs:1310-1381 | src/mcp_tests/file_import.rs:1390-1449 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/file_import.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9f1b5a529e9dc809a0367f0cb85794016e8321192bcf9e8a1a0c223d891b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:267-311 | crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:317-372 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"45faf8b14f00b3c9eed744dc1e428ce290d584586aae128a0be2184e85703e13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): scripts/e2e_project_share_roots.py:166-206 | scripts/e2e_share_oauth_restart.py:172-211 \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":"scripts/e2e_project_share_roots.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"161d290e230466a0eeddf0456389e5829b5327f77795f814449f00ef87f610d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): scripts/release_publication.py:807-869 | scripts/release_readiness.py:505-597 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_publication.py"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71f0ab2ccdd748339b414ac624ca3dd5cf9176185cf4f219538a5f6eebad2d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): scripts/release_readiness.py:262-297 | scripts/release_readiness.py:313-345 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_readiness.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4a565f6e80ad30713968e93e283b5894b0ec2347ef960e8116d650e3de5c3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/webcodex-runner/src/webcodex_runner/transport_tests/initial_project_scan.rs:278-312 | crates/webcodex-runner/src/webcodex_runner/transport_tests/initial_project_scan.rs:689-723 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport_tests/initial_project_scan.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d025bd42bee3969565eda60082790cad5d739559680cfc556dc06acd5371fbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): scripts/release_publication.py:744-771 | scripts/release_readiness.py:449-477 \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/release_publication.py"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"8312b37cd76b56879ee78edcde8efcf5d71c7efc5cb6a920e09f64b8c6ba4964"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/mcp_tests/cli/collaboration.rs:11-41 | src/mcp_tests/cli/peer_clients.rs:37-81 \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":"src/mcp_tests/cli/collaboration.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccda95754a868c6091ad932676e2bb25e9ed50b09ad0ea4b19811245c41c88ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): scripts/release_publication.py:687-720 | scripts/release_readiness.py:370-408 \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":"scripts/release_publication.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"5689ef1c9ee00a0b83f60585dd12b0f77ec47457efa4f9bcec83ae64d272c183"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): scripts/release_publication.py:873-891 | scripts/release_readiness.py:601-619 \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":"scripts/release_publication.py"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c69922e289db73296314c4f242b4d4fdfae7428498ce8ad31df2cf845455171"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): scripts/e2e_agent_environment_ws.py:45-62 | scripts/e2e_job_input_ws.py:28-46 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e_agent_environment_ws.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9938d9fd3cdf898d7fb02cb86c2dedc8549b14df47e0a24a69aba7376298559e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): scripts/release_publication.py:156-174 | scripts/release_publication.py:178-196 \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":"scripts/release_publication.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b1ef336e61412d8c828c4456836b3120618e4d31c1fbfdbef6d90195a9f7f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/webcodex-runner/src/webcodex_runner/transport_tests/polling_recovery.rs:1248-1284 | crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:638-671 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport_tests/polling_recovery.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e25fe119b07c36762dada590202f740b63e8dd024beb65426e3d49588a628c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): scripts/release_plan.py:77-96 | scripts/release_publication.py:567-584 | scripts/release_readiness.py:69-88 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_plan.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e472620370285cd1ed7a0fa3925ad5b8d8519ad5655688aeb7bfed5661a6e7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): src/mcp_tests/cli/peer_clients.rs:5-28 | src/mcp_tests/file_import.rs:261-279 | src/mcp_tests/fixed_scope.rs:22-40 | src/mcp_tests/http_transport.rs:888-906 \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":"src/mcp_tests/cli/peer_clients.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4e4d3190bc401856db9e4837d75ce31394a7436eb7eb9234c862e68e5d183d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/mcp_tests/result_app.rs:1916-1943 | src/mcp_tests/result_app.rs:1971-2001 \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":"src/mcp_tests/result_app.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91d2e5a173cb0bd138a6c37dbb3360b546b942bda1ffd25bb3ff1acf63c16e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/mcp_tests/agent_continuation_app.rs:91-104 | src/mcp_tests/goal_plan_app.rs:11-26 \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":"src/mcp_tests/agent_continuation_app.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bb671160b98c21a91aee4b384278189d8775aa2edc6289c3ca0a2111bc033b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): scripts/e2e_go_project_format_ws.py:227-241 | scripts/e2e_project_knowledge_ws.py:193-205 | scripts/e2e_session_continuity_ws.py:319-331 \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":"scripts/e2e_go_project_format_ws.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9beba901a2b04a3f1ed4dab16d37c16718ae0e994cd0ab6dd42195cd9300ea67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 27\u002B corresponding lines): src/mcp_tests/plugin_check.rs:21-49 | src/mcp_tests/plugin_tools.rs:193-221 | src/mcp_tests/plugin_tools.rs:228-254 | src/mcp_tests/ssh_resource.rs:14-42 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/plugin_check.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef912685b85f9e824a577d8c35bb3545e0bb3f3433ea8b23918faa8a6f53007"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): scripts/release_publication.py:241-250 | scripts/release_readiness.py:249-258 \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/release_publication.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d98444cc9dc93c3e8d28caee3177e528737e112ae77e2330da450b7af9ed8c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/mcp_tests/plugin_tools.rs:16-35 | src/mcp_tests/tools.rs:177-196 \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":"src/mcp_tests/plugin_tools.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0075d5c62ae6a57b6cbd11e5791fd795d3d69fd39d5bc48419913246c37b77b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/mcp_tests/plugin_check.rs:55-75 | src/mcp_tests/ssh_resource.rs:47-67 \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":"src/mcp_tests/plugin_check.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc456c909e89b4f00148f4fd621b12fef03b36c49201cde1230bf6a3f0bfc4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): scripts/e2e_codex_bidirectional_ws.py:359-369 | scripts/e2e_session_continuity_ws.py:83-92 \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/e2e_codex_bidirectional_ws.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bdde37348c06353537f9000af3ee09af3cc1894d41a154279c79ee8600497b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): scripts/collect_release_bundle.py:50-57 | scripts/prepare_release_metadata.py:151-158 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/collect_release_bundle.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86387c5ae026d9e1c35b8434225529883a8ba92c9e5570c3c1d710782052173"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/mcp_tests/agent_continuation_app.rs:146-162 | src/mcp_tests/agent_continuation_app.rs:197-211 \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":"src/mcp_tests/agent_continuation_app.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3829085e16f42f985ec80f3205b8d138a9a6d07d5507fe92bc3607baea4ba9ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): scripts/collect_release_bundle.py:388-399 | scripts/verify_public_release.py:634-645 \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":"scripts/collect_release_bundle.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa89590135c34ce1d47031fb036e7dfc9a9fc24c225cc144c3ff36622c702476"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/mcp_tests/plugin_tools.rs:393-415 | src/mcp_tests/plugin_tools.rs:539-557 \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":"src/mcp_tests/plugin_tools.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc1d4ab86c5d5d113cbbb44bbf0f1d3594d973a98f01df0a854bd869d8f7b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): scripts/release_publication.py:80-94 | scripts/release_publication.py:98-103 \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":"scripts/release_publication.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef509998a79a4a287c4b17e8aee2c8a6fcd84b56c8b5d593938214ed38e79b54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): scripts/collect_release_bundle.py:303-312 | scripts/verify_public_release.py:208-217 \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/collect_release_bundle.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5396c11d8e2530fb152982dcdd1cf91c58aa442218b92028d2d73f7bf7958e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/e2e_codex_bidirectional_ws.py:349-354 | scripts/e2e_session_continuity_ws.py:77-80 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e_codex_bidirectional_ws.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec7e0cff00faf26c112606130729e168161075cf09ed88aa4ef6c579972ef93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): scripts/e2e_project_share_roots.py:132-145 | scripts/e2e_share_oauth_restart.py:139-153 \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":"scripts/e2e_project_share_roots.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5509d38848401f09b1a7e7f705fcdeffff822c5b83aa55bbdebe0fd4894d66a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): scripts/release_doctor.py:90-95 | scripts/release_publication.py:147-152 \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":"scripts/release_doctor.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f6cbcf25f49950b90dcfed765af1e1914c1e5aae374dc2f6915ee96cdf1057"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/mcp_tests/agent_continuation_app.rs:106-112 | src/mcp_tests/goal_plan_app.rs:28-33 \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":"src/mcp_tests/agent_continuation_app.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3ce1b96a394969bb3fc00bbce83d4b6f145ff4f185eb0adfd121841eafd299"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): scripts/e2e_project_share_roots.py:54-60 | scripts/e2e_share_oauth_restart.py:57-63 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e_project_share_roots.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2693a17d2fa0c3c60c70462525fe3fa0d8ef48c4d15a9fecb69c1cb7f8f284"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): scripts/e2e_project_share_roots.py:99-104 | scripts/e2e_share_oauth_restart.py:103-107 \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/e2e_project_share_roots.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbdeddae342ca8207f8eca233fdcf4079e27bc501ed83b6553f4bf412970fef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): scripts/release_readiness.py:303-309 | scripts/release_readiness.py:351-357 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_readiness.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4c987a0f29517b27d2ce482aa17790608501579b272aeb3e8e9fe45270800d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/webcodex-computer/src/windows_uia_tests/scroll.rs:4-14 | crates/webcodex-computer/src/windows_uia_tests/selection.rs:3-13 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/windows_uia_tests/scroll.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2786e75bb6bbbd629e05ebb8313abdc9c2abcb74567352a82e4ba119d06db048"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/mcp_tests/plugin_check.rs:9-19 | src/mcp_tests/plugin_tools.rs:71-81 \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":"src/mcp_tests/plugin_check.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a3a0c7c1da586918dc3bb09c4fbdc37d8a0df361982b24ef0c6ff4dfc60d95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): scripts/agent_loop_benchmark.py:101-115 | scripts/e2e_cloudflare_oauth.py:66-81 \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/agent_loop_benchmark.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e66846bbd333d49dada275d865bb50744442c6215ce646bdaf430e11caed6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): scripts/e2e_share_oauth_restart.py:68-76 | scripts/e2e_project_share_roots.py:65-74 \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/e2e_share_oauth_restart.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5fc948a03c3ca243103dcebf391eabdf50c09b10dbb200367e0797a6883f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): scripts/collect_unified_installer_inputs.py:341-347 | scripts/prepare_desktop_bundle_macos.py:189-195 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/collect_unified_installer_inputs.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"591efcf0cb94515b15758ed89e9505d74e22dee1b3fba5b4cf65fd03a42c2b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): scripts/package_unified_installer.py:86-91 | scripts/collect_unified_installer_inputs.py:47-52 \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":"scripts/package_unified_installer.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"686f70f42b37af4f068ce33a1352d84312a0b2f9e6507f8bd38d492ead662f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/e2e_agent_knowledge_ws.py:42-45 | scripts/e2e_agent_temporal_evidence_ws.py:31-34 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e_agent_knowledge_ws.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"758b09bca7505d8750e00018927704110fba94cedf5f28c0ddaaeecf6d4cc673"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): scripts/e2e_linux_socket_activation.py:69-76 | scripts/e2e_session_continuity_ws.py:43-51 \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":"scripts/e2e_linux_socket_activation.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b253ac882b5d3c8767e6c2b60c53838f84717dcaa73b53905b9543b16bec2417"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): scripts/agent_knowledge_host.py:200-206 | scripts/e2e_session_continuity_ws.py:113-117 \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/agent_knowledge_host.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"06190c9472678e35ce34d68b5989e2cfe69e37685450d616699653e4eed8809e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/prepare_release_metadata.py:162-165 | scripts/verify_public_release.py:116-119 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/prepare_release_metadata.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0df76c1da52c213eddfff73544a9401eeabb6478d41617a40be589e62c2162"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/e2e_project_share_roots.py:47-50 | scripts/e2e_share_oauth_restart.py:50-53 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e_project_share_roots.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d5ae3f9eb44700d6191b421289cc9fd6dfba271e40f002f2436ebf63fb33f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/mcp_tests/plugin_check.rs:83-105 | src/mcp_tests/plugin_tools.rs:43-65 \u2014 before extracting anything, compare \u0060src/mcp_tests/plugin_check.rs\u0060 and \u0060src/mcp_tests/plugin_tools.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"src/mcp_tests/plugin_check.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cf893951cec8bb01e1d9747f1dfb993f108a188dd34054dbfb8e9b662be691"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/mcp_tests/agent_continuation_app.rs:120-138 | src/mcp_tests/job_terminal_continuation_app.rs:35-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"src/mcp_tests/agent_continuation_app.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f2994060d322cc6ce13acf9273f1c4823ee6f108efb5458701beab8f5ff87f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/mcp_tests/artifact_export.rs:53-70 | src/mcp_tests/file_import.rs:343-360 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/artifact_export.rs:53\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/artifact_export.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c0541028e22fb1a0dca887a9a9db361b8b1ac88076cbc1ab2047eaed63df23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): crates/webcodex-runner/src/main_tests/apply_patch.rs:34-50 | crates/webcodex-runner/src/main_tests/apply_text_edits.rs:42-58 | crates/webcodex-runner/src/main_tests/file_read.rs:26-42 | crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:619-635 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/main_tests/apply_patch.rs:34\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/main_tests/apply_patch.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abdb4112e6291944895cb90ff4aea276c24d5ed23bbbb81aa2d41943989e7ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/mcp_tests/fixed_scope.rs:79-94 | src/mcp_tests/result_app.rs:1780-1795 \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 \u0060src/mcp_tests/fixed_scope.rs:79\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":"src/mcp_tests/fixed_scope.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4b40662585d340848fbab21ce6126037094d81d7b46b54fa6688ae6367d928"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:334-348 | crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:351-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:334\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"8862fc65791e1e5977d76318c5a9cf6562e4a2aa3d73536bb77b049be44ea23a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/mcp_tests/file_import.rs:412-426 | src/mcp_tests/file_import.rs:463-477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/file_import.rs:412\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/file_import.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"b549955ffbbfe23fffbcfeda3ee5226b9d3c48e6d5f048122f7e3258e7e3b282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/mcp_tests/artifact_export.rs:177-189 | src/mcp_tests/artifact_export.rs:260-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 \u0060src/mcp_tests/artifact_export.rs:260\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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, \u0060src/mcp_tests/artifact_export.rs:257\u0060 calls \u0060complete_mcp_export_metadata\u0060, \u0060clone\u0060 and \u0060src/mcp_tests/artifact_export.rs:176\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":"src/mcp_tests/artifact_export.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"059d8c56435f9e4369e877b1fa20928affd675d1a10a254101319265a980dddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/mcp_tests/oauth_scope.rs:43-56 | src/mcp_tests/plugin_check.rs:35-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/oauth_scope.rs:43\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":"src/mcp_tests/oauth_scope.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"793a1d513c8dc8d5d72501fe2227bfa23959c5cb20aea648aff54d383c324429"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/mcp_tests/plugin_tools.rs:17-30 | src/mcp_tests/tools.rs:178-191 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/plugin_tools.rs:17\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/plugin_tools.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a22ff77e42de1f9adb35a13c8d076a79455895c688b6e3e736b47e2e1892d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/mcp_tests/http_transport.rs:1269-1281 | src/mcp_tests/http_transport.rs:1458-1470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/http_transport.rs:1269\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d37faec71d90fd66f037dcc0edf226cbbd27fcd3cc0c35025d98c06ea1c23ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/mcp_tests/artifact_export.rs:15-26 | src/mcp_tests/file_import.rs:302-313 | src/mcp_tests/http_transport.rs:110-121 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/artifact_export.rs:15\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/artifact_export.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"225257df6d602c458537a5d2edf746556d08b11d69d051a778724ca057454714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/mcp_tests/http_transport.rs:1268-1279 | src/mcp_tests/http_transport.rs:1456-1468 | src/mcp_tests/http_transport.rs:1498-1509 \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 \u0060src/mcp_tests/http_transport.rs:1268\u0060 it does not close everything it opens, so those exact 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, \u0060src/mcp_tests/http_transport.rs:1266\u0060 calls \u0060get\u0060, \u0060is_none\u0060 and \u0060src/mcp_tests/http_transport.rs:1497\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":"src/mcp_tests/http_transport.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6f3afa5a49241f72b74076d7086d3310c11900ce136a7f939d97abbad972a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/mcp_tests/plugin_check.rs:22-33 | src/mcp_tests/plugin_tools.rs:194-205 \u2014 before extracting anything, compare \u0060src/mcp_tests/plugin_check.rs\u0060 and \u0060src/mcp_tests/plugin_tools.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/plugin_check.rs:22\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/plugin_check.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"46555859c95be5d47f7970a66e9c3fbd051fb161267de92a76436b8626bca33e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/mcp_tests/file_import.rs:1014-1024 | src/mcp_tests/file_import.rs:1096-1106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/file_import.rs:1014\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/file_import.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10ca85bc84024ebf0053b865fbebc90f9e9fc6f46ba9db075f352ae8284bc3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/mcp_tests/http_transport.rs:323-333 | src/mcp_tests/http_transport.rs:401-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a69af2a85ce841189d6addcfc5b559c3ad35bb20425c4ce7d54e4899c32dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/mcp_tests/http_transport.rs:416-426 | src/mcp_tests/http_transport.rs:461-471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/http_transport.rs:416\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dd8fd74fc8d930478d16dab639d392316f0b2e8c0711b03a82d543d40fee04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/mcp_tests/request_policy.rs:144-154 | src/mcp_tests/workbench_http.rs:11-21 \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":"src/mcp_tests/request_policy.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a109b732f84bc6dadda57a8c8238f298406deebc48721f900ce337f2bf8273"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:276-285 | crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:336-345 | crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:351-360 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d4792744d0f9f0fb4f225e4f378b8d497aaaac7d70d62a0c9712295b88fd4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): src/mcp_tests/file_import.rs:836-845 | src/mcp_tests/file_import.rs:1135-1143 | src/mcp_tests/file_import.rs:1227-1236 \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 \u0060src/mcp_tests/file_import.rs:836\u0060 it begins part-way through the construct above it, so those exact 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":"src/mcp_tests/file_import.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff1bb7a891c064824ee1c2df9081b2b3ebcdc73b652462abbc327b8eff6a680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/mcp_tests/file_import.rs:835-843 | src/mcp_tests/file_import.rs:1052-1060 | src/mcp_tests/file_import.rs:1134-1142 | src/mcp_tests/file_import.rs:1226-1234 \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":"src/mcp_tests/file_import.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1e94574bcd350983b2099975cccf817641ecd66344ee3f2e553395185bb7a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:268-277 | crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:318-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:268\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:279\u0060 calls \u0060register_inventory_support_response\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:329\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4313f37bc1e2200548932317e4e34fc7e3ce549b2c629cdd3402d4ec7f8176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/mcp_tests/cli.rs:385-393 | src/mcp_tests/request_policy.rs:166-175 \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 \u0060src/mcp_tests/cli.rs:385\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/cli.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"197d377e1339975ae08b924e4f4085835d735b29f1024259197f2c5e17f4c785"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): src/mcp_tests/file_import.rs:834-841 | src/mcp_tests/file_import.rs:963-970 | src/mcp_tests/file_import.rs:1051-1058 | src/mcp_tests/file_import.rs:1133-1140 | src/mcp_tests/file_import.rs:1225-1232 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/mcp_tests/file_import.rs:971\u0060 calls \u0060set_import_test_resolved_ips\u0060, \u0060Some\u0060, \u0060parse\u0060 and \u0060src/mcp_tests/file_import.rs:843\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":"src/mcp_tests/file_import.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdad3d83b69a7a3a70fe10c348f6458c168bd53a0ac74bcc99a08ad4176f2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/mcp_tests/file_import.rs:940-947 | src/mcp_tests/file_import.rs:1028-1035 | src/mcp_tests/file_import.rs:1110-1117 \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":"src/mcp_tests/file_import.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68fc979c721def7ae25e6c2470bcce50644faed71e071bdc1f9bcf6a800be6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/mcp_tests/file_import.rs:1019-1026 | src/mcp_tests/file_import.rs:1101-1108 | src/mcp_tests/file_import.rs:1269-1276 \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":"src/mcp_tests/file_import.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4314f86fd40a008ae2423fabdef4e1d79f1d2bc51ad5560b837e55aef5f673b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/mcp_tests/http_transport.rs:322-329 | src/mcp_tests/http_transport.rs:400-407 | src/mcp_tests/http_transport/client_window.rs:799-806 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a995adddb8ffc47b8168ac9394ba745c5e634dd1447adb8070dbec129e455dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/job_manager_tests/project_build.rs:581-587 | crates/webcodex-runner/src/webcodex_runner/job_manager_tests/project_validation.rs:508-514 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/webcodex-runner/src/webcodex_runner/job_manager_tests/project_build.rs:581\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager_tests/project_build.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1dc0d46d0d630d750f4d1f574646dd15c29dd6afa7904aedd992e566f047c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:288-294 | crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs:843-849 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport_tests/runtime_shutdown.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"3780ca079ab673ed5adfa0d037d4ee64063864ddcc72cfc2bf38a24d6766d9cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/mcp_tests/file_import.rs:1149-1158 | src/mcp_tests/file_import.rs:1400-1409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/file_import.rs:1149\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/file_import.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f227305db47fe98c293316a2083285581781fcba0b7ec505b11f3dec267094"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/mcp_tests/http_transport.rs:236-242 | src/mcp_tests/http_transport.rs:486-492 \u2014 both copies are in the same file, so extract the block 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":"src/mcp_tests/http_transport.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fada7779ac06536ea869c3d5e4f273deac076f395bd4a109c64192d9fff810a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/mcp_tests/file_import.rs:779-784 | src/mcp_tests/file_import.rs:1234-1239 | src/mcp_tests/file_import.rs:1312-1317 \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":"src/mcp_tests/file_import.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c5219eac4b75dce2d3de5cc3473f4d897aea3ae7b3ca3b80cbd406ccfc40f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/webcodex-runner/src/webcodex_runner/transport_tests/initial_project_scan.rs:279-287 | crates/webcodex-runner/src/webcodex_runner/transport_tests/initial_project_scan.rs:690-698 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport_tests/initial_project_scan.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd958de55c4158cf3def8663bddcad74b027626541762e68185654b5917eec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/mcp_tests/agent_continuation_app.rs:92-98 | src/mcp_tests/goal_plan_app.rs:12-18 \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 \u0060src/mcp_tests/agent_continuation_app.rs:92\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/agent_continuation_app.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7587f9dccece90c3a69acf3f979c8f0546e7273069958b6bbe7e0aed9bd52a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/mcp_tests/file_import.rs:1022-1026 | src/mcp_tests/file_import.rs:1104-1108 | src/mcp_tests/file_import.rs:1197-1201 | src/mcp_tests/file_import.rs:1272-1276 \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 \u0060src/mcp_tests/file_import.rs:1022\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/file_import.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d31480d0ffc5b0dac3329ee88b49dbe7f159d9299c8932f974a37ced3721c8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/mcp_tests/http_transport.rs:1249-1260 | src/mcp_tests/http_transport.rs:1342-1355 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/http_transport.rs:1249\u0060 it begins part-way through the construct above it, so those exact 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":"src/mcp_tests/http_transport.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d166b81f04315ced32aee0b7cc411885e6a91fa323ea81da1024f9e233a243ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/mcp_tests/http_transport/client_window.rs:830-834 | src/mcp_tests/http_transport/metadata_trace.rs:64-68 \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 \u0060src/mcp_tests/http_transport/client_window.rs:830\u0060 it does not close everything it opens, so those exact 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":"src/mcp_tests/http_transport/client_window.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e63a0d138aeb07acab19ff4583888c50dfaed1087a883976d0a5dbcce0dbf3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/mcp_tests/http_transport.rs:2111-2127 | src/mcp_tests/http_transport.rs:2372-2387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/http_transport.rs:2111\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4919e89d868a2cc41959ed41fcf5360dca8da292094d5aa67c5a5d59067c9262"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/mcp_tests/http_transport.rs:2089-2105 | src/mcp_tests/http_transport.rs:2351-2367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c5b332492f50be1cd0b92cd528f37e00e7223496faeea217e41766bbf6077d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/mcp_tests/http_transport.rs:1323-1337 | src/mcp_tests/http_transport.rs:1416-1430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c27393ccb80e857efc89f9bab2233fea67feabc7ecabffc247059f5ca3e26ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/mcp_tests/plugin_check.rs:61-75 | src/mcp_tests/plugin_tools.rs:21-35 | src/mcp_tests/tools.rs:182-196 \u2014 before extracting anything, compare \u0060src/mcp_tests/plugin_check.rs\u0060 and \u0060src/mcp_tests/plugin_tools.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/plugin_check.rs:61\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":"src/mcp_tests/plugin_check.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02d108b1d06fe6897bc371b62382933db5fffe5966db323e11cead2c5676385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/mcp_tests/http_transport.rs:1212-1226 | src/mcp_tests/http_transport.rs:1323-1337 | src/mcp_tests/http_transport.rs:1416-1430 \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":"src/mcp_tests/http_transport.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e32a55c7f2b51d642faef4bb0d28ad3d806f90d1e772039fa135d3fa60a36db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/mcp_tests/file_import.rs:987-1001 | src/mcp_tests/file_import.rs:1162-1176 | src/mcp_tests/file_import.rs:1248-1262 \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 \u0060src/mcp_tests/file_import.rs:987\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/file_import.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b43b07da7cc7265b8da2a2526c97f42376150ec1bedadd480facefd298e5c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/mcp_tests/http_transport.rs:1391-1403 | src/mcp_tests/http_transport.rs:1490-1501 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/http_transport.rs:1391\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a907082c17aad6be03e19ceae480b9d714d59895df492d75dd6eb8a6ebf9f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/mcp_tests/file_import.rs:806-813 | src/mcp_tests/file_import.rs:920-931 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/file_import.rs:806\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/file_import.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f32c601980e21438e2c9c3b66bc0371070ca9387ad193ae7116f163083412a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/mcp_tests/http_transport/work_result_thread.rs:80-90 | src/mcp_tests/http_transport/work_result_thread.rs:122-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/http_transport/work_result_thread.rs:80\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/mcp_tests/http_transport/work_result_thread.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d84a6e2f43899e80d1e8703c3550afb2e7f8c2eb8abe16a9df64969ed009d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/mcp_tests/file_import.rs:450-460 | src/mcp_tests/file_import.rs:482-492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/file_import.rs:450\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/file_import.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"debb19a392b7807237fb16bd41f85a3ee38361131cc63dbe6aaabd2a7f935f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/mcp_tests/file_import.rs:270-279 | src/mcp_tests/http_transport.rs:897-906 \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 \u0060src/mcp_tests/file_import.rs:270\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":"src/mcp_tests/file_import.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"1192915de2455decab2dcdc361756b0b82d5f028b19ad09ceb28f47358c8f676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/mcp_tests/http_transport.rs:1208-1216 | src/mcp_tests/http_transport.rs:1601-1607 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/http_transport.rs:1208\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0031fdaddad235a2f48309b614ffcccbdeec5565366e565c2b5a451b7d64a37e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/mcp_tests/http_transport.rs:2163-2170 | src/mcp_tests/http_transport.rs:2188-2195 \u2014 both copies are in the same file, so extract the block 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, \u0060src/mcp_tests/http_transport.rs:2198\u0060 calls \u0060contains\u0060 and \u0060src/mcp_tests/http_transport.rs:2174\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":"src/mcp_tests/http_transport.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"010fb984b95b9d8ca656c10d6501d25f9cb684f59482f5a9298d6df9c562a324"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/mcp_tests/http_transport/work_result_thread.rs:94-100 | src/mcp_tests/http_transport/work_result_thread.rs:144-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/http_transport/work_result_thread.rs:94\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport/work_result_thread.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29ce4c37351e74c7e0d2213f8f42305afa33999763284ec45d085fee104c786"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/mcp_tests/file_import.rs:982-988 | src/mcp_tests/file_import.rs:1065-1070 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/mcp_tests/file_import.rs:982\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/file_import.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08f6b053356788ee5e0f243866c8d2d4d81cfdd4bb5d5303b366f6fd36af7a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/mcp_tests/file_import.rs:939-944 | src/mcp_tests/file_import.rs:1027-1032 | src/mcp_tests/file_import.rs:1109-1114 | src/mcp_tests/file_import.rs:1202-1206 \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 \u0060src/mcp_tests/file_import.rs:939\u0060 it does not close everything it opens, so those exact 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":"src/mcp_tests/file_import.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1e7e6acdf6fbeec24ca11f16f14c00e06c737dea9b39b290cc325c4bb4aeee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/mcp_tests/http_transport.rs:328-333 | src/mcp_tests/http_transport.rs:406-411 | src/mcp_tests/http_transport/metadata_trace.rs:27-31 \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 \u0060src/mcp_tests/http_transport.rs:328\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a91c1c7c7893579c1d71295935cb8df4a5be91e3beab560b19fb65f9c105ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/mcp_tests/file_import.rs:265-270 | src/mcp_tests/fixed_scope.rs:26-31 | src/mcp_tests/http_transport.rs:892-897 \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":"src/mcp_tests/file_import.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1c9e78d07f055a8095bcff21cbf7eda76975e20b52c0f2924bbd7619c1cb92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/mcp_tests/computer_post_observation.rs:23-27 | src/mcp_tests/oauth_scope.rs:4-8 | src/mcp_tests/oauth_scope.rs:24-28 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060scopes\u0060 to \u0060\u0026str\u0060 in one and \u0060\u0026str) -\u003E (tempfile::TempDir\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":"src/mcp_tests/computer_post_observation.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8277358fc4cd6579f0e06e3f7b337a88b1ef0f38ce3a30bac5434ac37fe2f14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): scripts/e2e_linux_socket_activation.py:242-267 | scripts/e2e_linux_socket_activation.py:320-345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e_linux_socket_activation.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"16485bb046cd7d25d7039909f534167b86bbf38b581017f18595b7d72084f032"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): scripts/release_publication.py:697-720 | scripts/release_readiness.py:384-408 \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/release_publication.py:697\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_publication.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"174eae56f000facd50da1e0dc2985eb06ba0b4fd9d6ce6e3c852e8813e5a079d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201324 lines \u00D7 2): scripts/e2e_linux_socket_activation.py:298-316 | scripts/e2e_linux_socket_activation.py:476-499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060scripts/e2e_linux_socket_activation.py:475\u0060 calls \u0060terminate\u0060 and \u0060scripts/e2e_linux_socket_activation.py:297\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/e2e_linux_socket_activation.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ae717e4593e434f42d8a9347b29d1aced5c276a0c66fcc658778db21c9b941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): scripts/agent_loop_report.py:629-647 | scripts/agent_loop_report.py:683-702 \u2014 both copies are in the same file, so extract the block into one function there 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/agent_loop_report.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57426e7072e23c889b735f779e05d30de41ae404c6fd23e551336423dc87bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): scripts/agent_loop_benchmark.py:681-698 | scripts/agent_loop_benchmark.py:707-723 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/agent_loop_benchmark.py:681\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/agent_loop_benchmark.py"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe765b575365c6381d87f433908a49d4a4342939df3bb2cd3ec3408f39237972"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): scripts/release_readiness.py:281-297 | scripts/release_readiness.py:329-345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/release_readiness.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"351b0e0594645e3790aab2a3ee297fd847f8e303d32e03f537b004c19150cf67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): scripts/release_operator.py:31-45 | scripts/release_operator.py:130-144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060scripts/release_operator.py:145\u0060 calls \u0060add_argument\u0060 and \u0060scripts/release_operator.py:46\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/release_operator.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed376f9eab076e4dde615913d6f766208172d265a62b9f91be1426adc5228ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): scripts/e2e_cli_runtime_output.py:308-318 | scripts/e2e_cli_runtime_output.py:326-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/e2e_cli_runtime_output.py:308\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e_cli_runtime_output.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"472b9b8e7d19011e2f9a467bcf8ded1bd944e1b2ae902f7b7061bd79af6ece84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): scripts/e2e_agent_environment_ws.py:50-62 | scripts/e2e_job_input_ws.py:34-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/e2e_agent_environment_ws.py:50\u0060 it begins part-way through the construct above it, so those exact 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":"scripts/e2e_agent_environment_ws.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb7764efdebf9036803375445abbb1cb9221067adc41248b23990281991c943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): scripts/e2e_project_share_roots.py:132-144 | scripts/e2e_share_oauth_restart.py:139-151 \u2014 before extracting anything, compare \u0060scripts/e2e_project_share_roots.py\u0060 and \u0060scripts/e2e_share_oauth_restart.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060scripts/e2e_share_oauth_restart.py:152\u0060 calls \u0060wait\u0060 and \u0060scripts/e2e_project_share_roots.py:145\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/e2e_project_share_roots.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8a9c6cf5d734bca42b20d2f60fc152877a8b47180f57f303ee57a86a26ee34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): scripts/e2e_project_share_roots.py:182-201 | scripts/e2e_share_oauth_restart.py:187-206 \u2014 before extracting anything, compare \u0060scripts/e2e_project_share_roots.py\u0060 and \u0060scripts/e2e_share_oauth_restart.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 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":"scripts/e2e_project_share_roots.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e19bc180483e49f6d0ccedf4f24a0b6791ff91f2a3b93822d3744ff53287da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): scripts/agent_loop_report.py:939-945 | scripts/agent_loop_report.py:1243-1252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/agent_loop_report.py"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26ffc856cf2fd1cf7ed02b9164199acfb716ecd64049cfd31e9ebef0a6bc40e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): scripts/e2e_project_share_roots.py:150-162 | scripts/e2e_share_oauth_restart.py:157-169 \u2014 before extracting anything, compare \u0060scripts/e2e_project_share_roots.py\u0060 and \u0060scripts/e2e_share_oauth_restart.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 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":"scripts/e2e_project_share_roots.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ab592fa71f0612f54d8bebe331d34674a7fb13d8d8a5ff6376893c9e8be3fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): scripts/release_operator.py:66-74 | scripts/release_operator.py:125-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_operator.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1933139c75b19e282a8ddbbd3a67c6d688559c081b347b40baa4420095c91441"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): scripts/release_operator.py:183-191 | scripts/release_operator.py:200-208 | scripts/release_operator.py:294-302 | scripts/release_operator.py:309-317 \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 \u0060scripts/release_operator.py:183\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_operator.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc0b763e723de36eff13cf127480a41a18f109f7cd53e5d2e25bdf4e2f01504"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): scripts/release_readiness.py:173-181 | scripts/release_readiness.py:286-294 | scripts/release_readiness.py:334-342 \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/release_readiness.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab41a901d0c89fa45b643c8092a4d1f04cd1d2ab260ed083bfde2fdc976b8e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/agent_loop_report.py:1582-1590 | scripts/agent_loop_report.py:1645-1653 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/agent_loop_report.py"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a489583ed41c34526aaf8861968b6638d30c0c3206f90ba7facb031f1d40500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/release_operator.py:234-242 | scripts/release_operator.py:247-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 \u0060scripts/release_operator.py: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. 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/release_operator.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8170f8b37f566df2fe67c11bedbba3c702fa8e5398f3e5868dab592513ec8e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/release_operator.py:265-273 | scripts/release_operator.py:278-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/release_operator.py:265\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_operator.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba76c5b6f6d40cbed8ec66bbebcb80b42d831737a29570aeaa0051ab0822ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/release_plan.py:81-89 | scripts/release_publication.py:570-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_plan.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abaa9e1a7d0d823ad68d08d5d064e1c3d450874a4fc796b0dbe90349b2925de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/release_publication.py:163-171 | scripts/release_publication.py:183-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_publication.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a0cb977c0c399338ed3e5f496a483c63cfddf1f196fa9ac7f188b40254a5a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/release_publication.py:571-579 | scripts/release_readiness.py:75-83 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_publication.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"285f8e1fd7f4177910096a3792dd84bd2710cc06e087ccd0c170a29b754930a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/release_publication.py:861-869 | scripts/release_readiness.py:589-597 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_publication.py"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fc9d3686fc282ac10919e36af44884df84d55a9e65d6a126b0da360008e4e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/release_publication.py:883-891 | scripts/release_readiness.py:611-619 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_publication.py"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"06630d2acb35ec7137a7b2bb5b8260985a19f7747366fbd57e6fd7d9c20ccc3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/release_publication.py:764-771 | scripts/release_readiness.py:470-477 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_publication.py"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"40eb68d82da4c0e491cdc88915f91fb6c8c28e6e3c7cedc17d08fb2ab7592be0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/release_operator.py:40-47 | scripts/release_operator.py:69-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_operator.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b50f9c855caa88f8aa738a122e50cbe4dc88af22900926ee743b7525129d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): scripts/release_operator.py:63-68 | scripts/release_operator.py:91-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/release_operator.py:91\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_operator.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a163e85000984774951d571e23e7df9f2ca95a3c4230f341f390eddd5dad12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): scripts/release_plan.py:358-364 | scripts/release_plan.py:416-421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/release_plan.py:358\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_plan.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb92e7cce3dee1f8d478905fc335c806ea9eae18544dd61ec59f5968b1d2bce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/e2e_codex_bidirectional_ws.py:359-364 | scripts/e2e_session_continuity_ws.py:83-88 \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/e2e_codex_bidirectional_ws.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"072283c27128ea8a48d2b9d94e4894a859f9d3b1698f3caae0f017b6868a9aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/e2e_project_knowledge_ws.py:193-200 | scripts/e2e_session_continuity_ws.py:319-326 \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/e2e_project_knowledge_ws.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59af1c5beb0dcb043738685f5c195e8dcd06f3213a9d5cbdf286d724d48f671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): scripts/release_operator.py:65-69 | scripts/release_operator.py:94-98 | scripts/release_operator.py:124-128 \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/release_operator.py:62\u0060 calls \u0060add_argument\u0060 and \u0060scripts/release_operator.py:123\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/release_operator.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bce962b5da410d0b3b43d814f4464bfe545d78f0f1c8f7fe3819ab1e4cadbc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/agent_tool_discovery.py:30-35 | scripts/runtime_installer_manifest.py:23-28 \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/agent_tool_discovery.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6521afde6fbe20efd580205b06a37c1ffb86dc0fbe6a2d2f5997b2be94cebe79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8): scripts/build_windows_unified_bootstrap.py:17-21 | scripts/deb_lifecycle_acceptance.py:141-145 | scripts/e2e_codex_bidirectional_ws.py:208-212 | scripts/measure_cli_runtime_projection.py:27-31 | scripts/package_unified_installer.py:40-44 | scripts/prepare_desktop_bundle_macos.py:32-36 | scripts/prepare_release_metadata.py:139-143 | scripts/prepare_windows_unified_installer.py:27-31 \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 8 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build_windows_unified_bootstrap.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"098c6545c9a08eac093e265656980bd4ad4ee29976cada48db09ba42319dd28f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/build_download_page.py:29-33 | scripts/prepare_release_metadata.py:42-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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/build_download_page.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc5475d444a379741890ad90aafec8a687bbf8bfa1a22759de082e100bfd576"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/collect_release_bundle.py:125-129 | scripts/verify_public_release.py:123-127 \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/collect_release_bundle.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"001f14234289f9202562041c1909f7ac999681adfa618af3645330a7b8e73407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/release_publication.py:559-563 | scripts/release_readiness.py:61-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. 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/release_readiness.py:70\u0060 calls \u0060mkdir\u0060 and \u0060scripts/release_publication.py:567\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/release_publication.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38fc10706da474202292bb5a877c36694b5f418c5337d4ce00b721a6ce4d363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/release_publication.py:788-793 | scripts/release_readiness.py:488-493 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_publication.py"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"10569724b5e3bfc4407cd3360855547e8562c7cb45da1900ea33d0caa2405875"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/e2e_cloudflare_oauth.py:415-419 | scripts/e2e_cloudflare_oauth.py:437-441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e_cloudflare_oauth.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f281b4744b7ce1e3fc951ff055bfde838711db17c8fdecd113715a27d75ee5"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project webcodex: webcodex has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1a479f19d7bc55a159956e21e55a3a468a2ddc1a97f437033d808a49b0093460"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: webcodex-admin: webcodex-admin: 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":"285e9a6222e829d49c18706631e1e8e34f3f2562f1bd9972601bd6bc6c8bb736"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: webcodex-computer-control: webcodex-computer-control: 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":"38c70b94685bae0116ec923bc46c92e078262f0dc3be4d17402cbf571e62b941"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: webcodex-core: webcodex-core: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 17 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"eeabf599e973a618dbeb6a57ec558e95cb7b88354a86b9404ddc7cfe35a261fa"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: webcodex-openai-tunnel: webcodex-openai-tunnel: 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":"87bceb51bd6ad0912047ced1333728132f635e4764cfb3c0e1c657e28688bd7c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: webcodex-process: webcodex-process: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"182a6f19a4e2bf8a885ec24f18622e4d32a2acc435b28105cbaacadf7a8fbffc"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: webcodex-code-mode: webcodex-code-mode: abstractness 0.06, instability 0.00, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a2d7d073662bbb5263e33fcd7f2804f001f1f3a4abd0ff81a89b89825865a63d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: webcodex-runner-config: webcodex-runner-config: abstractness 0.00, instability 0.13, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"21d0b43df94fd28c284d139cc5a94020b228fddfb6daca0d283dadbde2e27b85"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: webcodex-workspace: webcodex-workspace: 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":"4a0f5ec9ce9ca34fc26bd36322d2b5086fce3e6552a2977fe633b2b91f2fa50c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @yyjeqhc/webcodex-plugin-sdk: @yyjeqhc/webcodex-plugin-sdk: abstractness 0.29, instability 0.00, distance 0.71 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5d6a44ae7afa7f11826005db185c96f132265dc98e120362fa23311874fdfe89"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NativeEnvironment (LCOM4 10): NativeEnvironment\u0027s methods fall into 10 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 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d3f7d2ffbdbcd1653f888a9ce35d10bcf69bf65da72a60e7a18c13cbafab2b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ToolDefinition (LCOM4 5): ToolDefinition\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_definition.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4343440d60cb43a1fe4fdcbb2e6d3213df17d9b0e77e090e04415c8cdf026c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: keeps Add Project a single non-replayed write after an uncertain result: 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 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":"frontend/test-v2/relations.test.tsx"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8733674c404f5ed8600f866398482cbe5ab3bfcf045471b4ab0e246a1d32dfb"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: edits the shared Session focus from the composer: 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":"frontend/test-v2/window-collaboration.test.tsx"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a8f9cbc9d5457d5554acc13e5dc3830c37393f91c41122f00d26d7a828756a"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: subscribes before consuming the pending initial target and acknowledges once: 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":"apps/desktop/src/lib/desktop-navigation.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdce722a92b30c771671ade36dc4c9c02cd204c980d38c448e872758ddab5438"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: late registration after disposal unlistens without consuming native navigation: 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":"apps/desktop/src/lib/desktop-navigation.test.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0fa9aa7d155c6c87477e9f03ef829604373bf802087695411827bc9e894bb8"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: uses the exact installed environment for local service controls without applying effects on load: 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":"apps/desktop/src/features/RuntimeShell.test.tsx"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9c840825c5e0cc3d17ff9a49e9c7a1a05e908341c2685aaf79e7431747b7c6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: confirms Server interruption before applying tracing through a service restart: 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":"apps/desktop/src/features/RuntimeShell.test.tsx"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd89f5ae88bbf5a14cf47ad8d6b7df00b51929b69fe39fca1713b928cc34205"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: requires explicit Full trace confirmation, preserving the expected env revision: 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":"apps/desktop/src/features/RuntimeShell.test.tsx"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3dbd6d22982589fd680f81c8dfefa6c2f1b8e5720b810f715d80a9434736d5"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not export to a late save-dialog result after %s: This test sets up 5 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":"apps/desktop/src/features/RuntimeShell.test.tsx"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcfd40353badb1dec066884207a568ff86ed596153fde9a05441cf5b3e009e6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: cancels a folder choice when file-access settings unmount: 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 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":"apps/desktop/src/features/WorkspaceSettings.test.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a758165e2590048b868dfb58ff05e6ff59f183f19feabc1d08cfa8512e4e9e8"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: discards a folder choice after an intervening %s change, even when it changes back: 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":"apps/desktop/src/features/WorkspaceSettings.test.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3798c7ac13dca4b58b8aacfaf501465103fe7922f38757e62f77b8452ac7c0"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: ignores a file-access mutation that completes after leaving the settings page: 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 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":"apps/desktop/src/features/WorkspaceSettings.test.tsx"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"855f2269159b357b326ace733d5002de69d48e28b08043f56e671ec356529288"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: apps/desktop/src/features/settings/SettingsPanel.races.test.tsx::Settings observation and action ownership does not restore an old Desktop state from PowerShell guidance after unmount: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b5f87108095168fbed8ffec2d59960e8263296652e9e683ee143d2b190205c5a"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: frontend/test-v2/window-first-work.test.tsx::shows active Window work without any Workflow Session and keeps observe calls visible: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/test-v2/window-first-work.test.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf4a3f0b67d469b9df3d018db068f246921a88540a7871828ab5ed94199ea33"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: frontend/test-v2/window-session-record.test.tsx::Window-owned Session record navigation keeps the exact Window, activity filters, DOM and scroll when opening and returning from a Session record: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2eda70fcf31e96de2aea66fe9272d103b0fb6aeeb2b1b3326e78810216f75de9"}},{"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":"5da4b1f7dd966f810e4d53cce215a866e1b6c55678d19cd62c8ed8108c88b12c"},"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"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp.rs: src/mcp.rs changed 80 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in webcodex::mcp::mcp_post at line 585. 13 of those changes were fix/bug commits, and the other 67 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f6c928de6ee59898751ccc085f615eaab098d4f6ac34f1a204090a500de14b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner-registry/src/job_updates.rs: crates/webcodex-runner-registry/src/job_updates.rs changed 74 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in RunnerRegistry::update_job_checked at line 2183. 6 of those changes were fix/bug commits, and the other 68 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner-registry/src/job_updates.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"988d80c697e5e09d83d7af0bfe0c576e916a8846de62cae6b22a8dd94e4f6fb5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/startup_brief.rs: src/tool_runtime/startup_brief.rs changed 89 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in webcodex::tool_runtime::startup_brief::enforce_hard_size_limit at line 1084. 10 of those changes were fix/bug commits, and the other 79 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/startup_brief.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/startup_brief.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"de12880bc05e5c69d42f4a18b2e28e939ef74c04dc9f040649e2c6b1071a541b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-cli/src/lib.rs: crates/webcodex-cli/src/lib.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in webcodex_cli::run at line 2749. 2 of those changes were fix/bug commits, and the other 40 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-cli/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"8664903971725cf20455b18c9e9469fb8181307ee944a3f3d3ac956f7112148e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/onboarding/FirstRun.tsx: apps/desktop/src/features/onboarding/FirstRun.tsx changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 165 in FirstRun.FirstRun at line 47. 3 of those changes were fix/bug commits, and the other 16 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/onboarding/FirstRun.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":"apps/desktop/src/features/onboarding/FirstRun.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d886ed5b48e6b7b4b85edae890b49b79407ad47fb0c90546873d7f73a1d94413"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/tools.rs: src/mcp/tools.rs changed 115 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in webcodex::mcp::tools::mcp_tools_list_payload_with_exposure at line 332. 17 of those changes were fix/bug commits, and the other 98 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp/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":"src/mcp/tools.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"1804837e0deae70f66abd99d52486b5eb88e87a9473287fb9e58bfb0c848d924"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner-registry/src/requests.rs: crates/webcodex-runner-registry/src/requests.rs changed 83 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in RunnerRegistry::enqueue_computer_checked at line 2557. 3 of those changes were fix/bug commits, and the other 80 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner-registry/src/requests.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/requests.rs"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a163e53694ab8b36cc97a8573997afedda5bf30174afb127a0231a0bbbc94d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/kernel.rs: src/tool_runtime/kernel.rs changed 109 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ToolRuntime::call_tool_with_context_inner at line 351. 7 of those changes were fix/bug commits, and the other 102 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/kernel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/kernel.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"129976fb225b4c35eab85faaec803970bfa1ca7f21ecc78df33be04c30398a7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/main.rs: crates/webcodex-runner/src/main.rs changed 83 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in webcodex_runner::parse_runner_args at line 86. 5 of those changes were fix/bug commits, and the other 78 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/main.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f562f6467cc9fc6714daeea481bdf61a03f4f8c32cd602d168ea0abdba9027f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-core/src/runner_protocol.rs: crates/webcodex-core/src/runner_protocol.rs changed 112 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in RunnerConfigOperationResponse::validate at line 1370. 7 of those changes were fix/bug commits, and the other 105 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-core/src/runner_protocol.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2d635b4fa4576aa641b9a524e5b087c98eb41d10de7123b3ce22ef1d0ae3e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-cli/src/environment.rs: crates/webcodex-cli/src/environment.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in webcodex_cli::environment::run_inner 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-cli/src/environment.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"686960d443c208cfb57b3169f82880b967f933c4fbcda6c0d844923422fa241d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/discovery.rs: src/mcp/discovery.rs changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in webcodex::mcp::discovery::compact_tool at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp/discovery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/discovery.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c59fb21ddd8ba401e6f5019a79fc62e3fd000ed46f185533c5670575771f186"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-core/src/runner_operation.rs: crates/webcodex-core/src/runner_operation.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in webcodex_core::runner_operation::decode_operation at line 1351. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-core/src/runner_operation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a01b7926f5b1e33be026901985090f03611cd0d006d4eb9717d775dad21a6b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/projects/ProjectsPanel.tsx: apps/desktop/src/features/projects/ProjectsPanel.tsx changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 108 in ProjectsPanel.ProjectsPanel 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/projects/ProjectsPanel.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":"apps/desktop/src/features/projects/ProjectsPanel.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fdf69b5ff501645975263c3d51442952b016ec8944bd5248b7c1f4afb2fe71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs: crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in webcodex_tool_contracts::registry::output_schemas::jobs::output_schema_for_tool at line 951. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"c180f3960e3406cb657f1fca12dd11614070cf3af00962c18751de531683026e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/dispatch.rs: crates/webcodex-runner/src/webcodex_runner/dispatch.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in webcodex_runner::webcodex_runner::dispatch::dispatch_request_with_outcome 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/dispatch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/dispatch.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"209aa01a711c31c9d9bc33ada766d42fc5ef67d241cccdb6689a59a21c54356b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/jobs.rs: src/tool_runtime/jobs.rs changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in webcodex::tool_runtime::jobs::validation_job_result_with_policy at line 620. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/jobs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/jobs.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"22676dcc6e51fe8a7de5ea08aa0b61685451959924748067ab687d926188137f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/collect_release_bundle.py: scripts/collect_release_bundle.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 145 in collect_release_bundle.verify_bundle_directory at line 587. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/collect_release_bundle.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/collect_release_bundle.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"00faba4d17a86902fecb784cffba83c141ff72c96721d4d92ba38cbdf6ec9322"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner-registry/src/polling.rs: crates/webcodex-runner-registry/src/polling.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in RunnerRegistry::poll_checked 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner-registry/src/polling.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/polling.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d34127d38e3312a46482026970093b44e0a576fc771eb4a390942aa9077e976"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/settings/SettingsPanel.tsx: apps/desktop/src/features/settings/SettingsPanel.tsx changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in SettingsPanel.SettingsView 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/settings/SettingsPanel.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":"apps/desktop/src/features/settings/SettingsPanel.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b11bf56481480887a9863996917e61f2c833df15515d054f23f3d3fe4d95a2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-core/src/runner_protocol/job.rs: crates/webcodex-core/src/runner_protocol/job.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in ShellJobValidationMetadata::is_valid at line 941. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-core/src/runner_protocol/job.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/job.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c526fcb8a6ab17a46d4837e7fa4b2672dba2fe7869e8145bd5007f1906bc1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner-registry/src/reconciliation.rs: crates/webcodex-runner-registry/src/reconciliation.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in webcodex_runner_registry::reconciliation::validate_snapshot 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner-registry/src/reconciliation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6e4d8d9653294d9a2f8d9b82256adb9b02796527bf363eba71135f16370e84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/model_surface.rs: src/model_surface.rs changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in webcodex::model_surface::project_suggested_tool_calls_in_value_node at line 299. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/model_surface.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model_surface.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"818a4b644b9133683d7ac087f345f27c1680aaad1de21ca15bcdc6388fc3049a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner-registry/src/runners.rs: crates/webcodex-runner-registry/src/runners.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in RunnerRegistry::register_session 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner-registry/src/runners.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c85ef1034701f36d0114756145f6d6a65a4a7f5ba6c4e212c8215d1f2a01fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-workflow-session/src/store.rs: crates/webcodex-workflow-session/src/store.rs changed 57 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in SessionStore::ensure_coding_session_with_git_baseline at line 561. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-workflow-session/src/store.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db45c5087e6677de451b303b8146aae8f4d83b31d2c03e9353f74ef3981d61e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/lib.rs: src/lib.rs changed 71 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in webcodex::run_server_with_shutdown at line 259. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- 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":"src/lib.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c530fbeeba83c04da61dff30496df913b8ad97db9ae2ce4ec912d047bc7cc0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/observe_jobs.rs: src/tool_runtime/observe_jobs.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in ToolRuntime::observe_jobs_for_auth at line 1400. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/observe_jobs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7b4020b1e820ecf2a6fbd424a58586184dc1b47aa13d91927f89970cf04864"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/config.rs: crates/webcodex-runner/src/webcodex_runner/config.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in webcodex_runner::webcodex_runner::config::validate_acp_config at line 1880. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"00084eea32c3fc8cac6a866855b06438690d1b1d9eb95d67c0731c7e73f5cd66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/patches.rs: crates/webcodex-runner/src/webcodex_runner/patches.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in webcodex_runner::webcodex_runner::patches::edit_plan at line 498. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/patches.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ba0b98c6dc78f75e78120afae77819eb777de1116c62d509a83fe1494c26b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/handoff.rs: src/tool_runtime/handoff.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in ToolRuntime::session_handoff_observation at line 167. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/handoff.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/handoff.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cac6ffe2fe70cb599a6ecb206df88807a0975b67e162cb75526ddca78932180"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner-registry/src/validation.rs: crates/webcodex-runner-registry/src/validation.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in webcodex_runner_registry::validation::validate_file_request at line 273. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner-registry/src/validation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/validation.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0a7a8481f0ed7f3262e1fba82697d11cef1b8ca377a634b9b4e1321d75c906"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/runtime_info.rs: src/tool_runtime/runtime_info.rs changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ToolRuntime::query_runner_inventory at line 289. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/runtime_info.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runtime_info.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e61c7d40a5682a6a6c754945c26b667497427758e65c28eee025547d3400f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/git/diff_hunks.rs: src/tool_runtime/git/diff_hunks.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in ToolRuntime::git_diff_page_for_source at line 1870. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/git/diff_hunks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"795c57d5d6c4e55e22f0e9f3f1b50cab035af925754b4269767f9730c989d803"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-workflow-session/src/events.rs: crates/webcodex-workflow-session/src/events.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in webcodex_workflow_session::events::classify_failure_expectation at line 434. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-workflow-session/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":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f95bce62aa40d7475b11ebf9d394e4d0a5a67b60458f4263f41a6ef0485ef1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/agent_loop_report.py: scripts/agent_loop_report.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in agent_loop_report._summarize_job_convergence at line 877. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/agent_loop_report.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/agent_loop_report.py"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fcc41d000b42e3f2c3bc6227e1fd047f3f1b3745b3c1962dbacb8054b72d5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/git/show_changes.rs: src/tool_runtime/git/show_changes.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in webcodex::tool_runtime::git::show_changes::parse_show_changes_output_with_observation at line 1318. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/git/show_changes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1846a41a098dffd315d71c4f1a29244c8262a0844ae93ec134eb3ae22f076ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/project_entry_share.rs: src/project_entry_share.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in webcodex::project_entry_share::share at line 753. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/project_entry_share.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_share.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"8106aa7069ae6e40d363059a209056b097366a7451cbb1d300a3622cea2410b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/process.rs: src/tool_runtime/process.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ToolRuntime::run_process_with_contract_mode at line 798. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/process.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/process.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"231e0d4d1f4fdfb4eba2a6b96aaaff1fb0a43b5aaf0c12be98dcdae99dbdd265"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/verify_public_release.py: scripts/verify_public_release.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in verify_public_release.verify_public_release at line 930. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/verify_public_release.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/verify_public_release.py"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"911aaad1ddece0f2297121be70dab9da9c51566823c16d87fcf46272ef3ad8a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/connection/ConnectionPanel.tsx: apps/desktop/src/features/connection/ConnectionPanel.tsx changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in ConnectionPanel.ConnectionPanel at line 18. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/connection/ConnectionPanel.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":"apps/desktop/src/features/connection/ConnectionPanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ac9d7518c1c6dfff7976f445d2cc9198284de933126b7693b1e983ea9da9db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/resources.rs: src/mcp/resources.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in webcodex::mcp::resources::mcp_native_image_tool_result at line 524. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp/resources.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/resources.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"392f3b95719ed2215065c5067c118bc300b6f484db09495e721569470fdb1266"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/activity/ActivityPanel.tsx: apps/desktop/src/features/activity/ActivityPanel.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in ActivityPanel.ActivityPanel 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/activity/ActivityPanel.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":"apps/desktop/src/features/activity/ActivityPanel.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7be19fd9792bbd493a69280d40be25ede82d20f7614e76c69a5b880958df476"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/shell.rs: src/tool_runtime/shell.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in ToolRuntime::run_shell_with_contract_for_resource 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/shell.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/shell.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5d087903eab52bc615f859e662acdb7568f67bb5b26cd73d00d53b20dd57c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp_goal_plan_app.html: src/mcp_goal_plan_app.html changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in mcp_goal_plan_app.html.validPlan at line 236. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp_goal_plan_app.html\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_goal_plan_app.html"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe99dd6af1f8cec8d70f27517d7c3bc95fdd9d47246744713f10def765cc8c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/surface.rs: src/tool_runtime/surface.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in webcodex::tool_runtime::surface::sparsify_tool_manifest_model_result at line 1153. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/surface.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/surface.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"cceff4ae2fa4ccb2d65e09af9745da00e519525c52b1825c4e891be3977155ca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/file_tools.rs: src/tool_runtime/file_tools.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in ToolRuntime::dispatch_file_tool 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/file_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":"src/tool_runtime/file_tools.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fca859a1f01e636cf2ec7566dd0f2ca6323f1fe26b5b3bed1a0a6881b2b3cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/admin_project_lifecycle.rs: src/admin_project_lifecycle.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in AdminProjectLifecycleService::mutate_authorized_core at line 286. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/admin_project_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":"src/admin_project_lifecycle.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff8e59608f29cd45df814c79fb8f20713d68404e7f4603fcd90351215bcf0c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-workflow-session/src/persistence.rs: crates/webcodex-workflow-session/src/persistence.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in PersistedSessionRecord::into_record at line 222. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-workflow-session/src/persistence.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/persistence.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"29750ab7c4c9d0379171cd45ab285eb19a810a8a7e4dc577b0a097e144a3ae76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/ci_path_risk.py: scripts/ci_path_risk.py changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in ci_path_risk._classify_path at line 217. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/ci_path_risk.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_path_risk.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"807a609663317674b00a115089f41b74fbe746946f1f5541fa3034c62f52481f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/hooks/useDesktopWorkspace.ts: apps/desktop/src/hooks/useDesktopWorkspace.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in useDesktopWorkspace.useDesktopWorkspace 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/hooks/useDesktopWorkspace.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":"apps/desktop/src/hooks/useDesktopWorkspace.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b456b551077ea9c4d232b794b949f0e50df647e3a2e482296f92245ebe1eae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-tool-contracts/src/tool_call/input_types.rs: crates/webcodex-tool-contracts/src/tool_call/input_types.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in PluginToolCall::validate 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-tool-contracts/src/tool_call/input_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":"crates/webcodex-tool-contracts/src/tool_call/input_types.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c139f1a3db32793df89f1b2f6cd1aa0e700f4d65ec532023e81271a89bf3bde2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/computer_tools/request.rs: src/tool_runtime/computer_tools/request.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 92 in ToolRuntime::dispatch_computer_request_for_instance 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/computer_tools/request.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d316d690611b9a8530061b6f7a9c48ad0a503d70d3da1714c5502f643f78309c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/browser_tools.rs: src/tool_runtime/browser_tools.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in ToolRuntime::dispatch_browser_request at line 880. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/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":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af3781443c7a40d71d3e85d81fca9845922d2bf8cc37769e108a6461a74cf31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/App.tsx: apps/desktop/src/App.tsx changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in App.DesktopApp 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/App.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":"apps/desktop/src/App.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e647acd8332603fb3fecdc6dc84080fc0b67982e6869b643f9c1bdfc921914"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/oauth_http/shared_key_bridge.rs: src/oauth_http/shared_key_bridge.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in webcodex::oauth_http::shared_key_bridge::oauth_shared_key_client_provision at line 707. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/oauth_http/shared_key_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":"src/oauth_http/shared_key_bridge.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d6efbc8c45b8bac0056a2c91b29867d6a67860476dc5b74df31fb4fc55cfca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp_agent_continuation_app.html: src/mcp_agent_continuation_app.html changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in mcp_agent_continuation_app.html.projectionSemanticFailure at line 494. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp_agent_continuation_app.html\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_agent_continuation_app.html"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec89a5a7c8c2619b75c0d30842510a74fd793c93789fa03dfc1b9037f44cc74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/settings/DiagnosticsPanel.tsx: apps/desktop/src/features/settings/DiagnosticsPanel.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 107 in DiagnosticsPanel.DiagnosticsContents at line 23. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/settings/DiagnosticsPanel.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":"apps/desktop/src/features/settings/DiagnosticsPanel.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c77ed58f96d490240744104873e77588d338d81126cbad2d272e4482080c34c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/prepare_release_metadata.py: scripts/prepare_release_metadata.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in prepare_release_metadata.main at line 199. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/prepare_release_metadata.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/prepare_release_metadata.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6f8c39adbf650e23518592e764929042c3e6b93d310fc99612a798b14cf2a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-tool-contracts/src/registry/output_schemas.rs: crates/webcodex-tool-contracts/src/registry/output_schemas.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in webcodex_tool_contracts::registry::output_schemas::base_output_schema_for_tool at line 59. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-tool-contracts/src/registry/output_schemas.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e61fb4aeb7745e31af1d16126a95766bc85ed82fdab289d9ff56a777d677d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs: crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in webcodex_runner::webcodex_runner::fake_mcp_gateway::main 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_mcp_gateway.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e147d734b6afaf37a24a7620f1c5de1653b0e41b4271d26094281f7c2a03068"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/agent_loop_benchmark.py: scripts/agent_loop_benchmark.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in agent_loop_benchmark._run_sample at line 918. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/agent_loop_benchmark.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/agent_loop_benchmark.py"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6d054b52c6651121457382988437af44ff6ce31733115eba6601858a12c27d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-core/src/validation_identity.rs: crates/webcodex-core/src/validation_identity.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in webcodex_core::validation_identity::structured_validation_target_identity at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-core/src/validation_identity.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_identity.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb53f588e8c89caf795dfc12497a290be9573aedf1973498bf167c4a56e8908"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/skills.rs: src/tool_runtime/skills.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ToolRuntime::skill_read_file at line 1264. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/skills.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/skills.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0d301b7c51b5d69506958a275e1faef3f4783e88315947e12f00b31af3a93d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/projects.rs: src/tool_runtime/projects.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ToolRuntime::prepare_managed_worktree at line 952. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/projects.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/projects.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c12dee89439a57afa0205bd0573400ead13f0572844238befad9d38cbebe76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/artifacts.rs: crates/webcodex-runner/src/webcodex_runner/artifacts.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in webcodex_runner::webcodex_runner::artifacts::handle_read_project_artifact at line 919. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/artifacts.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5c45c084f36231b175b4c4487f490efcd2f9356a55dd43c508afe69d0b3fc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs: crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in webcodex_runner::webcodex_runner::fake_plugin::main 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"855d64cd434ff62503d0ab5f413e7ed8cff38098999cb19fc569b72bdf156670"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/model_ergonomics_telemetry.rs: src/tool_runtime/model_ergonomics_telemetry.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in webcodex::tool_runtime::model_ergonomics_telemetry::edit_facts at line 640. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/model_ergonomics_telemetry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/model_ergonomics_telemetry.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89631bac70e1f5e4ee32188f70597c0e94dc5af1dcf033ba9ac6b1fc3919296"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/route_metadata.rs: src/route_metadata.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in webcodex::route_metadata::audit_class_for_runtime_tool at line 313. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/route_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":"src/route_metadata.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb79112cb321c6634c4143c537f353193a907fa8ad3876d127fce5926b6c0bf7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/validation_events.rs: src/tool_runtime/validation_events.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ToolRuntime::materialize_validation_job_candidates at line 359. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/validation_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":"src/tool_runtime/validation_events.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e82d946b59f2efe20d07e522150e773dca73a3adfb842f2bce4f78a03e14314"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-store/src/communication.rs: crates/webcodex-store/src/communication.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Database::post_conversation_message at line 2024. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-store/src/communication.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccca5ed9de18a45f85f6a250c395a36aa26e1020738072ad6f288f449ac36ddd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/auth/middleware.rs: src/auth/middleware.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in AuthMiddleware::handle 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/auth/middleware.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/middleware.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c32d8d9d59654695df4ef685c59d5324588f7ff932ee23485988b298de8128"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/tools/call/surface.rs: src/mcp/tools/call/surface.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in RuntimeSurface::admit 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp/tools/call/surface.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call/surface.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45672a3c602f822b7ab35e405ff42a15b851d652b8227d783c7c668f5be0f8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/coding_agent.rs: src/tool_runtime/coding_agent.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ToolRuntime::coding_agent_observe at line 796. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/coding_agent.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e76792b9b954ca9d91d18eb6909550a0c75a23edcddbf625efd9f9f2daa2b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/read_files.rs: src/tool_runtime/read_files.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ToolRuntime::read_files_planned_resolved at line 1306. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/read_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":"src/tool_runtime/read_files.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e5b117e220013a425bff263b104876a2e50c8bb37b308bc27d37186dd64113"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp_workbench_app.html: src/mcp_workbench_app.html changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in mcp_workbench_app.html.loadWorkbench at line 520. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp_workbench_app.html\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_workbench_app.html"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"719af1dbdd37e2e896bd52a699c32fad008f03ee87fb198d4d548dbf536d25dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-browser/src/cdp.rs: crates/webcodex-browser/src/cdp.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in webcodex_browser::cdp::apply_dom_capabilities at line 1999. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-browser/src/cdp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb00d191edac888f2457b3d834d3751daa993497d7872944df18522974e4198a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-environment/src/upgrade.rs: crates/webcodex-environment/src/upgrade.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in webcodex_environment::upgrade::verify_upgrade_candidate at line 1078. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-environment/src/upgrade.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa2895413f808428e35f971bc8180806c6a5bdff9ee1fe5878ac67c3e7ab2dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/projects/ProjectRows.tsx: apps/desktop/src/features/projects/ProjectRows.tsx changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in ProjectRows.ProjectRow at line 24. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/projects/ProjectRows.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":"apps/desktop/src/features/projects/ProjectRows.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b3eb5c2f1e88f88df8220d5917bdadfe7e16f51dd7741fc95f173bad0b7fec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/files/artifacts.rs: src/tool_runtime/files/artifacts.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ToolRuntime::read_project_artifact at line 662. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/files/artifacts.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/artifacts.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec1e269be95b5f9ae60fbecde47e25443871070b7a6f991404e96f3ffb4537c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/validation.rs: src/tool_runtime/validation.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ToolRuntime::project_validate at line 440. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/validation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/validation.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"308a1389f50fb7a8157bae00c83b3442b02bff3ccabd81ae5c02ffdd41c8c106"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/goal.rs: src/tool_runtime/goal.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in ToolRuntime::goal_activity_observation_at at line 780. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/goal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/goal.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"239e40b21240a0b625af89be9e7ab054f77cb76c6c6453b2f79121c3b8c1aa91"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/changes.rs: src/tool_runtime/changes.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ToolRuntime::work_result_files at line 565. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/changes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/changes.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdb3bf6f44a51cee0ae16328dada85ca473af90003d7a2bc3ec345e7bf24e40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-lsp/src/fake_server.rs: crates/webcodex-lsp/src/fake_server.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in webcodex_lsp::fake_server::run 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-lsp/src/fake_server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c2b39475e4e8b1a916445a628bbeefce71c7bfec372dee390f665870408a46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/release_publication.py: scripts/release_publication.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in release_publication._load_state at line 587. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/release_publication.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/release_publication.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5a1468bc4187ddb837bae788eaea88d008fc87d545a3e4c92ba3e9f4cd415f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs: crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in webcodex_runner::webcodex_runner::projects::managed_worktree::handle_prepare_managed_worktree_operation at line 575. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"86810bfffd9923cff132bcd8a632b7fb10795e24fe2f77234904ff8fad142480"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-cli/src/webcodex_cli/project.rs: crates/webcodex-cli/src/webcodex_cli/project.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in webcodex_cli::webcodex_cli::project::run_project_activate at line 635. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-cli/src/webcodex_cli/project.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53ce8ac93cf3a119fb1a0b3583ca72ea3f84d1d68437f1843c5190ef8a4857c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/session_tools.rs: src/tool_runtime/session_tools.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ToolRuntime::authorize_session_target at line 648. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/session_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":"src/tool_runtime/session_tools.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcc7c2aeccbc89e5eaa423d61d22b451bf14433bc3ccf7ad7354ba98622ad0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/workspace/WorkspaceContext.tsx: apps/desktop/src/features/workspace/WorkspaceContext.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in WorkspaceContext.WorkspaceProvider at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/workspace/WorkspaceContext.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":"apps/desktop/src/features/workspace/WorkspaceContext.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4723adc8a142d6953d2dae78cc723c69b1b22c4ae10801651dd93d043658d550"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp_tests/artifact_export.rs: src/mcp_tests/artifact_export.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in webcodex::mcp_tests::artifact_export::complete_mcp_export_resource_read at line 248. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp_tests/artifact_export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/artifact_export.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf3e1e9ba7c5498b3f2266008daa5d51c3bd9578453dc023331a5a022a87575"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/tools/call.rs: src/mcp/tools/call.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in ParsedCall::prepare at line 204. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp/tools/call.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5303512679dc3eda25bb05b128f8445702f6666186cd01f08b43b3d0b04b7dfe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/script.rs: src/tool_runtime/script.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ToolRuntime::run_script_with_contract_for_resource 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/script.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/script.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f256cd83b55bb70dd501f786305070c39e9a5d1cbc608467f64ec5bb40d7589f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-store/src/agent_wake.rs: crates/webcodex-store/src/agent_wake.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Database::consume_agent_wake_with_now at line 1196. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-store/src/agent_wake.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"010e00c25d6d47b727d3082cf19ddb3416c374e5bfae9bda8793ef64e6f764bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/connection/ConnectionEditor.tsx: apps/desktop/src/features/connection/ConnectionEditor.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in ConnectionEditor.ConnectionEditor 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/connection/ConnectionEditor.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":"apps/desktop/src/features/connection/ConnectionEditor.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dae0ec4991921cf81d9f35c40d2c24b2758cb9e916c3136acedf26986d143f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/settings/AboutPanel.tsx: apps/desktop/src/features/settings/AboutPanel.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in AboutPanel.AboutPanelContent at line 18. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/settings/AboutPanel.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":"apps/desktop/src/features/settings/AboutPanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10caf70aa8259546d2c675751b0a5ecb660f6e08cbcc7016d0aaaf4a23d7272"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs: crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in webcodex_runner::webcodex_runner::job_manager::admission::validate_runner_job_context_operation at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e8eb50b6af84d0aae59cbaff33bb0d31ea50ec46624839f38f54513f4a1244"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/work_result.rs: src/tool_runtime/work_result.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in webcodex::tool_runtime::work_result::semantic_activity_label at line 920. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/work_result.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/work_result.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a4d96a355402a6369afe594ac944b80b9a50505d0f9d785eb5e4b344d26216"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/connection/ConnectionCard.tsx: apps/desktop/src/features/connection/ConnectionCard.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in ConnectionCard.ConnectionCard 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/connection/ConnectionCard.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":"apps/desktop/src/features/connection/ConnectionCard.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3856f481a988973a93045c04a9e12085c7ee40c97932506c14c1ee4b2d7e3091"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/coding_task/closeout.rs: src/tool_runtime/coding_task/closeout.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ToolRuntime::finish_coding_task 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/coding_task/closeout.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_task/closeout.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c6c83c8f3bd83b492c456f58182f43ef982e3a3b71775b96c0ebb73634090f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/files/inspection.rs: src/tool_runtime/files/inspection.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ToolRuntime::list_project_tracked_files at line 1263. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/files/inspection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/inspection.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4cbb7b9efe06fd91b12500dcf26e95b2f0a35daff8f74e47b8b42c4ffdf745"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs: crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in webcodex_cli::webcodex_cli::connect::oauth::run_oauth_connect at line 521. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a96ddb959f19bb8cf2d05518b88d2bead6aa3795c7f7c8c3fe87fe9dfd8a0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-browser/src/supervisor.rs: crates/webcodex-browser/src/supervisor.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in BrowserSupervisor::batch at line 1023. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-browser/src/supervisor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3d4197495ba12247ec49bc9ecc747b659749f3e47d3c5b6a3311ba14571884"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-tool-contracts/src/tool_call/parsing.rs: crates/webcodex-tool-contracts/src/tool_call/parsing.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ToolCall::from_tool_name_with_normalization at line 256. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-tool-contracts/src/tool_call/parsing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/parsing.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c27f7e33805f886f059cd69d95ac771b35a3f2f862b08ff266d6548e2610e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/settings/RunnerCapacityPanel.tsx: apps/desktop/src/features/settings/RunnerCapacityPanel.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in RunnerCapacityPanel.RunnerCapacitySettings 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/settings/RunnerCapacityPanel.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":"apps/desktop/src/features/settings/RunnerCapacityPanel.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"94195d277c5d167b0b742a31751da4cef083f8bb9aff5412067417e6c2ee0db5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-environment/src/native.rs: crates/webcodex-environment/src/native.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in NativeEnvironment::reconcile at line 1254. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-environment/src/native.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bc19513a3b459eac48ccdd852dd622cd0e5d20420e28c2bb4be6766d53e671"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/job_manager/local_shell.rs: crates/webcodex-runner/src/webcodex_runner/job_manager/local_shell.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in JobManager::start_shell_job at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/job_manager/local_shell.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/local_shell.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b467e64a2273032fcce3339c18c9d1ab4368fa63db83cb65206c0ffb502a4b7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-core/src/plugin.rs: crates/webcodex-core/src/plugin.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in webcodex_core::plugin::preflight_plugin_schema_node at line 667. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-core/src/plugin.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/plugin.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b397f1ad68cf3eae5ae88b0be55f0084659e6e80debd544f84783fe7673ccad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/files.rs: crates/webcodex-runner/src/webcodex_runner/files.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in webcodex_runner::webcodex_runner::files::handle_skill_read_file_request at line 642. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/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":"crates/webcodex-runner/src/webcodex_runner/files.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"34395f6e75822bc2727032c626d85246d26d0929c698e5389b0366ac6b87c657"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/dashboard/ReadinessBanner.tsx: apps/desktop/src/features/dashboard/ReadinessBanner.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in ReadinessBanner.ReadinessBanner 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/dashboard/ReadinessBanner.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":"apps/desktop/src/features/dashboard/ReadinessBanner.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7446535556b83311985930c471a9247fe48e25825e826fe2bdaa5f21e3b4f91"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp_result_app.html: src/mcp_result_app.html changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in mcp_result_app.html.renderPresentation at line 775. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp_result_app.html\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_result_app.html"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff4d6ed461be7379617963ea2c793a8b3b41be515de32bcbb82b71ec70647bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/browser.rs: crates/webcodex-runner/src/webcodex_runner/browser.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in webcodex_runner::webcodex_runner::browser::handle_browser_operation 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/browser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/browser.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"476bbed69b352762701636d460d2fb4c8121ed9ebcf3ce2f782c75c776d7626c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/computer.rs: crates/webcodex-runner/src/webcodex_runner/computer.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in webcodex_runner::webcodex_runner::computer::handle_computer_operation_with_runtime at line 133. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/computer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/computer.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1667e4f071d0231fda10a7ddd79f3507d483abf6755fa2f0df92b4bcca740a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/window_activity.rs: src/tool_runtime/window_activity.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in WindowActivityRegistry::finish at line 572. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/window_activity.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/window_activity.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7d246f99df40ba631b6b0770bf4c266226c6745f84d7a8e4856234b70b3d5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/runner_authorization.rs: src/tool_runtime/runner_authorization.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ToolRuntime::authorize_runner_tool 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/runner_authorization.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runner_authorization.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c63297721802ba42d3664137185d73c00d3bed77cde2073185bac0ac4e19ab9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/validation/project.rs: crates/webcodex-runner/src/webcodex_runner/validation/project.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in webcodex_runner::webcodex_runner::validation::project::plan 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/validation/project.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/project.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c24b2932ea6cf657575455312a59b5253bc857c6c96eff6587035b9a256afc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/orchestration_host.rs: src/tool_runtime/orchestration_host.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in CanonicalOrchestrationHost::invoke_tool at line 756. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/orchestration_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":"src/tool_runtime/orchestration_host.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"064eea9f0b96058e1a4def1f42abcd270f919ba3f19b031971717fa8d73d604f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/settings/RuntimePanel.tsx: apps/desktop/src/features/settings/RuntimePanel.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in RuntimePanel.RuntimePanelContent at line 18. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/settings/RuntimePanel.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":"apps/desktop/src/features/settings/RuntimePanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fbbbcb0e943d70a6d9c4e4c5b8da237c29919aa6114431b27f5a2349ff07c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs: crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in webcodex_runner::webcodex_runner::projects::lifecycle::handle_project_operation at line 718. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5054d3bf8705772a2e0e9f5beac781aa127b60a43a45af7653260a34f0afdc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/cli/text.rs: src/mcp/cli/text.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in webcodex::mcp::cli::text::project_response 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp/cli/text.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"369f10502f438daf84fc12621daf873111e22c42c9d08f3865410ebacd556304"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/agent_task.rs: src/tool_runtime/agent_task.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ToolRuntime::reconcile_agent_task_coding_run at line 1043. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/agent_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":"src/tool_runtime/agent_task.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea12510be6ac2cbd5d3514aef3eb7fdf6e786250bbdc8acf8f1f10daa9dcc98"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/tools/call/response.rs: src/mcp/tools/call/response.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in RuntimeResponse::finish 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp/tools/call/response.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call/response.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e088a31222b85ded327fed087c73289f1483566cdcfc05cc471d532ae4fed319"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-environment/src/tunnel.rs: crates/webcodex-environment/src/tunnel.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in NativeEnvironment::configure_tunnel_profile_under_lock at line 803. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-environment/src/tunnel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"b651b502c09466555829d2549b262dec4d051269b6eaf9acc67e0df16b6a93f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-tool-contracts/src/tool_inputs.rs: crates/webcodex-tool-contracts/src/tool_inputs.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ProjectTextEditInput::validate at line 171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-tool-contracts/src/tool_inputs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_inputs.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2793ccc65aa7cf193c858e2cb39e4363712be1cf697531e6a38f790d2dfb3229"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src-tauri/src/webcodex/cli.rs: apps/desktop/src-tauri/src/webcodex/cli.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in webcodex_desktop::webcodex::cli::run_bounded_until at line 401. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src-tauri/src/webcodex/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":"apps/desktop/src-tauri/src/webcodex/cli.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"068f027249831c45e09b2b0f9d09190bfb09eeb782d7117fb514eabf86cf90e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/skill_store.rs: crates/webcodex-runner/src/webcodex_runner/skill_store.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in SkillStore::install at line 801. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/skill_store.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ea2c1fd4188106742fa450417ec61d2039c304ec8349a8a74d6260f5687e88"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-workflow-session/src/handoff_brief.rs: crates/webcodex-workflow-session/src/handoff_brief.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in webcodex_workflow_session::handoff_brief::build_handoff_brief 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-workflow-session/src/handoff_brief.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac0cd962530a97070eecd9966d298d95b04ef12f65b8c9c008f8e18ef29b9da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/ui-smoke/mcp-workspaces.mjs: scripts/ui-smoke/mcp-workspaces.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in mcp-workspaces.mount at line 24. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/ui-smoke/mcp-workspaces.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/ui-smoke/mcp-workspaces.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6effc2d5fc3aea031eb071cb5834a6b69a3a7de74448f090557d006d57db531"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/git_review.rs: src/tool_runtime/git_review.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in ToolRuntime::git_review_summary_for_scope at line 908. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/git_review.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git_review.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"6766394255f1af97b88e0c29dd8dd63526c62d1265d1ca043fbdfd08a4a177b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/i18n/presentation.ts: apps/desktop/src/i18n/presentation.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in presentation.desktopErrorPresentation at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/i18n/presentation.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":"apps/desktop/src/i18n/presentation.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a484026596893b737430406e61750a03735ffd3afcb696f22182c13cfb6c7b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/coding_task/startup.rs: src/tool_runtime/coding_task/startup.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in ToolRuntime::start_coding_workflow 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/coding_task/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":"src/tool_runtime/coding_task/startup.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"526a0de4679e7c59b104ffa89c3ce7240d431522f595180142055583aeddc061"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-core/src/project_validation.rs: crates/webcodex-core/src/project_validation.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ProjectValidationRequest::validate at line 116. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-core/src/project_validation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_validation.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfd49a699cef6b5ed176f95e70a5c9bd85b90e20e16a5ec92a283aa39e149c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-cli/src/webcodex_cli/controller.rs: crates/webcodex-cli/src/webcodex_cli/controller.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in webcodex_cli::webcodex_cli::controller::run_controller_command at line 1959. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-cli/src/webcodex_cli/controller.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fbd28113e8d2da31aae107a841ae778aadc4e7140e1d310b03776db5c04706"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/settings/UpdateWorkflow.tsx: apps/desktop/src/features/settings/UpdateWorkflow.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 124 in UpdateWorkflow.UpdateWorkflow 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/settings/UpdateWorkflow.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":"apps/desktop/src/features/settings/UpdateWorkflow.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e85617189c9a52827eb4978b2708570d315fde3bb12b20a85377f7d267dcb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-cli/src/webcodex_cli/runner_service.rs: crates/webcodex-cli/src/webcodex_cli/runner_service.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in webcodex_cli::webcodex_cli::runner_service::run_runner_status at line 456. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-cli/src/webcodex_cli/runner_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":"crates/webcodex-cli/src/webcodex_cli/runner_service.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe8dc814670e710a6f7e9b2785f34a8297c35f4bc8ba465161d9916390de906"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/runner_session.rs: src/runner_session.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in webcodex::runner_session::dispatch_inbound at line 394. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/runner_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":"src/runner_session.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a2bf41d3a61bf5f6b85f0a96650e7a0eb4d4916b71d5e33f913bc4e374183f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-core/src/project_build.rs: crates/webcodex-core/src/project_build.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in webcodex_core::project_build::canonical_project_build_process_with_manager at line 266. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-core/src/project_build.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_build.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecea0e6602bf98f7a662b3dfe7e71ad9d135839d7d937db3a838b4746650ee1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/release_readiness.py: scripts/release_readiness.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in release_readiness._load_state 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/release_readiness.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/release_readiness.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"16991964d8fe307f49e4f1feb67fcc32e185c3d9ee4f50685e50564957efec47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-workflow-session/src/console.rs: crates/webcodex-workflow-session/src/console.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in webcodex_workflow_session::console::build_overview at line 358. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-workflow-session/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":"crates/webcodex-workflow-session/src/console.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1031963ef4cdc243154ec7162a65718e0e866c35e9bd3c0790f66569b12ce137"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/coding_agent.rs: crates/webcodex-runner/src/webcodex_runner/coding_agent.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in CodingAgentManager::start at line 639. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/coding_agent.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebab84bae99e001ea0d26fe66162e826be4c05f299e1ad2c77353b4b25c98981"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/extensions/ExtensionsPanel.tsx: apps/desktop/src/features/extensions/ExtensionsPanel.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ExtensionsPanel.ExtensionsPanel 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/extensions/ExtensionsPanel.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":"apps/desktop/src/features/extensions/ExtensionsPanel.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cf28697f579ff25f9a096a9ed54022ef26d1b7176e4982d1373266c16e9315"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src-tauri/src/connections.rs: apps/desktop/src-tauri/src/connections.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in ConnectionRuntimes::monitor at line 320. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src-tauri/src/connections.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/connections.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b8527d65161027784ffe2c85f1efd3077f6ccdbf0f388f50701e849e3409f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs: crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ProviderConnection::request at line 943. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcfad0495fb2a7a753acf5670ef7d7c3e9071f6d526bea6825d895e43587d81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/conversation_import.rs: src/tool_runtime/conversation_import.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ToolRuntime::import_one_conversation_file at line 661. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/conversation_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":"src/tool_runtime/conversation_import.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fd579164533d61bd118fac27e826f18d1b6ad5b5c8684495736f25f22fd7d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner-registry/src/dispatch_fence.rs: crates/webcodex-runner-registry/src/dispatch_fence.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in PendingDispatchFence::synchronous_rejection 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner-registry/src/dispatch_fence.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/dispatch_fence.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"24aa34c399539b67c2c14bbdb33b0dd57508d56ed14a4d2bf12784b4ec487508"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-cli/src/webcodex_cli/login.rs: crates/webcodex-cli/src/webcodex_cli/login.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in webcodex_cli::webcodex_cli::login::render_login_result at line 591. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-cli/src/webcodex_cli/login.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abbb4e0cfe0ca3f6d24f4ea01107ae6d00f72333f21120b79f82124fe402746"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-lsp/src/supervisor.rs: crates/webcodex-lsp/src/supervisor.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in LspSupervisor::request_with_timeout_and_encoding_inner at line 736. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-lsp/src/supervisor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d121fee6bd141f653bc98edc5624e5f7299a15443107c3c8008bc9b64bbb33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-cli/src/webcodex_cli/ops.rs: crates/webcodex-cli/src/webcodex_cli/ops.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in webcodex_cli::webcodex_cli::ops::run_ops_command at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-cli/src/webcodex_cli/ops.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/ops.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d72d8e60ba8d544e1cbf8b6baa8ce391398e5087f8fc249edcb09a5a2c8f55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-store/src/goal.rs: crates/webcodex-store/src/goal.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Database::update_goal_at at line 695. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-store/src/goal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"b337acad22a4b1d9439fa5ee300679df9c6dec71c8844bdc3336b0d36dd786ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/cargo_tools.rs: src/tool_runtime/cargo_tools.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ToolRuntime::dispatch_cargo_tool 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/cargo_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":"src/tool_runtime/cargo_tools.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54fb4ba57cf135657ea8e329f40e3d78b624afbec788fdaf77d155aa5117d3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/plugin.rs: crates/webcodex-runner/src/webcodex_runner/plugin.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in webcodex_runner::webcodex_runner::plugin::prepare_provider at line 1232. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/plugin.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a77e3a206bb2340e7093cb314526d8da5c69efe30612b9dd4786773c547555b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-store/src/agent_wait.rs: crates/webcodex-store/src/agent_wait.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Database::create_agent_wait 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-store/src/agent_wait.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wait.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0046ab938c5afc4e42ee7204cdd33b5ab9f829a594b37d3ceb983c74ae1e82"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/project_resolution.rs: src/tool_runtime/project_resolution.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ToolRuntime::resolve_project_input_for_auth at line 514. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/project_resolution.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/project_resolution.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4f5aea2a85b11789d9c85fa1b93740d3e929c631850128d50f9b4db107e564"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/cli/text/compact.rs: src/mcp/cli/text/compact.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in webcodex::mcp::cli::text::compact::jobs at line 383. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp/cli/text/compact.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"78777a3db82d90d7256650be1c1305109cfd9204994d355b6f9cd40b956c8119"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/kernel/postprocess.rs: src/tool_runtime/kernel/postprocess.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in PostRecordResponse::finish 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/kernel/postprocess.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/kernel/postprocess.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f330082e0c121b9f02a7afc315485c280b4705fdd8888b25be84aab2910ee233"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs: crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in JobManager::start_prepared_shell_job 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d574369fc64997617ebbcbc65c6566732ae78be51759b11a246bf14662d4e2c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner-registry/src/project_inventory.rs: crates/webcodex-runner-registry/src/project_inventory.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in RunnerRegistry::apply_project_inventory_page_checked at line 200. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner-registry/src/project_inventory.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/project_inventory.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b3b218cdc03ed53e961cd875ff67b3cefc0b75210bdb23ee851bc64baa6d7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/dispatch/governance.rs: src/tool_runtime/dispatch/governance.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in ToolRuntime::govern_dispatch 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/dispatch/governance.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/dispatch/governance.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce5d16b74626061b55651509d27d739bd8b9974ab86ac6431e5abea884c28c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs: crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in webcodex_cli::webcodex_cli::connect::shared_key_oauth::finish_shared_key_oauth_connect at line 506. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7589a317f97da43370431ec915af7c7addedf48cb3521fc96a34c945de8cd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src-tauri/src/tray.rs: apps/desktop/src-tauri/src/tray.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in webcodex_desktop::tray::build_menu at line 393. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src-tauri/src/tray.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/tray.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"39266f99dc0c601092d2408036e9e056c5a19c0f4b1678ff58f0dc3750f9a756"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src-tauri/src/state/environment.rs: apps/desktop/src-tauri/src/state/environment.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in DesktopCore::configure_environment at line 443. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src-tauri/src/state/environment.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"235a23d218f0f7753581de44197d0240caaa6494ce13c31940c084b8a69710c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/semantic_navigation.rs: src/tool_runtime/semantic_navigation.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ToolRuntime::probe_semantic_navigation_for_startup 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/semantic_navigation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/semantic_navigation.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e085660a17418da76a67e1259b1565822d6c61cabdeca881fb64db090980fb35"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/runtime_console_http/window_queries.rs: src/runtime_console_http/window_queries.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in webcodex::runtime_console_http::window_queries::window_for_auth_inner at line 336. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/runtime_console_http/window_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":"src/runtime_console_http/window_queries.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe3a55649b40a6d132de544884def7eca1c5fa8686459d658f5da45a8da2269"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/auth/tokens.rs: src/auth/tokens.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in OAuth2Verifier::verify_for_ingress_sync at line 223. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/auth/tokens.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/tokens.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffa0e737856b650f4f3f3d729d2ea9aa786dbcd78cad5eaa0643804789d5425"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/job_manager/process.rs: crates/webcodex-runner/src/webcodex_runner/job_manager/process.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in JobManager::start_structured_job 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/job_manager/process.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/process.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0773c9332d353f3b28f9ac83b7b9b9958bce82fe3ef6c804587a9174e7772039"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-core/src/runner_job_receipt.rs: crates/webcodex-core/src/runner_job_receipt.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in RetainedJobReceipt::validate 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-core/src/runner_job_receipt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_job_receipt.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5ba38ba9306909e70ff0e22707a08b4c5f805ea81a494f964b8c81f940b28b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/shell/execution.rs: crates/webcodex-runner/src/webcodex_runner/shell/execution.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in webcodex_runner::webcodex_runner::shell::execution::execute_configured_command_impl at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/shell/execution.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/execution.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e3d0706ab0ab51435b288c07e14ef028d2f20c020ff7af759c804fd7feecec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/computer_tools/control.rs: src/tool_runtime/computer_tools/control.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in ToolRuntime::dispatch_computer_control_action 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/computer_tools/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":"src/tool_runtime/computer_tools/control.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6115d86774443f41e36671108d678dd8a4806b31688df0eaf98a3f4c741acfe1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-environment/src/unified_update/source.rs: crates/webcodex-environment/src/unified_update/source.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in webcodex_environment::unified_update::source::verify_source_manifest_for_flavor 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-environment/src/unified_update/source.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/source.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8364648705cdeb034e962167040abeef2ce8cb7d2a6b9c63b6ee66fb8275f4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/project_build.rs: crates/webcodex-runner/src/webcodex_runner/project_build.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in webcodex_runner::webcodex_runner::project_build::plan at line 55. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/project_build.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae9be31444be126f85f6db5f118fdf8522eff135e4ca5d29ec712ac4bd87ba9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/lsp_tools.rs: src/tool_runtime/lsp_tools.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ToolRuntime::call_agent_lsp at line 201. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/lsp_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":"src/tool_runtime/lsp_tools.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c178d7f0ab429fcd30cbf196cab11a3044383efc56fd4966ce96ff34c4d849e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-core/src/mcp_gateway.rs: crates/webcodex-core/src/mcp_gateway.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in webcodex_core::mcp_gateway::validate_tool_result at line 517. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-core/src/mcp_gateway.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0888231bc70939223ca91e8cb060d14cdbd206658c823554bf2b8a3a18c237"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/release_plan.py: scripts/release_plan.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in release_plan.resume_plan 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/release_plan.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/release_plan.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"88870bc6c5ae9a73103a4465912e6b8d8747c092d11b5f12f09459f5a2229c74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/action_audit_sessions.rs: src/action_audit_sessions.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in webcodex::action_audit_sessions::compute_stats at line 558. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/action_audit_sessions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/action_audit_sessions.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c216541d49323e549440212a16d822935e946365e4e91cdabc2682abea2fbd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/oauth_http/managed_authorize.rs: src/oauth_http/managed_authorize.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in webcodex::oauth_http::managed_authorize::oauth_authorize at line 806. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/oauth_http/managed_authorize.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af30ebe5889c9176a69526c795806991e958a389387e8960cfc7c5aedb8d99f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/release_operator.py: scripts/release_operator.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in release_operator.main at line 172. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/release_operator.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/release_operator.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d2be944cdd9bf6f7eb83c635559173fd8fa9d7096ea9f970916ef40516768a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/coding_task/projection.rs: src/tool_runtime/coding_task/projection.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in webcodex::tool_runtime::coding_task::projection::project_work_on_project_output_inner at line 318. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/coding_task/projection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_task/projection.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"0988c7f70425bf392b9694b371de0e0da53911c0a327a184a572dba7f348e968"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner-registry/src/job_updates/start.rs: crates/webcodex-runner-registry/src/job_updates/start.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in JobStartPlan::admission_requirements at line 580. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner-registry/src/job_updates/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":"crates/webcodex-runner-registry/src/job_updates/start.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f367f5741d79aa62cd83b703ff5b8ca771aea6c641ad71abf28c4a5f4965f8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs: crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in webcodex_runner::webcodex_runner::artifacts::upload::handle_artifact_upload_begin at line 669. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b9b49b8a44b5af3b48611d591399c9afcebb5a1918c7c262d5fe141943d1da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/campus-application/src/plugin.ts: plugins/campus-application/src/plugin.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in plugin.analyzeNodes at line 221. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- plugins/campus-application/src/plugin.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":"plugins/campus-application/src/plugin.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b6559b03519f0917ad617107b7ee737620d37517f5f710f9d4039b3a086c39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/settings/ComputerPermissions.tsx: apps/desktop/src/features/settings/ComputerPermissions.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in ComputerPermissions.ComputerPermissions 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/settings/ComputerPermissions.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":"apps/desktop/src/features/settings/ComputerPermissions.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"199df50326631bd585ca569a745771d8bb4ac385116ffd6c8b962d127048fa5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src-tauri/src/state/runtime_shell.rs: apps/desktop/src-tauri/src/state/runtime_shell.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in DesktopCore::switch_runtime_transaction at line 319. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src-tauri/src/state/runtime_shell.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/runtime_shell.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"931b14ac508e965af9d012330d0f48a4edb698daf5b0626613a12a1baa4f0715"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/projects/registration.rs: crates/webcodex-runner/src/webcodex_runner/projects/registration.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in webcodex_runner::webcodex_runner::projects::registration::handle_resolve_or_register_project_operation at line 578. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/projects/registration.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/registration.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb4691c591a48d5a3249f4659dcc10c3117ff13aabebe35f5d32ab955f84564"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/resource_references.rs: src/tool_runtime/resource_references.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ToolRuntime::search_webcodex_resources at line 289. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/resource_references.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/resource_references.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"babfb8c0cec748464abc96d4939d29ac529cfc4c9381799e12776e8f45838cf7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-code-mode/src/runtime.rs: crates/webcodex-code-mode/src/runtime.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in webcodex_code_mode::runtime::execute_with_termination_mode_inner 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-code-mode/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":"crates/webcodex-code-mode/src/runtime.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6484b4e73b6801a36c850c90e357f7fee0567e0a7fc791577350d15541618cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/transport/stream.rs: crates/webcodex-runner/src/webcodex_runner/transport/stream.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in webcodex_runner::webcodex_runner::transport::stream::serve_registered_stream 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/transport/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":"crates/webcodex-runner/src/webcodex_runner/transport/stream.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b6851f8120098ebb3d30a2377a6fb8669c737c6fec0df7fbad05211253b01e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/collect_unified_installer_inputs.py: scripts/collect_unified_installer_inputs.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in collect_unified_installer_inputs.collect 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/collect_unified_installer_inputs.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/collect_unified_installer_inputs.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d30665d93de77a6c791dc2348ab90594aa7ed69e92e3ac48d2002e52f27ecd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-store/src/goal_stall.rs: crates/webcodex-store/src/goal_stall.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Database::record_goal_workflow_stalled_diagnosed at line 511. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-store/src/goal_stall.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal_stall.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e2e235fece0aff765b14121aa5fe2800dc614bf130ec12208c6781ed72e23b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/settings/RunnerFileAccess.tsx: apps/desktop/src/features/settings/RunnerFileAccess.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in RunnerFileAccess.RunnerFileAccess at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/settings/RunnerFileAccess.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":"apps/desktop/src/features/settings/RunnerFileAccess.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c4b0b5a25d8daa58283a6d91bf722e8097f48d0956e465d3cbd1c5c9e0e1a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-workflow-session/src/audit.rs: crates/webcodex-workflow-session/src/audit.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in webcodex_workflow_session::audit::session_input_summary_for_tool at line 24. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-workflow-session/src/audit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/audit.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"910837eb0e6f7133e461cc2d9da2d36be20da7e53c21c51f6f1cff1dc4407657"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/cli.rs: src/mcp/cli.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in webcodex::mcp::cli::project_manifest at line 396. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp/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":"src/mcp/cli.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d319ab6ff4e5202ecf0d53ed5f21c5315a69eb3fccdef963c2a2300520fd942a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-core/src/apply_patch_shared.rs: crates/webcodex-core/src/apply_patch_shared.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in webcodex_core::apply_patch_shared::seek_sequence at line 624. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-core/src/apply_patch_shared.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_patch_shared.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3e8491725e975ee1cfcae19f428bf17b8a293257e93d1ec4859b29de661a2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/server_tunnels.rs: src/server_tunnels.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in webcodex::server_tunnels::run_profile at line 157. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/server_tunnels.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server_tunnels.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"727de9ed6a097c61ab227be2dcb966f1eebe3750654b5c5fb408d93fbb386efc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp_job_terminal_continuation_app.html: src/mcp_job_terminal_continuation_app.html changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in mcp_job_terminal_continuation_app.html.prepareAndDispatch 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp_job_terminal_continuation_app.html\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_job_terminal_continuation_app.html"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a16470cbcd7462f33ef365b9b5ab1ed28fb9991d80ae2cd48532b631ddd4484"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/host_timing_dogfood.py: scripts/host_timing_dogfood.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in host_timing_dogfood.summarize at line 145. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/host_timing_dogfood.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/host_timing_dogfood.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e5e1a5771eb37df0acafdbfbe18e95aa7faf7f7f3a60335c1b6a7790387e5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/artifact_transfer.rs: src/tool_runtime/artifact_transfer.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in ToolRuntime::transfer_resolved_project_artifact at line 489. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/artifact_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":"src/tool_runtime/artifact_transfer.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07176682a1c078f28469925b06359df8927731bd33ae87f896f01e0b8de8bce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src-tauri/src/state/connections.rs: apps/desktop/src-tauri/src/state/connections.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in DesktopCore::persistent_tunnel_profile_action at line 311. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src-tauri/src/state/connections.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/connections.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"abec76c4ed2e83639a9687068a85596e0d5db1a8583faedb768b00d389319ca0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-core/src/validation_evidence.rs: crates/webcodex-core/src/validation_evidence.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in webcodex_core::validation_evidence::node_native_test_summary at line 241. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-core/src/validation_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":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0f8324605c1eb87938671faaaa411fe91889ae5eb45e36afc9525967b55acf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/e2e_linux_socket_activation.py: scripts/e2e_linux_socket_activation.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in e2e_linux_socket_activation.run_graceful_inflight at line 319. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/e2e_linux_socket_activation.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/e2e_linux_socket_activation.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"53950be714d780547d9debf31b64e6e8dfe39365aab3755f702b31bc19a81661"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: npm/webcodex/install.js: npm/webcodex/install.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in install.fetchToFile at line 463. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- npm/webcodex/install.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/webcodex/install.js"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"549c0d061e183215b51db7a2bef7824204e28e5dd1a7e85fa52d8b4fb3b0ae5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/files/mutations/text_edits.rs: src/tool_runtime/files/mutations/text_edits.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in ToolRuntime::apply_text_edits at line 426. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/files/mutations/text_edits.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/text_edits.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"2842d456f1a8c42559c14a2653e309f4370d6b730349ccd674e8b7edf3dc11a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/project_build.rs: src/tool_runtime/project_build.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ToolRuntime::project_build at line 51. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/project_build.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/project_build.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbacf97e5d3048374337928c07623bf244ad4ffb613e4145e34473f7c489b253"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/window_collaboration.rs: src/tool_runtime/window_collaboration.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ToolRuntime::post_window_operator_message_with_options_for_principal 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/window_collaboration.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/window_collaboration.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e73fb943abb1e598cbfc04041fb40e5169b69a67e70a25e35a76aee052d4c5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/campus-application/src/form-cache.ts: plugins/campus-application/src/form-cache.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in form-cache.deriveMappings at line 414. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- plugins/campus-application/src/form-cache.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":"plugins/campus-application/src/form-cache.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1ffbc532c9e43ef721872b836eb4b86e3428dd117da13caa9782d5239f6695"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-environment/src/service/linux.rs: crates/webcodex-environment/src/service/linux.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in webcodex_environment::service::linux::install 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-environment/src/service/linux.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45c80b4cc8d4a303a7c0679ff72610b3ce229f4a5f6717a8ad4be0a0b773d05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/projects/RunnerDevices.tsx: apps/desktop/src/features/projects/RunnerDevices.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in RunnerDevices.RunnerDevices 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/projects/RunnerDevices.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":"apps/desktop/src/features/projects/RunnerDevices.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd657f1e0cfb1c29356e1c634a107bf9b1b92210d87a3022537cb93e7d1c978"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/review_changes.rs: src/tool_runtime/review_changes.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ToolRuntime::review_changes 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/review_changes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/review_changes.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7423b380b29d86cc23a5daf56406ff5335f8064b0b587725c042e1b9810ce6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/job_observation.rs: src/job_observation.rs changed 5 times in last 90 days, max cyclomatic complexity 18 in webcodex_core::job_observation::project_log_stream at line 297. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/job_observation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/job_observation.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"37064e1dbed4bfe89165c053dce7043f70bf58a29364daa945c9d34f377e9a13"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs: crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in JobManager::record_update at line 136. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/retained.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d228e1e455f24550e01a2c0c8ae29a6ab8940004b1fb15f806ed5b2b72a53d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-admin/src/commands.rs: crates/webcodex-admin/src/commands.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in webcodex_admin::commands::build_admin_request at line 569. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-admin/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":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c998ad422c67ebc13bc80db20a7e4161b3badacd01e468fce1212de2f5ca3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/peer_collaboration.rs: src/tool_runtime/peer_collaboration.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ToolRuntime::post_peer_message_tool 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/peer_collaboration.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/peer_collaboration.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31b5fd7c827adfa2fd41a74ecfd688fd3bea0087096aae57b65d6b841280578"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/e2e_generic_agent_ws.py: scripts/e2e_generic_agent_ws.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in GenericFixture.oracle at line 165. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/e2e_generic_agent_ws.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/e2e_generic_agent_ws.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c850340f87a9ffea840650cbbc167eecb1fb542b1f6d202019e9bcbb610767"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/model_ergonomics_telemetry/job_convergence.rs: src/tool_runtime/model_ergonomics_telemetry/job_convergence.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in ToolRuntime::job_convergence_record 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/model_ergonomics_telemetry/job_convergence.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/model_ergonomics_telemetry/job_convergence.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"276c7eec62b31a8286715edfe71a027289d41d36fc05713f1531539edcd7c7b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/hooks/useRuntimeUpdates.ts: apps/desktop/src/hooks/useRuntimeUpdates.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in useRuntimeUpdates.useRuntimeUpdates.refreshLocal at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/hooks/useRuntimeUpdates.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":"apps/desktop/src/hooks/useRuntimeUpdates.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c99353d09ad58a91e882e20ffdfca3dd511a7383fb488e5d0fe2c6b1ffe51a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-core/src/project_instructions.rs: crates/webcodex-core/src/project_instructions.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ProjectInstructionsSnapshot::retain_unavailable_scopes at line 278. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-core/src/project_instructions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_instructions.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db1546a6926c1f8097909155b3365ec206572825e374b6b39b8402021fc64ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/settings/LocalServicesPanel.tsx: apps/desktop/src/features/settings/LocalServicesPanel.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in LocalServicesPanel.LocalServiceControls 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/settings/LocalServicesPanel.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":"apps/desktop/src/features/settings/LocalServicesPanel.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"274b5abf437267f8ea94e059b014854c9041aefe076f2eacfb7387f48e9ace17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: extensions/browser-bridge/worker.js: extensions/browser-bridge/worker.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in worker.chrome.runtime.onMessage.addListener() at line 79. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- extensions/browser-bridge/worker.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/browser-bridge/worker.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea45429b96ab0de1574147d0cac72601f0ea3713ad1c5ed6763b36923e5beafa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/project_format.rs: crates/webcodex-runner/src/webcodex_runner/project_format.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in webcodex_runner::webcodex_runner::project_format::format_candidates_with_deadline at line 415. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/project_format.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_format.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"32da8e7fe2c41a78445796d8a3ea1cf50e65ec950730d5977186eceeff86f0c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/extensions/CodingAgentsPanel.tsx: apps/desktop/src/features/extensions/CodingAgentsPanel.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in CodingAgentsPanel.CodingAgentsPanel 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/extensions/CodingAgentsPanel.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":"apps/desktop/src/features/extensions/CodingAgentsPanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31761c1cf832d9a29b35a1a30a1ba998d95044248a83378773c4efbc2ee00d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-environment/src/privilege.rs: crates/webcodex-environment/src/privilege.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in webcodex_environment::privilege::apply at line 163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-environment/src/privilege.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"700824cef0d53e37c405e9631c26aab7c7158582f224d386488b82d03f200674"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: integrations/codex/read_handoff.py: integrations/codex/read_handoff.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in read_handoff.read_handoff at line 163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- integrations/codex/read_handoff.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":"integrations/codex/read_handoff.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0b5c8040aa9cfb0cc13d537a8bb1e9ff7057e451673283d23dcca0ea729864"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/console/RuntimeConsolePanel.tsx: apps/desktop/src/features/console/RuntimeConsolePanel.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in RuntimeConsolePanel.RuntimeConsolePanel 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/console/RuntimeConsolePanel.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":"apps/desktop/src/features/console/RuntimeConsolePanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"344279647e906636c62b8387e786361f948c3e23fe79ff9dfe6e64c6acbd85e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/computer_tools/accessibility.rs: src/tool_runtime/computer_tools/accessibility.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in webcodex::tool_runtime::computer_tools::accessibility::validate_computer_element_state at line 345. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/computer_tools/accessibility.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/accessibility.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"2159165acb881950cdea6d412dae178d71c76220e63673120de22c68b5a3a45d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/transport/bootstrap.rs: crates/webcodex-runner/src/webcodex_runner/transport/bootstrap.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in webcodex_runner::webcodex_runner::transport::bootstrap::run_runner 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/transport/bootstrap.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/bootstrap.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"465ab95ff6f0fc90236e43305234c7cff317c1421a7765de4ec1e0fe7603f914"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/prepare_desktop_bundle_macos.py: scripts/prepare_desktop_bundle_macos.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in prepare_desktop_bundle_macos.stage 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/prepare_desktop_bundle_macos.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/prepare_desktop_bundle_macos.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2618dac51e91fe277f5bbfb22a1c87f09915dd742d26db25f3b461caa756a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/e2e_cli_runtime_output.py: scripts/e2e_cli_runtime_output.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in CliRuntimeSmoke.run_samples at line 208. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/e2e_cli_runtime_output.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/e2e_cli_runtime_output.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c058a275183b77794c5d94818aeccacd75528659d2186162957a99191d83c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-environment/src/unified_update.rs: crates/webcodex-environment/src/unified_update.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in UnifiedInstallerManifest::parse_value at line 451. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-environment/src/unified_update.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f052e77f309443bd0730b29ee5c11f0ff6000887929121e1d1808de82d75af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-openai-tunnel/src/poller.rs: crates/webcodex-openai-tunnel/src/poller.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in TunnelClient::poller 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-openai-tunnel/src/poller.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/poller.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee033b1e5cdc1b2afaa0269d243174f9e4cc1fe5472b145d33d065ef043004d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/activity/WindowActivityDetail.tsx: apps/desktop/src/features/activity/WindowActivityDetail.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in WindowActivityDetail.WindowActivityDetail 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/activity/WindowActivityDetail.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":"apps/desktop/src/features/activity/WindowActivityDetail.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbc3fceffb7b3f3a1cacd9695519f0d07b4dc0aff6002206523af9d7b3e5468"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/activity/WorkflowSessionDetail.tsx: apps/desktop/src/features/activity/WorkflowSessionDetail.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in WorkflowSessionDetail.WorkflowSessionDetail 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/activity/WorkflowSessionDetail.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":"apps/desktop/src/features/activity/WorkflowSessionDetail.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"98de95385f88dfcad5ac14800d8cb02f40842f57cda4ea2db4b4b82946250c95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/extensions/CodingAgentEditor.tsx: apps/desktop/src/features/extensions/CodingAgentEditor.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in CodingAgentEditor.CodingAgentEditor 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/extensions/CodingAgentEditor.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":"apps/desktop/src/features/extensions/CodingAgentEditor.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"554b2d8ea6a73473edc6fe6eb4945525c058a5a142a5a958404bde3c9419463a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/connection/TunnelConfigDiagnostics.tsx: apps/desktop/src/features/connection/TunnelConfigDiagnostics.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in TunnelConfigDiagnostics.TunnelConfigDiagnostics 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/connection/TunnelConfigDiagnostics.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":"apps/desktop/src/features/connection/TunnelConfigDiagnostics.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"615492a28496eb6baf56159be0d2f81779abf83362c72069d4d1a32c70897cfd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/tools/call/specialized.rs: src/mcp/tools/call/specialized.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in webcodex::mcp::tools::call::specialized::ssh_resource at line 203. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/mcp/tools/call/specialized.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call/specialized.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6844ec5871183447a025614693ebf119937ea0014679175e400aebaebb76cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-runner/src/webcodex_runner/transport/poll_dispatch.rs: crates/webcodex-runner/src/webcodex_runner/transport/poll_dispatch.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in webcodex_runner::webcodex_runner::transport::poll_dispatch::handle_one_poll at line 497. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/transport/poll_dispatch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/poll_dispatch.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe37177b119bac7c47fd9726ee533db0aceb4483526a4d6f241b79b911cbb9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-openai-tunnel/src/bin/webcodex-tunnel/main.rs: crates/webcodex-openai-tunnel/src/bin/webcodex-tunnel/main.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in webcodex_openai_tunnel::bin::webcodex-tunnel::main::execute 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-openai-tunnel/src/bin/webcodex-tunnel/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/bin/webcodex-tunnel/main.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b2e8a47167d0ae67422d9ae71ec079aad997ca7b12e1bb0b2296e38fd9cc5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/features/projects/AddLocalProject.tsx: apps/desktop/src/features/projects/AddLocalProject.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in AddLocalProject.AddLocalProject 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/features/projects/AddLocalProject.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":"apps/desktop/src/features/projects/AddLocalProject.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cdf896e3b6b50dc9475184698d7b7cb88d883629d7cbfad080a1735a137752"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-environment/src/unified_update/view.rs: crates/webcodex-environment/src/unified_update/view.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in UpdateManager::status_view_for_target 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-environment/src/unified_update/view.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/view.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63cb0b0ac53d5cbb895f5bf9950cd65944261d2122446977dea8c1203ea7ea1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/package_unified_installer.py: scripts/package_unified_installer.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in package_unified_installer.package at line 600. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/package_unified_installer.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/package_unified_installer.py"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17fffe7ce73c1e57c968a7ee0e6dd781a7a967b5aa9c6ad2934580ff4d52ebf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/project_format.rs: src/tool_runtime/project_format.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ToolRuntime::project_format 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/project_format.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/project_format.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d25a9f65deefd97f494868579625fec087935a8d6ee9d268f5f47a493529f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-environment/src/unified_update/installer.rs: crates/webcodex-environment/src/unified_update/installer.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in webcodex_environment::unified_update::installer::apply_verified_installer at line 401. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-environment/src/unified_update/installer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/installer.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e86b0b9e6c9f94c0ab3ea45587dca07f1fdbf6b9499b3ae6eba25d442c97f67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/dispatch/skills.rs: src/tool_runtime/dispatch/skills.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ToolRuntime::dispatch_skills_authorized at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/dispatch/skills.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/dispatch/skills.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b832c73e4af7ac7572879859e0c76ba50f2f0fb14a768a7bc85508481e0b082b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-openai-tunnel/src/run_fence.rs: crates/webcodex-openai-tunnel/src/run_fence.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in webcodex_openai_tunnel::run_fence::check_archives at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-openai-tunnel/src/run_fence.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"625c811ced5b44c7f063eb84119b2a97e24a5452c2923644cf504dfbd7e6f552"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/e2e_project_knowledge_ws.py: scripts/e2e_project_knowledge_ws.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in KnowledgeSmoke.run 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/e2e_project_knowledge_ws.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/e2e_project_knowledge_ws.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70fd968dfd63bb0c4236d5280eda2a6dbdae1a3aa2bb93cd4a0ee6ab302974c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/webcodex-environment/src/unified_update/install.rs: crates/webcodex-environment/src/unified_update/install.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in UpdateManager::install_locked 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-environment/src/unified_update/install.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/install.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18f9bfcc1075f08f2c62a11e09e6223c19063f8b4eec4b87dbc36514748a0f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/build_download_page.py: scripts/build_download_page.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in build_download_page.validate_manifest 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/build_download_page.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build_download_page.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9ee2302851db5e18ae6eaf9f0da2ae6b6dd147e05cf2b8df6e4eb6e956fff3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/external_observations.rs: src/tool_runtime/external_observations.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ToolRuntime::external_observation_tool 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/external_observations.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/external_observations.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dd3389653e32e008ccf14e28bdccc2e0b4528227c8829f09f65b5f196e807f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/git/mutations.rs: src/tool_runtime/git/mutations.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ToolRuntime::git_commit_paths at line 237. Frequent change and high complexity in one file compound: schedule the 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/git/mutations.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/mutations.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"61529c7e26069343b62c6f40d215fee81db89c791630208289e09d78bee36770"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_runtime/runner_instructions.rs: src/tool_runtime/runner_instructions.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ToolRuntime::load_runner_instruction_files 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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- src/tool_runtime/runner_instructions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runner_instructions.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"df985ae854a75e1ddf4fc47f25b4c7071b56148869c776e4b7ecbb784aa585e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/ui-smoke/work-result-card.mjs: scripts/ui-smoke/work-result-card.mjs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is work-result-card.chrome at line 12), 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 Window details/collaboration layout and clarify the Work Result card (#1304)\u201D; \u201Cfix(work-result): follow working changes and pin review snapshots (#932)\u201D; \u201Cfix(collaboration): durable history and clearer Work Result conversations (#937)\u201D; \u201Cfix(ui): improve runtime observability and restore work results (#698)\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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- scripts/ui-smoke/work-result-card.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/ui-smoke/work-result-card.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5740817de8f493e088f8bd31aaa6e2fe0fb79ba74a064417f1d513d3d3a5cca0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/webcodex-cli/src/webcodex_cli/connect/probe.rs: crates/webcodex-cli/src/webcodex_cli/connect/probe.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is webcodex_cli::webcodex_cli::connect::probe::wait_for_connection at line 80), 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(discovery): bound Project listing and resolution suggestions (#1305)\u201D; \u201CRevert \u0022fix(runtime): converge observability on runner naming\u0022 (#679)\u201D; \u201Cfix(runtime): converge observability on runner naming (#676)\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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-cli/src/webcodex_cli/connect/probe.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/probe.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f252d5ae49528c95b03b06d41e18c48ea7abacfdab66b904d24e408ac24bf974"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/webcodex-store/src/window_collaboration.rs: crates/webcodex-store/src/window_collaboration.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is Database::project_window_operator_attention at line 460), 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: preserve Window Operator continuity and Host Sidecar visibility (#1020)\u201D; \u201Cfix(collaboration): durable history and clearer Work Result conversations (#937)\u201D; \u201Cfix(store): keep peer sender context out of inbound transcripts (#686)\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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-store/src/window_collaboration.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/window_collaboration.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11b7b26ea36e00f6908d2cd1f0d5b2aa7206a3744fbf673d08f4f90ed658bc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/webcodex-cli/src/webcodex_cli/controller_projects.rs: crates/webcodex-cli/src/webcodex_cli/controller_projects.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 11 (its worst body is ProjectClient::request 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(controller): continuously observe runner status and unify credent\u2026 (#1150)\u201D; \u201Cfix(cli): include project inventory in runner list (#1111)\u201D; \u201Cfix(runtime): tighten remote Runner readiness and Work Result polling (#712)\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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-cli/src/webcodex_cli/controller_projects.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_projects.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb6ebf04981513448e52468373e37cf0ef77e3743ee7b33887fa7b5199a2a45"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/webcodex-runner/src/webcodex_runner/runner_instructions.rs: crates/webcodex-runner/src/webcodex_runner/runner_instructions.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 11 (its worst body is webcodex_runner::webcodex_runner::runner_instructions::snapshot 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(release): close WebCodex 0.4.2 runtime and Desktop gates (#615)\u201D; \u201Cfix(runner): harden configured instruction path opens (#535)\u201D; \u201Cfix(instructions): isolate refresh state and preserve project guidance (#529)\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 17:38:35 \u002B08:00\u0027 --until=\u00272026-11-17 17:38:35 \u002B08:00\u0027 --full-history --no-merges -- crates/webcodex-runner/src/webcodex_runner/runner_instructions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/runner_instructions.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8337135e8b7f6d76890b52bdc029ab256ff33d30ea7d5c4fe2bf963de82ce2de"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 210 significant file(s) lose their only recent owner: crates/webcodex-cli/src/webcodex_cli/login.rs, crates/webcodex-store/src/agent_wake.rs, crates/webcodex-lsp/src/supervisor.rs, crates/webcodex-cli/src/webcodex_cli/service.rs, src/tool_runtime/sessions/tests.rs, crates/webcodex-code-mode/src/runtime.rs, crates/webcodex-core/src/plugin.rs, crates/webcodex-runner/src/webcodex_runner/plugin.rs (\u002B202 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e10726c29a32be82aa91e0908236fd6bd9045ef713b1035ee9bb09a930c427fd"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 21 significant file(s) lose their only recent owner: scripts/e2e_generic_agent_ws.py, scripts/agent_temporal_evidence.py, crates/webcodex-cli/src/environment/update.rs, crates/webcodex-environment/src/unified_update/install.rs, integrations/codex/experience_proposals.py, crates/webcodex-environment/src/upgrade/status/tests.rs, crates/webcodex-workflow-session/src/task_context.rs, crates/webcodex-environment/src/unified_update/install/tests.rs (\u002B13 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3c567dc0f2c117d130ac60f006427331c5f2be746b20667ddf877bdb3b004e36"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 3 significant file(s) lose their only recent owner: apps/desktop/src-tauri/src/lifecycle_log.rs, apps/desktop/src-tauri/src/lifecycle_log/tests.rs, apps/desktop/src-tauri/src/platform/windows/session_shutdown.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b718b4aeffacfabc097c0db17b87079716099e721112b494aaff5e98f5710c22"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 7 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 (243 single-owned of 1237 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; 1237 of the 1376 production source files in this repository met that bar). They are anonymized user #4 (2 file(s)), anonymized user #5 (2 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)), anonymized user #8 (1 file(s)), anonymized user #9 (1 file(s)) (\u002B1 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/tool_runtime/computer_tools/request.rs, crates/webcodex-browser/src/supervisor/reaper.rs, integrations/codex/session_recovery.py, integrations/codex/external_observation_hook.py, scripts/deb_lifecycle_acceptance.py, crates/webcodex-environment/src/upgrade/windows_package.rs, crates/webcodex-cli/src/webcodex_cli/controller_tui.rs, crates/webcodex-runner/src/webcodex_runner/coding_agent/diagnose.rs (\u002B1 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// todo thread exceeds this bound the assignment read fails closed rather than \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/model.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a85442bcab73a9c6cc61868fa70135e97968e1a5a9669c1741813073a001a2"}},{"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":"b2ad9f6b0e2a6b267561897ff350810c05996e54cab27dc93ca62b07d7365320"},"properties":{"commitSha":"19778e39e49841b70374f4335568106123cdf05e"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"51a495d1b0deb7d608cd9b8efe7e6a29fdabc2ff48c3d7a44de60172c1dff9b9"},"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":"d2516c9986a15c449663c09ace408aa7c824699d599a83a07df8bc38eb936a5d"},"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":"7d6236fb0bd4d2aca42682d5268054f86ba8c8f78e09dd2ddfc8c8a4f28f59bd"},"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":"74398ffc2958005aef8b8a2ecd1beb901fd45276ce303d47ae6d2e153442a186"},"taxa":[{"id":"CWE-116","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e2b3756849cfca680cd7e51b66eb714adfc45ee66495d1bb1ef20958815327cf"},"taxa":[{"id":"CWE-116","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"140aa83cfdbc0c46f9b33d6d636ec6eb12db313fc1716ee75954356b5b111911"},"taxa":[{"id":"CWE-116","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34c1dc1b471b09b53ad34de45f672252e7fa530cb654c0587ce1f89bfa73b2e9"},"taxa":[{"id":"CWE-116","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e4aef5a1ac8a9fe388930b013f0f488cc6865ae57de089f3b68ee2968e5b91f"},"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":"563b63dfb1af9b8997f742d909c09d95f8c94dc1afce59319086017bba773eb7"},"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":"c0e120600efe1f734c2c74ced6996e8f153d5e8ee02e54d146317bd08015e21a"},"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":"612bebabbf041ec10748e0445dd6b6ce7d993e33c20960e7c0362c1ab2e0c5a6"},"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":"8fff2919457135fa4d868f76a9637e1206e12875924fbbcfe63b1854717f50e5"},"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":"cc918c2ac474a17b940e1275324a984abc14a2b6825d6bfca3775eb1709e0afb"},"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":"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":"887c67d25b25612aac2f81ea0afe0accd7cc9541c5857fbeca073da2a6eadbaa"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65ca57580fd0ef9d40a17078fb9021acb84b472147841986fa441dc31ec3561c"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40ca340c4e4edb510fb04fe0d806bf900e93acc06e31d75c300ab8bd31883867"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"570770c038b01b818e20592a3c34c0af506232f7247f35c8bf37bec547a22df1"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72a08356fe864df59a59490ea348d6ef2778caed8ff08ac76610e00bf58a1ff8"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ea02a2ef0dfd59c1aaed8481632612593bde99bc82bcad3d56b80154ccf9209"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6dfe745fe85812a12db67f32a0aac60f56d9ad9822c6bacbc38e8ca4dce89183"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8de66fd189fee3f102b9ed1dc139132811a279330503c6fa8c386b3fd494d751"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62530dd29f310acebe131d7030354bea960eb426d86b4d426ca0859004a964e4"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2fc941580f075e7f9fefd109cf75187609370805fd304d579287c8d91490f163"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d69cdd66b8667cb00c0c178941092d13c10b4182650887f645aad00a3fd76a0e"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc0b4699476dadfaeda42f039488a6ceab0c684eb022019f255e2570b0e4d864"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"1d0463a6fed331050a188d2aef1fab1bc6a87f29638bb2c0c41a728feeaf21a2"},"taxa":[{"id":"CWE-290","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"4315b15e248180b421048cf7a724f6495a9f2fcc66899377e8e19d5db00b2999"},"taxa":[{"id":"CWE-444","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"4a3cf5173b5bc25e9a0215c89e14d76c0001c34bebf6cd910c40f3d1ea3f6c20"},"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":"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":"5e241e091a25e2fea425b2d01becfa62b7bbdde92f3d54bcdade8fba37165f1e"},"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":"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":"353a5e94356a915f24c40f2e72aa4e1ae39b68e7c147c4399feb1b2c112bb477"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5700cf8ee182fc440abb16030061d2e9976929eb60c880096208a514bc453b10"},"properties":{"dependency":{"package":"zip","version":"2.4.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429","RUSTSEC-2026-0545","RUSTSEC-2026-0548"],"severity":"critical","fixedVersion":"9.0.5","relation":"direct","declaredRange":"2","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f263be4203dc977c6cad5f6d9da314140b5741a931cf0e9db395c86905ea2f6"},"properties":{"dependency":{"package":"vitest","version":"4.0.18","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"4.1.0","relation":"direct","declaredRange":"^4.0.18","reachability":{"kind":"production","file":"frontend/test-v2/inventory-load.test.tsx","line":2}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da4316006252e9cf87d00f114e438f091d9f903dac38375552b4b50f7b03abb9"},"properties":{"dependency":{"package":"dompurify","version":"3.4.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"3.4.17","relation":"direct","declaredRange":"3.4.16","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e88205f657f7169642eadf2397070833a9c2ec511d6fd02c6251f8d0553cf09"},"properties":{"dependency":{"package":"picomatch","version":"4.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf3a2b70a4b9c41aab50dee20b2ee804f5de8ca0ff53f30c9d1010a5a2a6306f"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"1.2.2","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef48a5bdf48cc44e7697d2de5403628a4770025d7a7193063dbad5381c0fddd2"},"properties":{"dependency":{"package":"undici","version":"8.10.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.12.2","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e8742e1585c92fba58ccd426147435316ba0d160b90f1549ff4887a471916a9"},"properties":{"dependency":{"package":"vite","version":"8.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.2.4","relation":"direct","declaredRange":"^8.2.2","reachability":{"kind":"test-or-tooling","file":"apps/desktop/package.json"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4249787291e5cbcfb00d378f22393b28caa91786487ccd1fa2536d9a116af5fe"},"properties":{"dependency":{"package":"picomatch","version":"4.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e5a889b07d1485cb85eed469b27701b4b6f5450e4b29eadf09d261b76dde6cd"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"1.2.2","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f0438855b41cab575887c1c216e054aab56ced8967092069ce380671fab6f91"},"properties":{"dependency":{"package":"vite","version":"8.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.3.3","relation":"direct","declaredRange":"^8.3.0","reachability":{"kind":"test-or-tooling","file":"frontend/package.json"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd503c6b3ca2f550d324fe8896a3617a880514c349923e7d8e5176f2c06d1f11"},"properties":{"dependency":{"package":"vite","version":"7.3.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"7.3.7","relation":"separate-copy","declaredRange":"^8.3.0","reachability":{"kind":"test-or-tooling","file":"frontend/package.json"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22b7f498ad407f88300e5d325d85b79eee0529edb0a49d0e95286bd69bec1979"},"properties":{"dependency":{"package":"markdown-it","version":"15.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"15.0.3","relation":"direct","declaredRange":"15.0.2","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4787dcd10eb11417591c3f9a51008c4f58cbef28800f03248d3026b911cfeae"},"properties":{"dependency":{"package":"undici","version":"8.10.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.12.2","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"},"properties":{"dependency":{"package":"anyhow","version":"1.0.102","advisory":"RUSTSEC-2026-0190","severity":"medium","fixedVersion":"1.0.103","relation":"direct","declaredRange":"1","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09aadcc6f21d12b1dc09249844a2aae646dbfe24d2ce9815fa31408b55cf97c8"},"properties":{"dependency":{"package":"chrono","version":"0.4.44","advisory":"RUSTSEC-2026-0543","severity":"medium","relation":"direct","declaredRange":"0.4","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.2","advisory":"RUSTSEC-2026-0459","aliases":["BIT-sqlite-2026-119375","[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"severity":"medium","fixedVersion":"0.39.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d469c4cdd0b2892278c4ee90c01a5a8ea4872a98733c483777e04c904cfebdfc"},"properties":{"dependency":{"package":"proc-macro-error2","version":"2.0.1","advisory":"RUSTSEC-2026-0173","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5524f25221308ec94b7206b58afaa59996104c20abaa242285d451f5344e44b"},"properties":{"dependency":{"package":"rustls-pemfile","version":"2.2.0","advisory":"RUSTSEC-2025-0134","severity":"medium","relation":"direct","declaredRange":"2","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.52.3","advisory":"RUSTSEC-2026-0386","severity":"medium","fixedVersion":"1.53.3","relation":"direct","declaredRange":"1","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f6329e2b29fe1ee1dd724766af980b151618490b720201bbdc1839704210c3e"},"properties":{"dependency":{"package":"zbus_names","version":"4.3.4","advisory":"RUSTSEC-2026-0371","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","severity":"medium","fixedVersion":"0.13.4","relation":"direct","declaredRange":"0.13","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0395","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0396","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0397","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0399","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0400","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0401","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0402","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0404","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0405","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0406","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.0.16\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","severity":"medium","fixedVersion":"2.1.2","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77d4d5d4357ce0a5ade8f6f76c84914f1a2c80f9fe7358d9854254b760de650a"},"properties":{"dependency":{"package":"zvariant","version":"5.14.0","advisory":"RUSTSEC-2026-0370","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f67f0700e108bacf2f3dfd2008273e31f01b0ea1f2d5f9ef71c4f46ace73bbe9"},"properties":{"dependency":{"package":"zvariant_derive","version":"5.14.0","advisory":"RUSTSEC-2026-0372","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0eb6fc42810c19a97b4b687e5f15f36636a7ecc1ac4aa1954b3d736021cf1c68"},"properties":{"dependency":{"package":"chrono","version":"0.4.45","advisory":"RUSTSEC-2026-0543","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2647bd13b3d243217fe303be137c285582364b7c9ac0d157789b6388bdb2e5e7"},"properties":{"dependency":{"package":"glib","version":"0.18.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2024-0429"],"severity":"medium","fixedVersion":"0.20.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb002538432db3e29f9acd7465213ea3a395605923fe3009e20d1cf4f51d51c9"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-0370","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f41ac95481232d698ffdb71bb2612e1cfde3f79d95218b61a9aa15c01046210b"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.18","advisory":"RUSTSEC-2026-0523","aliases":["[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0524"],"severity":"medium","fixedVersion":"0.11.19","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58b97d85bf5f3f31d765bb0763fbc58511009a4f4a92fc1e0d50a38727d59c75"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.5.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d56bdc5216f8ffd7f4493a74c99aa4e1351a3a994cc7580974e08d0138c0b4e"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de0fe30dbf8f9168d0535839881f2c878a1e74c9120b1cb5ea710c43bdabb05d"},"properties":{"dependency":{"package":"rustls","version":"0.23.45","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0346","RUSTSEC-2026-0347","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"severity":"medium","fixedVersion":"0.23.46","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"984bc0a6f031fc73521aa3c52be08950e93edfe65054735bf8036fe274cde075"},"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"],"severity":"medium","fixedVersion":"0.103.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6b03b7e7645f1168d00b7044e64f51895bb45ec5bb629ce3839c52422da259f"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","severity":"medium","fixedVersion":"1.53.3","relation":"direct","declaredRange":"1","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9bc0f08e8869efc594f0351db7bb735024c0720f15859d35ed9789e9827bac5"},"properties":{"dependency":{"package":"unic-char-property","version":"0.9.0","advisory":"RUSTSEC-2025-0081","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc3ed0947197691bcd74fd53b52021948771dac836ea6650cb83980fae49027b"},"properties":{"dependency":{"package":"unic-char-range","version":"0.9.0","advisory":"RUSTSEC-2025-0075","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65ba5be29ebb32693e28e5cca052d69456d5188e1377237bd01230e0f406ddd1"},"properties":{"dependency":{"package":"unic-common","version":"0.9.0","advisory":"RUSTSEC-2025-0080","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b07cccb0e11d47c7cf4804e2035a2768c5af727173fde6d65871f9e2897bdca6"},"properties":{"dependency":{"package":"unic-ucd-ident","version":"0.9.0","advisory":"RUSTSEC-2025-0100","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"004ebb7ed86b101d1942420275018dfa8f92b53feb35e37d4984158f253a0dfa"},"properties":{"dependency":{"package":"unic-ucd-version","version":"0.9.0","advisory":"RUSTSEC-2025-0098","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e199090eb0f26e12b4ed4e842eea1f437ab1020a919165fec49d53145b20ea4"},"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"],"severity":"medium","fixedVersion":"1.0.10","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce18dadfc2b38c21291ff7d92336ed5c787d9ea856589ef57f7daa64be203ae9"},"properties":{"dependency":{"package":"zbus_names","version":"4.3.4","advisory":"RUSTSEC-2026-0371","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b83ac5c95140c95fcc085aa09ce011d27806fabb2730bc9b671d8e7007671d"},"properties":{"dependency":{"package":"zvariant","version":"5.15.0","advisory":"RUSTSEC-2026-0370","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5661a1945f666e417b7d12e88d89ccd8ed613037150cc31c36a8c01cd30b5a59"},"properties":{"dependency":{"package":"zvariant_derive","version":"5.15.0","advisory":"RUSTSEC-2026-0372","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1138a127f25ecb18eff4e63cde9e4d24b40b812723975cf838bd6c9223bf6a3f"},"properties":{"dependency":{"package":"@vitest/mocker","version":"5.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"5.0.3","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3950ff8d7f3e1e5accf61e4d41000d208d38501a3517b2d7c8e9e3df46fb5deb"},"properties":{"dependency":{"package":"@vitest/mocker","version":"4.0.18","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"4.1.11","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c759d0b493d2cdeeedf1c9777325a6742442b7cf4378e779b86b24e76946bed8"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","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":"880c5a9e3754ff2f8b6ebe629520afecbaa8208a75ab43985dc95bf538bfa60c"},"properties":{"dependency":{"package":"xxhash-rust","version":"0.8.15","advisory":"[GHSA redacted]","severity":"low","fixedVersion":"0.8.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79168a2135bf47161f9d7e379bb2042b01a385e0b133136f4abb61b6e9fa373b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f3de5ef0b48ca1917c9f9f2286bd0eae7c590636bcadbe579e0347bfdcbbb38"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: patches.rs, edits.rs, mutations.rs: 3 files \u2014 \u0060crates/webcodex-runner/src/webcodex_runner/patches.rs\u0060, \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/edits.rs\u0060, \u0060src/tool_runtime/files/mutations.rs\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bd1e54bcf135522543ff92e6c60e904fb93b1d05a131229ee45a933c1c9d2a"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: git.rs \u2194 git.rs: \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/git.rs\u0060 (context crates) and \u0060src/tool_runtime/git.rs\u0060 (context tool_runtime) sit in DIFFERENT parts of the tree yet change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u00603ab51de4\u0060 Fence paged reads to exact snapshots (#474); \u0060f1361496\u0060 Add safe Git hunk fragment continuation (#455); \u0060ea9b1626\u0060 Improve diff review recovery (#324) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/git.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54281b0453f1a350b19a11b22b2a497960d4a665323e8f08b37ad88f47bf24f8"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: jobs.rs \u2194 observe_jobs.rs: \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs\u0060 (context crates) and \u0060src/tool_runtime/observe_jobs.rs\u0060 (context tool_runtime) sit in DIFFERENT parts of the tree yet change together 60% of the time (12 of the 20 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 12 shared commits counted here, the most recent 3 are \u0060b6f8a00f\u0060 fix(jobs): compact successful observations within mixed batches (#1308); \u0060dff90878\u0060 fix(runtime): make run_job budgets and execution evidence explicit (#\u2026; \u006075d36d62\u0060 feat(jobs): classify meaningful vs heartbeat wake after batch truncat\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9782cba87f8061841042c9bcce457a990d30cd01c2914e664219b75be97d63"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: coding_tasks.rs \u2194 coding_task.rs: \u0060crates/webcodex-tool-contracts/src/registry/output_schemas/coding_tasks.rs\u0060 (context crates) and \u0060src/tool_runtime/coding_task.rs\u0060 (context tool_runtime) sit in DIFFERENT parts of the tree yet change together 57% of the time (27 of the 47 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 27 shared commits counted here, the most recent 3 are \u0060f0def36c\u0060 refactor(startup): retire unused full diagnostics and projection help\u2026; \u0060399fa744\u0060 perf(runtime): streamline bootstrap, validation truth, and Job UX (#768); \u00607a4981ad\u0060 feat(session): add durable model-facing session refs (#666) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/coding_tasks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc28212e398b08079b59b6fab968a31035206a88362ef6cf28599f3ec26111cf"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: recorder_metadata.rs \u2194 dispatch.rs: \u0060crates/webcodex-tool-runtime-contracts/src/recorder_metadata.rs\u0060 (context crates) and \u0060src/tool_runtime/dispatch.rs\u0060 (context tool_runtime) sit in DIFFERENT parts of the tree yet 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) \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 \u0060105c64cd\u0060 feat(skills): add trusted skill resource execution (#491) (at that commit the file was still \u0060crates/webcodex-tool-runtime-contracts/src/tool_call.rs\u0060); \u0060dbebb2fe\u0060 feat(skills): add exact-name skill loading (#490) (at that commit the file was still \u0060crates/webcodex-tool-runtime-contracts/src/tool_call.rs\u0060); \u006001333b96\u0060 Close remaining runtime turn-economy friction (#487) (at that commit the file was still \u0060crates/webcodex-tool-runtime-contracts/src/tool_call.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/recorder_metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ec9db22e1540a35c3a98fddd029166780de16d9db35667e0c485061394bec3"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: persistence.rs \u2194 tests.rs: \u0060crates/webcodex-workflow-session/src/persistence.rs\u0060 (context crates) and \u0060src/tool_runtime/sessions/tests.rs\u0060 (context tool_runtime) sit in DIFFERENT parts of the tree yet 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) \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 \u006039c096af\u0060 Drop pre-0.4 persisted-state compatibility (#238) (at that commit the file was still \u0060src/tool_runtime/sessions/persistence.rs\u0060); \u0060d0c82e1e\u0060 Canonicalize session ledger persistence compatibility (#232) (at that commit the file was still \u0060src/tool_runtime/sessions/persistence.rs\u0060); \u0060f122e336\u0060 Fix logical invocation accounting (#206) (at that commit the file was still \u0060src/tool_runtime/sessions/persistence.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/persistence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65964340e74026a36f6f7f8ac64ea264f0d34c15fc6f1cb79c38af20cd91ddcb"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: agent_task.rs \u2194 dispatch.rs: \u0060crates/webcodex-store/src/agent_task.rs\u0060 (context crates) and \u0060src/tool_runtime/dispatch.rs\u0060 (context tool_runtime) sit in DIFFERENT parts of the tree yet 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) \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 \u0060be952daf\u0060 feat(runtime): recover agent tasks from attempt_ref (#727); \u00604557e66d\u0060 feat(runtime): add agent_task_attempt_ref for fenced continuation (#688); \u00603ec0c709\u0060 feat(goal): add explicit controller agent routing (#541) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4bad9527d4824fe30d06265110624f4bcd228b33778592eaca1cc8d07d0ba9"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: http_transport.rs \u2194 model_ergonomics_telemetry.rs: \u0060src/mcp_tests/http_transport.rs\u0060 (context mcp_tests) and \u0060src/tool_runtime/model_ergonomics_telemetry.rs\u0060 (context tool_runtime) sit in DIFFERENT parts of the tree yet 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) \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 \u0060b967a155\u0060 feat: measure input normalization and repair ergonomics (#774); \u0060d80d4af8\u0060 Simplify Context result projections (#446); \u0060f75395a1\u0060 Canonicalize Session and Job recovery actions (#442) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58be65c497b921a03244a7c3c72ed4ce260297652723ba70e6982359ddeea930"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: tools.rs \u2194 plugin_tools.rs: \u0060src/mcp/tools.rs\u0060 (context mcp) and \u0060src/mcp_tests/plugin_tools.rs\u0060 (context mcp_tests) sit in DIFFERENT parts of the tree yet 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) \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 \u00607ae5d2b4\u0060 fix(mcp): preserve CLI collaboration and explicit acknowledgements (#\u2026; \u00604b0fc069\u0060 refactor(mcp): add common invocation envelope (#717); \u00605bc4a83f\u0060 feat(session): accept session refs for recorder provenance (#670) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f50ce65ad50b6bda5919052465f8749a4fb5cf009d7887fed31b826a4a04cd"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: persistence.rs \u2194 mod.rs: \u0060crates/webcodex-workflow-session/src/persistence.rs\u0060 (context crates) and \u0060src/tool_runtime/sessions/mod.rs\u0060 (context tool_runtime) sit in DIFFERENT parts of the tree yet 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) \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 \u0060d7c6470e\u0060 fix(session): preserve durable active identity across capacity churn \u2026; \u0060f122e336\u0060 Fix logical invocation accounting (#206) (at that commit the file was still \u0060src/tool_runtime/sessions/persistence.rs\u0060); \u00602f5048d0\u0060 Add durable Session message edit and withdrawal (#160) (at that commit the file was still \u0060src/tool_runtime/sessions/persistence.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/persistence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfc2861153d4b3a864a311491c5ea4f0e54598ef03c60694f06114ecdb17e76"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: tools.rs \u2194 protocol.rs: \u0060src/mcp/tools.rs\u0060 (context mcp) and \u0060src/mcp_tests/protocol.rs\u0060 (context mcp_tests) sit in DIFFERENT parts of the tree yet change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \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 \u00607ae5d2b4\u0060 fix(mcp): preserve CLI collaboration and explicit acknowledgements (#\u2026; \u00604b0fc069\u0060 refactor(mcp): add common invocation envelope (#717); \u006028ba6258\u0060 perf(runtime): reduce model-facing status and discovery cost (#695) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45d37e9edb6b7d3b2a6c6f7eed1a47e2b312bf03027faf9b2c0d884ceeb66e1"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: tools.rs \u2194 goal_plan_app.rs: \u0060src/mcp/tools.rs\u0060 (context mcp) and \u0060src/mcp_tests/goal_plan_app.rs\u0060 (context mcp_tests) 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 \u0060372bdb08\u0060 Diagnose continuation polling, eligibility and Wake timing (#1144); \u00605001d4ff\u0060 refactor(mcp): compose bundled App resources and descriptor bindings \u2026; \u00604b0fc069\u0060 refactor(mcp): add common invocation envelope (#717) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc3e7e7c0b475bdf1e05863516fc02ba0888b1f3303aae35cbc5a578ec19c96"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: fake_server.rs \u2192 navigation.rs, supervisor.rs, tests.rs: \u0060crates/webcodex-lsp/src/fake_server.rs\u0060 changes together with 3 other files \u2014 \u0060crates/webcodex-lsp/src/navigation.rs\u0060, \u0060crates/webcodex-lsp/src/supervisor.rs\u0060, \u0060crates/webcodex-lsp/src/tests.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/fake_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77a818b8190444695e09ed790e669ae549b6e0e133662140dc85e453472da82"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: protocol.rs \u2194 tools.rs: \u0060src/mcp_tests/protocol.rs\u0060 and \u0060src/mcp_tests/tools.rs\u0060 change together 83% of the time (10 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 10 shared commits counted here, the most recent 3 are \u00607ae5d2b4\u0060 fix(mcp): preserve CLI collaboration and explicit acknowledgements (#\u2026; \u00604b0fc069\u0060 refactor(mcp): add common invocation envelope (#717); \u006028ba6258\u0060 perf(runtime): reduce model-facing status and discovery cost (#695) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/protocol.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f383f33da905a10b55224bb826d69a1ebdff7b8b9707c9f52a6f045ec15b38ca"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: lib.rs \u2192 projects.rs, requests.rs, main.rs, registration.rs, runner_quic.rs, runner_ws.rs: \u0060crates/webcodex-runner-config/src/lib.rs\u0060 changes together with 6 other files \u2014 \u0060crates/webcodex-runner-registry/src/projects.rs\u0060, \u0060crates/webcodex-runner-registry/src/requests.rs\u0060, \u0060crates/webcodex-runner/src/main.rs\u0060, \u0060crates/webcodex-runner/src/main_tests/registration.rs\u0060, \u0060src/runner_quic.rs\u0060, \u0060src/runner_ws.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":"crates/webcodex-runner-config/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d13879a5f12a9ad3993c2176bb8ea14a506cdda9c4777dc40b9120aaed75745"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: recorder_metadata.rs \u2194 tool_audit.rs: \u0060crates/webcodex-tool-runtime-contracts/src/recorder_metadata.rs\u0060 and \u0060crates/webcodex-tool-runtime-contracts/src/tool_audit.rs\u0060 change together 79% of the time (11 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 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 11 shared commits counted here, the most recent 3 are \u0060105c64cd\u0060 feat(skills): add trusted skill resource execution (#491) (at that commit the file was still \u0060crates/webcodex-tool-runtime-contracts/src/tool_call.rs\u0060); \u0060dbebb2fe\u0060 feat(skills): add exact-name skill loading (#490) (at that commit the file was still \u0060crates/webcodex-tool-runtime-contracts/src/tool_call.rs\u0060); \u006015382006\u0060 Unify the project artifact model surface (#481) (at that commit the file was still \u0060crates/webcodex-tool-runtime-contracts/src/tool_call.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/recorder_metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddeb66d3b958ed59e3500e826968e531714bbff39b503025531d28ec6a6d6c1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: main.rs \u2192 runner_protocol.rs, projects.rs, validation.rs, runner_quic.rs, runner_ws.rs: \u0060crates/webcodex-runner/src/main.rs\u0060 changes together with 5 other files \u2014 \u0060crates/webcodex-core/src/runner_protocol.rs\u0060, \u0060crates/webcodex-runner-registry/src/projects.rs\u0060, \u0060crates/webcodex-runner-registry/src/validation.rs\u0060, \u0060src/runner_quic.rs\u0060, \u0060src/runner_ws.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"138eee343e38d75393e64771d7c02380b86936787af1b4f2923e35cf0dd71121"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: runner_quic.rs \u2194 runner_ws.rs: \u0060src/runner_quic.rs\u0060 and \u0060src/runner_ws.rs\u0060 change together 71% of the time (27 of the 38 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 27 shared commits counted here, the most recent 3 are \u00607b35aafb\u0060 refactor(query): share search and Git decoding, reduce test fixture d\u2026; \u00600946d4a9\u0060 feat(project): add bounded Go source formatting (#1180); \u00600bea9cff\u0060 fix(mcp): \u4FEE\u590D\u8D44\u6E90\u94FE\u63A5\u8FD4\u56DE\u4E0E\u5DE5\u5177\u76EE\u5F55\u8282\u70B9\u9650\u5236 (#1128) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runner_quic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca350160b9d4bc867090e705a3c887d841cc439b178cb6aa9617200732d6f2c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: registration.rs \u2192 requests.rs, runner_quic.rs, runner_ws.rs: \u0060crates/webcodex-runner/src/main_tests/registration.rs\u0060 changes together with 3 other files \u2014 \u0060crates/webcodex-runner-registry/src/requests.rs\u0060, \u0060src/runner_quic.rs\u0060, \u0060src/runner_ws.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/main_tests/registration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2778bc652c45e93a3bd61279b34d77eaecbb0c6225217a60e5ffcf038ac2a365"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: projects.rs \u2194 admin_project_lifecycle.rs: \u0060crates/webcodex-runner/src/webcodex_runner/projects.rs\u0060 and \u0060src/admin_project_lifecycle.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00602e6a1e92\u0060 Model managed worktree knowledge associations (#429); \u00601f7b2998\u0060 Separate project registration provenance (#268); \u00605748c59b\u0060 Add model-facing project unregister (#69) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f42c5125b598804c8c359f6b942572980894b870cee15634ed829fca5daf963"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: external_tools.rs \u2194 transport.rs: \u0060crates/webcodex-runner/src/webcodex_runner/external_tools.rs\u0060 and \u0060crates/webcodex-runner/src/webcodex_runner/transport.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 \u0060fe09ce87\u0060 Stabilize V1 CI and clean maintenance warnings (#30); \u00602c25ea11\u0060 fix: enforce a global runner shutdown deadline; \u0060f582fbd1\u0060 feat: add agent config hot reload (at that commit the files were still \u0060src/bin/webcodex_agent/external_tools.rs\u0060 and \u0060src/bin/webcodex_agent/transport.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/external_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2585461306d75917a2798f4c42358e03fe0b4ae3ce6b38552d40b746a1d267"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: server.rs \u2194 usage.rs: \u0060crates/webcodex-cli/src/webcodex_cli/server.rs\u0060 and \u0060crates/webcodex-cli/src/webcodex_cli/usage.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 \u006077e55176\u0060 security: require explicit opt-in for remote shared-key auth (#732); \u0060f3238f70\u0060 Improve first-run CLI readiness guidance (#221); \u0060de3e9211\u0060 Close Linux managed onboarding gaps (#216) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bb8a61afb89b6f22dc053f888beb814472bb8fc8f30039993571edfcd1dade"}},{"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":"1f3124c2a5390f9f91283d357eff1e26396023bba7a36a24dbe87eff7a3512b4"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"apps/desktop/public/computer-activity.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c602f91804c5e85e1e26b6b212c095c83b7e0fb35a1258d62bbbefd956efa7f"}},{"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":"extensions/browser-bridge/popup.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a91dc2b2431a386410358d8c421860e51286d1cbb78b1f3427b969c732f62d"}},{"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":"src/mcp_job_terminal_continuation_app.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1aaa94d750cee530b696e8a7a2c4886fc0621a3bafdd6e06de70c385714dac"}},{"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":"src/mcp_spreadsheet_app.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"921d11bf6b6adf24c3ae881e7a62eedb0b1aee65bb158d48d40307dd6b10b38c"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"download/index.html"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f431ca6eeb056825a60e387f7a004da39370c9b58ed887222cf5345ad5a687"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Carticle\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/runtime-v2/components/WindowActivityFeed.tsx"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa9b8745581a8db5703cf1ad508a746c3ad67e658c96d1b93e0bece22b188b8"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Cstrong\u003E: This \u003Cstrong\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":"frontend/src/runtime-v2/components/WindowBoardRow.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13bf7c035be078380232b5403bb118f94f29cf4341617ea1afa91e0ed3c44e7"}},{"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":"frontend/src/ui/AccentPalette.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed434602be5097790991509192302e8eca5f40c1b83d42578123d7805dd55d9"}},{"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":"frontend/src/ui/ProjectPicker.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9bfd18d802c4b30aec6b512863d65730d3a65c7cefc147f1181622e4f06de5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.work-search input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/runtime-v2/styles-production.css"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3326ab6ac7eb83e1284322fa0f91b12a3ffc6a4ef76f6685d28c6920b1e3a02"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.goal-list-filters input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/runtime-v2/styles-production.css"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b7cd82062df16b56c454e54a141a38b34cfc8390ba8477f04bb0ba8aab300c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.window-collaboration textarea\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/runtime-v2/styles-production.css"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd5c17da64aa1876aa982df03afa563e230de8b42394aca092c59f3ac613d09"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.auth-field input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/runtime-v2/styles-responsive.css"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9478e9d719502ca25643c87de9f4941fab4f80dd94e7dbfba310f3015e30320a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.composer textarea:focus-visible\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/runtime-v2/styles-workbench.css"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc706a9c5e80bdca51d054473087e3aa6316ba3f209341f01f42a397f5a14f8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.composer textarea\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/runtime-v2/styles.css"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9c0e98d4f12e6dd2beac43b2532bb251a4a0c20aec889c11ca6a1dbcbaef1e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.filter-bar input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/runtime-v2/styles.css"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8407235d3707cf3e3867469000d679b03852e742bd64845ddbd9d149dcc4b32"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.main-content:focus\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/styles/app.css"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb38b8bf929325613e27a96a05c06b62c1bbf80405b2f3ec2d0ec3d97de127ec"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: diagnostics.read_env calls \u0060std::fs::symlink_metadata\u0060: \u0060diagnostics.read_env\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/diagnostics.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"165cf0eef50100044982de1c5a587677c7e299dd4cec4fa3f2a1e415e0f5e266"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: diagnostics.read_env calls \u0060File::open\u0060: \u0060diagnostics.read_env\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/diagnostics.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b331f03490524cfa1bf2b5a567a34b3bb0d1c641d45113cb9b32e1c6af7cc32d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: mcp_providers.executable_file calls \u0060std::fs::metadata\u0060: \u0060mcp_providers.executable_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/mcp_providers.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f51666142a1b13010cde60aabc747696e4a4bdcc57c08ec81ee124f7e75195"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: runtime_selection.probe_binary calls \u0060std::fs::metadata\u0060: \u0060runtime_selection.probe_binary\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/runtime_selection.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"93849038349c62666ec5648d8b3a9d1c2033755de8d90689ebd39353f5e6b670"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: AppState.copy_console_credential calls \u0060File::open\u0060: \u0060AppState.copy_console_credential\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/diagnostics.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f02c8210d6faadbac0bb052f57f25a9f77677fd3869d349443ebdf44ac3b069"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: environment.validate_legacy_runner_layout calls \u0060std::fs::symlink_metadata\u0060: \u0060environment.validate_legacy_runner_layout\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4655f4e586ceeb8a348112718c9539db8e6f38395ac3530791f119ef9ed90eb7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: environment.validate_legacy_runner_layout calls \u0060std::fs::metadata\u0060: \u0060environment.validate_legacy_runner_layout\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba514149d7f81b2c9cf1eb4fa6a2a4a71f2a64716f630add7041f2c70360cb21"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: environment.validate_legacy_runner_layout calls \u0060File::open\u0060: \u0060environment.validate_legacy_runner_layout\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"37317c04e224515ed37b1f5207bd420e26bdafc1dbc3071671ba513afca86093"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: environment.config_fingerprint calls \u0060std::fs::metadata\u0060: \u0060environment.config_fingerprint\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"41658d664a5a716862b8932d7587bfd4238fd37149179364bb77a0f2944614b4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: environment.config_fingerprint calls \u0060std::fs::read_to_string\u0060: \u0060environment.config_fingerprint\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ee6742c62abe527eb6ecd80d5ff6ea2f9fdd78191547a5a70ade4f42e7e882"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: environment.config_fingerprint calls \u0060std::fs::read_to_string\u0060: \u0060environment.config_fingerprint\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"f079ce9c3a6f499af2c8aa2f36a330451a7e1f0266ee36b695087a36bcd6e49d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: DesktopCore.configure_environment calls \u0060std::fs::canonicalize\u0060: \u0060DesktopCore.configure_environment\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::canonicalize\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0275f6fe9e1aa95df07ee3343421f88f4238443fb984d898de840cc89f4ffb8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: DesktopCore.configure_environment calls \u0060std::fs::canonicalize\u0060: \u0060DesktopCore.configure_environment\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::canonicalize\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c643e08727fe3057f13c63da0a394703682ec5115406e84a0ec41bf01555a55"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: DesktopCore.migrate_environment calls \u0060std::fs::read_to_string\u0060: \u0060DesktopCore.migrate_environment\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c78147de88595bc308313c5d48a8b5ff5cdf26eb88acd3ec1f1b01d077719ce"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: DesktopCore.migrate_environment calls \u0060std::fs::canonicalize\u0060: \u0060DesktopCore.migrate_environment\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::canonicalize\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7810d914f79b6043dd1ca39f8ff91a5b718c6d5a4a336c6c7196d0473d4d4c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: persistence.read_stored_config calls \u0060std::fs::metadata\u0060: \u0060persistence.read_stored_config\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/persistence.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce6cc9802ead1467942157163a778c80f3ed1620b25bd3b0730292ef4b6a29b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: persistence.read_stored_config calls \u0060std::fs::read\u0060: \u0060persistence.read_stored_config\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/persistence.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2113a574886c6c940306c5ffed843b60af5df0f0d91a8003a1af7af5a93f261e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: persistence.write_atomic_file_with_hook calls \u0060std::fs::create_dir_all\u0060: \u0060persistence.write_atomic_file_with_hook\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/persistence.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d6a563f67f49fd419666fd03bd34a5111dd5bfe9de84c5035dfa2192d565e3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: persistence.write_atomic_file_with_hook calls \u0060std::fs::remove_file\u0060: \u0060persistence.write_atomic_file_with_hook\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/persistence.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9c32b2b4d2bbb46ce9c795899a3442a57d84f802e86a87e6dd405556bc2390"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: persistence.atomic_replace calls \u0060std::fs::rename\u0060: \u0060persistence.atomic_replace\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/persistence.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c354bbb6dbd70dfb88f7582902806a28bb0c5b52f1b56f18e660ec10455ba3b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: persistence.read_desktop_server_env calls \u0060std::fs::symlink_metadata\u0060: \u0060persistence.read_desktop_server_env\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/persistence.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fd3ff0665e89b32c50a66db4a5dd749adf4b6bee92348f297f9c6b7aa9d532"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: persistence.read_desktop_server_env calls \u0060std::fs::read\u0060: \u0060persistence.read_desktop_server_env\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/persistence.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abe9f6aebea8008efa7bad49c4847e93f9e1312f65618dca036cea1170e9f76"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: readiness.ensure_desktop_server_defaults calls \u0060std::fs::metadata\u0060: \u0060readiness.ensure_desktop_server_defaults\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/readiness.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5d76fbc1d0591bc4936ffd2e4ee751f1deda71568cf129d7c6686ed6543f93"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: readiness.ensure_desktop_server_defaults calls \u0060std::fs::read_to_string\u0060: \u0060readiness.ensure_desktop_server_defaults\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/readiness.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c33729f87d03510a9b92fb76056828e08ce3e8091d9fb4897d1c4348ba3f55"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: runtime_shell.configuration_file_fingerprint calls \u0060File::open\u0060: \u0060runtime_shell.configuration_file_fingerprint\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/runtime_shell.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e883f362f162bfd82179edd1bbebd7d6c7f0f0415eec21a04217ce86efa58c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: commands.resolve_token calls \u0060std::fs::read_to_string\u0060: \u0060commands.resolve_token\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"4062845cc08b84855c1a8632037049568966d1b45f7b6f53a63ca4610e822f36"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: commands.read_local_secret calls \u0060std::fs::read_to_string\u0060: \u0060commands.read_local_secret\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c6db5bf2b7723a14c008de64890758a34f8573ca4958e25114fbdf21172576"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: BridgeServer.start_at calls \u0060TcpListener::bind\u0060: \u0060BridgeServer.start_at\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060TcpListener::bind\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/bridge.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"76610ab16aaee1413409a362e3b2dda1d9644ec6979a506c5ec5eb0969cb7f99"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native.run_inner calls \u0060TcpStream::connect_timeout\u0060: \u0060native.run_inner\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060TcpStream::connect_timeout\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/bridge/native.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cabc54f1cad0099c9dbaa51f9c267d6893c92d4c057e2267eb958fc0bf34b5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profiles.private_dir calls \u0060std::fs::symlink_metadata\u0060: \u0060profiles.private_dir\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/profiles.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"66860f5e42c9d77939396618ff3178c205e3bbba4e6843d2ef779de0fae090a3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profiles.private_dir calls \u0060std::fs::symlink_metadata\u0060: \u0060profiles.private_dir\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/profiles.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b83314611887b18689ddf68f23e21dc2e139d1e516acbbb26010c526d605128"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profiles.private_file calls \u0060std::fs::symlink_metadata\u0060: \u0060profiles.private_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/profiles.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"34581ffe984bfd77e0769de9b92b0648de33eb72c3a8f9b91fd020b61bdf0983"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: launcher.trusted_system_file calls \u0060std::fs::symlink_metadata\u0060: \u0060launcher.trusted_system_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/update/launcher.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3526146ff00d7e6e1a0176d001c381c135f49729b41f9ef484371b1d751d4f30"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: launcher.trusted_system_file calls \u0060std::fs::symlink_metadata\u0060: \u0060launcher.trusted_system_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/update/launcher.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a31d950561816ab5e0ca105ebb632daccc276409ca9796a1000f784acf9a6b1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: disconnect.resolve_registration calls \u0060std::fs::read_dir\u0060: \u0060disconnect.resolve_registration\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/disconnect.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f340a9dd9da55a9b1bfba3dfbc78f2896653f58c3c62c915ecd10ada361935c0"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: disconnect.observe_exact_registration calls \u0060std::fs::symlink_metadata\u0060: \u0060disconnect.observe_exact_registration\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/disconnect.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"4561a175cbe6bd0ccb1e5c0b79a839bd9ef8c53a3b32d77e5b7e7e389a4b9c83"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: disconnect.observe_exact_registration calls \u0060std::fs::read_to_string\u0060: \u0060disconnect.observe_exact_registration\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/disconnect.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ea63466af055bac217225ed84d757f47946a6058b5c5018836ff8b21bdbe23"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: disconnect.remove_exact_registration calls \u0060std::fs::remove_file\u0060: \u0060disconnect.remove_exact_registration\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/disconnect.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"b741dc63e0968f5c2a418aa110c77df7088222b7580d76939dd9015c85e4a6e4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: oauth.read_managed_identity calls \u0060std::fs::read_to_string\u0060: \u0060oauth.read_managed_identity\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b10ba3199cdfff4fc77e9e0071586ae0a008c57146cbe2ff15d0990e1bdfb9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: oauth.read_oauth_profile calls \u0060std::fs::read_to_string\u0060: \u0060oauth.read_oauth_profile\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe45cffb66f3646bb2bc06c5a8dec16d14a0076f2951a12a045b673861598eb"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: oauth.run_oauth_connect calls \u0060std::fs::read\u0060: \u0060oauth.run_oauth_connect\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bffb5898d7c271a9fa27ea2aaa67615b996c99369decd07e4bc727e2406b9a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: oauth.run_oauth_connect calls \u0060std::fs::remove_file\u0060: \u0060oauth.run_oauth_connect\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"05af0bedaeb7af71254c106dae97946348cbde7c1f634629a136bd42691a454f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: oauth.observer_token_for_disconnect calls \u0060std::fs::read_to_string\u0060: \u0060oauth.observer_token_for_disconnect\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd5ae5cd8787cbf20f41e45ca05f8959b1f386e391a4e72afffdf78060c84c4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profile.read_key_file calls \u0060std::fs::metadata\u0060: \u0060profile.read_key_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c779408deae841d8ade232f9d067e40b37ec4c45e447e94493ab34c924dc3730"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profile.read_key_file calls \u0060std::fs::read_to_string\u0060: \u0060profile.read_key_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a57acb0b9179a2c9c5c02d219c6e69772c5b132efc03ec38af1adc62cbece73"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profile.validate_existing_regular_file calls \u0060std::fs::symlink_metadata\u0060: \u0060profile.validate_existing_regular_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6a0f5f1612a0a82f582ffe8c2c55ca73017359381eaaaf6476eb02b2aaa41e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profile.read_existing_runner_config calls \u0060std::fs::read_to_string\u0060: \u0060profile.read_existing_runner_config\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3252baea61bdbcb3161930adb2fb450eb8614c879a00fc49258a95b6fa97d5a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profile.read_project_files calls \u0060std::fs::symlink_metadata\u0060: \u0060profile.read_project_files\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"129420e727287d4357e94b0247bb1e6086e35669d695488b94ca8ed8265ea323"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profile.read_project_files calls \u0060std::fs::read_dir\u0060: \u0060profile.read_project_files\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bdc54319d9e95ea4354f206392f954a53ce1a2df7f18230f313bbe86ecbcde"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profile.read_project_files calls \u0060std::fs::read_to_string\u0060: \u0060profile.read_project_files\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3423078687c9ab37aad75b501aa69ebcca641365818900261690c8d1ad0f3e1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profile.recover_key_for_project calls \u0060std::fs::read_dir\u0060: \u0060profile.recover_key_for_project\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"22623b70c166ade8e55d3b789ce2ed7529bf1b33519e92eef1a0c7795c170449"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profile.atomic_write calls \u0060std::fs::read\u0060: \u0060profile.atomic_write\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"8406e90d00b26ede2a368792a4a840fd83085ed75910cd446952122bf601dbc2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profile.atomic_write calls \u0060std::fs::rename\u0060: \u0060profile.atomic_write\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5682c839bf17bc916bc20c58a89345ea23aa51f046a09b0be83562b3d107ef"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profile.atomic_write calls \u0060std::fs::remove_file\u0060: \u0060profile.atomic_write\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ad560b3335727e58e0bad6ac5cf1f15604bafd660eeedc6808b13769c39b81"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profile.protect_secret_file calls \u0060std::fs::set_permissions\u0060: \u0060profile.protect_secret_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"118ba04b221ce1037c2abc1031548e0c459cf5d4101fb319850549b4f8733772"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: profile.read_runner_document calls \u0060std::fs::read_to_string\u0060: \u0060profile.read_runner_document\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef59279e8eb660bdb3f0759f481426c6facbdfd68268fcadd4030dfbb9f98da"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: shared_key_oauth.read_profile calls \u0060std::fs::read_to_string\u0060: \u0060shared_key_oauth.read_profile\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/shared_key_oauth.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"479276c91de1654c30a49ead96071065952f427052f7fb4d0893362759372252"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: connections.ensure_component calls \u0060std::fs::symlink_metadata\u0060: \u0060connections.ensure_component\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connections.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"701a398fa948c29ca885a41a8c49984ea278b25d8c1a6bb3fd62f71a3c05b70a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: connections.ensure_component calls \u0060std::fs::create_dir\u0060: \u0060connections.ensure_component\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connections.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2a61bbc79859538ab595086ab55e4ab6b3de6bdf1c65a17fde49b5d613a2ff"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: connections.ensure_component calls \u0060std::fs::symlink_metadata\u0060: \u0060connections.ensure_component\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connections.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4e9c25ba5dd198a31cd883292e209c6d7981578b66ee0709b1ee40bb519059"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: connections.resolve_connection_parent calls \u0060std::fs::symlink_metadata\u0060: \u0060connections.resolve_connection_parent\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connections.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b28412ba528dd724d177a9fa006e00a9012bf3567c56ae7acffa564978da0e8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: connections.resolve_connection_parent calls \u0060std::fs::create_dir\u0060: \u0060connections.resolve_connection_parent\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connections.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b31e7e7d6c8af68df5e80827110082c589ac197fe612c00af57c1e3dd2cdfc3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: connections.is_real_dir calls \u0060std::fs::symlink_metadata\u0060: \u0060connections.is_real_dir\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connections.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe72c07b854eaf5bae14a5d897979da89af8d9cd77388b4f6cd15fb39d6da64c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: connections.is_regular_file calls \u0060std::fs::symlink_metadata\u0060: \u0060connections.is_regular_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connections.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fc5ab14c5732ec4e02aaa016cd3c1a2f1596fb6b8179554b43018b8851936f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: connections.read_connection calls \u0060std::fs::read_to_string\u0060: \u0060connections.read_connection\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connections.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fce196a70d7888a7d871c8adc04129251f0b01f04376b13c546e0ba589b2752"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: connections.real_subdirs calls \u0060std::fs::read_dir\u0060: \u0060connections.real_subdirs\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connections.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e13243333ffbc81dc7f83b8c124b1c5437da9e615eb9ba59cf0fd246d326db"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: controller.read_config calls \u0060std::fs::read_to_string\u0060: \u0060controller.read_config\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ebdeb5f623fb61e0acc109a43a0f6dfedc66dee9f46099547efa51a23c8331"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: controller.runner_view calls \u0060std::fs::read_to_string\u0060: \u0060controller.runner_view\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0186eb9cd53b1fe79bbb9d2b2d5c52b937159d8b0c4d979e3ec0ec1d11c219b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: controller.prepare_runtime_dir calls \u0060std::fs::symlink_metadata\u0060: \u0060controller.prepare_runtime_dir\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bcefb55b823a28be679f164d86e013099c750e2915dba4e86182d4179ce375"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: controller.remove_stale_controller_socket calls \u0060std::fs::symlink_metadata\u0060: \u0060controller.remove_stale_controller_socket\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dbebe65db3c2742f623cdb5d58550a7a4272a3fd578c8b5874c684b8e5aae3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: controller.remove_stale_controller_socket calls \u0060std::fs::remove_file\u0060: \u0060controller.remove_stale_controller_socket\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1111018fba806075f91fff7c4bd03c920c687472e94550df20f2e66d72f95b5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: controller.run_controller calls \u0060std::fs::set_permissions\u0060: \u0060controller.run_controller\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bebc444f4103ace50dd541f8f364de911f925bc4d5533df5d1b36012830e24"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: controller.run_controller calls \u0060std::fs::remove_file\u0060: \u0060controller.run_controller\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"700ef9b227d47bde687a71bf5b6c178ccb2c34e325861f5d7887766325fb6f5c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: controller.run_controller calls \u0060std::fs::remove_file\u0060: \u0060controller.run_controller\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba7a79026edfa2044194687b39ab336af7bf804dcb577bae7b88fec51f40c80"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: controller.run_controller_command calls \u0060std::fs::create_dir_all\u0060: \u0060controller.run_controller_command\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1988}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2103664743f6801f9f42bf7a21507d313e7c8e177a52b6e982a48d76bacd91d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: controller.run_controller_command calls \u0060std::fs::write\u0060: \u0060controller.run_controller_command\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::write\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller.rs"},"region":{"startLine":1991}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f727607ff1a172d30f7f1d276edc0d32a9e284a6cdb5fd7498f4c7068509e81"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: controller_tui.run calls \u0060thread::sleep\u0060: \u0060controller_tui.run\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060thread::sleep\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_tui.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c10a75f93dd01315087a24eabaa06600e1012408404df02c17c4f543818f7ac"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: controller_wsl2_nat_startup.validate_runner calls \u0060std::fs::read_to_string\u0060: \u0060controller_wsl2_nat_startup.validate_runner\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_wsl2_nat_startup.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"96191c3272f8965199e26ca169056157d77412bd7cb65b5885d15c4351e77429"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: env.read_env_file_value calls \u0060std::fs::read_to_string\u0060: \u0060env.read_env_file_value\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/env.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36f719eca756ea230e507e24a24d4e698009d48e6e112047d99044e5317b972"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: env.read_pairing_server_env_file_value calls \u0060std::fs::read_to_string\u0060: \u0060env.read_pairing_server_env_file_value\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/env.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10c90cd107330762c66ba73c85d3e624c62668f78696a5a0e8bf494559f14e9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.device_suffix calls \u0060std::fs::symlink_metadata\u0060: \u0060login.device_suffix\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9193a13568c68e26c2b0e13466194d0faee34b0b98dde50a4b23e8e257175d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.read_device_suffix_after_concurrent_create calls \u0060std::fs::symlink_metadata\u0060: \u0060login.read_device_suffix_after_concurrent_create\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0a4d371c9207518814f7bc73bf10ba7b9cc4c6ec47d3dfd9dc0837a8f0d5b1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.read_device_suffix_after_concurrent_create calls \u0060thread::sleep\u0060: \u0060login.read_device_suffix_after_concurrent_create\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060thread::sleep\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a6dd8b1b3f128d3a571144d301080dc32a90044c4f4988a84bf8d6f9d060c8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.read_device_suffix calls \u0060std::fs::symlink_metadata\u0060: \u0060login.read_device_suffix\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c71f996e686a06b5e8233b4fea9d936da9c7e387b3082dcc2f1ef5220be12e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.read_device_suffix calls \u0060File::open\u0060: \u0060login.read_device_suffix\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1f8c4abbf8af61176e80c83d430d6da8323a4671fb1539aa15b55764582b1b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.harden_dir calls \u0060std::fs::set_permissions\u0060: \u0060login.harden_dir\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f08ba560a62f957a127eaa65b3bc39d20a1842427f73cc1d2445e6f62cf9dc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.harden_secret_file calls \u0060std::fs::set_permissions\u0060: \u0060login.harden_secret_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"8159dfc0ac9c2c3de330bec1d779bd1165faaa9e7a9592826254766f58934612"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.create_staging_dir calls \u0060std::fs::create_dir\u0060: \u0060login.create_staging_dir\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a155d7a4de25447a651e2beee3ce7eb443986d6710f440539c3509f41ed2e77"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.remove_internal_dir calls \u0060std::fs::remove_dir_all\u0060: \u0060login.remove_internal_dir\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1310762afd0e92f01e9ab2a2c337cdd220d13dffea09d709b919fbffdc8593"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.publish_connection calls \u0060std::fs::symlink_metadata\u0060: \u0060login.publish_connection\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"646d7361e9d04fdaf52247fd004cc2702f27b115a700d1eaf725eb1087a8e0fd"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.publish_connection calls \u0060std::fs::rename\u0060: \u0060login.publish_connection\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c820390fb805955a4b004fabd7275613b5aa8f7db8fb70853334200dfdb6ee"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.publish_connection calls \u0060std::fs::rename\u0060: \u0060login.publish_connection\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b93d27b6cd10ca94317f3f9bab7b35125099513d5287e48901b11b876f129a3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.publish_connection calls \u0060std::fs::rename\u0060: \u0060login.publish_connection\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7eacd3d9c1f676b34477143f95f88c27f357c54dcf36398736f75107c93d8c4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.publish_connection calls \u0060std::fs::rename\u0060: \u0060login.publish_connection\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"d443268825d3891a6bee74dd01fcfc3dc501080aeae85b7e9fcef86c06133a79"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.publish_connection calls \u0060std::fs::rename\u0060: \u0060login.publish_connection\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e069b75179bd2d32d1d724b9cc8b1d5741548cdad19a8b7f72db12070eabf3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.write_descriptor calls \u0060std::fs::write\u0060: \u0060login.write_descriptor\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::write\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"619a2365ce180c771eb1dcb0cc8abaf9e73671d1c134eedfaef7669b58e9a3da"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.stage_connection calls \u0060std::fs::create_dir_all\u0060: \u0060login.stage_connection\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e015570565095e8bbb49326bba79ee8e90386a71cd05bc656f7a2ab49bea4b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.render_login_result calls \u0060std::fs::read_to_string\u0060: \u0060login.render_login_result\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8536835a6df70c05db98f744c6af7258cf191ba4e65030ff78cc69a2496fef"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.remove_connection calls \u0060std::fs::symlink_metadata\u0060: \u0060login.remove_connection\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"474af4cd306341b48daa59f32160a15f49678e60d1c2087a478c42b5a72afd79"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.remove_connection calls \u0060std::fs::remove_dir_all\u0060: \u0060login.remove_connection\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"a044607259fbdb5d115fd4f46ce1387b0470fcc9a29393c9d4f73b304a015c60"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.remove_connection calls \u0060std::fs::read_dir\u0060: \u0060login.remove_connection\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"41645429d523dc679fff9a438a2af5fb18318cb63e129e4bf2757fbbb77d8676"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: login.remove_connection calls \u0060std::fs::remove_dir\u0060: \u0060login.remove_connection\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/login.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afb7cd9b9eb17a1e541490d5501283a69e1fa6a5d0e0f2abb0307e353b09bdd"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: pairing.resolve_pairing_create_token calls \u0060std::fs::read_to_string\u0060: \u0060pairing.resolve_pairing_create_token\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/pairing.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"183d61c55fb2b7dff887223ef5329dbdde6d5aa2112d1cb8bfe8f6a4888102bf"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: plugin_init.run_plugin_init calls \u0060std::fs::create_dir\u0060: \u0060plugin_init.run_plugin_init\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/plugin_init.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"82672157376b905c5753ff31e57021f98dfed0b9344c2010d39f693374cffb00"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: plugin_init.prepare_destination calls \u0060std::fs::symlink_metadata\u0060: \u0060plugin_init.prepare_destination\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/plugin_init.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0859cc63b1d21e931d390d023b6988da38c84d8952b58a2223874e989eaf9ab4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: plugin_init.prepare_destination calls \u0060std::fs::create_dir_all\u0060: \u0060plugin_init.prepare_destination\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/plugin_init.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77760e71457b0571bcc4cd103148606a7e91ff62902dc2a75207f65b4acf382"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: plugin_init.prepare_destination calls \u0060std::fs::create_dir\u0060: \u0060plugin_init.prepare_destination\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/plugin_init.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ca271baf95501b7386895a0d7996db6db77b33cad055c4b5e7c1350d2ebf5c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: plugin_init.ensure_directory_empty calls \u0060std::fs::read_dir\u0060: \u0060plugin_init.ensure_directory_empty\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/plugin_init.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8958d5e42ad5fec21f8b46e5af8683e7c44c12b055937b487475545826fb001b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project.prepare_project_authority calls \u0060std::fs::symlink_metadata\u0060: \u0060project.prepare_project_authority\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3751f0d03850f6f128c66926b34f9767bde623c5466f04ae261336bf6c47c08f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project.ensure_registry_directory calls \u0060std::fs::symlink_metadata\u0060: \u0060project.ensure_registry_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d1c52c1936d176b5f0cfe428237e66bb5957cd10b37f72705c9aacbe0bef8c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project.ensure_registry_directory calls \u0060std::fs::create_dir_all\u0060: \u0060project.ensure_registry_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcb7fec1d8d50b5cab5cfc97f850bf036314e414df1f993eac6318fb42a723e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project.read_registration_config calls \u0060std::fs::symlink_metadata\u0060: \u0060project.read_registration_config\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f874078ec7b7f5f7b6cce3c1d862b744996e12665f2ed7ee5c033456065e605b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project.read_registration_config calls \u0060std::fs::read_to_string\u0060: \u0060project.read_registration_config\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"575fbd6954727d17f001968067e7e479682a7e609e17ec0baf222118a18a1723"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project.persist_registration_allowed_roots_if_unchanged calls \u0060std::fs::read_to_string\u0060: \u0060project.persist_registration_allowed_roots_if_unchanged\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ececb11b8a958b83304712d6dfce6a23a70393648bbec2a5322737141d6c136"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project.runner_config_candidate_unchanged calls \u0060std::fs::read_to_string\u0060: \u0060project.runner_config_candidate_unchanged\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4947351c7f5b38840eb12f055d658c93852d7cb01bf04c9b36054b5a1ec494"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project.persist_registration_allowed_roots calls \u0060std::fs::read_to_string\u0060: \u0060project.persist_registration_allowed_roots\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"0828505a10fb50e12ab10fb773e88a040a4ccb9b253a2cf514dc0c262110faaf"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project.read_activation_config calls \u0060std::fs::symlink_metadata\u0060: \u0060project.read_activation_config\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0db311bf6a46450cbd4a7fec6a3695f05d0a02a5975750701ea4bb25daf9745"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project.read_activation_config calls \u0060std::fs::read_to_string\u0060: \u0060project.read_activation_config\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/project.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed78881c3804931f13192b0028263ee9aceb5b394dfddbab7d7318787c016271"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: runner_service.read_runner_config_metadata calls \u0060std::fs::read_to_string\u0060: \u0060runner_service.read_runner_config_metadata\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/runner_service.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b2f025ea11dcc3f6cf4669ae984e44584aa7275235d3f578aab113e9904e02"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: server.run_server_init calls \u0060std::fs::create_dir_all\u0060: \u0060server.run_server_init\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/server.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46cd4b9f5f5093f44ca355f188f77be0ac38421d79f773856a21e9a834dd269"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: server.preflight_server_install calls \u0060std::fs::metadata\u0060: \u0060server.preflight_server_install\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/server.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c714d4dd659d955bbf6e718062b6ec6914fce964d22c0a4afb647464aebaa48"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: server.preflight_server_install calls \u0060std::fs::metadata\u0060: \u0060server.preflight_server_install\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/server.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a1ef6d35b7c216945dcabcfe441a5de4eb6403be0469726a4092e7e3e3755c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: server.preflight_server_install calls \u0060std::fs::metadata\u0060: \u0060server.preflight_server_install\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/server.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94cbd1edf726aedcdc4466fbdd2423a275c9bbdfb56b41882b63d65e36e998c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: server.preflight_server_install calls \u0060File::open\u0060: \u0060server.preflight_server_install\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/server.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f5aeee102a2326de3542816d20510d7cef125cee6a69d9d84eae6cf645268d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: server.resolve_status_token calls \u0060std::fs::read_to_string\u0060: \u0060server.resolve_status_token\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/server.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0947e9c5a8db3f5d5a252776a21e61dfd689fe44aa270361555eb0fb991487"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.ensure_service_file_parent calls \u0060std::fs::create_dir_all\u0060: \u0060service.ensure_service_file_parent\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6fd44a72badcafc6d5493696879f2c4b3e8673738723a7edf66e4a5e16a979"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.ensure_service_file_parent calls \u0060std::fs::symlink_metadata\u0060: \u0060service.ensure_service_file_parent\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"30822d262b2ccc35b9a50e5f71bb5dbf970af38220b797c2da65ce08323a6a60"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.write_text_file_atomic calls \u0060std::fs::metadata\u0060: \u0060service.write_text_file_atomic\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c4a519e8ab2c04d869ec572dd7ee173df4eca8b8dcda6c10d7cbd2f92e2441"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.write_text_file_atomic calls \u0060std::fs::rename\u0060: \u0060service.write_text_file_atomic\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"1457524792f8cc2a6ebb8f6e3a8bfbc37f9d764656bf0d0aa63c573f0e46101c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.write_text_file_atomic calls \u0060std::fs::remove_file\u0060: \u0060service.write_text_file_atomic\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6662dd19247f89c4bf48ffc1c1f279df6d2d80388a9db9eac0de3c46ff1c53"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.preflight_unit_path calls \u0060std::fs::symlink_metadata\u0060: \u0060service.preflight_unit_path\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f64a19d99ad390c50971450cfb2c8a26493cd3020f1ea5468b094b4508f050"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.preflight_unit_path calls \u0060std::fs::read_link\u0060: \u0060service.preflight_unit_path\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_link\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6b6abb416867c39e221a11660b1bc3c1c20f7ca6fc05c21eb6bcbf3506e4a6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.preflight_unit_path calls \u0060std::fs::metadata\u0060: \u0060service.preflight_unit_path\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6a107b2baeb008e87ce469eb2f8dc4c90365d36429145c374cf4077a52b7ab"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.restore_unit_file calls \u0060std::fs::remove_file\u0060: \u0060service.restore_unit_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83ba105b573db7324fc645c278017e8c390c26913e89bbf01eb1d2646792bb3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.capture_install_snapshot calls \u0060std::fs::read_to_string\u0060: \u0060service.capture_install_snapshot\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d651d6c610324f0578c0188cdddde06567ecfc6c249f8ff9933036142c02df3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.read_managed_unit_for_uninstall calls \u0060std::fs::symlink_metadata\u0060: \u0060service.read_managed_unit_for_uninstall\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c25afdd6fd48857003e1bad59548c4b54882c71ca4e9e4fa507859dcc3bd105"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.read_managed_unit_for_uninstall calls \u0060std::fs::read_to_string\u0060: \u0060service.read_managed_unit_for_uninstall\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9026834c68d7affeaa24e36c4e075d3bcfce21755dc057763f76ab0b3310f1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.uninstall_server_unit_pair_with_executor calls \u0060std::fs::remove_file\u0060: \u0060service.uninstall_server_unit_pair_with_executor\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12eedb3b536b5b4fa7f0a4588e55f8d275fc0e81daaeffc9ba9a7a7c32937ee"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.uninstall_server_unit_pair_with_executor calls \u0060std::fs::remove_file\u0060: \u0060service.uninstall_server_unit_pair_with_executor\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe326e2032e27f7d735ac3a89aec99ddf368c3941216a21ece5efe9d5c676a5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.uninstall_unit_with_executor calls \u0060std::fs::read_to_string\u0060: \u0060service.uninstall_unit_with_executor\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ef6e016fcb0d1e6c9defb0b0fd30d59b9733eaae89c7fb5b6b09f57783e232"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.uninstall_unit_with_executor calls \u0060std::fs::remove_file\u0060: \u0060service.uninstall_unit_with_executor\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"56218295a803af4bc66f9d48163d7e166d93ed6a8e52dc08ff923d058d71e807"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: system.write_text_file calls \u0060std::fs::create_dir_all\u0060: \u0060system.write_text_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc3569bec0ed64902bb6adbd9fa5b923a5961378702ee5421b5aa633c615e57"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: system.write_text_file calls \u0060std::fs::set_permissions\u0060: \u0060system.write_text_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"90da00f8403549ce82a0996620b9c4b8c496d6ce2eb48fb768532104112e7875"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: system.write_text_file calls \u0060std::fs::write\u0060: \u0060system.write_text_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::write\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d478dfa5cdb3afa44e34e70d296430d8ff4a90f1016e820f468dbbdf4ac678"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: system.write_windows_secret_text_file calls \u0060std::fs::remove_file\u0060: \u0060system.write_windows_secret_text_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"384644158773517d6fe91022e64f5443b3121042692e0ced16ebc77b189d9e11"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: system.read_optional_token calls \u0060std::fs::read_to_string\u0060: \u0060system.read_optional_token\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/system.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6218c6602a60fd6441a20dc017ad92275b6fdf71b89625d18eb8e21e2564941"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: cloudflare_tunnel.cleanup_regular_file calls \u0060std::fs::symlink_metadata\u0060: \u0060cloudflare_tunnel.cleanup_regular_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e24a13535039b7fb58315fd46a7359d8825aabd88c1f117ebf3fc2da280aa29"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: cloudflare_tunnel.complete_cloudflare_profile_cleanup calls \u0060std::fs::read_dir\u0060: \u0060cloudflare_tunnel.complete_cloudflare_profile_cleanup\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d270a6dedb14efdb008f3c5b08479957d864b2be7f4c38fdff2459efb20d8d15"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: cloudflare_tunnel.complete_cloudflare_profile_cleanup calls \u0060std::fs::symlink_metadata\u0060: \u0060cloudflare_tunnel.complete_cloudflare_profile_cleanup\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"845b31f68ea3c0cc7c9969654936582cf7a5c600943a565d2ed4f1dc954f6f86"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: cloudflare_tunnel.complete_cloudflare_profile_cleanup calls \u0060std::fs::read_dir\u0060: \u0060cloudflare_tunnel.complete_cloudflare_profile_cleanup\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ffcaabdb06a481620c383bf520f433bd46b1f890f16dd3e7da866107c0e49d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: cloudflare_tunnel.complete_cloudflare_profile_cleanup calls \u0060std::fs::remove_file\u0060: \u0060cloudflare_tunnel.complete_cloudflare_profile_cleanup\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"4934f298a7e0b835874949e34ee96860b022a26bdc1e3c0c97a119a9b9b27463"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: cloudflare_tunnel.complete_cloudflare_profile_cleanup calls \u0060std::fs::remove_dir\u0060: \u0060cloudflare_tunnel.complete_cloudflare_profile_cleanup\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3efebad97458afce84124702ec613651b51cb9afe5fba3b2932190906822f79"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: cloudflare_tunnel.desired_ingress_port calls \u0060TcpListener::bind\u0060: \u0060cloudflare_tunnel.desired_ingress_port\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060TcpListener::bind\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"5549f78f9741b4d9054f177653e710d9500cc9b8435067137273c47d8db4a111"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.configure_cloudflare_tunnel_profile calls \u0060std::fs::read_dir\u0060: \u0060NativeEnvironment.configure_cloudflare_tunnel_profile\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cd7cba368b6c88d90f429f3baba7ef234a2704d8c917f2829d438a6822c002"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.configure_cloudflare_tunnel_profile calls \u0060std::fs::remove_file\u0060: \u0060NativeEnvironment.configure_cloudflare_tunnel_profile\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5745efc37e60c61ceaab8bf8a3f6dccd51d35075ef9e83088c7d30096712ff23"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: embedded_tunnel.embedded_tunnel_profiles calls \u0060std::fs::symlink_metadata\u0060: \u0060embedded_tunnel.embedded_tunnel_profiles\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/embedded_tunnel.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"335f4ce98b1cc3b40155e7fc579a06f3b1a32bfacb80828396f9c8558d9aa03c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: installer_authorization.clear_authorization_under_lock calls \u0060std::fs::remove_file\u0060: \u0060installer_authorization.clear_authorization_under_lock\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/installer_authorization.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75042e75bcef3fec3617bdd2da4163f7c4c13fcb626b2d6cbcf7aa6e861440e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: installer_authorization.clear_authorization_under_lock calls \u0060File::open\u0060: \u0060installer_authorization.clear_authorization_under_lock\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/installer_authorization.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"079638979a8780dbfe49f1fc8668ad57971ee31e72631c999540130ec3571e98"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: installer_authorization.cancel_matching_authorization calls \u0060std::fs::remove_file\u0060: \u0060installer_authorization.cancel_matching_authorization\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/installer_authorization.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b3e25a13503b7c43fff4d7d01355b673c7bbdd6a3c99493435951c1c595502"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: installer_authorization.cancel_installer_authorization calls \u0060std::fs::remove_file\u0060: \u0060installer_authorization.cancel_installer_authorization\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/installer_authorization.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f6a2ecda4f2810949daf8b6bed042ddc18c83e979de43983efbca1d111cb55"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: installer_authorization.cancel_installer_authorization calls \u0060File::open\u0060: \u0060installer_authorization.cancel_installer_authorization\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/installer_authorization.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b2a12a7cae602fa0c1f4f3f6e684bc9e9db0cbcf10af7d28579acfcedb2e26"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: inventory.load calls \u0060std::fs::symlink_metadata\u0060: \u0060inventory.load\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/inventory.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2dee6cea3027c6889b9057c2ee89caa6afb61fdc466058f8806e74d8c4c15b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: paths.local_path_entry calls \u0060std::fs::symlink_metadata\u0060: \u0060paths.local_path_entry\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/inventory/paths.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc13052ca38628cf8eef584398e548374dcfb2296a6de6470e983d71cbe6fb9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: migration.copy_data_tree calls \u0060std::fs::symlink_metadata\u0060: \u0060migration.copy_data_tree\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d053844c34d47b59833a2ec6b11068b654e7166a09e20ee102439a8b42789ae"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: migration.copy_data_tree calls \u0060std::fs::read_dir\u0060: \u0060migration.copy_data_tree\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a967dfb8350f90b57bfe5e4fec56cd98906b0ff54032a062988f30dc0e602e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: migration.copy_data_tree calls \u0060std::fs::symlink_metadata\u0060: \u0060migration.copy_data_tree\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29f708977229c294b408a232eed9efd11c8d082371989ca064e3601c2634046"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: migration.copy_data_tree calls \u0060std::fs::copy\u0060: \u0060migration.copy_data_tree\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::copy\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"36368cd4d31bafd0fad2b0d426f0e0eea934d0d1fc618564980905e66d508176"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: migration.copy_data_tree calls \u0060std::fs::set_permissions\u0060: \u0060migration.copy_data_tree\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4101498dadf2e3d1699de0c99ef2a836c3234d9e942853297487d0142da9dadf"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: migration.copy_data_tree calls \u0060std::fs::rename\u0060: \u0060migration.copy_data_tree\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"743097b511a9c7c120c6a472bc3b1b6c492938f2f7ac35330d57c0b99d5af6e0"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.add_project calls \u0060std::fs::remove_file\u0060: \u0060NativeEnvironment.add_project\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea9b804b30fd10937062a9794d27c8ffd1ba207280139e0f8cacf639dfc962e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.remove_project calls \u0060std::fs::remove_file\u0060: \u0060NativeEnvironment.remove_project\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"79eb127cb3589837afb764b8f3e1f57756e678321ab613c349be33dab9c75b0b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.apply calls \u0060std::fs::remove_file\u0060: \u0060NativeEnvironment.apply\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7ae3774ab9f569fee8e7ce451d0a5eb861747a02b40c64b1dffdab1e51dbf3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native.service_log_diagnostic calls \u0060std::fs::symlink_metadata\u0060: \u0060native.service_log_diagnostic\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eee47378ff6952efa894baffceeecfc338a26970e5d865e59d42b6db2ba1702"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native.recover_uncreated_username calls \u0060std::fs::symlink_metadata\u0060: \u0060native.recover_uncreated_username\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"098377a13c963bccebb2f4a1b64a0e9d2663f41d75df2499dd1df6e6c9ff1706"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: privilege.restore_upgrade_programs calls \u0060std::fs::remove_file\u0060: \u0060privilege.restore_upgrade_programs\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8008a4f3a49ae0d9335f848dac64a9fc7485aefeacbf18e6d431219aa642980d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: privilege.restore_upgrade_programs calls \u0060std::fs::remove_file\u0060: \u0060privilege.restore_upgrade_programs\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0a2583dba0182fbe89c475ed377ef792028f43ef87d1d304f58a3aa717939d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: privilege.service_operation_spec calls \u0060std::fs::remove_file\u0060: \u0060privilege.service_operation_spec\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebef39bb0c5a993e5fe4f585811d9cbbbd649cb75e2fe8c3bb2769a92d2e168"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: privilege.service_operation_spec calls \u0060std::fs::remove_file\u0060: \u0060privilege.service_operation_spec\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9513a171ab2ae45a45caaf0cb60dff4d73d66453479a8af22c5e4917963b2e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: privilege.open_exchange calls \u0060std::fs::symlink_metadata\u0060: \u0060privilege.open_exchange\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/privilege.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"66158903e56daf540c8f44f009ba17b42b206d39eb8389e75af60b1d5a34828e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: windows.capture calls \u0060thread::sleep\u0060: \u0060windows.capture\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060thread::sleep\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/process/windows.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd91933ccadb578ebf43517fa2f6febbff8c8a9ce6547c21949c90e86373a6d1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: runtime_entry.validate_service_env_file calls \u0060std::fs::symlink_metadata\u0060: \u0060runtime_entry.validate_service_env_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/runtime_entry.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee782d707ec2160f950f82d31a1ab60ad6ee04b5535d5e9a8373caa9245c7eb"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: runtime_entry.validate_service_env_file calls \u0060File::open\u0060: \u0060runtime_entry.validate_service_env_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/runtime_entry.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77fed9d408e51658a89a8d680f21237d7663b5559c9cef0924cd613f1c657c6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: runtime_entry.validate_windows_env_acl calls \u0060std::fs::symlink_metadata\u0060: \u0060runtime_entry.validate_windows_env_acl\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/runtime_entry.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b0324700f1345beda030001e5228b9b7674327e91304562da01071c7f926b1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: log.validate_directory calls \u0060std::fs::symlink_metadata\u0060: \u0060log.validate_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/log.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7774a72acdfcbee1fffc86618b41c40826a584e7a5750f18db9ca110b1be2e12"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: log.validate_directory calls \u0060std::fs::symlink_metadata\u0060: \u0060log.validate_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/log.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"58674147731fc33af1b970ff30c1f61c2a3c3a5eeb267da9c36ebeed327dcdb5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: log.validate_directory calls \u0060std::fs::symlink_metadata\u0060: \u0060log.validate_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/log.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa694dcb2c8910dfee6adb0d931b0486d84a860564b4f519c1094f76d62db29"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: log.validate_file_path calls \u0060std::fs::symlink_metadata\u0060: \u0060log.validate_file_path\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/log.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"612cde2a5372ca201047233c86d5914b3b76d55fd03cf82f1a1d0162baa6c5b6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.check_files calls \u0060std::fs::metadata\u0060: \u0060service.check_files\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/mod.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7738d404f0e9d364f7573ed898a49e2a8bf8b0dcc19d5b7974e0fa8b6c2f249"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.check_files calls \u0060std::fs::metadata\u0060: \u0060service.check_files\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/mod.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bea06d4122bbdd3f879a4591cc6696183df336097bb65d0942a34f3b4418c6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: session_service.plan calls \u0060std::fs::symlink_metadata\u0060: \u0060session_service.plan\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/session_service.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fee7f4fd2946ba08df273f36b7cf06e9c5fdf170ec2abe83293c25a269f95fb"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: EnvironmentStore.open_existing calls \u0060std::fs::symlink_metadata\u0060: \u0060EnvironmentStore.open_existing\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e148198f3403a5b4b7edf2d2df258b317c2762d399c41c7e34fce04ac1f8c628"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: EnvironmentStore.open_existing calls \u0060std::fs::symlink_metadata\u0060: \u0060EnvironmentStore.open_existing\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"bded79b0a9bd936a70428a27c832aa2ec9841556ce4eb46feeb247984faca04a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: EnvironmentStore.open_existing calls \u0060std::fs::symlink_metadata\u0060: \u0060EnvironmentStore.open_existing\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"84330788ece1060b3c598f49a66303ce644533d94cf9c410841599e8f7c09638"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: storage.validate_directory_ancestors calls \u0060std::fs::symlink_metadata\u0060: \u0060storage.validate_directory_ancestors\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"89447e38380d627b4a43a0a82e341e9f6b5aa8f4a7766fce6516e8bd07e8a7f0"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: storage.validate_existing_private_directory calls \u0060std::fs::symlink_metadata\u0060: \u0060storage.validate_existing_private_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4a72abc66b8c9202a7bf774fe3ba99878a90c68495aeb29976c18a8bdc68fc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: storage.validate_existing_private_directory calls \u0060std::fs::symlink_metadata\u0060: \u0060storage.validate_existing_private_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb96f4da0ff2563279d2b3ca4e84499c64b89b8035dd6f9483d1b5612fd11fe6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: storage.open_existing_private calls \u0060std::fs::symlink_metadata\u0060: \u0060storage.open_existing_private\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd602f906521cba402f22b272f221677118cc3f2231938d2206f4852fde0e7ae"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: storage.read_private calls \u0060std::fs::symlink_metadata\u0060: \u0060storage.read_private\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b52af506eba29a3a27e0c361e2e1410152dab4d0f538f082041154b38095f77"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: storage.atomic_private_write calls \u0060std::fs::symlink_metadata\u0060: \u0060storage.atomic_private_write\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b764876e2487eeb7183186386717c1acc14a9d76c27981575e94d0f3c6a08d2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: storage.atomic_private_write calls \u0060std::fs::rename\u0060: \u0060storage.atomic_private_write\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9e625477cef3e02b59783bcfb7546604e260debb9cfa80c0bb21c53f63ecc9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: storage.atomic_private_write calls \u0060File::open\u0060: \u0060storage.atomic_private_write\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/storage.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38ef169c5803be906d0423838f034016feec086aa2c3744eefefad51f8cfa23"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: tunnel.remove_created_profile_binding calls \u0060std::fs::symlink_metadata\u0060: \u0060tunnel.remove_created_profile_binding\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c373c3b4f77dd2c7808239f7458fc7b862fc3b42329a40446f4b95d449d988"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: tunnel.remove_created_profile_binding calls \u0060std::fs::remove_file\u0060: \u0060tunnel.remove_created_profile_binding\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"938de7d73197aaf74729d9b00fe1f21db327c2c6310b700ed89a9c3284f3d3d1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.remove_tunnel_fenced calls \u0060std::fs::remove_file\u0060: \u0060NativeEnvironment.remove_tunnel_fenced\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"65617de2e5d7fb3b4e0eba09192159614424ad8c85df79773efe285c0ff02cb8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.remove_tunnel_fenced calls \u0060std::fs::remove_file\u0060: \u0060NativeEnvironment.remove_tunnel_fenced\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"578e1015229bef50ed405bec9c98210fdf973329875ebb64e7fc43cdc2b74d42"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: tunnel.write_tunnel_health_inner calls \u0060std::fs::symlink_metadata\u0060: \u0060tunnel.write_tunnel_health_inner\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c20d8b0cf0f07d2a5dd922fea230d4234fb7f03e425d644d5dda8584e5c139b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: tunnel.read_tunnel_health calls \u0060std::fs::symlink_metadata\u0060: \u0060tunnel.read_tunnel_health\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0004b450d27bdfab7529ac81cca53967a72eb60ea42e28312197df8884bc72c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: context.probe_installed_build calls \u0060std::fs::metadata\u0060: \u0060context.probe_installed_build\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/install/context.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"da755f0285ec846500436321f3259cb7422171e88d3d38ac7a69633de318685e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: context.assess_runtime_installation calls \u0060File::open\u0060: \u0060context.assess_runtime_installation\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/install/context.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e19013a054a88da546431bed1abd61107c5f6ab22365d1396815c862c168527"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: package.root_protected calls \u0060std::fs::symlink_metadata\u0060: \u0060package.root_protected\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/install/package.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e412fbed993726804bad47461cc79c6c1c4e1d10624bb2f5e84f56ce057b8c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: installer.verify_installed_update_cli calls \u0060std::fs::symlink_metadata\u0060: \u0060installer.verify_installed_update_cli\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/installer.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b3ece5a0ee9fdff065d06d7d91fb6f9a9ed961d793c638ccf7bc29e20da59b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: installer.copy_installer calls \u0060std::fs::symlink_metadata\u0060: \u0060installer.copy_installer\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/installer.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31fbadc1a139aa3dc71240b285ad506aadff3e89fbccb3a32f411e73855a47e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: installer.copy_recovery_tree calls \u0060std::fs::symlink_metadata\u0060: \u0060installer.copy_recovery_tree\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/installer.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c59394845d8953a0733bd7d266d68b274fedff18c9515e17a859fe47d5542e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: installer.copy_recovery_tree calls \u0060std::fs::create_dir\u0060: \u0060installer.copy_recovery_tree\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/installer.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bae28a5ff33059808ddf0a3d5c5ce7ec2d0bf3d24778d308170060fcd8e35ba"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: installer.copy_recovery_tree calls \u0060std::fs::set_permissions\u0060: \u0060installer.copy_recovery_tree\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/installer.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"194efd937dc36105c304acfd11658f2d2aaf5f31c02d62ed27687f70732f555b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: installer.copy_recovery_tree calls \u0060std::fs::read_dir\u0060: \u0060installer.copy_recovery_tree\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/installer.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f8ec8f73de0efb0059cfb4c7ca5213135b4ac97c78af26e272f079013b8224"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: installer.copy_recovery_tree calls \u0060File::open\u0060: \u0060installer.copy_recovery_tree\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/installer.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5c8a429834467606915704641967e2df26cb3a64b0d8cebfcfe9b4dcca4e20"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: installer.remove_orphaned_packages calls \u0060std::fs::read_dir\u0060: \u0060installer.remove_orphaned_packages\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/unified_update/installer.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"f326c25f74584fb31c6bb5113e53c22893b8dbd6658d0423bbed0712bece6d4b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.snapshot_desktop calls \u0060std::fs::symlink_metadata\u0060: \u0060upgrade.snapshot_desktop\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2e3cf4c7b5f0fd0366321932bac21c1b6de9158c73632d5f99af336dab324a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.checked_owner calls \u0060std::fs::symlink_metadata\u0060: \u0060upgrade.checked_owner\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b79e8c60110855783106f92373ec88ad2d97aa0e6e6ca7c9d35664d8959c03b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.checked_owner calls \u0060std::fs::symlink_metadata\u0060: \u0060upgrade.checked_owner\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f80af57ea0b81f4894990e694f2c0023c2c81de8b17e017452bd06959853e8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.digest calls \u0060std::fs::symlink_metadata\u0060: \u0060upgrade.digest\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5a81148bf8ec1bde9853b4a1154d470f64681482c147f8273345b159f43af0"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.digest calls \u0060File::open\u0060: \u0060upgrade.digest\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75d2b751ca556ce343cfb56fb4978ef8972195c265ff4124e4b38758c654a23"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.bounded_file calls \u0060std::fs::symlink_metadata\u0060: \u0060upgrade.bounded_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0ffbce757f29a91a68362eb230aeef0288263313fb31a66bc42c9ca586d3be"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.bounded_file calls \u0060File::open\u0060: \u0060upgrade.bounded_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b45859afeed2793b2443897e93f66d0307a8c50702b85533ac74df8ad1cbcc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.artifact_path calls \u0060std::fs::symlink_metadata\u0060: \u0060upgrade.artifact_path\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d7247f16187c072cfb0ec6a388e6c00213b76a0c64453a2f9c43b6794b93cc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.verify_installed_target_path calls \u0060std::fs::symlink_metadata\u0060: \u0060upgrade.verify_installed_target_path\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a9fbd84aaad3b9fb14bbc17eaf8947287d121fd7247dac2130824feb0d4c5c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.upgrade_prepare_with_options calls \u0060std::fs::set_permissions\u0060: \u0060NativeEnvironment.upgrade_prepare_with_options\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1770}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64a4fb1cd9ea4bb49780072189461dd675dc5999799615e3974f2283e492e83"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.complete_upgrade_preparation calls \u0060std::fs::remove_dir_all\u0060: \u0060NativeEnvironment.complete_upgrade_preparation\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"1040abf263588835162746dc459e1af71f40c3f4bbde04864724aaa7520f0a72"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.complete_upgrade_preparation calls \u0060std::fs::rename\u0060: \u0060NativeEnvironment.complete_upgrade_preparation\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"1068385fd159198110d183c294491f6414dd365c888672f372ebfd3eeeedeb1c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.complete_upgrade_preparation calls \u0060File::open\u0060: \u0060NativeEnvironment.complete_upgrade_preparation\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d64399765556da22d856789578e0dce95bf51d22d4439f5273576acc2658bd"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.upgrade_rollback_with_target calls \u0060std::fs::remove_dir_all\u0060: \u0060NativeEnvironment.upgrade_rollback_with_target\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bef0af2c8093ac31880b3f3b4d4aad4aa585d8aa5480e02fa3913f6b8d499cc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.upgrade_rollback_with_target calls \u0060std::fs::rename\u0060: \u0060NativeEnvironment.upgrade_rollback_with_target\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eca429ce67b04b49bfdf1b7e4904061a9835a34a47bad54cfcea4d03bc2333b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.upgrade_rollback_with_target calls \u0060std::fs::rename\u0060: \u0060NativeEnvironment.upgrade_rollback_with_target\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"866c1cad1a613c014ba4581007451e8e269738c18756503b341f5a1e2f6b0afe"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.upgrade_rollback_with_target calls \u0060std::fs::rename\u0060: \u0060NativeEnvironment.upgrade_rollback_with_target\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9a02cdfea76f8ebf4185f766833dab659a2bba0e5414fa8b28801a009c9faa"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: NativeEnvironment.upgrade_rollback_with_target calls \u0060File::open\u0060: \u0060NativeEnvironment.upgrade_rollback_with_target\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c8f3c455c4f7ed603f0b719c102fbef495f7702cf79d8168ba93dfc6512965"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.copy_bounded calls \u0060std::fs::symlink_metadata\u0060: \u0060upgrade.copy_bounded\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2470}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e7381846a201813a72b4fdd28fa7d9a24497e56b2df7dac58ddc463978e395"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.copy_tree calls \u0060std::fs::symlink_metadata\u0060: \u0060upgrade.copy_tree\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2542}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f98d10b119893fc66043980759b18c0045c4f94f4371dd8944109c269571b45"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.copy_tree calls \u0060std::fs::read_dir\u0060: \u0060upgrade.copy_tree\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2550}}}],"partialFingerprints":{"codehealthFindingId/v1":"2215ae00403bb94711d753f434768b143743d3c5aa14964710d66dd8ddec2d1e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.copy_tree calls \u0060File::open\u0060: \u0060upgrade.copy_tree\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2568}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67e03461002125a1e4852915658b39e6844e187cd9f6ffc11a96c098a08d447"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.restore_programs_from_journal calls \u0060std::fs::symlink_metadata\u0060: \u0060upgrade.restore_programs_from_journal\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2662}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bdf4c3a178be285fafc915999551fa1bb1c32c74e0904c1f9acae058267ccc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.authorize_restore_destinations calls \u0060std::fs::symlink_metadata\u0060: \u0060upgrade.authorize_restore_destinations\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2747}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb6990424ae8df97c0c505f43c3498abd27848c52a92906e78f5aa5d76cdd09"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.restore_desktop calls \u0060std::fs::symlink_metadata\u0060: \u0060upgrade.restore_desktop\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2786}}}],"partialFingerprints":{"codehealthFindingId/v1":"d065fec9b891333b88246db57a640ee18b0876f81a76c3da02a5f34a6cd3bb86"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.restore_desktop calls \u0060std::fs::symlink_metadata\u0060: \u0060upgrade.restore_desktop\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2796}}}],"partialFingerprints":{"codehealthFindingId/v1":"054d987d5120214057f865268c5e14de3a165f1ad8a756f4c67517f2147e795f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.restore_desktop calls \u0060std::fs::rename\u0060: \u0060upgrade.restore_desktop\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2852}}}],"partialFingerprints":{"codehealthFindingId/v1":"794d262c4f438286275b10be3a4b2e4125fc4e0191497251c0d09196abb024ab"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.restore_desktop calls \u0060std::fs::rename\u0060: \u0060upgrade.restore_desktop\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2854}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6595d30c9aadaf1e8897a312dd3c39889e6a7e9514a64ddb410b8dc88637f4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.restore_desktop calls \u0060File::open\u0060: \u0060upgrade.restore_desktop\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2855}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d2f027b2264de2774570cc309970b03eced65404631b079b784a3d4e818c4e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.restore_program calls \u0060std::fs::set_permissions\u0060: \u0060upgrade.restore_program\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2877}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcafcd09ee2e30284697467516ab29a011d68f90cdbb08d4aa6b1e6ff0076347"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.restore_program calls \u0060std::fs::rename\u0060: \u0060upgrade.restore_program\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":2909}}}],"partialFingerprints":{"codehealthFindingId/v1":"11de3e96270311c545e0ac661be7261a9ee3a1d71ac4ddc8e1e73ed6d49db6bb"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade.verify_candidate_executable_headers calls \u0060File::open\u0060: \u0060upgrade.verify_candidate_executable_headers\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":3049}}}],"partialFingerprints":{"codehealthFindingId/v1":"5847ea5df8b034b6cb5af61fae1624345d596e292ce75228422fb40485d54eee"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.entries calls \u0060std::fs::symlink_metadata\u0060: \u0060desktop_tree.entries\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c045c794dbeff2cecb206aeebf2648fb84a9f477eedbcc1b7384555541e4ad21"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.entries calls \u0060std::fs::read_dir\u0060: \u0060desktop_tree.entries\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43097b8784727a029a76482c5431542b720446b76252a60874c003073ad3e6b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.entries calls \u0060std::fs::symlink_metadata\u0060: \u0060desktop_tree.entries\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c85ae26d7eb644be0ad2a1fa3a8597c3a8c57f0287ef86273ddeae3a415ff3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.digest_named calls \u0060std::fs::symlink_metadata\u0060: \u0060desktop_tree.digest_named\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"219247a49bd6a7161bda3a08cfccbefda3a092d6cbc1b4d8a51d461e35b8d0fc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.digest_named calls \u0060std::fs::symlink_metadata\u0060: \u0060desktop_tree.digest_named\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c06bb0a7b7afbe808652a5db96dada914025606fe725fcc73a915f122ba6b78"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.digest_named calls \u0060std::fs::read_link\u0060: \u0060desktop_tree.digest_named\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_link\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4f256bf4f1e5afe9c1c7ac26a62715a2b64385d87497233fc1bde655f530a1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.directory_modes_digest calls \u0060std::fs::symlink_metadata\u0060: \u0060desktop_tree.directory_modes_digest\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"2043dc747e656b75c5370bc06daa27f7462e55bed7f7fc2093261968a558954e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.directory_modes_digest calls \u0060std::fs::symlink_metadata\u0060: \u0060desktop_tree.directory_modes_digest\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ea3ddb8fb16bf4babfcc7de2014c8621b2ed192de79ce740b1cf88fec6fcc1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.copy calls \u0060std::fs::symlink_metadata\u0060: \u0060desktop_tree.copy\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1540349a8836aaf4e63d41221c4bdcf1fde31aa50695f76d8b44232ed1ed9535"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.copy calls \u0060std::fs::set_permissions\u0060: \u0060desktop_tree.copy\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"0768bd3536ba53d0c1b3296a87ad0a1557935d4d676ba8db333c90449fbab017"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.copy calls \u0060std::fs::symlink_metadata\u0060: \u0060desktop_tree.copy\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dc1b898ec412433186361375700f24fc1fb7a4525a3a46969175a97d5bcb90"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.copy calls \u0060std::fs::read_link\u0060: \u0060desktop_tree.copy\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_link\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47dd74a5d5dccb07eef1d0f4496b0375a98a9c55bb7861c1dabd19f9744b108"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.copy calls \u0060std::fs::set_permissions\u0060: \u0060desktop_tree.copy\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f62fd3b4e1d10862f961a229272a3275011dae20784a20e15c03d55503d3db1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.copy calls \u0060std::fs::symlink_metadata\u0060: \u0060desktop_tree.copy\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"081c6384914d78a7c010efa95d4328144252ccbae8ebde4b4190d914fa997806"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.copy calls \u0060std::fs::set_permissions\u0060: \u0060desktop_tree.copy\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b15f61b7ad4fcae9bf8c1dc63fb14d78293e8b591494cf61bcc0c138723306a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: desktop_tree.copy calls \u0060std::fs::set_permissions\u0060: \u0060desktop_tree.copy\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/desktop_tree.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec0ffb2523c20ac0dc801746a08f26ce1e5a05a1a901ebd7cd7e1e27b8ecdea"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: windows_package.prepare_verified calls \u0060std::fs::remove_dir_all\u0060: \u0060windows_package.prepare_verified\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/windows_package.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa12b2337fc5ab475fc26b6be4149dd1c677f6247178f7431be9581b30cae86"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: upgrade_transport.clear calls \u0060std::fs::remove_file\u0060: \u0060upgrade_transport.clear\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade_transport.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e4bdc9b734e61fdb370ddd2dd1bba5f0556c03381e0574186488eac244dc27"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run_fence.private_directory calls \u0060std::fs::symlink_metadata\u0060: \u0060run_fence.private_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68d1c70326c43d33a37afdcaaeebf3bfb81de11a80a37406abbfb0a88b918af"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run_fence.private_directory calls \u0060std::fs::create_dir_all\u0060: \u0060run_fence.private_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9c5ce1add46b03ec18104d91483d5c2cd4467df1760cc6c9159df9deb51581"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run_fence.private_directory calls \u0060std::fs::set_permissions\u0060: \u0060run_fence.private_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d555e648dffc4565601774e071fa2efaa4c5334bb4d2c7a5ec90869e0ec32b54"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run_fence.sync_directory calls \u0060File::open\u0060: \u0060run_fence.sync_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bc0650bad15a32467da564fe31e73c654e2f56f8034f78871643d7ee7e25fa"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run_fence.missing calls \u0060std::fs::symlink_metadata\u0060: \u0060run_fence.missing\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1b093dc0f8e0c7dab3f9f838fb03d0fc56a83511973237e7a8921764cedff6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run_fence.check_archives calls \u0060std::fs::symlink_metadata\u0060: \u0060run_fence.check_archives\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9ba7bd9293b75049fb3b33065c30dfa231c37c2b85c20d495c9dfdad4c674e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run_fence.check_archives calls \u0060std::fs::read_dir\u0060: \u0060run_fence.check_archives\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca6b2e47d514fb10d688b5acf40b76291e952f3193a02c39d6a6ba3eb7414b9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run_fence.check_archives calls \u0060std::fs::symlink_metadata\u0060: \u0060run_fence.check_archives\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f317afa7fa7fa2ac1eaf109ebe9e3559a6d5befd53814431dac1dfb3e2f37c3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run_fence.read calls \u0060std::fs::symlink_metadata\u0060: \u0060run_fence.read\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a44a096e04a8cc1d985280c8d071fa2806d2028b50fc0fd41207e0011a8dadf"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: RunFence.acquire calls \u0060std::fs::symlink_metadata\u0060: \u0060RunFence.acquire\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f37c9da1f01a5a79bdebc7a37ce7acb1adda2b20c46ef10348710c9218479a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run_fence.archive calls \u0060std::fs::symlink_metadata\u0060: \u0060run_fence.archive\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0159410588f029780b4b29f1fd8c8f1bb04e6d183d807405fd723ee5e7a3b1c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run_fence.archive calls \u0060std::fs::rename\u0060: \u0060run_fence.archive\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_fence.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5831dd27bd42abd10076c037cad55bc4e715bcdfe61c6c7f4f0cf64884bcd2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: windows.cleanup_failed_spawn calls \u0060thread::sleep\u0060: \u0060windows.cleanup_failed_spawn\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060thread::sleep\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/windows.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee31ed24db55dfaae280ce7d8bd0eb6b1f0ffcbfd714eddadcb0b09ad0803db3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: src.resolve_runner_init_token calls \u0060std::fs::read_to_string\u0060: \u0060src.resolve_runner_init_token\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-config/src/lib.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce006acef7b8448b6050c389e1852729c5d3dcf222f9b55eb46f33e2724b4eb1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: src.run_runner_init calls \u0060std::fs::create_dir_all\u0060: \u0060src.run_runner_init\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-config/src/lib.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8ef092fefc4f1dfc64975dac4d04e8b8064e156d7e55efbf122018fc464363"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: src.run_runner_init calls \u0060std::fs::set_permissions\u0060: \u0060src.run_runner_init\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-config/src/lib.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f1c4067a6cfbab4c8dd31417c1fa75bf8f5f1faa87a4644c683b9b2aff279d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: paths.is_effective_root calls \u0060std::fs::read_to_string\u0060: \u0060paths.is_effective_root\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-config/src/paths.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2734ba904aeb9d3da8bfdca4b7ec39bef5c643e5a2c57242a98f7079cefd53d4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: config.hostname calls \u0060std::fs::read_to_string\u0060: \u0060config.hostname\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fd371dea57c1650834eea4a86da949ddc7afb59c22d9bbd0edadf64653fdc7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: managed_ssh.load_registry calls \u0060std::fs::metadata\u0060: \u0060managed_ssh.load_registry\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3264341868a616a1685cb08955a258ce98d66bb889151ce939b8873ff435d5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: managed_ssh.load_registry calls \u0060std::fs::read\u0060: \u0060managed_ssh.load_registry\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b06e62efea2fe8b2ad99314a17e89a0d315d08e61069cba46d4812d0759c8ba"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: managed_ssh.reject_symlink_or_non_file_if_exists calls \u0060std::fs::symlink_metadata\u0060: \u0060managed_ssh.reject_symlink_or_non_file_if_exists\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3c137ec8148b377b9c91df47c1da86b5ffbe61a6e313fc0b22b854e7a58e57"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: managed_ssh.ensure_store_directory calls \u0060std::fs::create_dir_all\u0060: \u0060managed_ssh.ensure_store_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f265ad6f0474da2d53658611a887388a2c95d4175d1060702fd269f75276332"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: managed_ssh.ensure_store_directory calls \u0060std::fs::symlink_metadata\u0060: \u0060managed_ssh.ensure_store_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"3047d4a28f9d9dc7b138b8210888ad77cd6544fd929528563739ff3b3fa7c106"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: managed_ssh.ensure_store_directory calls \u0060std::fs::set_permissions\u0060: \u0060managed_ssh.ensure_store_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6188d5167c8fc6e18e2f2d94e5efa21d8ff999fbb7cc9f67555b1cdd7eb126"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: managed_ssh.ensure_private_file_permissions calls \u0060std::fs::set_permissions\u0060: \u0060managed_ssh.ensure_private_file_permissions\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/managed_ssh.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2307b38470b5f7e4c5e3421d0df73bd6ee1553db7195cdba94f215a3543b06ec"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: initial_project_scan.hold_initial_project_scan calls \u0060recv_timeout\u0060: \u0060initial_project_scan.hold_initial_project_scan\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060recv_timeout\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport_tests/initial_project_scan.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"265f6cf5a1b4dd214e7481c931aef055ecc5c14c6425072868767ac5436b52da"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: initial_project_scan.initial_project_scan_completed_before_dirty_event_is_replaced_before_publication calls \u0060std::fs::remove_file\u0060: \u0060initial_project_scan.initial_project_scan_completed_before_dirty_event_is_replaced_before_publication\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport_tests/initial_project_scan.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43c967029b76001c7c8e614b92ade2b3a909c392258d1298e2395b6f6744706"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: initial_project_scan.hold_project_enrichment calls \u0060recv_timeout\u0060: \u0060initial_project_scan.hold_project_enrichment\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060recv_timeout\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport_tests/initial_project_scan.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a9390b524ac8458ac519a09fdf10da8242ef5d65c0ff73071f84e5e345bd5b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: stream_telemetry.write_synthetic_project_configs calls \u0060std::fs::create_dir_all\u0060: \u0060stream_telemetry.write_synthetic_project_configs\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport_tests/stream_telemetry.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97d8fd5b3b4cd1bb7069c0bddf82f4e39b99f424dab8358bd89b36d098ed9b3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: stream_telemetry.write_synthetic_project_configs calls \u0060std::fs::write\u0060: \u0060stream_telemetry.write_synthetic_project_configs\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::write\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport_tests/stream_telemetry.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"9012b9971a6875db7437e40b5eeec2b22f52d59a8d33c6952b8ca9c8bd87f4ab"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Database.open calls \u0060std::fs::canonicalize\u0060: \u0060Database.open\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::canonicalize\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/schema.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbb5e09393f1c228ae186ef836316c42809ef471c2d5d01d5287286681d969a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_credential.read_protected_secret calls \u0060std::fs::metadata\u0060: \u0060project_credential.read_protected_secret\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/project_credential.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"807a5996f10fce19ec5b3491a71105c73e7b8e9fff0dd614496508c01f4b6c9f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_credential.read_protected_secret calls \u0060std::fs::read_to_string\u0060: \u0060project_credential.read_protected_secret\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/project_credential.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7fdb4c622688b59206023f3dfc60b39c05f9b26c94cf60ce32a987e86d948f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: CloudflareTransport.spawn calls \u0060std::fs::canonicalize\u0060: \u0060CloudflareTransport.spawn\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::canonicalize\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cloudflare_transport.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"280b197dce3c9569c65f1d13e54136616db98080d08515bfdc0738c0576cf8a8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: CloudflareTransport.spawn calls \u0060std::fs::symlink_metadata\u0060: \u0060CloudflareTransport.spawn\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cloudflare_transport.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eeb053252b75d8aa978f339e4e6708d32653bf1511d7338d8a1024e85d7d2b6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: cloudflare_transport.cloudflared_binary_version_until calls \u0060std::fs::canonicalize\u0060: \u0060cloudflare_transport.cloudflared_binary_version_until\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::canonicalize\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cloudflare_transport.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e00e36d56ca27f89b0011decd2b30afb4af39ee82763bb0bf571e91dc62547"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: config.load_env_file calls \u0060std::fs::read_to_string\u0060: \u0060config.load_env_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a034adbcea8a0247b1a3b73ecd5deb81f2ae977aea695c5d6346f6ee65d334"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ConsoleAssetSource.from_directory calls \u0060std::fs::canonicalize\u0060: \u0060ConsoleAssetSource.from_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::canonicalize\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/console_web.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"163140eda8b236da48368f6ed98fad3072c387840ded292e1d8dc2da31f7a935"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ConsoleAssetSource.from_directory calls \u0060std::fs::metadata\u0060: \u0060ConsoleAssetSource.from_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/console_web.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b57dbaa9b6ab92323a2d20c0dd1af61ecee75f393e4e3ad0ae264ee58696454"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ConsoleAssetSource.from_directory calls \u0060File::open\u0060: \u0060ConsoleAssetSource.from_directory\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/console_web.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c38783d371f92b8150ee179d7d612963a265b7cbb602f6a6ba8af9fecfb8b3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ConsoleAssetSource.validated_path calls \u0060std::fs::symlink_metadata\u0060: \u0060ConsoleAssetSource.validated_path\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/console_web.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"38577ed1f33df2e925cfda5d940af55198338ec152d2d39c40c0fdabae80a36e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ConsoleAssetSource.validated_path calls \u0060std::fs::canonicalize\u0060: \u0060ConsoleAssetSource.validated_path\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::canonicalize\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/console_web.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d721129fe1b244c1643b59e22ab2880c9666ce6a637c04b75a9bd0bec3cfacb5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ConsoleAssetSource.validated_path calls \u0060std::fs::metadata\u0060: \u0060ConsoleAssetSource.validated_path\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/console_web.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f0d99abf9e33e276cf8466bd03e718d196a17acba73401c73873b08dc866ec"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: src.run_server_with_shutdown calls \u0060std::fs::create_dir_all\u0060: \u0060src.run_server_with_shutdown\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf351321f1b788c2c1df17a45ae19a0a58316abb045c612048f5a6fb1775f21"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: file_import.mcp_import_config_from_startup_env calls \u0060std::fs::write\u0060: \u0060file_import.mcp_import_config_from_startup_env\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::write\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/file_import.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3924c1f942cf81f72bf768584c87f472037c6012ebc79272531c996cce414f52"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: http_transport.full_trace_dir_with_payload calls \u0060std::fs::read_dir\u0060: \u0060http_transport.full_trace_dir_with_payload\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f64b4b287183caa52a1e422f7383756332d8966cdf03156572348218f14a84"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: http_transport.full_trace_dir_with_payload calls \u0060std::fs::read_to_string\u0060: \u0060http_transport.full_trace_dir_with_payload\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef07694f26df75b9c0f29569c684a5f1f2c45063b9212fdc7008462fa2eb59b0"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: http_transport.full_trace_dir_with_payload calls \u0060std::fs::read\u0060: \u0060http_transport.full_trace_dir_with_payload\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f518d21bfcfcdf763db96f26261bd13a126e81a0a0fc24d0005c95256d7173"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: http_transport.stateless_full_trace_preserves_raw_context_request_and_records_clean_effective_arguments_body calls \u0060std::fs::read_to_string\u0060: \u0060http_transport.stateless_full_trace_preserves_raw_context_request_and_records_clean_effective_arguments_body\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc6b4054611d9bbf58569fe37094d1d5144b012ea75074de0a075e71e93ad79"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: http_transport.stateless_full_trace_preserves_raw_context_request_and_records_clean_effective_arguments_body calls \u0060std::fs::read\u0060: \u0060http_transport.stateless_full_trace_preserves_raw_context_request_and_records_clean_effective_arguments_body\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"434999b4af8037d787156f5e6b1eb98910d7f209a3c3b2262782727bf352e27d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: http_transport.stateless_full_trace_correlates_only_hashed_openai_window_body calls \u0060std::fs::read_dir\u0060: \u0060http_transport.stateless_full_trace_correlates_only_hashed_openai_window_body\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e419383415d1c85bc03ad4646b4d64da4d356281f372bfe61fa18aebc0fb415f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: http_transport.stateless_full_trace_correlates_only_hashed_openai_window_body calls \u0060std::fs::read_to_string\u0060: \u0060http_transport.stateless_full_trace_correlates_only_hashed_openai_window_body\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a27e8de3a5b1b0100d45ec20e636bf896e55c3df2c79d072ef30859e1acc92"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: http_transport.stateless_full_trace_correlates_only_hashed_openai_window_body calls \u0060std::fs::read\u0060: \u0060http_transport.stateless_full_trace_correlates_only_hashed_openai_window_body\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4eb04a59f4f359d9f3816b35ac12fd4dae2640e7217ec9038b611e66000fb47"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: client_window.window_privacy_fixture calls \u0060std::fs::read_dir\u0060: \u0060client_window.window_privacy_fixture\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport/client_window.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"278679f1ec34843b1036702cba6ef1c0c79a6dfd897af950eefdc40cbc36ad46"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: client_window.window_privacy_fixture calls \u0060std::fs::read_to_string\u0060: \u0060client_window.window_privacy_fixture\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport/client_window.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"94816ad4397a3c2acacecb5bc88640f962acecca898cc25fae3c9537b5a3decd"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: client_window.window_privacy_fixture calls \u0060std::fs::read\u0060: \u0060client_window.window_privacy_fixture\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport/client_window.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9d65d09556613336f341c48aa150216282a7b929bda46554f7f2d512291069"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: metadata_trace.exercise calls \u0060std::fs::read_dir\u0060: \u0060metadata_trace.exercise\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport/metadata_trace.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbfac3c43f3fe4ffd93c2c9a9c12a5a690087701ea45ae6bf41f9531a5b2d00"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: metadata_trace.exercise calls \u0060std::fs::read_to_string\u0060: \u0060metadata_trace.exercise\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/http_transport/metadata_trace.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bcb2ceba24274a5988d3cf60eb4cfdc7df8ba181398216a4c3ccebf484d392"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: result_app.mcp_validation_run_and_summary_use_real_canonical_contracts calls \u0060std::fs::create_dir_all\u0060: \u0060result_app.mcp_validation_run_and_summary_use_real_canonical_contracts\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/result_app.rs"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"247d270153012cc0268b1f34e7fbac51c32c54051b585f45d5ad513d1a73efb4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: tools.managed_worktree_project_grant_admission_preserves_exact_and_root_authority calls \u0060std::fs::create_dir_all\u0060: \u0060tools.managed_worktree_project_grant_admission_preserves_exact_and_root_authority\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/tools.rs"},"region":{"startLine":4065}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a6c50d629a5c9a6cdf5e5a84c845a4b6f6b1f4b9345a96131457cb3f610468"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: tools.project_share_root_scope_admits_new_directories_without_weakening_other_credentials calls \u0060std::fs::create_dir_all\u0060: \u0060tools.project_share_root_scope_admits_new_directories_without_weakening_other_credentials\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/tools.rs"},"region":{"startLine":4434}}}],"partialFingerprints":{"codehealthFindingId/v1":"d096e619c6bd5a6131389cf8a783d10758e226664081402da4fcfe2cded87e0e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: tools.project_share_root_scope_admits_new_directories_without_weakening_other_credentials calls \u0060std::fs::create_dir_all\u0060: \u0060tools.project_share_root_scope_admits_new_directories_without_weakening_other_credentials\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/tools.rs"},"region":{"startLine":4436}}}],"partialFingerprints":{"codehealthFindingId/v1":"7872f0a8537a018e152f340d332cd71938bb33e0f2eba2a94e51e24fa1a98c86"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: tools.project_share_root_scope_admits_new_directories_without_weakening_other_credentials calls \u0060std::fs::remove_dir_all\u0060: \u0060tools.project_share_root_scope_admits_new_directories_without_weakening_other_credentials\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/tools.rs"},"region":{"startLine":4532}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8247d5573027031fb8b87c3fae5d6382914d2b77a8aef93a193e699a13c1c71"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: tools.project_share_root_scope_admits_new_directories_without_weakening_other_credentials calls \u0060std::fs::remove_dir_all\u0060: \u0060tools.project_share_root_scope_admits_new_directories_without_weakening_other_credentials\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/tools.rs"},"region":{"startLine":4533}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0026213b5e713bac67353a03fd8f91c110f9c2965148bed87bfc5f25629c74"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: tools.mcp_skill_safe_continuation_executes_projected_gateway_and_preserves_legacy_admission calls \u0060std::fs::create_dir_all\u0060: \u0060tools.mcp_skill_safe_continuation_executes_projected_gateway_and_preserves_legacy_admission\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/tools.rs"},"region":{"startLine":5339}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba96a36c6febf48ab9d8d806884893ccd5deb8729048befda9dc65c6ae0f4d9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: tools.mcp_skill_safe_continuation_executes_projected_gateway_and_preserves_legacy_admission calls \u0060std::fs::write\u0060: \u0060tools.mcp_skill_safe_continuation_executes_projected_gateway_and_preserves_legacy_admission\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::write\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_tests/tools.rs"},"region":{"startLine":5346}}}],"partialFingerprints":{"codehealthFindingId/v1":"49736ed9c3cf5f6d6f5f869172a50ed574f5ac02b829b7ba17319f57e1ad2b93"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry.ensure_local_runtime_port_available calls \u0060TcpListener::bind\u0060: \u0060project_entry.ensure_local_runtime_port_available\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060TcpListener::bind\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"9864034d35837cf6ee10cb88e93e936e0e22d4b0672a3138b4c090be168fc632"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_cloudflared.read_npm_ca_file calls \u0060std::fs::metadata\u0060: \u0060project_entry_cloudflared.read_npm_ca_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_cloudflared.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"04318683457eb039de9bb490b0be7c125f77e11c37cddc9e86bbaa5f19fe4e16"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_cloudflared.read_npm_ca_file calls \u0060std::fs::read\u0060: \u0060project_entry_cloudflared.read_npm_ca_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_cloudflared.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"9133dc793d8d5c429ae4952265cd7079f0b5754f96e612683454b774b8d9f602"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_cloudflared.ensure_managed_cloudflared_at calls \u0060std::fs::rename\u0060: \u0060project_entry_cloudflared.ensure_managed_cloudflared_at\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_cloudflared.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"719329dd003105b3e24831a84f80ff86df2c37a40b6dc7c8249885f4dbbdbee4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_cloudflared.ensure_managed_cloudflared_at calls \u0060std::fs::remove_dir_all\u0060: \u0060project_entry_cloudflared.ensure_managed_cloudflared_at\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_cloudflared.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8e057f038bd5ec1fef7d068effd795178bfd83da6e8f94e3355409d9583e49"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_cloudflared.managed_binary_is_valid calls \u0060std::fs::symlink_metadata\u0060: \u0060project_entry_cloudflared.managed_binary_is_valid\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_cloudflared.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c807a1877830476fea6d1e6de7d241d364316e9ab3f68c7ec2bedf672f420b6e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_cloudflared.create_private_tool_dir calls \u0060std::fs::create_dir_all\u0060: \u0060project_entry_cloudflared.create_private_tool_dir\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_cloudflared.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c33687ebfe2735624ff98290761e77f17b0f7302a7c6af9a08e93bfe865e028"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_cloudflared.create_private_tool_dir calls \u0060std::fs::set_permissions\u0060: \u0060project_entry_cloudflared.create_private_tool_dir\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_cloudflared.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3be630c73f8e59a3ea75ce46bd48cc3550c197872149837d1164dac3d425e0"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_cloudflared.sha256_file calls \u0060File::open\u0060: \u0060project_entry_cloudflared.sha256_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_cloudflared.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"8822410d01656a2e9f9bf152f1a6ab15635304f4f269d3f5ea49563eca60d10c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_cloudflared.make_private_executable calls \u0060std::fs::set_permissions\u0060: \u0060project_entry_cloudflared.make_private_executable\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_cloudflared.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f13d5a58e2023ac96f04d48581615f9b438aadf730047dc08b2542dad95e83"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_setup.canonicalize_with_missing_tail calls \u0060std::fs::symlink_metadata\u0060: \u0060project_entry_setup.canonicalize_with_missing_tail\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_setup.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"9307dc34738052c5fe5d7571a1f3be29f2a336836b0cc689a8f909805ccd3149"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_setup.read_toml calls \u0060std::fs::read_to_string\u0060: \u0060project_entry_setup.read_toml\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_setup.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d73a6c7c2cbdc0eda7842f5e6104793458538f4e208ab1b94483cd1947b243"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_setup.harden_existing_runtime_private_state calls \u0060std::fs::symlink_metadata\u0060: \u0060project_entry_setup.harden_existing_runtime_private_state\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_setup.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e53c10485099ec61d04d6608f4f95ebe7894ad4a3ebbc1b46127ca3285af8d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_setup.create_private_dir calls \u0060std::fs::create_dir_all\u0060: \u0060project_entry_setup.create_private_dir\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_setup.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcef5371f44a1de2b17df924df5b3601352699adfe3690ee2c24d9ed160eb22a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_setup.create_private_dir calls \u0060std::fs::set_permissions\u0060: \u0060project_entry_setup.create_private_dir\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::set_permissions\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_setup.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ec68da5a4f39ae9283f248d0111541b8a5e1de77f7b73a2e8a1723c15eb65e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_setup.replace_private_file calls \u0060std::fs::remove_file\u0060: \u0060project_entry_setup.replace_private_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_setup.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4eeb88729395ede8c8f7b5823123758288cb6296b9dae5eec08ec6100d48a8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_setup.replace_private_file calls \u0060std::fs::rename\u0060: \u0060project_entry_setup.replace_private_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_setup.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df94b6f9d60f12f104e945d899e5034d4021d1b3e146fdf89e3edbd19df6450"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_setup.replace_private_file calls \u0060std::fs::remove_file\u0060: \u0060project_entry_setup.replace_private_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_setup.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8726327ca1502a3cb4457b4cf6de95576c2ddcef58477e16c239d2f49bb604"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_setup.remove_private_state_file calls \u0060std::fs::remove_file\u0060: \u0060project_entry_setup.remove_private_state_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_setup.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b111cfff117d8bd95dea0cf4ebbbfc8b1e44d05262b61f3f819c974bd652df45"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_share.read_persisted_share_project_roots calls \u0060std::fs::read_to_string\u0060: \u0060project_entry_share.read_persisted_share_project_roots\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_share.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d633356f6f6e0db5cfdbcba29dea4520c24462409d5a826311ac36dcee5ddea"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_share.stored_roots_is_owner_only_file_with calls \u0060std::fs::symlink_metadata\u0060: \u0060project_entry_share.stored_roots_is_owner_only_file_with\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_share.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2926ad3c0afd38c8d1ad0b167aabc56e1751a3e97db0b671b0e4c2855dc4ac"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_share.stored_roots_is_owner_only_file_with calls \u0060std::fs::read\u0060: \u0060project_entry_share.stored_roots_is_owner_only_file_with\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_share.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10d74aecbf6baba703ec7401b17e1b4fc99f3c211b9ca7cfeadb33cf843c050"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ShareSession.create calls \u0060std::fs::remove_dir_all\u0060: \u0060ShareSession.create\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_share.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd27d8bac69f583070c9eeb655ecca68f0b217bcf8f3111e2cbc8d0dc4260c7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: project_entry_share.prepare_share_oauth_client calls \u0060std::fs::remove_dir_all\u0060: \u0060project_entry_share.prepare_share_oauth_client\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/project_entry_share.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"c901755cd59d897fa1d5c25076f8ca98b59e95e1ae05ca24b7cb7c0929e04541"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: runner_quic.load_certs calls \u0060File::open\u0060: \u0060runner_quic.load_certs\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runner_quic.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c094d36a1ec7d232bc20d6ff24f352f5c01eec6614ab13e426897f2cb31b12"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: runner_quic.load_key calls \u0060File::open\u0060: \u0060runner_quic.load_key\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runner_quic.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"71aaa58fe229e5b8377caccdd25a8f9b73033408ad0cc73406654b3af1bddb25"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: FileMaintenanceStore.new calls \u0060std::fs::symlink_metadata\u0060: \u0060FileMaintenanceStore.new\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/upgrade_maintenance_store.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1412f1995198a31461010050942aa55adf4605437667054415e15cb00e91786"}},{"ruleId":"ES1","level":"error","message":{"text":"Non-deterministic recovery fold: NativeEnvironment.apply: \u0060NativeEnvironment.apply\u0060 folds a domain event but reads a clock/random source (\u0060Instant::now\u0060/\u0060Utc::now\u0060/\u0060rand\u0060/\u0060Uuid::new_v4\u0060) on the replay path \u2014 a replay must derive state PURELY from the event\u0027s own fields, or two replays of the same log diverge. Stamp the timestamp/id into the event in the COMMAND, then read it from the event in the fold."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6749462e9f1c456427d57f1907d4862c95d1ef08b5d5769d705f1f1e9ad6f1"}},{"ruleId":"ES1","level":"error","message":{"text":"Non-deterministic recovery fold: NativeEnvironment.apply: \u0060NativeEnvironment.apply\u0060 folds a domain event but reads a clock/random source (\u0060Instant::now\u0060/\u0060Utc::now\u0060/\u0060rand\u0060/\u0060Uuid::new_v4\u0060) on the replay path \u2014 a replay must derive state PURELY from the event\u0027s own fields, or two replays of the same log diverge. Stamp the timestamp/id into the event in the COMMAND, then read it from the event in the fold."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1344439186d40c82cf7083387e9714017d01a4c7299c2b062e480d4ee6f1bd"}},{"ruleId":"ES1","level":"error","message":{"text":"Non-deterministic recovery fold: NativeEnvironment.apply: \u0060NativeEnvironment.apply\u0060 folds a domain event but reads a clock/random source (\u0060Instant::now\u0060/\u0060Utc::now\u0060/\u0060rand\u0060/\u0060Uuid::new_v4\u0060) on the replay path \u2014 a replay must derive state PURELY from the event\u0027s own fields, or two replays of the same log diverge. Stamp the timestamp/id into the event in the COMMAND, then read it from the event in the fold."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a2c59b97c7f09169ac69a6fe9f7bb7e1df2e42ed6399ddebb70667e6367279"}},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 1 ADR-shaped document(s) detected by content \u2014 \u0060docs/agent/architecture-decisions.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":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060webcodex_environment.service.runtime.implementation\u0060 is marked as implementation by its own namespace, folder or name: \u0060ServiceStop\u0060 (crates/webcodex-environment/src/service/runtime.rs:29, \u0060implementation\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/runtime.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34708b2792bbc5ec2dec27b185ad9e437c4aecfb9192ebf7a4772ef55498ca2"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 8/15 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060crates/webcodex-admin\u0060, \u0060crates/webcodex-browser\u0060, \u0060crates/webcodex-cli\u0060, \u0060crates/webcodex-openai-tunnel\u0060 and 2 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060apps/desktop/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":"apps/desktop/package.json"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"160941ce5433be017a150fbc5350b0ecc8759770880344e6fb877c6e9c1baf72"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060run\u0060 is async and calls thread::sleep \u2014 a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_tui.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"058a8da3d41937847e609261cd1cf3ad2e2dc345dacc6be82902467d154e2f9d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to http.createServer\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":"scripts/ui-smoke/server.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76febda7aa5da7324683fcd79a91319dfd9f866ba1bd3bc48c05fb8b519dee6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to http.createServer\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":"scripts/ui-smoke/server.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5fb5c924ed44b7b486103c989d95ad70615c652b9bf6aa6aa381d38d28a8da"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to http.createServer\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":"scripts/ui-smoke/server.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b23fc30bc3c419f694886cc54aa35d37bdb12a724b42e868fe6131edc0bb67"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060scenario\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":"scripts/ui-smoke/web-page-consistency.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"612ba1e7ab87f7d152c3973202add72215dfc19ba8ef4c72c133f6eb438c5fd7"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 129 typed \u00B7 86 plain JS \u2014 the untyped files are apps/desktop/scripts/check-form-control-css.mjs, apps/desktop/scripts/generate-icons.mjs, crates/webcodex-browser/src/cdp/set_value.js, crates/webcodex-browser/src/cdp/widgets/choice.js, crates/webcodex-browser/src/cdp/widgets/common.js, crates/webcodex-browser/src/cdp/widgets/date.js (\u002B80 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 5 sibling directories (8 clone groups): 8 duplicated blocks under apps/desktop/src/features/ have copies in at least two of the sibling directories activity, extensions, onboarding, projects, settings \u2014 2 of them are reported below, and 6 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 8 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 8 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 8 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":"apps/desktop/src/features/onboarding/QuickShareSetup.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dee06dce868e626cfa69e06d97574287586f69657994a778fe41e13758cb7c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (43 matched lines \u00D7 2 locations): scripts/ui-smoke/desktop-runtime-probe.mjs:19 \u00B7 scripts/ui-smoke/desktop-runtime-simple.mjs:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 532 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/ui-smoke/desktop-runtime-probe.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba7865708d129356138d55fb96af2854e41d79e9be78c94ab74362893573521"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): scripts/ui-smoke/mcp-workspaces.mjs:13 \u00B7 scripts/ui-smoke/work-result-controls.mjs:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 372 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/ui-smoke/mcp-workspaces.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b524ddc54ba16ab1403fc0eda08697f400011123b31c64e2dd253081d954df21"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): apps/desktop/src/features/extensions/RunnerCapabilityAuthorization.tsx:22 \u00B7 apps/desktop/src/features/extensions/SshResourcesPanel.tsx:25 \u2014 the two spans are one implementation copied and then locally edited \u2014 200 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":"apps/desktop/src/features/extensions/RunnerCapabilityAuthorization.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c035fe7c832babb88b69850eda2e10e06dad33c4cf4a2522e3fb724be6099b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): apps/desktop/src/features/projects/ProjectsPanel.tsx:111 \u00B7 apps/desktop/src/features/projects/ProjectsPanel.tsx:145 \u2014 the two spans are one implementation copied and then locally edited \u2014 123 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":"apps/desktop/src/features/projects/ProjectsPanel.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"172be97cd41aa19afd19ebc158bd9f75bb4bdc14f481ac9a08709b1debb87172"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/ui-smoke/smoke.mjs:122 \u00B7 scripts/ui-smoke/smoke.mjs:139 \u2014 both copies are in the same file, so extract the block into one function there 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/ui-smoke/smoke.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"67425f72f8559db826efd68e7f61ecd4320308a2bbed4ec486dcf2ad7a9c6a45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): apps/desktop/src/features/settings/PowerShellInstallGuidance.tsx:27 \u00B7 apps/desktop/src/features/settings/PowerShellInstallGuidance.tsx:42 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 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":"apps/desktop/src/features/settings/PowerShellInstallGuidance.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5ee9ffdaabe791f4b2dd278a2a62908c37ab021652d0bece42c51152d7f2ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/ui-smoke/projects-runtime.mjs:7 \u00B7 scripts/ui-smoke/runtime-overview.mjs: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":"scripts/ui-smoke/projects-runtime.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f18c8e0cbbbf831c4d214fc299e2c4e8d2276a0257857ac3a1534ada95e69f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): apps/desktop/src/features/onboarding/FirstRun.tsx:114 \u00B7 apps/desktop/src/features/onboarding/QuickShareSetup.tsx:18 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 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":"apps/desktop/src/features/onboarding/FirstRun.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69fdb65593b7f9ca206945c33494c20fde460009f9cd7cec6a0dc297b8cfdc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): scripts/ui-smoke/admin-preferences.mjs:123 \u00B7 scripts/ui-smoke/window-session-record.mjs:231 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 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/ui-smoke/admin-preferences.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f4ab1d20afeca4450725e318e802bc4df675ee11c27e27c1ee7e26aabf1770"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/ui-smoke/projects-runtime.mjs:77 \u00B7 scripts/ui-smoke/runtime-workflow.mjs:51 \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/ui-smoke/projects-runtime.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0960eaeae730e202ca46f76057235abc7d0c0b45288933f1af488166d72cc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/ui-smoke/desktop-page-fixtures.mjs:15 \u00B7 scripts/ui-smoke/desktop-soft-surfaces.mjs:171 \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/ui-smoke/desktop-page-fixtures.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8299a399fc32f9fdf58264cd04fe63366a98e5cf10b8b60285d67f6fd653f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/ui-smoke/runtime-overview.mjs:7 \u00B7 scripts/ui-smoke/work-header.mjs: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":"scripts/ui-smoke/runtime-overview.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d592486d803d25b78a4e9d4f4d3a284539adf4b8cfd0b852c3c5af6e98feb62f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/features/extensions/CodingAgentsPanel.tsx:38 \u00B7 apps/desktop/src/features/extensions/McpProvidersPanel.tsx:22 \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":"apps/desktop/src/features/extensions/CodingAgentsPanel.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8fef638402501cc4ca81d0a108cd830166a30ddb54fa4cf6c14c0d046f84c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/features/extensions/CodingAgentsPanel.tsx:22 \u00B7 apps/desktop/src/features/extensions/useExtensionsState.ts:41 \u2014 the two spans are one implementation copied and then locally edited \u2014 91 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":"apps/desktop/src/features/extensions/CodingAgentsPanel.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedb78b939f9df81318640eff587dc420dd3a797cbe941af70d452b64efd013f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/ui-smoke/collaboration-history.mjs:30 \u00B7 scripts/ui-smoke/work-result-card.mjs:40 \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/ui-smoke/collaboration-history.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1f45b546557879e256385985fc6e3cbebe81c2e05d6530956dca60c83dd7a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): scripts/ui-smoke/desktop-long-activity.mjs:9 \u00B7 scripts/ui-smoke/localized-layout.mjs:4 \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":"scripts/ui-smoke/desktop-long-activity.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c40d2a3f22c2d57c428bcb9c8134ad339d1d25995e7d7fd0555dfddaa8cf069"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/ui-smoke/projects-runtime.mjs:26 \u00B7 scripts/ui-smoke/runtime-overview.mjs: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":"scripts/ui-smoke/projects-runtime.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1753f155767130abdb8dbb998301a27dab71d3a803a620ba2680dc715c91b74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/features/connection/ConnectionEditor.tsx:12 \u00B7 apps/desktop/src/features/connection/TunnelConfigDiagnostics.tsx:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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":"apps/desktop/src/features/connection/ConnectionEditor.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8b99444d16065adc6dd4a4cc49594d3c1ac9801350d26564be0766012c5b2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/features/projects/AddDevice.tsx:108 \u00B7 apps/desktop/src/features/settings/ConfigurationDataPanel.tsx:120 \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":"apps/desktop/src/features/projects/AddDevice.tsx"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"266f9b73c57cb5da78c51d50b89b93c82b870b471b68f878ba6c0a710c6790b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/hooks/useAppearance.ts:44 \u00B7 apps/desktop/src/hooks/useAppearance.ts:55 \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":"apps/desktop/src/hooks/useAppearance.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa4ee887e5b388a509f0a065c99fb5ad795c56b6cc61d76d1dc6e8efe15e010"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): apps/desktop/src/i18n/configuration-data.ts:83 \u00B7 apps/desktop/src/i18n/connections-tools.ts:141 \u00B7 apps/desktop/src/i18n/device-invitation.ts:35 \u00B7 apps/desktop/src/i18n/product.ts:349 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/configuration-data.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab0727fcb3ec70f52538be83e47f2386249d410fe3c2eee0795df227ad80646"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/i18n/presentation.ts:226 \u00B7 apps/desktop/src/i18n/presentation.ts:234 \u00B7 apps/desktop/src/i18n/presentation.ts:242 \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":"apps/desktop/src/i18n/presentation.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b68c97aa85ebb433218e46e0a6ec72331942eaee168e90eb0e21c3c0da268cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6 locations): scripts/ui-smoke/admin-preferences.mjs:2 \u00B7 scripts/ui-smoke/desktop-resize-theme.mjs:3 \u00B7 scripts/ui-smoke/session-navigation.mjs:3 \u00B7 scripts/ui-smoke/sidebar-geometry.mjs:2 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 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 6 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/admin-preferences.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fe34edede20b951da4ca091c3e1cb4f03a0450dae2d0a345c91b10c1311203"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): scripts/ui-smoke/agents-workbench.mjs:6 \u00B7 scripts/ui-smoke/runtime-overview.mjs:7 \u00B7 scripts/ui-smoke/work-header.mjs:7 \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":"scripts/ui-smoke/agents-workbench.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0d2a33cf5a7098e69e9da6235c77fe25b3ad38a975f606fbefa016f92e808c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): scripts/ui-smoke/desktop-clarity-layout.mjs:54 \u00B7 scripts/ui-smoke/desktop-page-fixtures.mjs:16 \u00B7 scripts/ui-smoke/desktop-soft-surfaces.mjs:172 \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":"scripts/ui-smoke/desktop-clarity-layout.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82bb3c28a25bf50471b8e8f7c3bc539f5509f6acc1ae7bc9bd787bd0832f505"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): scripts/ui-smoke/desktop-soft-surfaces.mjs:93 \u00B7 scripts/ui-smoke/web-soft-surfaces.mjs:75 \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":"scripts/ui-smoke/desktop-soft-surfaces.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1de105a86097fbe0bfbea24bd46aa33dcb3d127d252884e4482ead28f9939c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/ui-smoke/mcp-workspaces.mjs:450 \u00B7 scripts/ui-smoke/mcp-workspaces.mjs:489 \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/ui-smoke/mcp-workspaces.mjs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f08936e7ff70baeecddc1ac879d9f9873d67468e1cdcab6da488cd819ae943"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): scripts/ui-smoke/pdf-document-reader.mjs:192 \u00B7 scripts/ui-smoke/pdf-document-reader.mjs:229 \u00B7 scripts/ui-smoke/pdf-document-reader.mjs:251 \u00B7 scripts/ui-smoke/pdf-document-reader.mjs:308 \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":"scripts/ui-smoke/pdf-document-reader.mjs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab0f2be0acc5043a5683e05ced3e1a26f44283732ac1ff910af009fdc211302"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/ui-smoke/smoke.mjs:360 \u00B7 scripts/ui-smoke/smoke.mjs:649 \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/ui-smoke/smoke.mjs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"f696be828fd91c80cb37d947f16f56f46a44b10d3460bd7d6f79e64aeeaa50ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/features/extensions/CodingAgentEditor.tsx:44 \u00B7 apps/desktop/src/features/extensions/McpProviderEditor.tsx:20 \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":"apps/desktop/src/features/extensions/CodingAgentEditor.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcb96dc106473ad6cf498d87d105a8588f96f6fb970243dda7f0d3511986292"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/ui-smoke/admin-preferences.mjs:105 \u00B7 scripts/ui-smoke/web-soft-surfaces.mjs: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":"scripts/ui-smoke/admin-preferences.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f12b26e96645a0bd27c1242deba3840784299615e264017eee06f42be20616"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/ui-smoke/sidebar-geometry.mjs:7 \u00B7 scripts/ui-smoke/web-soft-surfaces.mjs: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":"scripts/ui-smoke/sidebar-geometry.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b81595f5b79d61ee33c7eb0d2e425e707c71b10fd0473c7a58106b533488f09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scripts/ui-smoke/sidebar-geometry.mjs:122 \u00B7 scripts/ui-smoke/web-detail-consistency.mjs:101 \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":"scripts/ui-smoke/sidebar-geometry.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"657e34bf0d4a6e6f3d733cbf2e7d476bbe7538ddd684eed71f0a74282d549fbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/ui-smoke/smoke.mjs:520 \u00B7 scripts/ui-smoke/smoke.mjs:578 \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/ui-smoke/smoke.mjs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"348c55e15249fd97dc66a9a75b78487be4783be4eb7bf5039795b0177af5be74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scripts/ui-smoke/tab-alignment.mjs:110 \u00B7 scripts/ui-smoke/window-workspace.mjs:20 \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":"scripts/ui-smoke/tab-alignment.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b536f9af5d470458b494624d2800afad7c1cd3fcc678f8fca8e8a66c7d9dde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scripts/ui-smoke/window-collaboration.mjs:38 \u00B7 scripts/ui-smoke/work-result-card.mjs:194 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 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/ui-smoke/window-collaboration.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"211f6183b841ada10cd5cbd45a423c8276523b8890f69506ec280740a1bb58fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/features/extensions/ManagedInstructionsPanel.tsx:15 \u00B7 apps/desktop/src/features/settings/DiagnosticsPanel.tsx:27 \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":"apps/desktop/src/features/extensions/ManagedInstructionsPanel.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a86c9ecb3d9f5bb00ee0a461674a0a15b7af95272484d94558ac6327d3bf4a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/features/settings/LocalServicesPanel.tsx:11 \u00B7 apps/desktop/src/features/settings/PowerShellInstallGuidance.tsx:8 \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":"apps/desktop/src/features/settings/LocalServicesPanel.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3671ae2f512f4f002184bd5ea9aad2e9c946a73e6da81305721c41573de31c44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/i18n/instructions.ts:24 \u00B7 apps/desktop/src/i18n/service-scope.ts:12 \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":"apps/desktop/src/i18n/instructions.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea217316c59e7a5dda29909b83727bc955702a6a67eaf26a7e1c767f865ff1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): crates/webcodex-browser/src/cdp/widgets/choice.js:17 \u00B7 crates/webcodex-browser/src/cdp/widgets/choice.js:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"crates/webcodex-browser/src/cdp/widgets/choice.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c75dc95ed3f32207dea5e62cbd7b29fc15168c53c3265375a5408ad31d7fba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): scripts/ui-smoke/admin-preferences.mjs:7 \u00B7 scripts/ui-smoke/session-navigation.mjs:7 \u00B7 scripts/ui-smoke/sidebar-geometry.mjs:7 \u00B7 scripts/ui-smoke/web-detail-consistency.mjs:8 \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":"scripts/ui-smoke/admin-preferences.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6199e0349efe7d049ea604d6bfd7b2e044d6d319292eaf1fa37b2a7ca382b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): scripts/ui-smoke/admin-preferences.mjs:49 \u00B7 scripts/ui-smoke/admin-preferences.mjs:70 \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":"scripts/ui-smoke/admin-preferences.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2aa1f994240c48e851f9e1eb8bf69040c85e7c0eb218c6f9b44855088996d8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/collaboration-history.mjs:13 \u00B7 scripts/ui-smoke/work-result-card.mjs:17 \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/ui-smoke/collaboration-history.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b599374ec871e0b1f4727ee528ffbf56d81db7318628fe0fda46c1d50958a50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/desktop-clarity-layout.mjs:31 \u00B7 scripts/ui-smoke/desktop-workflow-layout.mjs:11 \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/ui-smoke/desktop-clarity-layout.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c54cd271382c9a24109f460ab3a9b1d72817455720bef48b0a2e182e0b4e3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): scripts/ui-smoke/desktop-clarity-layout.mjs:47 \u00B7 scripts/ui-smoke/desktop-runtime-probe.mjs:26 \u00B7 scripts/ui-smoke/desktop-runtime-simple.mjs:20 \u00B7 scripts/ui-smoke/desktop-workflow-layout.mjs:202 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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/ui-smoke/desktop-clarity-layout.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e478dceae76e2aba5d011bb7ee85d11fec93f7dae71ab317a84096ba174118e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): scripts/ui-smoke/desktop-clarity-layout.mjs:138 \u00B7 scripts/ui-smoke/desktop-soft-surfaces.mjs:243 \u00B7 scripts/ui-smoke/desktop-workflow-layout.mjs:262 \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":"scripts/ui-smoke/desktop-clarity-layout.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f669e5770e36d2eccf3e0c54349575544f93d5d2549434c2cef5c571102b8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): scripts/ui-smoke/desktop-connection-readability.mjs:63 \u00B7 scripts/ui-smoke/i18n-project-layout.mjs:73 \u00B7 scripts/ui-smoke/i18n-project-layout.mjs:112 \u2014 the 3 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/ui-smoke/desktop-connection-readability.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e83dd293fb6ca7866fb56423c48d46e5504d673e94b7266fd4cbd6365b5d7b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/desktop-connection-readability.mjs:111 \u00B7 scripts/ui-smoke/i18n-project-layout.mjs:122 \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/ui-smoke/desktop-connection-readability.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"677bb51c33b4e59444db9defa8b8e4ca818fffabb10e8f372f4bbf3bc15d64fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/desktop-page-fixtures.mjs:26 \u00B7 scripts/ui-smoke/desktop-soft-surfaces.mjs:182 \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/ui-smoke/desktop-page-fixtures.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d719497c7e0b2c7530707018f22564488b6f3944feca7f027529f405f1184ba5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): scripts/ui-smoke/desktop-runtime-probe.mjs:10 \u00B7 scripts/ui-smoke/desktop-runtime-simple.mjs:10 \u00B7 scripts/ui-smoke/desktop-workflow-layout.mjs:8 \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":"scripts/ui-smoke/desktop-runtime-probe.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda367941e12af7ccad668532dc88ad2cd9baf5f9ebd6ca26e6e190f9ec396d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/desktop-soft-surfaces.mjs:110 \u00B7 scripts/ui-smoke/desktop-soft-surfaces.mjs:139 \u2014 both copies are in the same file, so extract the block into one function there 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/ui-smoke/desktop-soft-surfaces.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"653c18cd6da0a346438f05704c6ffe07bf5d54d7d0ac5840cf3c7bb08c1b08d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/desktop-workflow-layout.mjs:118 \u00B7 scripts/ui-smoke/desktop-workflow-layout.mjs:137 \u2014 both copies are in the same file, so extract the block into one function there 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/ui-smoke/desktop-workflow-layout.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3066c6a77891ec8ccb3aa8652b00f44376e4762e6c7525058f51cbd15d6dad3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/desktop-workflow-layout.mjs:124 \u00B7 scripts/ui-smoke/desktop-workflow-layout.mjs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/desktop-workflow-layout.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc964d1448ad7bac8cd8cd6df82afa61bc278b2af7c3e2c7ef90f41a7057a09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/mcp-workspaces.mjs:64 \u00B7 scripts/ui-smoke/pdf-document-reader.mjs:77 \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/ui-smoke/mcp-workspaces.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b528fdb853bcfdbe0c774f53d00eafee3c143e4364849ee173c54d48c8c5233f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/mcp-workspaces.mjs:417 \u00B7 scripts/ui-smoke/mcp-workspaces.mjs:518 \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/ui-smoke/mcp-workspaces.mjs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"31671468957b19f08e0a748031459d32f70c5287d91727bc083730be0dba6c0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/mcp-workspaces.mjs:425 \u00B7 scripts/ui-smoke/mcp-workspaces.mjs:444 \u2014 both copies are in the same file, so extract the block into one function there 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/ui-smoke/mcp-workspaces.mjs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f6f331a20b120cc19b6b8bbcfc3d77e4cc71b18719f2f777d59436108d5d12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/mcp-workspaces.mjs:499 \u00B7 scripts/ui-smoke/mcp-workspaces.mjs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/mcp-workspaces.mjs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5937c87600a92d00a716f1da3143674bd1fc526a7463d1696e939168d4e5f39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/mobile-runtime-layout.mjs:94 \u00B7 scripts/ui-smoke/mobile-runtime-layout.mjs:109 \u2014 both copies are in the same file, so extract the block into one function there 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/ui-smoke/mobile-runtime-layout.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"724338907e81b82a9347f591214a883879caf8c4f69b87da7251032d094ebe4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/mobile-runtime-layout.mjs:170 \u00B7 scripts/ui-smoke/selection-consistency.mjs:264 \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/ui-smoke/mobile-runtime-layout.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e36e23340a208b22f00f9f5cd11615b56044857ebc5566c2a1f6edc0b28cf96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): scripts/ui-smoke/mobile-runtime-layout.mjs:8 \u00B7 scripts/ui-smoke/tab-alignment.mjs:10 \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":"scripts/ui-smoke/mobile-runtime-layout.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3329261da23ba7026b2b82e084f9ac1617756d34db9aa88502212f47032755"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/selection-consistency.mjs:142 \u00B7 scripts/ui-smoke/selection-consistency.mjs:205 \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/ui-smoke/selection-consistency.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14eb713ba71ecf6c03ca2de787d05923384d275a7cb2f5c84a2e26cea21dd4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): scripts/ui-smoke/selection-consistency.mjs:210 \u00B7 scripts/ui-smoke/web-soft-surfaces.mjs:89 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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/ui-smoke/selection-consistency.mjs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b596f776578212f4707be8e05ba464e9c96229d8bd26a64cbc4ff68fec2cf3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/smoke.mjs:9 \u00B7 scripts/ui-smoke/window-workspace.mjs: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":"scripts/ui-smoke/smoke.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8241d9e9c704ad200c6497fe2b08a5d2ba9d7f34d9bf8ca83778254cd9596eec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/smoke.mjs:225 \u00B7 scripts/ui-smoke/smoke.mjs:436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/smoke.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7873dcb76fd1e8a002f9a6ec7142e0bae36f42afe17e2ceea6fd976893aeb940"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/web-page-consistency.mjs:306 \u00B7 scripts/ui-smoke/window-board.mjs:99 \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/ui-smoke/web-page-consistency.mjs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea11f473de97e0adb22ee4dffea1b5918709524d906c06807b95b4c9c8c91aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/work-result-card.mjs:119 \u00B7 scripts/ui-smoke/work-result-card.mjs:183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/work-result-card.mjs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"efee1efe051c97371eb4800706de2c5e26da479f64435584533929b0580f137f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ui-smoke/work-result-controls.mjs:134 \u00B7 scripts/ui-smoke/work-result-controls.mjs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/work-result-controls.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cce2843d21f45c0269b47b6af75ed5078038ee08ba8f40673492c5503d0d54"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: apps/desktop/src/main.tsx:7 reaches into another package with a relative path (../../../frontend/src/ui/foundation.css) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/main.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5b3995c9bdc2ef6dbb72867b1ec91b6fc6b2784b91f7431dd590f2d9138f80"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/ui-smoke/collaboration-history.mjs:5 imports src/mcp_tests/work_result_app_fixture.mjs, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/collaboration-history.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"048d97b1ef7459af88efe66964a82350ed025ec3acf8f039cadaa0d5e29f8358"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/ui-smoke/mcp-workspaces.mjs:6 imports src/mcp_tests/workbench_upgrade_fixture.mjs, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/mcp-workspaces.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ff81ddf38a0a20b1b68c7df76fa452355e358533b7e071840b6c26410fef57"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/ui-smoke/mcp-workspaces.mjs:7 imports src/mcp_tests/work_result_app_fixture.mjs, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/mcp-workspaces.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae25109ccb39401d37bab3c41ec540f0990aba6b05776a91f4cb71a038f4fc2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/ui-smoke/work-result-card.mjs:5 imports src/mcp_tests/work_result_app_fixture.mjs, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/work-result-card.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e0014e52bb9a1b6a37cdcac09f93e063cb7eeab42d6ce93cfede27870118ce"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/ui-smoke/work-result-controls.mjs:6 imports src/mcp_tests/work_result_app_fixture.mjs, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/work-result-controls.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8aadb802face65c82a77406d6c65aea61dc15e7b489246a39819c521162d085"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FirstRun (cyclomatic 125, cognitive 100): FirstRun has cyclomatic complexity 125 and cognitive complexity 100; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/onboarding/FirstRun.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c7b9ded8e2e4e7bf65d56dd9c78e990e9f4d1658a843315d9a33711bc1dd3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UpdateWorkflow (cyclomatic 119, cognitive 79): UpdateWorkflow has cyclomatic complexity 119 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/settings/UpdateWorkflow.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"499faed0e8dc4c3c4f04d05e51fe56c593d4e12fedc5e026ef918a5e04a4de8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DiagnosticsContents (cyclomatic 54, cognitive 49): DiagnosticsContents has cyclomatic complexity 54 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":"apps/desktop/src/features/settings/DiagnosticsPanel.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4510c6dc63a2449b495be067d15138a66372d923800bb9eb4cf3b552d1b58531"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function invoke (cyclomatic 52, cognitive 28): invoke has cyclomatic complexity 52 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":"scripts/ui-smoke/desktop-shim.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"388e2decb1e5cee56e93cda0f83fa7a270bab4338ccaefdaf44686cabff60ac1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ReadinessBanner (cyclomatic 50, cognitive 42): ReadinessBanner has cyclomatic complexity 50 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/dashboard/ReadinessBanner.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3a14ea3b479b023614d90c14f9d916c55e1028d13e1ef970bf16f180cc35a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ConnectionCard (cyclomatic 49, cognitive 47): ConnectionCard has cyclomatic complexity 49 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/connection/ConnectionCard.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc36cf6452c3cb1c1fa599ac4ab067edea96d0c7ba42e8d0d84c1a9ba3df5ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ConnectionEditor (cyclomatic 47, cognitive 40): ConnectionEditor has cyclomatic complexity 47 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":"apps/desktop/src/features/connection/ConnectionEditor.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e65f1d9de3615e78caa638744ae6d88aa2b9419a2aff9e546f4e3b2746ef736"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 46, cognitive 75): (anonymous) has cyclomatic complexity 46 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/ui-smoke/mcp-workspaces.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4354e949419bb64d0ccbb42f973b72f39477feadfa13300ef7717a167e145a08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SettingsView (cyclomatic 45, cognitive 35): SettingsView has cyclomatic complexity 45 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":"apps/desktop/src/features/settings/SettingsPanel.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4aa86a6d7d56e38b2a1a768787b97f59d6c9e9efc791b26ed07ffb5857a7cb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AboutPanelContent (cyclomatic 42, cognitive 35): AboutPanelContent has cyclomatic complexity 42 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":"apps/desktop/src/features/settings/AboutPanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2beab46c425eae27ef2da67d05df9985e80b63a2825bbd630fe58a3950208d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RunnerCapacitySettings (cyclomatic 42, cognitive 32): RunnerCapacitySettings has cyclomatic complexity 42 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/settings/RunnerCapacityPanel.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf18df9f6be191c3e1af87e261da78b4a8247418818f2e932ec04b178c3681a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CloudflareConnectionCard (cyclomatic 42, cognitive 31): CloudflareConnectionCard has cyclomatic complexity 42 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":"apps/desktop/src/features/connection/CloudflareConnectionCard.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cf1dda74cd861e37402076f395d138b9cb3610d806ae9c28bcc451ce8ef74c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ProjectsPanel (cyclomatic 41, cognitive 36): ProjectsPanel has cyclomatic complexity 41 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/projects/ProjectsPanel.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7455636eae1171584c2c5727788386b57edc0ba6f787335d63962955f172f869"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ConnectionPanel (cyclomatic 41, cognitive 30): ConnectionPanel has cyclomatic complexity 41 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":"apps/desktop/src/features/connection/ConnectionPanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"22343b9f7807b12e4844b8fcf30363bcb343248a3434f142b7d43d05e7f195c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function control (cyclomatic 40, cognitive 48): control has cyclomatic complexity 40 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/browser-bridge/worker.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b77afea929ff052d6a4ec839ee8aa39959e0b2b6c1048892331ad135b3be69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RuntimePanelContent (cyclomatic 39, cognitive 33): RuntimePanelContent has cyclomatic complexity 39 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/settings/RuntimePanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac6ca49583802851b9ae9a71d4bf92b8639625bce1b2de1117d4486f75c7160"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DesktopApp (cyclomatic 37, cognitive 29): DesktopApp has cyclomatic complexity 37 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d55cd6d781c50060e662a5e61b4817bf31ab927fac106be085a3c559cd6b15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ActivityPanel (cyclomatic 36, cognitive 32): ActivityPanel has cyclomatic complexity 36 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/activity/ActivityPanel.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9dd728c49a6a8b2b41ff942d1ec832e7ce73a43d5e8c31e565bddebe7d57e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 33, cognitive 38): execute has cyclomatic complexity 33 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":"plugins/agent-environment/src/bridge.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1516c6acbbaab626e4728522488c4a8b2ca17a6b211e4e8d50364b420b967f1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 38): (anonymous) has cyclomatic complexity 32 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/server.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"423f8f4c6ca04259a91b5a004545f6d4b227cb98f8c49c9ef4cd2aedb978a4c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 31): (anonymous) has cyclomatic complexity 29 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":"apps/desktop/src/hooks/useDesktopWorkspace.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"127fd250dcdc22b71ed58476e0aaa5313ef9693e6ae7e89ea63edd8a1ccaebf7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspect (cyclomatic 28, cognitive 22): inspect has cyclomatic complexity 28 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":"scripts/ui-smoke/admin-preferences.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"41aa9d19dce78247656018f1233097791962dc9dce964bdef2d5ead3e7e2fe29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 22): (anonymous) has cyclomatic complexity 27 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":"apps/desktop/src/features/projects/RunnerDevices.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"97137ed288e22333831c8d5acffc83ce53585e130aa5727cacf8bfeaeba6239d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RunnerFileAccess (cyclomatic 27, cognitive 17): RunnerFileAccess has cyclomatic complexity 27 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/settings/RunnerFileAccess.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c3a84db6f93294f9c0e43f783f27d34d479bdd87908996871fad1a164ba3aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspect (cyclomatic 26, cognitive 32): inspect has cyclomatic complexity 26 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":"scripts/ui-smoke/sidebar-geometry.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a676a9f8ed142f5e3d3300cbaacde2730f049a4de0d37f84b6d4ca3c8d05a113"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function noProxyMatches (cyclomatic 25, cognitive 41): noProxyMatches has cyclomatic complexity 25 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/webcodex/install.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f5b838b4c55218639146a00552386edd0d3a7d80d9ca6438f0cc4d2873df79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderEntry (cyclomatic 25, cognitive 21): renderEntry 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":"apps/desktop/src/features/settings/ConfigurationDataPanel.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2e7f437ae2f8544448e9bb8ba1dfcdcd92b27db6333c4edd4b0d7a0fd8684f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capture (cyclomatic 24, cognitive 35): capture has cyclomatic complexity 24 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":"scripts/ui-smoke/web-page-consistency.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b84e24f555fb24bf2f22d2bece711a4c8daabfd14b288b86efbc526e7c39e4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractTarGz (cyclomatic 24, cognitive 32): extractTarGz 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":"npm/webcodex/install.js"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"42691cad325215f80c0c49b0512252b0b530afad2b2c6cc0208330984ae3af58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ProjectRow (cyclomatic 24, cognitive 19): ProjectRow 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":"apps/desktop/src/features/projects/ProjectRows.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e4edd09d8195392395aa19c974b77262a6e3181c6601fd22ff88373e29a09f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ComputerPermissions (cyclomatic 24, cognitive 19): ComputerPermissions 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":"apps/desktop/src/features/settings/ComputerPermissions.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2718f48656f415804beb5a3d629c4bdabc4ea3ed2e549076fe20d92b2c04467"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ExtensionsPanel (cyclomatic 24, cognitive 18): ExtensionsPanel has cyclomatic complexity 24 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":"apps/desktop/src/features/extensions/ExtensionsPanel.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8af9ee5b81d2f942710506877a8919b602478c77918dc2ffa503875bbd6cc85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 28): (anonymous) has cyclomatic complexity 23 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":"extensions/browser-bridge/worker.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa1fd6bde30347b7e1398b328d5aa19112eb2cec303a35df15326caacce12a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function desktopErrorPresentation (cyclomatic 23, cognitive 24): desktopErrorPresentation has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/presentation.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"da896d9a826ed7c7081598be2db4b3376e6d0fdc13c19e67a4032ba2d90ed56b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RuntimeConsolePanel (cyclomatic 23, cognitive 15): RuntimeConsolePanel has cyclomatic complexity 23 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":"apps/desktop/src/features/console/RuntimeConsolePanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4655c2c8f81942c1664734111f80ad504f55701f8273bf51a8e0eeb4061d83ab"}},{"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":"frontend/test-v2/navigation.test.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb45a04efd49ed0428b497e6e47167e0b204d7157dd45c701cc7b8c2750492c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function poll (cyclomatic 22, cognitive 19): poll 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":"apps/desktop/src/features/workspace/WorkspaceContext.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de7d92bd5390dd572c7f6ac045e11f854e43eec0d11ef8432e6d8b2eda236b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unregisterSelected (cyclomatic 21, cognitive 43): unregisterSelected has cyclomatic complexity 21 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/projects/ProjectsPanel.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68489701edf816a3e36cd07962895d51b912719840c4a92857e44c48315d31c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureProtectedNpmEnvironment (cyclomatic 21, cognitive 23): captureProtectedNpmEnvironment has cyclomatic complexity 21 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/webcodex/bin/wrapper.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f6e1168838046bf518773457945631d611a08a42753a70be067460b3d8865d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ManagedInstructionsPanel (cyclomatic 21, cognitive 17): ManagedInstructionsPanel 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":"apps/desktop/src/features/extensions/ManagedInstructionsPanel.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"949679c7cffc65881bf78da2102b83b91ab30e2cef1c3bce4e64bc4d72b162c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 32): (anonymous) has cyclomatic complexity 20 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":"scripts/ui-smoke/window-session-record.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6052d2d4af752de1e2a28d8fbd9c575a0aac5983c827a90d589577fceb40c8d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function continuationFromWindow (cyclomatic 20, cognitive 18): continuationFromWindow has cyclomatic complexity 20 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":"apps/desktop/src/features/activity/window-evidence.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecd89ec9fd2e2519b00ebc1d4553a86ed3e5352537324a47869424b4fb31563"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function command (cyclomatic 20, cognitive 18): command has cyclomatic complexity 20 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":"extensions/browser-bridge/worker.js"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"353e6203211a7e8707095f6dcef7dcb260ac64ebf6d8cb3b92b8ba895b7a2c0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runtime (cyclomatic 19, cognitive 11): runtime has cyclomatic complexity 19 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/selection-consistency.mjs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"16227b6f05810eb4c58a216b6cb16efa5d2e0486f9707599091d244b44c0e417"}},{"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":"apps/desktop/src/features/activity/ActivityPanel.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d9cbf6267bb307d6f199e04c5f405cd11597693e9d8c5d4a79fd857534b0cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function McpProvidersPanel (cyclomatic 18, cognitive 15): McpProvidersPanel 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":"apps/desktop/src/features/extensions/McpProvidersPanel.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4c46cb245e034881e99ceb811079e3677d183319e1c75c125144a1717ec148"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CodingAgentsPanel (cyclomatic 18, cognitive 14): CodingAgentsPanel has cyclomatic complexity 18 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":"apps/desktop/src/features/extensions/CodingAgentsPanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a76675f260ed61063fe1a40a80f2b75d450488df67c6a52157def85a413920"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectSelection (cyclomatic 18, cognitive 13): inspectSelection has cyclomatic complexity 18 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/selection-consistency.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9d4b2719c8d2df712d5542d29e587c16762a0d1fb12ec9ebff709b52b60278"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 17, cognitive 22): observe has cyclomatic complexity 17 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":"apps/desktop/src/features/extensions/SshResourcesPanel.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4730100415aa1e1cbf0ace4f8eaf32c59419fd3addfb6db64d35e34ff5043e76"}},{"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":"crates/webcodex-browser/src/cdp/set_value.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"740449e7fc24bc19718231df5e52a1f1b7671a9a80cb91b709d39db3a9e89b84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submit (cyclomatic 17, cognitive 17): submit 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":"apps/desktop/src/features/connection/ConnectionEditor.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4656791c639e26faf3138116b9ef94bd1d7a0e843403a594d64103ca651cdc94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authorize (cyclomatic 17, cognitive 17): authorize 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":"apps/desktop/src/features/extensions/RunnerCapabilityAuthorization.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea174ef1af2f2399fb3424e0390b19b70cdd3ba6aabab7bfa1df9d2b5147f56d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WorkflowSessionDetail (cyclomatic 17, cognitive 15): WorkflowSessionDetail 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":"apps/desktop/src/features/activity/WorkflowSessionDetail.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75bcd60ad95685ad4857d83a69ee8a3e57d3b0ca87f4641ac21593fbbf8ab9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ContinuationFacts (cyclomatic 17, cognitive 14): ContinuationFacts 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":"apps/desktop/src/features/activity/ContinuationFacts.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2080abe33cf044899d4bda1aa4c096bd319afa8c8d4d551b09b9281b12956db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AuthorizationFlow (cyclomatic 17, cognitive 14): AuthorizationFlow 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":"apps/desktop/src/features/extensions/RunnerCapabilityAuthorization.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a44d3a0512e81125919dd1e54a546582f069eb877ab927ccfc394b430d483d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 14): (anonymous) 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":"apps/desktop/src/features/settings/RunnerCapacityPanel.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbffb0eea5d05e3c8d479fb8859c549c4269415bf471d71ef8a92cf77e3a76b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspect (cyclomatic 17, cognitive 13): inspect has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/desktop-soft-surfaces.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b78219ee1e22e14c1ba112716accedf104889ac6adf6ed4007002805bc89d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWindowsNpmCli (cyclomatic 16, cognitive 18): resolveWindowsNpmCli 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":"npm/webcodex/bin/wrapper.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7181b6a541b7cd25fde5b68b9842ba45f50d183bb3f1ca656c3600875919a678"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ConfigurationDataPanel (cyclomatic 16, cognitive 15): ConfigurationDataPanel 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":"apps/desktop/src/features/settings/ConfigurationDataPanel.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d66181dc66545e0fb42e3e180fc74a8140930d54c996ae769e39181d6038fa"}},{"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":"apps/desktop/src/features/workspace/WorkspaceContext.tsx"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff1a42beed2eb995995342e927fcd1b4c8a0a9ed8b6f61e9f590c402c80c7c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CodingAgentEditor (cyclomatic 16, cognitive 14): CodingAgentEditor 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":"apps/desktop/src/features/extensions/CodingAgentEditor.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7aad7de6ec5c20e3e67a5a23d8564396d06bc86a89490148c3ae7af3083533a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 14): (anonymous) has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/widgets/common.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e1a3e0fc31653ae8e7326114860646afbe49572063f63945e6f851b996c132"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TunnelConfigDiagnostics (cyclomatic 16, cognitive 13): TunnelConfigDiagnostics 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":"apps/desktop/src/features/connection/TunnelConfigDiagnostics.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"161bc418a71f66d68d7b8e2422d330ac29ac35f381f2be4f933673b897ef8a36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OAuthHandoff (cyclomatic 16, cognitive 12): OAuthHandoff 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":"apps/desktop/src/features/connection/CloudflareConnectionCard.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d91505e1c2c839aaf1042b81868225463f9fa6ed9db3915a28d90dde033065"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SshResourcesPanel (cyclomatic 16, cognitive 12): SshResourcesPanel 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":"apps/desktop/src/features/extensions/SshResourcesPanel.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b72b59e2fb5327e0a157928c94484b521b82f8ae7204385a186c568004f70f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 29): (anonymous) has cyclomatic complexity 15 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":"scripts/ui-smoke/work-result-card.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6017ebfcdc4d4bd466ddd92087aa1dcaa2ca0d430fcf1715c6506ee9a7d9c42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assignPart (cyclomatic 15, cognitive 23): assignPart 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":"crates/webcodex-browser/src/cdp/widgets/date.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31996124a5deb672a74ee7532eab9026f04a58db2d041c4e8795b387b8d3e6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 15, cognitive 17): main 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":"npm/webcodex/test/self-test.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e33f107567c2bce81bbbc55766e7f9eea31d1d370489f516d843f7eecb1da7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifySurface (cyclomatic 15, cognitive 16): verifySurface has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/desktop-resize-theme.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"666accedcb3b66e839e4705c57f09dfe6af3098d327227d4599a4175275a2fed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 15, cognitive 14): run has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/features/onboarding/FirstRun.tsx"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2607559c4ccd4f707dc059c9de17500af72593b2af2f72fe7567aa0ecfd1362d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BinaryFacts (cyclomatic 15, cognitive 12): BinaryFacts 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":"apps/desktop/src/features/settings/RuntimePanel.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c65be1ab75d86de20c05d1705a183c53a358cb5631617bd8280362fe8e56ced"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UpdateBanner (cyclomatic 15, cognitive 11): UpdateBanner 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":"apps/desktop/src/features/settings/AboutPanel.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff36b7b875298fc2e2da64c062499f696236fb367a45a8ba6212ff3e3e00563d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/widgets/common.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8373f9b77bc20539a80415f2339013a51c6dcf860b9cd0e73e065bf34a84cebf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) 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/ui-smoke/flowing-selection.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3104fb6fcbe54aef7a6b15481745684571d5d9adf959b5dbeb4141b18d354ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 14, cognitive 14): check 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":"apps/desktop/src/hooks/useRuntimeUpdates.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e591b150ca9cac61312ddef85f24186350d7b4c5ce01f3a8e16125fe42b49ba"}},{"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":"apps/desktop/src/features/settings/RuntimePanel.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4d5493eebeba26a1ca12e28f4366fb34538834b2f32160a4720a433e006daa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WorkspaceProvider (cyclomatic 14, cognitive 12): WorkspaceProvider 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":"apps/desktop/src/features/workspace/WorkspaceContext.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf21bdd8edb29d8f00a2e08472183b5a826ad52c9d9ada69363a79390c2b24e6"}},{"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":"apps/desktop/src/hooks/useRuntimeUpdates.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fa2eb908339c8731af31e4d1242a1103bee0c8bd76ffebd8e33736b60d4137"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AddLocalProject (cyclomatic 14, cognitive 10): AddLocalProject 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":"apps/desktop/src/features/projects/AddLocalProject.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f72794d939ba54ab8013dafcf89baa147e031c5c013206c142df89e3a30a86f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 26): (anonymous) has cyclomatic complexity 13 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/ui-smoke/work-result-controls.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26594a9ea4d2bc55fddd32061a0e3f51232ceb52813c5f8f63fefa86ae25f0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 19): (anonymous) 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":"src/mcp_tests/agent_continuation_app.test.mjs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"37925ef16441d5e5da947c0d0525c07c490efd345e11eb661ad56249aa71df3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function write (cyclomatic 13, cognitive 13): write 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":"apps/desktop/src/features/settings/RunnerFileAccess.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b65869b9047357fe599cfef0101683e5ef7d1045b764055860270ab1436237"}},{"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":"frontend/test-v2/window-session-record.test.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3a19001d37ee8ce4090603c1d63191e112bdada8cf2d0e9555758b2612ce31"}},{"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":"frontend/test-v2/inventory-load.test.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8daede2b0a3224b896abee969491b5c6706c158caaf3cbf9175926db1a426575"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WindowActivityDetail (cyclomatic 13, cognitive 11): WindowActivityDetail 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":"apps/desktop/src/features/activity/WindowActivityDetail.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbb789b0c1840cafe13d9ce5ad608965387456d641a55cb9649b3fd4ad72de6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chooseYear (cyclomatic 12, cognitive 18): chooseYear 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":"crates/webcodex-browser/src/cdp/widgets/date.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2482781bf426ca4f014f55ff872f4a7a238d7b79ae9c0b19ef86e41a1ab2e3d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enable (cyclomatic 12, cognitive 14): enable 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":"apps/desktop/src/features/extensions/ManagedInstructionsPanel.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ad0fbf1ba2a976a87f04cd3250c708209cc51662d629b3d9a29298a67bfe76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startNetworkRequest (cyclomatic 12, cognitive 14): startNetworkRequest 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":"npm/webcodex/install.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69534fc4bd424849736c520f6142aa0adbac782c7428465f9abbf53db4a11cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-smoke/i18n-project-layout.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef4cbd9846666bb565e6068b60c852fc0cb7faec353e3f62972ff89cdbc1fc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 12, cognitive 13): create 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":"apps/desktop/src/features/projects/AddDevice.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1da0d265903f8f0f9d6a434ca90df394f8d5eda86a427dc4a42d3655f1bc00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareSelectedRemoval (cyclomatic 12, cognitive 13): prepareSelectedRemoval 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":"apps/desktop/src/features/projects/ProjectsPanel.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d860a19119605e510b31ce33a4c19cee8c91da6dd72a0202b91e7612b9e3281"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submit (cyclomatic 12, cognitive 12): submit 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":"apps/desktop/src/features/extensions/CodingAgentEditor.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f762405abeee3bfdc4fbc38ed5211e07b5ad835bae836826fa7a5063b9c7e39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runNative (cyclomatic 12, cognitive 12): runNative 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":"npm/webcodex/bin/wrapper.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9bcdefc7f74337c5f29b90b7db225ccf8f68f4b9dd0b7595aa3c81e050b7ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 12, cognitive 11): run 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":"apps/desktop/src/features/connection/CloudflareConnectionCard.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcef5318778d91a4ba642cb9c32c1796797e3aea27ad4672ee44d29c7bd8fc57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ProjectGitChanges (cyclomatic 12, cognitive 11): ProjectGitChanges 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":"apps/desktop/src/features/projects/ProjectRows.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7455e6a0e2a57074e9a2ea14ab376282f4c107a3c62a578957568820c8f61c57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadManifest (cyclomatic 12, cognitive 11): loadManifest 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":"download/app.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"13891cf1d2ea192b9e4f039cf8c8249a1c39a275467e18cd1f0923926bdb5643"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveNpmNetworkOptions (cyclomatic 12, cognitive 11): resolveNpmNetworkOptions 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":"npm/webcodex/install.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7faaf3804e6d119d2fac2513e5b47b8b1c08875547f0a091b306312213f541f"}},{"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":"scripts/ui-smoke/desktop-clarity-layout.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cb22994bf4d87c7737c8b97b1ae0b65c40edc11a56e908a10155e6a4801c8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chooseMode (cyclomatic 12, cognitive 10): chooseMode 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":"apps/desktop/src/features/onboarding/FirstRun.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2185504a2ade50628697a99f0b364e9ca48905ab1fea30467efb4618e8555240"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SessionAttention (cyclomatic 12, cognitive 9): SessionAttention 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":"apps/desktop/src/features/activity/WorkflowSessionDetail.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b6506798acf057e031d00cb422273cc8cd94db91909f639e8ffcc8b344d64f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) 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":"apps/desktop/src/features/settings/LocalServicesPanel.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a5db857057be0cb73ce764bd2a2c77eeceea5354c4954e876db0d5b9bbddff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consoleText (cyclomatic 11, cognitive 16): consoleText 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":"extensions/browser-bridge/worker.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7a09660cd85f5a55534df3966f6339c10e8870fd080142a77730f4e13d139a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 11, cognitive 14): open 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":"crates/webcodex-browser/src/cdp/widgets/common.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"21523d18b0ec477d860d6400f4a8c475435530b651de0580cc05ea58b703ef35"}},{"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":"npm/webcodex/install.js"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4403b6bd4c3f8c207eb4ccf7eecaf624a4465f61a854bdb616c0beb29127e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function devicePlatform (cyclomatic 11, cognitive 12): devicePlatform 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":"download/app.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"78faaac2d682e1a968d475cb92843c82ebaa172645dfd62f7e545b0edc4178ee"}},{"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":"scripts/ui-smoke/pdf-document-reader.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"005263dd79b1a3cb673d32e33d2e6cc820dab6f0bf83ae2b00417b2b9352fc3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ExtensionPathsEditor (cyclomatic 11, cognitive 10): ExtensionPathsEditor 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":"apps/desktop/src/features/extensions/ExtensionPathsEditor.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbee8e2ea432ae3c44a47a09cf6770da8fffc5addfa48d0df671eacf8d9d440e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FirstReadGuide (cyclomatic 11, cognitive 9): FirstReadGuide 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":"apps/desktop/src/features/onboarding/FirstRunCompletion.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dfac1d69b49a507d77fe24fe8543fee821db4a6afb8add328d81d868163115"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DeviceInvitationDialog (cyclomatic 11, cognitive 9): DeviceInvitationDialog 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":"apps/desktop/src/features/projects/AddDevice.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6108211cc67ea4e36f718b2423f6e1f463bbbd582a6fff0f9b761f740d0732dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function desktopStatusPresentation (cyclomatic 11, cognitive 9): desktopStatusPresentation 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":"apps/desktop/src/features/workspace/WorkspaceStatus.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c89a540e0b04edf3982ab32ebbad44073c70873977043fc9e1290bca737c9a"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/webcodex/install.js: 897 lines of code: npm/webcodex/install.js has 897 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":"npm/webcodex/install.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8990d4689b6c451ee4fb50572d364cd0bfa899a3b3f2237e76760e7213030d11"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/i18n/update-text.ts: 563 lines of code: apps/desktop/src/i18n/update-text.ts has 563 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":"apps/desktop/src/i18n/update-text.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d59abc54d370dda29c1760862c546669da89640b3742af2e45428a3703e1124"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/widgets/common.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce86a24b913635d01068b467bb8ee0b649b2ade7182eaa853fc5adc315ced39"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/widgets/date.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"142372945421687c7bd59e9fb5c97512426b3c09e3834335c061f94accdf266a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/widgets/choice.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fc553f8eba10c88286859fb2d60837e9f147970ee5c7622e9a0f89c61c8fc0"}},{"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":"download/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bbe77b4d9046dd86c89f98ea209d207dbf4252636afd1ceebf38b165d60a36"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/set_value.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d63846c54f331c412f46a9739dbdfbd24dbea8366adaa39170bda08f082ddb"}},{"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":"apps/desktop/scripts/generate-icons.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5395618bda0531875778d557c68192797c4fa8cc6d4f687117bfe5434fb1f3f7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/browser-bridge/popup.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb306e1213be1c9b383db94ebe0c32215cb2b74fbb032ce249585a0aa61338d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~207 LoC): no import path from any entry point (94 application, 4 tooling, 153 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/ui-smoke/work-result-card.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2305c853461dca14057fe3b954cd3c108097afabf4fcc27659d6ec5c456e48"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~186 LoC): no import path from any entry point (94 application, 4 tooling, 153 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/ui-smoke/window-workspace.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40efaac8558628c0c802225d2446f2793f0d9d9fb185c4a0956961e89b7c12e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~143 LoC): no import path from any entry point (94 application, 4 tooling, 153 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/ui-smoke/desktop-clarity-layout.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"652f1b21fc6de40fc17dd0999ef106b8b7c584942c27f064a58f4cf50951e90b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~129 LoC): no import path from any entry point (94 application, 4 tooling, 153 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/ui-smoke/i18n-project-layout.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd58899e85b1a629108438095a01d9c03af6148c5b7217ab5faf06216f0f3c9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~117 LoC): no import path from any entry point (94 application, 4 tooling, 153 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/ui-smoke/desktop-connection-readability.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c910c28f4220529c7ce0ab3686fa4235f57796085177b26f7c76caede3babcc7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~78 LoC): no import path from any entry point (94 application, 4 tooling, 153 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/ui-smoke/collaboration-history.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a977f689b50792d60641d9ef1a91394716efc541c008d874fe9593f74ad3a6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~76 LoC): no import path from any entry point (94 application, 4 tooling, 153 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/ui-smoke/desktop-connection-recovery.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e420ca456454d6ccb496aea6b539d10a41673d993ab18a641a77568633c3a3a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~72 LoC): no import path from any entry point (94 application, 4 tooling, 153 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/ui-smoke/desktop-runtime-probe.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3ac52b0fc7b4431a8114ec3652254cbe38fb359a62d0b711559b99d2564f01"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~66 LoC): no import path from any entry point (94 application, 4 tooling, 153 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/ui-smoke/desktop-runtime-simple.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a8e877c6d189108a70d1da770d1a5ad1a05d3c865046050a17f1d8c96e57de"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~58 LoC): no import path from any entry point (94 application, 4 tooling, 153 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/ui-smoke/runtime-overview.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1f6150ba2b5e794739b849cc6e048b89f66e97169017e41687a137209f62d8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~51 LoC): no import path from any entry point (94 application, 4 tooling, 153 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/ui-smoke/window-collaboration.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"409f121591de14d2a4c7b3827b24d3ecf98acb227ee05b54e1d0612d0276af51"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~50 LoC): no import path from any entry point (94 application, 4 tooling, 153 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/ui-smoke/work-header.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb97773000814d5cb25db3e897eb4097b5be1b8c13f6947c253078afe45e610f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027readinessNextAction\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/presentation.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ae0745e856af41a497f6f0f1db24ac138ceed122cc588a37819ecb00f87916"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027serverReadinessLabel\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/presentation.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f75a786e31f6c8774d150a1877df78d0af4bf03389fdb139ee1ae3cdd0c30f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027runnerReadinessLabel\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/presentation.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5639b3abba6de895282410b6cd0ba3fc4b60f909c31c76cba3166c760a1f56"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027projectReadinessLabel\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/presentation.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b10a42f26ffd2a2d65373dd9eeac4db33e75acc50f6533b221fef464aa7860"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027runtimeLabel\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/presentation.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1201fa4af4732aba42a30992a2b6db662a5ff597c4654c55d8eb74e63a94d767"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027flush\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":"frontend/test-v2/admin_controller.test.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95011e4613fc4fceac4682cfee0aa925138aa2a9bf5f278965416ba5b19e0a3"}},{"ruleId":"R8","level":"note","message":{"text":"Test-only dependency \u0027react\u0027 in production deps: Only test files import it (first: frontend/test-v2/navigation.test.tsx:2) \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/package.json"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2283c3c9896b0053346206857a4e0caec6beba2cb6b3fb6543e578425cad30cd"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): apps/desktop/src/i18n/locale.tsx \u2192 apps/desktop/src/lib/desktop-api.ts \u2192 apps/desktop/src/i18n/locale.tsx"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/locale.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7de10d9bd44192a0d14a254a5437fc0493d54bd5760d0894490191012591e90"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!value \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Array.isArray(value) \u0026\u0026 typeof value.success === \u0022boolean\u0022 \u0026\u0026 (Object.prototype.hasOwnProperty.call\u2026\u0060 appears character-identically in 2 files \u2014 frontend/src/mcp-apps/docx-app.mjs, frontend/src/mcp-apps/work-result/pdf-document.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":"frontend/src/mcp-apps/docx-app.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c210b94782ac5e36ec800a85807939933370f524f2099abc79a935638d08238"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!block || block.type !== \u0022text\u0022 || typeof block.text !== \u0022string\u0022 || block.text.length \u003E 400_000\u0060 appears character-identically in 2 files \u2014 frontend/src/mcp-apps/docx-app.mjs, frontend/src/mcp-apps/work-result/pdf-document.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":"frontend/src/mcp-apps/docx-app.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"229567500cea8798d08f42c8559a2693901216b56a66a759cb9244feff643733"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!existsSync(resolve(dir, \u0022package.json\u0022)) \u0026\u0026 dirname(dir) !== dir\u0060 appears character-identically in 2 files \u2014 frontend/scripts/build-docx.mjs, frontend/scripts/build-work-result-markdown.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":"frontend/scripts/build-docx.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c63aa1e2c158f5d7a44e30efebb429a0b1ac36f07afba4d528b7b4b9e82294"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Math.abs(control.icon.cx - control.cx) \u003C= 1 \u0026\u0026 Math.abs(control.icon.cy - control.cy) \u003C= 1\u0060 appears character-identically in 2 files \u2014 scripts/ui-smoke/admin-preferences.mjs, scripts/ui-smoke/sidebar-geometry.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":"scripts/ui-smoke/admin-preferences.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24927308672399bf13d2ff36c365616de94aedae39917886de586418a9ddad4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bounds.body \u003C= width \u002B 1 \u0026\u0026 bounds.root \u003C= width \u002B 1\u0060 appears character-identically in 5 files \u2014 scripts/ui-smoke/projects-runtime.mjs, scripts/ui-smoke/runtime-overview.mjs, scripts/ui-smoke/runtime-workflow.mjs, scripts/ui-smoke/window-workspace.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":"scripts/ui-smoke/projects-runtime.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6226d8cd56253e428561e8e731925ee3fe871e04473679b93292f8d9e47d3265"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bounds.x \u003E= 0 \u0026\u0026 bounds.x \u002B bounds.width \u003C= width \u002B 1 \u0026\u0026 bounds.y \u003E= 0 \u0026\u0026 bounds.y \u002B bounds.height \u003C= 1001\u0060 appears character-identically in 2 files \u2014 scripts/ui-smoke/admin-preferences.mjs, scripts/ui-smoke/sidebar-geometry.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":"scripts/ui-smoke/admin-preferences.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e34fd9c815bb4dbf91ad9a844f21378a7224004cf866cd5e1644bdf175f6459"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060box.left \u003E= 0 \u0026\u0026 box.right \u003C= innerWidth \u002B 1 \u0026\u0026 box.top \u003E= 0 \u0026\u0026 box.bottom \u003C= innerHeight \u002B 1\u0060 appears character-identically in 2 files \u2014 scripts/ui-smoke/mcp-workspaces.mjs, scripts/ui-smoke/work-result-controls.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":"scripts/ui-smoke/mcp-workspaces.mjs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"520a105c60a69257c9e6678aba5013b406f5da9c4587aada483d959bbc9379b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060busy || Boolean(state.current_operation)\u0060 appears character-identically in 6 files \u2014 apps/desktop/src/features/console/RuntimeConsolePanel.tsx, apps/desktop/src/features/extensions/useExtensionsState.ts, apps/desktop/src/features/onboarding/QuickShareSetup.tsx, apps/desktop/src/features/settings/DiagnosticsPanel.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":"apps/desktop/src/features/console/RuntimeConsolePanel.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d3dc04b1bbb05f08c52d3959a6b083a43cef4b28986282ae0ec97c102376c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate \u0026\u0026 typeof candidate === \u0022object\u0022 \u0026\u0026 !Array.isArray(candidate)\u0060 appears character-identically in 2 files \u2014 frontend/src/mcp-apps/docx-app.mjs, frontend/src/mcp-apps/work-result/pdf-document.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":"frontend/src/mcp-apps/docx-app.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a6dbe8e88e095ab7ad255ec5b5252c535ecc03e7cab112c0c2a480321df738"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current === \u0022available\u0022 || current === \u0022stale\u0022\u0060 appears character-identically in 2 files \u2014 frontend/src/runtime-v2/state/useProjectSessions.ts, frontend/src/runtime-v2/state/useWindowWorkspace.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":"frontend/src/runtime-v2/state/useProjectSessions.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17c0c2d3e0ba967e3838ef1b7cb724544bddfa1063a69e4fa8c57017ad0bf92"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060details.killed === true || details.code === \u0022ETIMEDOUT\u0022\u0060 appears character-identically in 2 files \u2014 plugins/repo-context/src/context.ts, plugins/repo-info/src/plugin.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":"plugins/repo-context/src/context.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"284ad536430bc03aa479fe03360f082899c4ca16237433262b982f56dd792721"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dimensions.document \u003C= dimensions.viewport \u002B 1 \u0026\u0026 dimensions.content \u003C= dimensions.main \u002B 1\u0060 appears character-identically in 2 files \u2014 scripts/ui-smoke/desktop-runtime-probe.mjs, scripts/ui-smoke/desktop-runtime-simple.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":"scripts/ui-smoke/desktop-runtime-probe.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7dd01ab20ddc81909c935e2758ba3837030cda7983457bb33864add83abf6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060document.documentElement.lang === locale \u0026\u0026 document.documentElement.dataset.theme === theme\u0060 appears character-identically in 2 files \u2014 scripts/ui-smoke/desktop-connection-readability.mjs, scripts/ui-smoke/i18n-project-layout.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":"scripts/ui-smoke/desktop-connection-readability.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a0fad323d741af4f80699203bc2fffd167e89a0f71e3c972e032938406f6aa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error \u0026\u0026 desktopErrorPresentation(error, t)\u0060 appears character-identically in 4 files \u2014 apps/desktop/src/features/console/RuntimeConsolePanel.tsx, apps/desktop/src/features/settings/DiagnosticsPanel.tsx, apps/desktop/src/features/settings/LocalServicesPanel.tsx, apps/desktop/src/features/settings/RuntimePanel.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":"apps/desktop/src/features/console/RuntimeConsolePanel.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"818a6753026622d41d934d4e98c93c407d0a7ae6700fe4c27368119c03dc5f8d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error \u0026\u0026 typeof error === \u0022object\u0022 \u0026\u0026 \u0022name\u0022 in error \u0026\u0026 error.name === \u0022AbortError\u0022\u0060 appears character-identically in 2 files \u2014 frontend/src/admin_controller.ts, frontend/src/admin_mutation_controller.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":"frontend/src/admin_controller.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fa35c3e5b59bf1b04fb5a7cf85a5024b4380fd8fc61db67ab1fc464f77f6f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.key === SELECTION_STORAGE_KEY || event.key === null\u0060 appears character-identically in 2 files \u2014 frontend/src/ui/cardAppearance.ts, frontend/src/ui/useSelectionPreference.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":"frontend/src/ui/cardAppearance.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0e9e4ba56e8efca83a3b752c748aedb31c0c1bb5635da19e8ec1ed2ba71189"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.source !== frame.contentWindow || event.data?.jsonrpc !== \u00272.0\u0027\u0060 appears character-identically in 3 files \u2014 scripts/ui-smoke/mcp-workspaces.mjs, scripts/ui-smoke/pdf-document-reader.mjs, scripts/ui-smoke/work-result-controls.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":"scripts/ui-smoke/mcp-workspaces.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5fd28cf3ff8f166929fe956fa4b6b7ca0135a5fccde4e623fb7454779cb914"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060head === undefined || !/^[0-9a-f]{40,64}$/u.test(head)\u0060 appears character-identically in 2 files \u2014 plugins/repo-context/src/context.ts, plugins/repo-info/src/plugin.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":"plugins/repo-context/src/context.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbe63b89aecf106affbb4d74df2b604d8d394dbd86844f687f44000ec9f09d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060html.split(begin).length !== 2 || html.split(end).length !== 2\u0060 appears character-identically in 6 files \u2014 frontend/scripts/build-docx.mjs, frontend/scripts/build-pdf-document.mjs, frontend/scripts/build-selection-motion.mjs, frontend/scripts/build-spreadsheet.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":"frontend/scripts/build-docx.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b921f4996208ff8f13da66b0dd1cc282d8d36f6e218722d9a3ded5f06e7525"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.WC_TEST_AGENT_BROWSER || \u0027agent-browser\u0027\u0060 appears character-identically in 2 files \u2014 plugins/agent-browser/scripts/live-smoke.mjs, plugins/agent-browser/scripts/native-smoke.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":"plugins/agent-browser/scripts/live-smoke.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21ab1d35b2d4e83bbae5e6ad6672e46b8e2d45d79721fd8a5fd128860914063"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response?.status === 403 || response?.status === 404\u0060 appears character-identically in 3 files \u2014 frontend/src/runtime-v2/components/SessionWindowNavigation.tsx, frontend/src/runtime-v2/state/useGoalWorkspace.ts, frontend/src/runtime-v2/state/useSessionWorkspace.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":"frontend/src/runtime-v2/components/SessionWindowNavigation.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"190d21f1a6147444ce5c1c9e1ed5521cc851384586c42b5c80e96a71759983df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060script.includes(begin) || script.includes(end)\u0060 appears character-identically in 2 files \u2014 frontend/scripts/build-pdf-document.mjs, frontend/scripts/build-work-result-pdf.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":"frontend/scripts/build-pdf-document.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b2e3926fe2e05f92a543516bafdbceae9f5e72bdfc45e0dbf449f920f777cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session.project_name || session.project_id\u0060 appears character-identically in 2 files \u2014 frontend/src/runtime-v2/components/GoalWorkbench.tsx, frontend/src/runtime-v2/model/work.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":"frontend/src/runtime-v2/components/GoalWorkbench.tsx"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"122507af3e402d0ecfe5ef86ac2916d81893beb03f353cb2690be108e727b102"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.topology?.experience === \u0022full\u0022 \u0026\u0026 state.topology.server.kind === \u0022local\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/features/onboarding/FirstRunCompletion.tsx, apps/desktop/src/features/projects/AddDevice.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":"apps/desktop/src/features/onboarding/FirstRunCompletion.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"71068a84bd5ccfc3e0813fe885e4cd2f858d9c310412eff44b1ca6c98be993d2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 npm/plugin-sdk/src/schema.ts, npm/plugin-sdk/src/types.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":"npm/plugin-sdk/src/schema.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3a58a2558196ad2869d2e6e46af247e117a9fd9470950c225a02a210b0b2b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 npm/plugin-sdk/src/protocol.ts, plugins/agent-environment/src/catalog.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":"npm/plugin-sdk/src/protocol.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"55436e20f7f1555be6310114b55bcb9291d68b832361bc7884b993d1d3a290f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === \u0022available\u0022 || value === \u0022stale\u0022\u0060 appears character-identically in 7 files \u2014 frontend/src/runtime-v2/state/useAgentWorkspace.ts, frontend/src/runtime-v2/state/useGoalWorkspace.ts, frontend/src/runtime-v2/state/useProjectSessions.ts, frontend/src/runtime-v2/state/useProjects.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":"frontend/src/runtime-v2/state/useAgentWorkspace.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fe8caeb773fd8632dc398a172fd7963bec3aad4682bc3304a60006b5156273"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060window.last_meaningful_activity_at_ms || window.last_seen_at_ms\u0060 appears character-identically in 3 files \u2014 frontend/src/runtime-v2/components/GoalWorkbench.tsx, frontend/src/runtime-v2/components/SessionInspector.tsx, frontend/src/runtime-v2/model/work.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":"frontend/src/runtime-v2/components/GoalWorkbench.tsx"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"320bf8b73f3249c35032138b6ddb30e9a40cfd5bc37965e9559b39572579e581"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060windows.availability === \u0022error\u0022 || windows.availability === \u0022denied\u0022\u0060 appears character-identically in 2 files \u2014 frontend/src/runtime-v2/components/WindowWorkbench.tsx, frontend/src/runtime-v2/views/ProjectsView.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":"frontend/src/runtime-v2/components/WindowWorkbench.tsx"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2636f3a5f708861e0442fee78caad25f39821933bd7ade8b5c457b7f3c6ea17"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060workspace.error \u0026\u0026 [\u0022authenticationRequired\u0022, \u0022permissionDenied\u0022].includes(workspace.errorReason)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/features/activity/ActivityPanel.tsx, apps/desktop/src/features/projects/ProjectsPanel.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":"apps/desktop/src/features/activity/ActivityPanel.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"077cbfbd1adf0bc81f87838d16415eceda1c6264b1436592d0cb5e994c0311d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arguments.get(\u0022tool\u0022) != tool or not isinstance(arguments.get(\u0022arguments\u0022), dict)\u0060 appears character-identically in 2 files \u2014 scripts/agent_knowledge_evidence.py, scripts/agent_temporal_evidence.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/agent_knowledge_evidence.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0820312ad54c86a578274b860b94b6a0db3488dafb17b17978c0db2cebfbb974"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060body is not None and \u0022Content-Type\u0022 not in headers\u0060 appears character-identically in 2 files \u2014 scripts/e2e_project_share_roots.py, scripts/e2e_share_oauth_restart.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/e2e_project_share_roots.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3007998b4ac399962edd1634d2b37c0bb84fa002254c8928b7cf5c5ef7c111"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060call[\u0022tool\u0022] == \u0022work_on_project\u0022 and call[\u0022result\u0022][\u0022success\u0022] is True\u0060 appears character-identically in 2 files \u2014 scripts/agent_knowledge_evidence.py, scripts/agent_temporal_evidence.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/agent_knowledge_evidence.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d38bdf638c831fe59ed202deec340bd96b4c273528edc80e45ef218afb1726"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060conclusion is not None and not isinstance(conclusion, str)\u0060 appears character-identically in 2 files \u2014 scripts/release_publication.py, scripts/release_readiness.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/release_publication.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"300d68db39d96eae89af2c16bd841fcd62dd36097d091157eebab809f4ef7820"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060destination.exists() or destination.is_symlink()\u0060 appears character-identically in 2 files \u2014 scripts/collect_release_bundle.py, scripts/release_publication.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/collect_release_bundle.py"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acb8082679d39e7012c9f602f4fcdf26923d455f0e3fe28f9b19901bbaf1952"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(block, dict) and block.get(\u0022type\u0022) == \u0022text\u0022\u0060 appears character-identically in 2 files \u2014 scripts/e2e_codex_bidirectional_ws.py, scripts/local_agent_metrics.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/e2e_codex_bidirectional_ws.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd5db616bf97c078f08cd1da4f3881531195799138b040de6b478a2e9b85fdc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(tokens.get(\u0022access_token\u0022), str) and isinstance(tokens.get(\u0022refresh_token\u0022), str)\u0060 appears character-identically in 3 files \u2014 scripts/e2e_cloudflare_oauth.py, scripts/e2e_project_share_roots.py, scripts/e2e_share_oauth_restart.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/e2e_cloudflare_oauth.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ff5b022c7eb656508ab68f23312835f33c3e6a53fbf85b2119b3167dfd7c4e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060member.size \u003C 0 or member.size \u003E MAX_MEMBER_BYTES\u0060 appears character-identically in 2 files \u2014 scripts/collect_release_bundle.py, scripts/verify_public_release.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/collect_release_bundle.py"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1a157fb08e8a4d0264ebc61a84f91d6c664f6e4ac7a70da74a758152f27fe0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not authorization or \u0022\\n\u0022 in authorization or \u0022\\r\u0022 in authorization\u0060 appears character-identically in 3 files \u2014 integrations/codex/external_observation_hook.py, integrations/codex/read_handoff.py, integrations/codex/session_recovery.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":"integrations/codex/external_observation_hook.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5b21a3d4650008962ef091d61cf82072b7235c31b2c3044827586350332f44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(artifacts, dict) or set(artifacts) != set(PLATFORMS)\u0060 appears character-identically in 2 files \u2014 scripts/collect_release_bundle.py, scripts/verify_public_release.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/collect_release_bundle.py"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"276fabf128831ba96158e38c61b05e1020b7821deea34505bf836c63850c2433"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(asset, dict) or not isinstance(asset.get(\u0022name\u0022), str)\u0060 appears character-identically in 2 files \u2014 scripts/release_publication.py, scripts/verify_public_release.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/release_publication.py"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ab3f19c76cfe58bac40ea29bd655b669a937b89b1bee735f5065798d77ffef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(desktop_artifacts, dict) or set(desktop_artifacts) != set(desktop_platforms)\u0060 appears character-identically in 2 files \u2014 scripts/collect_release_bundle.py, scripts/release_publication.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/collect_release_bundle.py"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b79d55a574ac20b146415f010d8b8c7895dbb277f93e7890f7f5694ca94c11e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(digest, str) or not SHA256_RE.fullmatch(digest)\u0060 appears character-identically in 2 files \u2014 scripts/collect_release_bundle.py, scripts/verify_public_release.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/collect_release_bundle.py"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bd209371c466e5ca3d2a5cfb4c3efb1af380a63f0f34a301764dfbbe30c1e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(installers, dict) or set(installers) != set(INSTALLER_TARGETS)\u0060 appears character-identically in 2 files \u2014 scripts/build_download_page.py, scripts/verify_public_release.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/build_download_page.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5ff8415909e3f9871e3e58ecaaa4eb61a7f82dc9febca6d2beac942fc447df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(item, str) or not item.strip()\u0060 appears character-identically in 2 files \u2014 scripts/agent_loop_report.py, scripts/check_builtin_guidance_contract.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/agent_loop_report.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c25cc342753b9a9fae1ed6b24521dc747c96c56ddc04e3e669452ca2744728"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(last_observed_at, int) or last_observed_at \u003C= 0\u0060 appears character-identically in 2 files \u2014 scripts/release_publication.py, scripts/release_readiness.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/release_publication.py"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee02be62dc9e35da2a12ff6cd4cfee28b7f4caadba97b03794a9573b8a03879"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(run_id, int) or run_id \u003C= 0\u0060 appears character-identically in 2 files \u2014 scripts/release_publication.py, scripts/release_readiness.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/release_publication.py"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84fc7257ae73c62202dd2ed3569455165f01692b08de09dc0fa86f2a652e7aa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(run_url, str) or not run_url.startswith(\u0022https://github.com/\u0022)\u0060 appears character-identically in 2 files \u2014 scripts/release_publication.py, scripts/release_readiness.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/release_publication.py"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"817f456087a7bc8a1ce22d39f164e22411c4301eca28e8579721df013405aacd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, str) or not value.startswith(\u0022sha256:\u0022)\u0060 appears character-identically in 3 files \u2014 scripts/collect_release_bundle.py, scripts/release_publication.py, scripts/verify_public_release.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/collect_release_bundle.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf44b242d5cd0050d104fc30d8dbdc55206f4a3756464ff85ea390f1232132e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value.get(\u0022created_at\u0022), int) or value[\u0022created_at\u0022] \u003C= 0\u0060 appears character-identically in 2 files \u2014 scripts/release_publication.py, scripts/release_readiness.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/release_publication.py"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60931027c766f1953567590b1a190ef68783c358a12d171b6eb8320c68ad3a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(version, str) or not VERSION_RE.fullmatch(version)\u0060 appears character-identically in 2 files \u2014 scripts/build_download_page.py, scripts/collect_release_bundle.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/build_download_page.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a003d9a7114cce624942c96b27c884d20952cdfb5d27978a93f705b583bf83"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060query.get(\u0022state\u0022) == [parameters[\u0022state\u0022]] and \u0022code\u0022 in query\u0060 appears character-identically in 3 files \u2014 scripts/e2e_cloudflare_oauth.py, scripts/e2e_project_share_roots.py, scripts/e2e_share_oauth_restart.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/e2e_cloudflare_oauth.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"d693f046e5487ff7ae77a4d905e7344d83786df921abe5c1512254eade00049c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060require_runtime_installers and not require_unified_installers\u0060 appears character-identically in 2 files \u2014 scripts/collect_release_bundle.py, scripts/verify_public_release.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/collect_release_bundle.py"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bd654af846f7e8d08734bd52f3e815193b68978d341ad7db56abaf86b61738"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run is not None and state[\u0022run_status\u0022] == \u0022completed\u0022\u0060 appears character-identically in 2 files \u2014 scripts/release_publication.py, scripts/release_readiness.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/release_publication.py"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78b59c76e46a1886506904bdaadc25a17c2adc37e7a451b83de5e09cc6533e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run is not None and state[\u0022source_matches\u0022] is False\u0060 appears character-identically in 2 files \u2014 scripts/release_publication.py, scripts/release_readiness.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/release_publication.py"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bd5ebed3385ff878ace17498510fff52ff26fb8213eaa658485c601a9117c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run.get(\u0022status\u0022) != \u0022completed\u0022 or run.get(\u0022conclusion\u0022) != \u0022success\u0022\u0060 appears character-identically in 2 files \u2014 scripts/collect_release_bundle.py, scripts/release_readiness.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/collect_release_bundle.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a2d0723e40aab384ee7c91bbfaa60e605b6262bded73ea7cd7ada49cdb45ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.process is not None and self.process.poll() is not None\u0060 appears character-identically in 2 files \u2014 scripts/e2e_project_share_roots.py, scripts/e2e_share_oauth_restart.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/e2e_project_share_roots.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7bdfc920a059959c18374650c342a1143c91e472d468b234ac55f981d9303f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state_path.is_symlink() or not state_path.is_file()\u0060 appears character-identically in 2 files \u2014 scripts/release_publication.py, scripts/release_readiness.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/release_publication.py"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79e7926024052ed40db4ffbfdfb07df66d8371fafb7cd8f06f063c8c2899617"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type(started) is not int or type(ended) is not int or ended \u003C started or event.get(\u0022response_streaming\u0022) is not False\u0060 appears character-identically in 2 files \u2014 scripts/agent_knowledge_evidence.py, scripts/agent_temporal_evidence.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/agent_knowledge_evidence.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae6bad07319fb63b164292bd6479083247d78cad6b321f6770473081785033b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060url.scheme == \u0022http\u0022 and url.hostname in (\u0022127.0.0.1\u0022, \u0022::1\u0022, \u0022localhost\u0022)\u0060 appears character-identically in 2 files \u2014 integrations/codex/external_observation_hook.py, integrations/codex/session_recovery.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":"integrations/codex/external_observation_hook.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0cbcbd030c7a8edde5474f1daf651467220b0d36a19be5f2b0063bd5607c3b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060written \u003E expected_size or written \u003E MAX_MEMBER_BYTES\u0060 appears character-identically in 2 files \u2014 scripts/collect_release_bundle.py, scripts/verify_public_release.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/collect_release_bundle.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d31b882d4ee757e547b15d23aca0ca5db8cd578025459cec7fbd772889aef05"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(stdout_eof \u0026\u0026 stderr_eof) \u0026\u0026 Instant::now() \u003C drain_deadline\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs, crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"21276ef01c6c4604273f59aba74b0ed2484bd0412ee509c53e6143b69689a6cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(stdout_eof \u0026\u0026 stderr_eof) \u0026\u0026 forced_status.is_none()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs, crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cec0b3c6cf37af00f28039f81ee5e4851798adece394d01ecc6b485c6cb4fe6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!batch.messages.is_empty() || !batch.accepted_ack_ids.is_empty()\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/peer_collaboration.rs, src/tool_runtime/window_collaboration.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":"src/tool_runtime/peer_collaboration.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb9289c92ac2913f0ce8fb05b7d14f015c32e6759d5cda70e75297816fa138e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!element_id.starts_with(\u0022element_\u0022) || element_id.len() \u003C= \u0022element_\u0022.len() || element_id.len() \u003E MAX_ELEMENT_ID_BYTES\u0060 appears character-identically in 4 files \u2014 crates/webcodex-computer/src/lib.rs, src/tool_runtime/computer_tools/control.rs, src/tool_runtime/computer_tools/observe.rs, src/tool_runtime/computer_tools/post_observation.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"143b311cfaabd678a592ab9017149a4ee9260b951ec7b61d7defae52a37c8e7a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!id.starts_with(\u0022element_\u0022) || id.len() \u003C= \u0022element_\u0022.len() || id.len() \u003E MAX_ELEMENT_ID_BYTES\u0060 appears character-identically in 2 files \u2014 crates/webcodex-computer/src/lib.rs, src/tool_runtime/computer_tools/accessibility.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec07a6cf8b1b01ad2cb1cb78b0a0a62d1ecec77b6f24ec8bedc06f9cecf8ff08"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!meta.is_dir() || meta.file_type().is_symlink()\u0060 appears character-identically in 4 files \u2014 crates/webcodex-environment/src/service/mod.rs, crates/webcodex-openai-tunnel/src/run_fence.rs, crates/webcodex-openai-tunnel/src/run_transitions.rs, crates/webcodex-runner/src/webcodex_runner/computer_session.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/mod.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb5ddbb02d2b3e80e4a41cbd2918ae3ce4c0a23b1b6214ab9fa1e1468231e46"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!meta.is_dir() || meta.file_type().is_symlink() || meta.uid().to_string() != *expected_identity\u0060 appears character-identically in 2 files \u2014 crates/webcodex-environment/src/service/linux.rs, crates/webcodex-environment/src/service/macos.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/linux.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9c1c5151eafc594474ccee189d760dd63cf47fc606ee825a018eb4c10a1193"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!metadata.is_dir() || metadata.is_symlink()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-environment/src/upgrade.rs, src/upgrade_maintenance_store.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b829f32edb7821ab023c517ad9daa561dfee64ee94c42e7e4c6fb5b1930aeb0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!metadata.is_file() || metadata.len() \u003E DESKTOP_SERVER_ENV_MAX_BYTES\u0060 appears character-identically in 2 files \u2014 apps/desktop/src-tauri/src/state/persistence.rs, apps/desktop/src-tauri/src/state/readiness.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":"apps/desktop/src-tauri/src/state/persistence.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb2bf050021b7150a326ed013ef123f994d494fd1e45bbacc103d3dc0f72914"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!metadata.is_file() || metadata.len() \u003E MAX_BYTES\u0060 appears character-identically in 2 files \u2014 apps/desktop/src-tauri/src/coding_agents.rs, apps/desktop/src-tauri/src/webcodex/settings.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":"apps/desktop/src-tauri/src/coding_agents.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6fee9662500716968af0377f50d9d7a75938443da42588947821efb820232e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!output.status.success() || output.stdout_capped\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs, crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce57e9707964b3f33437d18c6148f6d278857fb48aff65bd9a125998a569a93e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed.username().is_empty() || parsed.password().is_some()\u0060 appears character-identically in 3 files \u2014 crates/webcodex-cli/src/webcodex_cli/connections.rs, crates/webcodex-runner/src/webcodex_runner/transport/websocket_connect.rs, src/oauth_http/clients.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connections.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50b0e4921ef132434a8d3cf07b06f50dd2adaee48bc1f0d3e4bec5434328916"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!protected \u0026\u0026 is_supported_text_input_fingerprint(target)\u0060 appears character-identically in 2 files \u2014 crates/webcodex-computer/src/platform/macos/accessibility.rs, crates/webcodex-computer/src/platform/windows/accessibility.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c722fe53a248f0eea2ba345d56178792c81e6bc673cad31a89f7a8b3f37d2239"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!retryable || Instant::now() \u003E= retry_deadline\u0060 appears character-identically in 3 files \u2014 crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs, crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs, crates/webcodex-runner/src/webcodex_runner/exit_diagnostics.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45e827d4c51cb6590fca853cf2f83a523c464c5381c036a4c8101ac3e48715d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!root.is_empty() \u0026\u0026 !root.contains(\u0027\\0\u0027) \u0026\u0026 Path::new(root).is_absolute()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs, crates/webcodex-runner/src/webcodex_runner/projects/registration.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"163d8716980685adcf966f0bcc388260caf61e1eae9ab1184c0acacd413d3594"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!stdout.is_empty() \u0026\u0026 !stdout.ends_with(\u0027\\n\u0027)\u0060 appears character-identically in 2 files \u2014 src/mcp/cli/text/compact.rs, src/tool_runtime/files/search.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":"src/mcp/cli/text/compact.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e68df73e9d71518a555cccdbdd3d8978945a9823e608985907307a56761caa3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Instant::now() \u003C deadline \u0026\u0026 self.reader_threads_running()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-persistent-shell/src/unix.rs, crates/webcodex-runner/src/webcodex_runner/remote_shell.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b6ce1be7947a348f845b984aca0aa534960e87af332cbe9ffcf69fa90cd9be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060application_id.len() \u003C= MAX_APPLICATION_ID_BYTES \u0026\u0026 webcodex_core::compact::decode::\u003C12\u003E(suffix).is_some()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-computer/src/lib.rs, src/tool_runtime/computer_tools/inputs.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f99a1afcacaf93124f03f00fbb1852319e6f5b3cd86958f1d47cfdb09ea101"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060async_handoff_available \u0026\u0026 timeout \u003E budget.sync_wait_secs\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/process.rs, src/tool_runtime/script.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":"src/tool_runtime/process.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84a0dce9cd908545d74131fab943aaea79207e89426e7479a45e6def6c50be4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060auth.is_oauth_project_subject() || auth.is_project_credential() || auth.is_agent_token()\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/coding_agent.rs, src/tool_runtime/session_context.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"d906a2e1ea2588ccf277617259aa9c81c1e47e128bc2eb9f7eea3b03b1d8866e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060auth.is_oauth_shared_key_subject() || auth.is_shared_key()\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/coding_agent.rs, src/tool_runtime/session_context.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_agent.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14b01f788b36380d4a408153b21a4441fb0e4539cfe61f6c2120334b8d837ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes == 0 \u0026\u0026 error.raw_os_error() == Some(libc::ESRCH)\u0060 appears character-identically in 2 files \u2014 crates/webcodex-process/src/unix.rs, crates/webcodex-runner/src/webcodex_runner/detached_job/platform/macos.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/unix.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"466d54060337b6bb0c5515a09653f3e1a98173e1a07be66f92a8cb9f2db0bac7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes == 0 \u0026\u0026 std::io::Error::last_os_error().raw_os_error() == Some(libc::ESRCH)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src-tauri/src/webcodex/cli.rs, crates/webcodex-lsp/src/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/cli.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"977b152e5c39d03ba08d7ebb1b03b43f0536f353c695d8a85ab83abd6df201bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.len() \u003E= 2 \u0026\u0026 bytes[0].is_ascii_alphabetic() \u0026\u0026 bytes[1] == b\u0027:\u0027\u0060 appears character-identically in 4 files \u2014 crates/webcodex-runner/src/webcodex_runner/artifacts.rs, src/tool_runtime/changes.rs, src/tool_runtime/files/artifacts.rs, src/tool_runtime/lsp_tools.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f065f303ae5688adae526a072fc1e802c45824f810bfd0b375146c02afc9507"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060canonical_bytes \u003E payload_budget \u0026\u0026 sparse_bytes \u003C= payload_budget\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/read_files.rs, src/tool_runtime/search_project_texts.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":"src/tool_runtime/read_files.rs"},"region":{"startLine":2215}}}],"partialFingerprints":{"codehealthFindingId/v1":"145e96464140b845f0724c59e883a0547f99b793fc2a5c59d635648fa97707fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060change.content.is_some() || !change.edits.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/patches.rs, src/tool_runtime/files/mutations/text_edits.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"34129bf6c3943cf20f1f7aea1b2b357b9430ad371e2e1a00634c431a64f09dcd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060change.to_path.is_some() || !change.edits.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/patches.rs, src/tool_runtime/files/mutations/text_edits.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1566d2310fb99cdc2311e813edab10f6675219e7aa60a8197eea71b1eb2edfa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060change.to_path.is_some() || change.content.is_some()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/patches.rs, src/tool_runtime/files/mutations/text_edits.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c5c8512ec8b981b601fc36ca6aba009ff1f7c55627a1589d3b2376fb40ef06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060change.to_path.is_some() || change.content.is_some() || !change.edits.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/patches.rs, src/tool_runtime/files/mutations/text_edits.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbc9ff8be239c486ed4d86ebba4dcd7cb861868d22494fcd24dfe772a099ae2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child_reaped \u0026\u0026 child.wait_tree_exit(Duration::ZERO).unwrap_or(false)\u0060 appears character-identically in 2 files \u2014 crates/webcodex-lsp/src/supervisor.rs, crates/webcodex-runner/src/webcodex_runner/external_tools.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":2516}}}],"partialFingerprints":{"codehealthFindingId/v1":"10390fc42b17248350b4e5095f90be262b68fe50eb12f4eb350a5ecb03b5e194"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060client_id.is_empty() || client_id.len() \u003E 128\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/browser_tools.rs, src/tool_runtime/computer_tools/request.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":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c923412166699593596304ef53d6365c6c2f25eb7cae13d3c7ffdf00dfd1e42"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060client_id.trim().is_empty() || server_url.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs, crates/webcodex-runner/src/webcodex_runner/skill_store.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/store.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d72f3cd69877444ca2d9030eed3b133d95ad110c76b6e54791c8135dbf4453"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060context.runtime_project_id.is_none() || !webcodex_core::workflow_session_contract::is_valid_session_id(session_id)\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs, crates/webcodex-runner/src/webcodex_runner/job_manager/detached.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4667ab4554008c80e183cd6ebbd6eafc1083eb452c261dde70570ecbb5de41e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060context.ssh_resource.is_some() \u0026\u0026 context.workflow_session_id.is_none()\u0060 appears character-identically in 3 files \u2014 crates/webcodex-core/src/runner_operation.rs, crates/webcodex-runner/src/webcodex_runner/job_manager/admission.rs, crates/webcodex-runner/src/webcodex_runner/job_manager/detached.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4b23ac5673ee74a9b24b487ee38a5971575830c8542b5090251b3120a1fc70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060control_disconnected || (stdout_disconnected \u0026\u0026 !progress.stdout_synced) || (stderr_disconnected \u0026\u0026 !progress.stderr_synced)\u0060 appears character-identically in 2 files \u2014 crates/webcodex-persistent-shell/src/unix.rs, crates/webcodex-runner/src/webcodex_runner/remote_shell.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20ceebc9e6d58bcd28cb8fc2ed257266ce4556f61c988721b9cb7ae998c1b6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060digits.len() \u003E 1 \u0026\u0026 digits.starts_with(\u00270\u0027)\u0060 appears character-identically in 4 files \u2014 crates/webcodex-core/src/model_reference.rs, src/tool_runtime/agent_task.rs, src/tool_runtime/communication.rs, src/tool_runtime/project_resolution.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/model_reference.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7d4131c6969822516a1e6a79178473fab97682b32b20e2490d7c3528ed4e84"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060discovery_principal.is_none() \u0026\u0026 !auth.is_admin_caller()\u0060 appears character-identically in 2 files \u2014 src/runtime_console_http/window_collaboration.rs, src/runtime_console_http/window_queries.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":"src/runtime_console_http/window_collaboration.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6433db64a48eaaccbd432213e7a1aac854f83af8c70e27d9350262f679ab493f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060display_id.len() \u003C= MAX_DISPLAY_ID_BYTES \u0026\u0026 webcodex_core::compact::decode::\u003C12\u003E(suffix).is_some()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-computer/src/lib.rs, src/tool_runtime/computer_tools/inputs.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f56a77af5936faf23f04abb73604c89b6e26f7035025309e252e2f3e60aec44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060edit.new_text.is_some() || edit.anchor_text.is_some()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/patches.rs, src/tool_runtime/files/mutations/text_edits.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca962042ad7d69249bd3e70f4289f2fe7577f448c09222bc6e1cde5406f100b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060edit.old_text.is_some() || edit.anchor_text.is_some() || edit.occurrence.is_some() || edit.expected_match_count.is_some()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/patches.rs, src/tool_runtime/files/mutations/text_edits.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"8389263432bca097dfe51b04e56e578f8a8db7de3d436fe67fb8d9302413ed70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060encoded.is_empty() || !encoded.is_ascii()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-workflow-session/src/messages.rs, src/tool_runtime/coding_agent.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/messages.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1551fe969651bf2119e1a3c061014ff40cea9f29749a400b34b243cb38fc5e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060end \u003E 0 \u0026\u0026 !message.is_char_boundary(end)\u0060 appears character-identically in 3 files \u2014 crates/webcodex-code-mode/src/runtime.rs, src/plugin_gateway.rs, src/tool_runtime/code_mode.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-code-mode/src/runtime.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"25263bb2c3cf6f2b975ebfc7cca56a606e65aa5726992c45c45fbe1bd5631ac7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error.message.is_empty() || error.message.len() \u003E 512\u0060 appears character-identically in 2 files \u2014 crates/webcodex-core/src/mcp_gateway.rs, crates/webcodex-core/src/plugin.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/mcp_gateway.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44bbe7a1c1b5b6c6a9cf2032b86996c591963dff851c718f2deac63268cd59e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.kind != \u0022tool_call_finished\u0022 || canonical_finished_ids.contains(event.event_id.as_str())\u0060 appears character-identically in 2 files \u2014 crates/webcodex-validation/src/evidence.rs, crates/webcodex-workflow-session/src/events.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/evidence.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bd5334f2e23d89cc5d673a878bac840c3d210a4059b0be073c10fbcbe11d03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060features.supports(RunnerFeature::AsyncJobs) || features.supports(RunnerFeature::AsyncShellJobs)\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner-registry/src/job_updates/start.rs, src/tool_runtime/shell.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates/start.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ced01a15a84d71c1b2248bd653a3d3dcbc0ae32b0a9ed7d7ee15c91db769e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.page \u0026\u0026 item.after_observation_token.is_none() \u0026\u0026 item.observation_ref.is_none()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-tool-contracts/src/tool_call/input_types.rs, src/tool_runtime/observe_jobs.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_call/input_types.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3eb401c083a7376d2cf82c26d6d8bc8a9b0516b2113aadf9708b5b11d019e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060job.status == \u0022completed\u0022 \u0026\u0026 job.exit_code == Some(0) \u0026\u0026 job.error.is_none()\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/process.rs, src/tool_runtime/shell.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":"src/tool_runtime/process.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cc31f05a069557e7773ef4a65603117f6254496d60a677a48850dc8425b140"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060job.visibility != ShellJobVisibility::Public || !job.lifecycle.is_terminal()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner-registry/src/receipts.rs, crates/webcodex-runner-registry/src/reconciliation.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/receipts.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c48af88516bf8407e7bed09f37a2459173dea6728ea47f5cc492ce9575866bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060job.visibility == ShellJobVisibility::CleanupPending \u0026\u0026 job.lifecycle.is_terminal()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner-registry/src/job_updates.rs, crates/webcodex-runner-registry/src/reconciliation.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b354d35bb447bc66548eb228141ac9a150c8f6e5add29ffed15caff04da023"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060libc::kill(pid, 0) == -1 \u0026\u0026 std::io::Error::last_os_error().raw_os_error() == Some(libc::ESRCH)\u0060 appears character-identically in 2 files \u2014 crates/webcodex-environment/src/tunnel_recovery.rs, src/project_entry_openai_tunnel.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel_recovery.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e0150911b49a2bc00eb83381332328157c575e9301cd0833bf588166770068"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lifecycle == Some(RunnerJobLifecycle::Completed) \u0026\u0026 exit_code == Some(0)\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/jobs.rs, src/tool_runtime/validation.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":"src/tool_runtime/jobs.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3e2fdc7c9572bb159c88b3c46729d47cbc3f15eca0c9e6c0ef35ab0869bdf8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060limit == 0 || limit \u003E MAX_GOAL_LIST_LIMIT\u0060 appears character-identically in 2 files \u2014 crates/webcodex-store/src/goal.rs, src/tool_runtime/goal.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa88d6c28597caddb55c5bc2a50e792bbb77d04575a99d3b6ad8d2468511ecdf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060limit == 0 || limit \u003E crate::MAX_DISPLAYS \u002B 1\u0060 appears character-identically in 2 files \u2014 crates/webcodex-computer/src/platform/macos/display.rs, crates/webcodex-computer/src/platform/windows/display.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/display.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78aef6d1f3083522f51a0279cf5a6252c1bdfcf79eeb79def39889c2ee84699"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.is_empty() || line.starts_with(\u0027#\u0027)\u0060 appears character-identically in 2 files \u2014 crates/webcodex-cli/src/webcodex_cli/env.rs, crates/webcodex-core/src/server_environment.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/env.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3279bec735268ffa12ded3cd387a0907f5ed340d22696b9c9c90b35ad49a4577"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060login \u0026\u0026 explicit_shell != Some(ExecutionShell::Bash)\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/job_manager/local_shell.rs, crates/webcodex-runner/src/webcodex_runner/shell/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":"crates/webcodex-runner/src/webcodex_runner/job_manager/local_shell.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fc980b5460a54417ca5f1cd98222ff5c5ee9b4e5229c5db6dfa4c27b1b4420"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(\u0022offline\u0022) || lower.contains(\u0022not connected\u0022) || lower.contains(\u0022no connected\u0022) || lower.contains(\u0022unknown agent\u0022) || lower.c\u2026\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/process.rs, src/tool_runtime/shell.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":"src/tool_runtime/process.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a3ac72e3bbe91ff339e2e62234afba1805e65ad367f9267916ba1c5c1dc5f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(\u0022token\u0022) || lower.contains(\u0022secret\u0022) || lower.contains(\u0022password\u0022) || lower.contains(\u0022authorization\u0022) || lower.contains(\u0022bear\u2026\u0060 appears character-identically in 2 files \u2014 crates/webcodex-core/src/validation_evidence.rs, crates/webcodex-workflow-session/src/util.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_evidence.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84c8f62f5460fabf33663e631a46e3c58bc399051da16a024612806f0321175"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.file_type().is_symlink() || !metadata.is_dir()\u0060 appears character-identically in 11 files \u2014 crates/webcodex-cli/src/webcodex_cli/connect/process.rs, crates/webcodex-cli/src/webcodex_cli/controller.rs, crates/webcodex-cli/src/webcodex_cli/service.rs, crates/webcodex-computer/src/platform/macos/applications.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/process.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c506179671c9f7aad85d35461cc3e0c756448ee0c9ece5eecec107fbd34461c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.file_type().is_symlink() || !metadata.is_file()\u0060 appears character-identically in 8 files \u2014 crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs, crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs, crates/webcodex-runner/src/webcodex_runner/detached_job/store.rs, crates/webcodex-runner/src/webcodex_runner/exit_diagnostics.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6210fdc4113e1db474247f75198a189355d2d1902d27611487710675b9dee83"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.is_symlink() || !metadata.is_file()\u0060 appears character-identically in 3 files \u2014 crates/webcodex-cli/src/webcodex_cli/connect/disconnect.rs, crates/webcodex-cli/src/webcodex_cli/connect/profile.rs, crates/webcodex-cli/src/webcodex_cli/project.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/disconnect.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc91943ef3401fe4c3ed7d5215c59221a675e1c312748b1738469e75909c0b86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.is_empty() || name.len() \u003E 160 || name.chars().any(char::is_control)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src-tauri/src/tunnel_config.rs, crates/webcodex-environment/src/cloudflare_tunnel.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":"apps/desktop/src-tauri/src/tunnel_config.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6fb18e9499a2f12ce5ac9815da827be5559e9170b7c371afdc08394a5114c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060observation.server_reachable \u0026\u0026 observation.authenticated\u0060 appears character-identically in 2 files \u2014 apps/desktop/src-tauri/src/state/environment.rs, crates/webcodex-environment/src/native.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":"apps/desktop/src-tauri/src/state/environment.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"887253d00036b1595c98b60e630c218817cc29dd0b349eff6ed272255ac0caeb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060observation.stdout_truncated || observation.stderr_truncated\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/structured_execution.rs, src/tool_runtime/validation.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":"src/tool_runtime/structured_execution.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a5970dcb9e9f7a4a5c7d645bb0896d4fd7fb103450c6524f580b71b17c4c91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060option.kind != \u0022select\u0022 \u0026\u0026 option.kind != \u0022boolean\u0022\u0060 appears character-identically in 2 files \u2014 crates/webcodex-core/src/coding_agent.rs, src/tool_runtime/coding_agent.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4617af9b72c593c65791d9d993035bafc8acdcf90827b0e00b0a95e5c48cb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.token.is_some() \u0026\u0026 opts.token_file.is_some()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-admin/src/commands.rs, crates/webcodex-runner-config/src/lib.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-admin/src/commands.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb39d73ca690c317132820b0c8b331d5bac475f36b4927a337777fe8555b8b0b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output[\u0022path\u0022] != path || output[\u0022file_bytes\u0022] != bytes || output[\u0022offset\u0022] != offset || output[\u0022bytes_returned\u0022] != length || output[\u0022next_\u2026\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/docx_document.rs, src/tool_runtime/pdf_document.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/docx_document.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a452f7791d63a9c94f8b18ba1716abe0bc1011c6022ae1bc59c1b00bacb32ddc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output_dirty \u0026\u0026 last_checkpoint.elapsed() \u003E= DETACHED_CHECKPOINT_INTERVAL\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs, crates/webcodex-runner/src/webcodex_runner/detached_job/platform/windows.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/detached_job/platform/unix.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3914dbe99c089f54006d54873aa40ecc34579283079640b066f67da668ce72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.has_root() || path.starts_with(\u0027\\\\\u0027) || windows_drive_prefix\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/artifacts.rs, src/tool_runtime/files/artifacts.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dc9abbc3420a1f9b28f3008eb3674cd7a8e9aa21f53f8c049a6049ef977612"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parent != root \u0026\u0026 !parent.starts_with(root)\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/artifacts.rs, crates/webcodex-runner/src/webcodex_runner/artifacts/upload.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/artifacts.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d71e65b00ed3a79dfa2138390e27b8ee873d508a6f1a077445ed33a2ebd588"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.response_type.is_empty() || parsed.response_type != \u0022code\u0022\u0060 appears character-identically in 2 files \u2014 src/oauth_http/managed_authorize.rs, src/oauth_http/shared_key_bridge.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f8b46a8a19f1fb62256fe0fa71c08a27994b7428298e913174c5f8dd003452"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060principal.is_none() \u0026\u0026 !auth.is_admin_caller()\u0060 appears character-identically in 2 files \u2014 src/runtime_console_http/window_inventory.rs, src/runtime_console_http/window_queries.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":"src/runtime_console_http/window_inventory.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a434952d1c8c651fd804f0b582c71c74f754f8298e7ca320d8cabbbb5cecc49"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060principal_key.is_empty() || principal_key.len() \u003E 128 || ref_index == 0\u0060 appears character-identically in 2 files \u2014 crates/webcodex-store/src/model_reference.rs, crates/webcodex-store/src/project_reference.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/model_reference.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f8fe513973b8c144216fc3130eef03a6cb361796cfe9a1af91ca022b2e86be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060profile.profile_id == profile_id \u0026\u0026 profile.provider != TunnelProvider::Openai\u0060 appears character-identically in 2 files \u2014 crates/webcodex-environment/src/cloudflare_tunnel.rs, crates/webcodex-environment/src/tunnel.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"6782dc1e3831a067c6f7ec203a0f93d78be617e9c575f6407b529b53a29ce4d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060progress.current_step.is_none() \u0026\u0026 progress.failed_step.is_none()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner-registry/src/job_updates.rs, crates/webcodex-runner-registry/src/reconciliation.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceccd9603b4cf79658eacfff9431b91310c9ea6e7cd043e99507499949069450"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060progress.stdout_synced \u0026\u0026 progress.stderr_synced\u0060 appears character-identically in 3 files \u2014 crates/webcodex-persistent-shell/src/unix.rs, crates/webcodex-persistent-shell/src/windows.rs, crates/webcodex-runner/src/webcodex_runner/remote_shell.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"91752cdab0b4d64d2eb2e8a54940b274c1c8c18d7d96b1d732018e32df16db0d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060query.is_empty() || query.chars().count() \u003E 200\u0060 appears character-identically in 2 files \u2014 crates/webcodex-lsp/src/navigation.rs, src/tool_runtime/lsp_tools.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/navigation.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"0840f0f01da7b79644a92c0df96c293ced100882f85047f1d00831c0f6ba5fb9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060record.request.local_runner() \u0026\u0026 record.request.service_scope.is_system()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-environment/src/migration.rs, crates/webcodex-environment/src/native.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ebb5e16ff865dd3b321dcc0f77b1d35eda1ddf9d9c1921182c9373c7e5b459"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.error.is_some() || response.exit_code != Some(0)\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/runner_config.rs, src/tool_runtime/runner_instructions.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":"src/tool_runtime/runner_config.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a923c809c8d3ffa74a3aa8ded4d41871735c608a1ed83694a65e73454a7a098a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.exit_code == Some(0) \u0026\u0026 response.error.is_none()\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/coding_task/observations.rs, src/tool_runtime/files/inspection.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":"src/tool_runtime/coding_task/observations.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e77117940f3d4ed1e559d0b501ddf4b248b7df49e867b946421c176e6225b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.stdout_truncated || result.stderr_truncated\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/project_build/rust.rs, crates/webcodex-runner/src/webcodex_runner/project_format.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build/rust.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc4dbd5441c701e68e7d20c37d2268d7ec21c3e318d1b13ea55d5319b1941f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060root.get(\u0022project\u0022).and_then(Value::as_str).is_none() || root .get(\u0022requested_count\u0022) .and_then(Value::as_u64) .is_none() || root.get(\u0022items\u2026\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/read_files.rs, src/tool_runtime/search_project_texts.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":"src/tool_runtime/read_files.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c73285fb1bda114083bb9563c63c67fa023444dc130c7c2b2844ae013daaad5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runner_id.trim().is_empty() || runner_id.len() \u003E 128 || runner_id.chars().any(char::is_control)\u0060 appears character-identically in 2 files \u2014 src/plugin_gateway.rs, src/ssh_resource_gateway.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":"src/plugin_gateway.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f3bcd5f6c65f75cbfa1d045fe6dfb34e8e7f7112520cc09092105febc37f4d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.project_id.is_empty() || self.project_id.len() \u003E 200 || self.project_id.chars().any(char::is_control)\u0060 appears character-identically in 2 files \u2014 crates/webcodex-core/src/project_build.rs, crates/webcodex-core/src/project_validation.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_build.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ca35110c551c5eeb9ab2a8e9531986aa6a676032a38ab887ca0af472527941"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.request.dependency_resolution_policy.is_none() || self.backend == \u0022rust\u0022\u0060 appears character-identically in 2 files \u2014 crates/webcodex-core/src/project_build.rs, crates/webcodex-core/src/project_validation.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_build.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab944f1d5080a68b4a9ff759f905ceac1a135ac072746bb9beb38c6cf3738c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.shutdown_signal.is_cancelled() || self.operations.current().is_some()\u0060 appears character-identically in 3 files \u2014 apps/desktop/src-tauri/src/state/runner_capability_grant.rs, apps/desktop/src-tauri/src/state/ssh_resources.rs, apps/desktop/src-tauri/src/state/workspace.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":"apps/desktop/src-tauri/src/state/runner_capability_grant.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7031851e2676416b7791ddf8d210f7d7e898d3582f11de70f352ea6f710326d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session_changed_during_snapshot || external_observations_changed_during_snapshot\u0060 appears character-identically in 2 files \u2014 src/tool_runtime/coding_task/closeout.rs, src/tool_runtime/handoff.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":"src/tool_runtime/coding_task/closeout.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"9418f93a41a5e6f4944939c0cd770258051297a149fbafafa2d10c17059cba86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start_line == 0 || end_line \u003C start_line\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/files.rs, src/tool_runtime/files/mutations/text_edits_result.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/files.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5d4fb8c6d314d2e66a83dc83f218bd9374f830dcf96ecf877901b13fd697bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status.ownership != Ownership::Owned || status.running != Some(false)\u0060 appears character-identically in 3 files \u2014 crates/webcodex-environment/src/native.rs, crates/webcodex-environment/src/tunnel.rs, crates/webcodex-environment/src/upgrade.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb05dd18d073e7a5bf1770326bf9cc56608026c842ef621dca0c8ec6f7cb0fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status.ownership != Ownership::Owned || status.running != Some(true)\u0060 appears character-identically in 2 files \u2014 crates/webcodex-environment/src/service/mod.rs, crates/webcodex-environment/src/upgrade.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/mod.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2f1ed5ebe2faf109033b396fc5886f59efd821d58beab17c0916e01d309031"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060std::io::stdin().is_terminal() \u0026\u0026 std::io::stdout().is_terminal()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-cli/src/lib.rs, src/project_entry_client_handoff.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":2753}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba18bf1b0e14cf1d5b6582d60fb4928b9cbfe8925e50a9bcd03041eaf8d8d41"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060step.program != \u0022cargo\u0022 || !(step.is_canonical() || (validation.is_valid() \u0026\u0026 step.is_project_workspace_cargo()))\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner-registry/src/job_updates.rs, crates/webcodex-runner-registry/src/reconciliation.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfb4cb2fb7c61507cfe2778fa40c6a9016ae9044098d7810ee5f4b4d5df4776"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060store.load_environment()?.is_some() || store.load_journal()?.is_some()\u0060 appears character-identically in 2 files \u2014 crates/webcodex-environment/src/migration.rs, crates/webcodex-environment/src/upgrade/windows_package.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/migration.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d74e9fe0b147af0966626001bdb239d25520aa97bc488ad454250583987adc4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060surface_id.is_empty() || surface_id.len() \u003E MAX_SURFACE_ID_BYTES\u0060 appears character-identically in 4 files \u2014 crates/webcodex-computer/src/lib.rs, src/tool_runtime/computer_tools/control.rs, src/tool_runtime/computer_tools/observe.rs, src/tool_runtime/computer_tools/snapshots.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff42bd13015264f9414c311865ceff7155783d46d4450e4d7be04fd4662dfe43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text_bytes == 0 || text_bytes \u003E MAX_INPUT_TEXT_BYTES || text.contains(\u0027\\0\u0027)\u0060 appears character-identically in 2 files \u2014 crates/webcodex-computer/src/lib.rs, src/tool_runtime/computer_tools/inputs.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/lib.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3b1e1cff4789fdcdb68c6402df9ed6ac9b21e5c92c166a730d925a18b15dd8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060timed_out.timed_out() \u0026\u0026 Instant::now() \u003E= deadline\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/coding_agent/protocol.rs, crates/webcodex-runner/src/webcodex_runner/shutdown.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/protocol.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f60beedb3d4dd6565de386c92f3c5e795c08a5671effef5693972a5485522b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060timeout_secs == 0 || timeout_secs \u003E STRUCTURED_EXECUTION_DIRECT_SYNC_TIMEOUT_MAX_SECS\u0060 appears character-identically in 2 files \u2014 crates/webcodex-core/src/runner_operation.rs, crates/webcodex-runner-registry/src/validation.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_operation.rs"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e0971aaa2110b14d61d7dd94a81c561afd215a14215d4a3014fb57042ef3f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060timeout_secs == 0 || timeout_secs \u003E policy.max_timeout_secs\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner/src/webcodex_runner/persistent_shell/local.rs, crates/webcodex-runner/src/webcodex_runner/persistent_shell/ssh.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/persistent_shell/local.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"483d9f7654ba75470c0c58c057207c4b9444c16a7becf95c0cd8b068348d3606"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token.len() \u003E 16_384 || token.trim().is_empty()\u0060 appears character-identically in 2 files \u2014 apps/desktop/src-tauri/src/ssh_resources.rs, apps/desktop/src-tauri/src/workspace.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":"apps/desktop/src-tauri/src/ssh_resources.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ceff896b0be363820d0427146e41bbfff387454ffa49d1aadb9ed90563cd12"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060topology.experience == Experience::Full \u0026\u0026 matches!(topology.server, ServerTopology::Local)\u0060 appears character-identically in 3 files \u2014 apps/desktop/src-tauri/src/state/cloudflare_connections.rs, apps/desktop/src-tauri/src/state/connections.rs, apps/desktop/src-tauri/src/state/desktop_core.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":"apps/desktop/src-tauri/src/state/cloudflare_connections.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1725787af807772f34a95e5c272d573ea4e321bbaa8da5b43649459b0692d1fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.is_empty() || value.chars().count() \u003E max_chars\u0060 appears character-identically in 2 files \u2014 crates/webcodex-store/src/store_primitives.rs, src/tool_runtime/job_query.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/store_primitives.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b38c002ed2b60c5fe7465913e1a1b9b5cc4c7a10e22d7ddd81e86eba241986"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.is_empty() || value.len() \u003E max_bytes\u0060 appears character-identically in 4 files \u2014 crates/webcodex-computer/src/platform/macos/applications.rs, crates/webcodex-core/src/coding_agent.rs, crates/webcodex-core/src/mcp_gateway.rs, crates/webcodex-core/src/plugin.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/applications.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d432cfe83d98aca820b0820735dc2e8e59d22c78c31775bfeff7d0ec7a89b76a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.starts_with(\u0022[output truncated]\\n\u0022) || value.starts_with(\u0022[...]\\n\u0022)\u0060 appears character-identically in 2 files \u2014 crates/webcodex-runner-registry/src/jobs.rs, src/tool_runtime/files/inspection.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/jobs.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"9137a3d3b56bfc22471908bb4db28bee5a7c6feefc0939b912b198df7a85eaa0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022webcodex-agent-continuations\u0022.to_string()).spawn(move||{while let Ok(agent_id)=dispatch_rx.recv(){loop{worker_state.dispatch_one(\u0026agent_id);let mut scheduled=worker_state.scheduled_agents.lock().expect(\u0022Agent continuation schedule mutex poisoned\u0022);let run_again=scheduled.get_mut(\u0026agent_id).is_some_and(|dirty|{let run_again=*dirty;*dirty=false;run_again});if!run_again{scheduled.remove(\u0026agent_id);break;}}}})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent_wake.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"44aef31fe3ceda1f0c459a353a7dcb721f4ce05d7155caecb0fc5a3d43b98812"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060peer_id_from_window_key(\u0026self.key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060peer_id\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/client_window.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0353532f185d39a2338190441937ef55d3d60cf3f680166fc3ba5f0a024cdd50"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ClientWindow::from_opaque(\u0022http-cookie\u0022,\u0026raw)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060api_window\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/client_window.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe937c744fcb8498b45deca095e462505db9bd82431071e16cf05ad032aeffe1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060canonical.get_mut(\u0022properties\u0022).and_then(Value::as_object_mut)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060project_suggested_tool_call_schema_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model_surface.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cabbcbb03c1d4d6fc7042431b7198587f19a0236b3cab71e9c6b9c257caeb0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060properties.remove(\u0022follow_up_kind\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060project_suggested_tool_call_schema_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model_surface.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"110c0bbf093ee3a764e20dd00652c7519f4863531da1e6d97b0865df483e6abb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060properties.remove(\u0022tool\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060project_suggested_tool_call_schema_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model_surface.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f240c584de340608bca806c43d34bb9f5262a52c942480dd6cc55f39cee5e717"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060properties.remove(\u0022arguments\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060project_suggested_tool_call_schema_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model_surface.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51b98006b50368d0fdcd77dc1fa1351d066bfbace14bbe214eded78019f1a89"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema.pointer(\u0022/properties/follow_up_kind/const\u0022).and_then(Value::as_str)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060project_suggested_tool_calls_in_value_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model_surface.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"78250788aff1aad1675303292eb3ac9e3be36d2b230c08a9b8b06016b86ce77e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lists.remove(\u0026project.id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060scan_runtime_home\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime_console_http.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9c11e95d6c3fd9bee6530490a318c0ab5da80fff203c77f8daa4f840d71f46"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060outcome.result\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060tools_call\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime_http.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"e029d48fe968ab59cfedad7fdcf56b01d9e28720962e65637dadc358a2555d4f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060auth\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ssh_resource_gateway.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bd6c4f0ef31ab0f7eb26aa053f09886c38c540870214a7282934296ee90620"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060auth\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_binding\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ssh_resource_gateway.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"55975822ea08df53ed5ecd284656bf711abfd8660ae9cb83b3c044204813f7a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::runner_http::runner_access_from_auth(Some(\u0026auth))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060maintenance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/upgrade_http.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7019dfb72be8e55a74c56f956c13126ea8c8b05c43b9870a7cb1f76ee9169d9c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(\u0026operation)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_browser_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"994518d3a09dfd766fae830505776806742010c0104bdceb8312a13235669523"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060payload.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_browser_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/browser_tools.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"373bf5b64284191840b917c89096b9922f6ee4b9f8028758812bddec2cc98253"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060validation_adapter_for_tool(\u0022cargo_fmt\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060cargo_fmt_with_context_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/cargo.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac87cddb16b086a6f83d9aa0157ccb0c3fa25643a15d73e51009245ff532bdb4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060adapter.build_command(ValidationCommandOptions{check:true,..ValidationCommandOptions::default()})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060cargo_fmt_with_context_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/cargo.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f3d434f924ca54b44fd76d2a6fece008a5b54ebb4b9d627b4f66d4edde4bd4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060adapter.build_command(ValidationCommandOptions{check:false,..ValidationCommandOptions::default()})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060cargo_fmt_with_context_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/cargo.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92e8f9a34c59d783a76a06530ae61c49fe204eebcb3ab3ff7044a7ae4264048"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_cargo_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/cargo_tools.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"626bb7be9c4a9f13e74c2d4a50a72afeccb0ef9f9fb7e1edc59efcb54047e2ff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(\u0026raw[..error.valid_up_to()])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060frozen_changes_file_content\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/changes.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97cad8378b743e272d0facd3f5892abfc769c1c163930b97a4674704f781ec5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(self)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060to_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/closeout_evidence.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2accd5854fa88aa48886d38836ddf0abd87af8b82cbfe44e4ad00a9659932db9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060projected.as_object()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060install_closeout_decision\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/closeout_projection.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a67ab191797a32b7e040938035029f49d89eb21f5145e69d9d37c8ea6b80eb7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060phase_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"570d342e4a74e4fac93e9d5da6bd529b26605ca4efafe07bb08462b2d3003297"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022required\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060phase_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"2558447640789fe4464f7007a7489f5ed4b66f0c63b295d74fa5137b84a2b308"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060field.as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060phase_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca07f6e740646f633c73f3d174c5ec4ff36d9d49b05d3ef5985b6e90226119ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022required\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060phase_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"36355f4b578b9ddbe5bbbbb9850f5919eb5b97b39f74e613077ed8e7b8310941"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d719eb542c900658a1f6c81b0f0f2dc7d8f27be2abbf313e3b79d427205015"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7c04f5a561b5e5aaade75daa1d0bdbb8440fa04416b749f84dc7777346fa40"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value.as_object_mut().unwrap().remove(kind)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b77f21c53aa7a7521b2d3d677020a25f8f43c43458398547331eab6bea6967"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060communication_request(\u0026value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060execute_communication_before\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ad070c8858afaf0f169c7833f7e7feb88636356220edd926c980e68ed7c934"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060request(kind,value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060after\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4c76c3e49b546c0e3db78aac3fdaeee1bcd79c5a4ce15a53c8918405d78230"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060communication_request(\u0026value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060after\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c865d4bd7c0fd78ee89a43ddf180fe092b1a1ab75be85641c648a214d1811d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060outcome.result.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060decorate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/control_sidecar.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"30909fb3e28f80911218184abfa4c58d1086b99ba189ac4f9b3fb963b5cd86a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060project_observation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/external_observations.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da62ebffc2eb5a2dff964015e11bbdefeb7f2d32a1213b0bddcebba808b836e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060query\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_file_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/file_tools.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3e05c55a2b4837da56c1056c052f0c0a188359c44c6f5bab1351e6f8d9e101"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026source.presentation_value())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060review_snapshot_id\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git_review_snapshot.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"785a430a8dfb4660d0e622277a1b53640220e941226165c9405f0d4f24a3b8d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(projection_identity)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060review_snapshot_id\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git_review_snapshot.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ce4b6e0e767d5a1c1037f6ed52841d609a8f9a0cfee8b24685c459a2f4effc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.sessions.session_project(\u0026session_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060session_handoff_observation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/handoff.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c48c8af7ddda1fe51506b485adffb5edd8e69a775621fe12cae2af3597895d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060session_handoff_observation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/handoff.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2663d94630bf35e014e1927f0962f270f3921bcdce2b91db7f8e9e18c1960c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060compact.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060session_handoff_observation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/handoff.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1a704cbbd1afdb087d89ffbdd872b58088f0019789f9a61e7a6e44ecb7ea80"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060compact.as_object()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060session_handoff_observation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/handoff.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"b914f6e9bb78068f1e14486ab55b807e0abf1307b9f358982a1c80ec227d5607"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060session_handoff_observation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/handoff.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd14f1262bb304303b2a22850374e0c75fb2d50ed0f9505c694a1cf5b79dcb4f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060diagnostics.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060bounded_failure_diagnostics\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/job_attention.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c35449eb1e06ebd3d18d2afec2da0caf9bc14b79944494ae0ee39705023929c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060diagnostics[field].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060bounded_failure_diagnostics\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/job_attention.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"33698e39c90f07598c757afa57ee8d20e47daa85f818fb3f4a5f79a7a74dfe06"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060diagnostics[\u0022diagnostics\u0022].as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bounded_failure_diagnostics\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/job_attention.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf34800ff5f4310cc9b3074b4d520bd1a5e8a19828d6fdfcaf78b95bb0392ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060diagnostics[\u0022diagnostics\u0022].as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bounded_failure_diagnostics\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/job_attention.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a55969097f0a3ad4ebd0968e79376764e513cfe97c0588e4f8401813751220"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060diagnostics[field].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bounded_failure_diagnostics\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/job_attention.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9611574e4d233dd18707b6089a064035fef3a926c52521196a4d61ef938482a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060passive_job_attention_item\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/job_attention.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e713ff76bbdfb80288ba023a1b75c7f3ff35805ab340f4033c97aa9cb2fa9c9e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060facts.job_id()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sparsify_job_handoff_model_result\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/jobs.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b859d3eba5842b1d64e74e1a114e57a21de8c91f27b14773954ffd7514c7900"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060snapshot.memories.iter().map(|memory|memory.created_at_unix_ms).min()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060memory_scope_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/memory.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cab2086f8c12a64ba587e19b3eec95aa455c4c920d284a6e45750cc0711992e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060snapshot.memories.iter().map(|memory|memory.updated_at_unix_ms).max()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060memory_scope_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/memory.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e50f2508493f1197a74fc4f12d0cec9a91783f1e27689718647364c3170960"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022items\u0022].as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060refresh_batch_counts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f8892a24129cbeaba54e50309bdbffc19ce434845b8369402188edb243c093"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022items\u0022].as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_output_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0ad0efda208794a93d824d0e4bca076ca820ea9ecfef594a5381741ea28c1d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022items\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_output_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c821d18e6b72540ac4ebe76fe852d68785b07b36b581deca973aa26bc7fa92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022items\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_output_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6955b23f1214e15a7174975386a40418a66f7d49301cbf2fdae45b7f1a68a3e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022items\u0022].as_array_mut().expect(\u0022canonical batch\u0022).pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_output_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2120c6c72800974a7b8bb5b875894a82540d6d71ab4185802278b64f916a61"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022items\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_output_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"6245c6039258989a91d16c0a60d851f19ef3fbb6a7770eeb82a93aefa84e82d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022items\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_output_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d95ca05d5f31e7222aaa5fbe413b328b172eda5d569a0d0a11e5a6011de4d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022items\u0022].as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_output_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"8082cbf7a4d4b779f3e97c0e74d05dcb3e24d175b074687bd683e5aecf74cc56"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060wait_secs\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060observe_jobs_for_auth\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/observe_jobs.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad4da484cb3c5aa5516c121c6c3daf486395f59f816cdab85d197eced061838"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026character.to_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060bounded_json_string\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/projection_text.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2b991fbc4c75a9338599b556b4d9b900a7bc291cdc12477fb9eca696cb0479"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026authority)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_cache.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c74eec1f8fa687ad987810acb7730c1e354e47d42237acac41ca91bd8ea86b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060flight.downgrade()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060flight\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_cache.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4486c12ca9a24da8e9a8b7b7cf84a99d5aff4fd1974448c515fb3321732f0d92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022items\u0022].as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sync_truncated_batch_counts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cb9721ea1a81f498ac40a8e436659fb7bb8b2ca34b6439bf2b00dc28b67d42"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022items\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fit_truncated_batch_to_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded757ceadad1a6dd4d679cd20b424ec812bd443216e4209b6c8b73e45292ee2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022items\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fit_truncated_batch_to_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"90398b948cc39f9fd8f79b8e3e634a94b478c97cd802cd641b13d1c09678108b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022items\u0022].as_array_mut().expect(\u0022validated canonical batch\u0022).pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fit_truncated_batch_to_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"95dabb5d5f5dde4ca4d4c7c5496ab71fa92b46eab9b4e1a31328d9036427a5b5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022items\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fit_truncated_batch_to_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3afacf9202a26551de6d0c34455419933e98f852840cd981cb59e2d23a6d607"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060complete[\u0022items\u0022].as_array_mut().map(std::mem::take)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_output_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7db45ab9b5394373f1ed86e20d8a902aa0859ceec7b4d3d88b08ad25676a72"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root[\u0022items\u0022].as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060enforce_final_model_facing_hard_cap\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"71929c3ff9fd5d1b209af3ae7d511b1e36cfdfdfa0a7930ae48d3c02ca7dd3b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.output[\u0022items\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060enforce_final_model_facing_hard_cap\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0cd23db6511b7c73cc0a8a0d08f34179c220de5a15f1a08ae1e74ee93e43f9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.output[\u0022items\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060enforce_final_model_facing_hard_cap\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce61796e5f76aec109a21a0af23086dc87d523be757350dd7efa78dd604cc90"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.output[\u0022items\u0022].as_array_mut().expect(\u0022validated read batch\u0022).pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060enforce_final_model_facing_hard_cap\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4e71f20797b58458bc06ae3e3ffed28fe0ae5c3c9da510f34e2a3a62bf0a41"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.output[\u0022items\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060enforce_final_model_facing_hard_cap\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68e210aadf1fdf42a4a8afc233f9bf63c2892232c03644116d4a957a3caba11"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060members.iter().map(|member|member.index).min()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060read_files_planned_resolved\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/read_files.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b497cb7240ff92ee842227806dc1db1b24a318ceea65606eed77351a3430ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_text_edits_model_projection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/result_projection.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"a997573c5531f555b039aadce2ba27d3c10b5711903fee1fbc25b5ff7bb0cfbe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sparsify_search_success_for_model\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/result_projection.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0f9e405adf87282d87e164d2f5d3d1b1219e6ca402f864fa006f937e1a5649"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sparsify_complete_read_success\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/result_projection.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebfa6f4c429cc5c9aa90d220300ec08fd1a31faeca8e2551e41340deaf2c221"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060projection.as_object()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060review_next_call\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/review_changes.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2545ed7966ea774f70b468012b8f23a93e15fdd00b1464aa6d3fd8ea311e9f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060expected_generation\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_runner_config_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runner_config.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb0b069982ef85d61a912a04ff6f8b66c169e318d3345f6644107d737be0622"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060snapshot.scan.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060load_effective_coding_instructions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runner_instructions.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9debfc36983cc11f26b6764d1d99318568993be0b3a63bcc521afe512dcf85"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060snapshot.scan.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060load_effective_session_instructions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/runner_instructions.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b5861ebcf8357ecf6238bc6654bf7907c8f48228084de9dc592449be4172de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060complete[\u0022items\u0022].as_array_mut().map(std::mem::take)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_output_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/search_project_texts.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e03ab7c2c45131a4149f67912c20346d7e095afc6be435abc76cbc7ef0c06d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_output_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/search_project_texts.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c2fd4c1dc4f51082465d0b154afba91476409c7bc88ba9c86b1537393ddafa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022remaining_summaries\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060attach_bounded_remaining_summaries\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/search_project_texts.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0962369253a37b3e5f4f9111b2dfb850207bb15c0f092191c29a750dea0c79"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022remaining_summaries\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060attach_bounded_remaining_summaries\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/search_project_texts.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f17e7411b4530446c5fb9f770461a076ec022409811d27a403cf62955babe4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060attach_bounded_remaining_summaries\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/search_project_texts.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"63090fc504a13ec258e1f1b79c657d362c99a063ba2793a2cd40e85434b2c854"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(query)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060search_query_argument_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/search_project_texts.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"9279e292eb5f55667808bc28d72e3450a47d8ea086caec254125be1fe73fbbad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060call.session_id()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_session_shell_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_shell.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e380778cd3f37caa9a5f5c04c112bbf7f761e8ed58681edd5a6241c31513c78"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(item)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060list_sessions_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_tools.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cf6d8de47a10dd0322f12647ca6ba32be01e4a5a2f83e88fdfd320293429bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060list_sessions_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_tools.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca669fc78b49d4e5538d3f886f3b8f80f0ff71264cb3d3c01c1debbefcd4578"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022sessions\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060list_sessions_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/session_tools.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"d051ae0f1f84602461f9906ade1d4fa27e68d0b7fd680a09d439058f22eb1181"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(SuggestedToolCall::mechanically_followable(\u0022read_skill_file\u0022,arguments,))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060append_skill_read_continuation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/skills.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"004ee3bee3e8de4dfa1cde2f41d87b78a4a30ed4e2899ccc3061c0d9c1aa59f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(\u0026descriptor)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060skill_load\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/skills.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adec969dac3ab2f63b7dc643d226fddcfb7d5d8ea33140c857a595755e98cdd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060skill_error_dynamic\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/skills.rs"},"region":{"startLine":2467}}}],"partialFingerprints":{"codehealthFindingId/v1":"903c15a5df51143424df98f1c219dcc2a334102f56493ae695b6e0b08c1dfdac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serialized_json_len(\u0026projection)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060code_mode_callable_contract\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/surface.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"df57e6151dee34528da3fd3d808eb0083d94f121a851ba4d43540587d6d91802"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060outcome.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060attach_task_outputs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/task_outputs.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"08528343bd70bb35619c04b8c9cbc79101c767ec90fa5980e63d4286f8a96cb8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060query.since_ms\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060read_tool_trace_diagnostic\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/trace_diagnostics.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7f7b5a17ef845be8b6d79b3d80aceab9927f0b3de20e5c944593dcab5da440"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060query.until_ms\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060read_tool_trace_diagnostic\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/trace_diagnostics.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e4279c7077697fd8f03499265a5a4f40b2aabf83b84358351658b06185eb44"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sparsify_structured_validation_success_evidence\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/validation_success_projection.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1a5fad320430f84decb0e5f095eab2ccb9f798fc225baff87c76c6ee0e14e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060scope_fields\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060window_collaboration_page_for_scopes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/window_collaboration.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2cfb0fb7de995cc17bef5f69791104ddba950d4e06000cfd2472b165b4b26d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(\u0026input)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060submit_workbench_work\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/workbench_execution.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c3c1c79a09c497538c3c2ac9a9ba95bde612eb71de9de4e41d1cd6d911f353"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060intent.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060submit_workbench_work\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/workbench_execution.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0e901e4753b66a73d3205e9b2a05ce55aa70915a6611b88d4579fd8c5de835"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026intent)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060submit_workbench_work\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/workbench_execution.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1ba575dd137d86ba0bcaa101c7e4fa491f5c6dc924edf928992893b349befe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input.execution.endpoint_id\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060submit_workbench_work\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/workbench_execution.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"25efc94600111f66adf076e41f7c501e97f06c44dc933ea0d453149e55b338ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input.execution.expected_controller_generation\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060submit_workbench_work\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/workbench_execution.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd360201168e6a2b70136ef5b5baa8ee6b9bc2dfc4d0c19d763700cddb87cbcc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026row)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_workspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/projects/maintenance.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e46b5e257f3c679ae2edea482d39eb243ccfe28687ab9c1efc03484b14dea73"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::admin_project_lifecycle::parse_runtime_project(\u0026item.project)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060preview_unregister_project\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/projects/maintenance.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4f99728ea3ace55a49d5de0c851d9fce5c1ca2bbd7335a4424863e70714e55"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060runtime.sessions.session_project(recorder_session_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060prepare\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/kernel/recording.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"73abde77cdd6d8d8cf24bae4e040e3e41746c9f84710d0a5eceb305ccbc3b8aa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060runtime.sessions.session_project(recorder_session_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060prepare\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/kernel/recording.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5848fb7bd9264f3ccedf9945dd8659acf10bf41283cb36c65c9990d02404bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060runtime.sessions.session_project(target_session_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060prepare\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/kernel/recording.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8359795b6e2b921511e560175cd647ab5329bbc69ff349d8ad44217985659e8c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060outer_ack_observation.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060prepare\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/kernel/recording.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a0c21d4df12a80a2e010a34ea98ef26902205892b1af723c84bcad1d5ccb3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060outer_ack_observation.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060prepare\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/kernel/recording.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"8435ca74b768add35c8074cfbce3c4391cb36add9d4adba2b43f8772939171ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ack.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/kernel/recording.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d15e1a46a7d7568bac1e2ba5869e71c905bb2d2fc03a5fb73c97114db660337"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.entry(\u0022hunks\u0022.to_string()).or_insert_with(||json!([])).as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish_hunk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb414a546ebf779e2156aabe0ab14cd0eef546c687085864ce766d84fb7f5769"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060status\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060git_diff_page_for_source\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da47ddead0ca36d4e29f2fec850805629c37b6dd62d2a7b2da3134c3e68c024"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fragment_line_position\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060git_diff_page_for_source\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/diff_hunks.rs"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b272f36c61cdbfd71ecb27c4867f67b6bc2744c327cb77f6e0da0843e2845fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060marker.new_head\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060git_commit_paths\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/mutations.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"315ad5db0950f0aedf5850b11876aa4922eb61a854867fc866c127aa1432d2e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060marker.new_head\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060git_commit_paths\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/mutations.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc6d78fc80fa7f3a14fa5d966ae98d40262b8f53625f9481d5b44588c1c1374"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060status\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060workspace_review_metadata\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/git/show_changes.rs"},"region":{"startLine":2614}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35980e3386acd91296d325df330e80f75846e2dd2bc3e017e0f0173c5c910c1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ooxml_extension_for_mime(mime)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate_artifact_mime_for_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/artifacts.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a95157637e1bce7b4907d4041e4f1bc5fe9647c8051bc93678bc2966def1cd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026page_request)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060list_project_files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/inspection.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"17135b909cdd9a63d15099501f58929ffde518fa813cf5f3a54a80db3049a15e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060project_text_search_rg_options(options.result_mode.as_str(),options.context_before,options.context_after,\u0026options.include_globs,\u0026options.exclude_globs,shell_escape_simple,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ripgrep_search_command\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/search.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d16a2bc5a612d502d8e4b51a48cb056381ee9437ec4572f27cbf1f1c408d49e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060provider_code\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060external_provider_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/search.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5055c02960e0358ed6161b6a4b1c506b50b1555898fd61d9d1b8c573ee1465e3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060structured_edit_outcome_unknown_result\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/lifecycle.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d1ed2473f592eed7a0a5c4f01d49d3c0362906b2117536ca4ea76cd9d9cfd9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parsed.hunks.first().map(|hunk|hunk.path().to_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_patch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/patch.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"195b07754fcfd131d3bb56124947b921fe8091c9fb54b093fe2540e255e99269"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060changes.first().map(|change|change.path.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_text_edits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/text_edits.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f8d2e8a9d72a0e2ef482f571e5978a199f8b043a9b9709004595027bc94cfb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.output.get_mut(\u0022files\u0022).and_then(Value::as_array_mut)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_text_edits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/text_edits.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c61e2e2039c3c6cf009fbce5475fe03b7404023f7a86900963f7a370c4173f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060change.to_path.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_text_edits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/text_edits.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e0377d064a7e1c60cbd935945d7a0c6abca0de244b781adc9237f972ccc2c5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060new_sha256\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_text_edits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/text_edits.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b68847179ee03a90950c2a978c94242dfe334a3ddedecfe8cefaa10b7c2689"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_text_edits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/files/mutations/text_edits.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"2062d1ca56daac0361ccc42f5b2ec18b4d60ac1450b9749475a64eae4b5ee3ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ToolCall::from_tool_name(\u0022run_shell\u0022,arguments)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060govern_dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/dispatch/governance.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ed6e6945b2aec149c5dd6dfd587cab003e6b1bee1222a19fa75f4fa8907ba9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.project\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060project\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/context_projection/registry.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e9c72b1e7d88861fcc5ae20f743b9e87b07526d110e3a80ad7332a773f739e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.workflow\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060for_instruction_projection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/context_projection/registry.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc5d835ef48f4d1ca5c15917c9e2e55438279026c3684ca6f03081102215d48"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(payload)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_control_action\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/control.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7beb1db98022613ab47e4dfe2d9a71a1a131686d1df688fb8d2753355f7d5a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060computer_suggested_recovery\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/effects.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69d926667c6d4813898d0b92302b989426f1a645a9ec46bd35d267a87bf5b16"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arguments.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060computer_observe_suggested_recovery\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/effects.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b67c7a021665499029fe03b43eb6297b8785841661383e3eda35bd7ab93fc5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060computer_reconcile_recovery\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/effects.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c3a9c9cc69dded0b96c3fbd9bcd2a9dd964630ecde18bb069bd34018cd1a40"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060computer_error_with_client\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/effects.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b1642745b5c3febccfcfc68a4d5c1683a21e81cddf4db72afa520288e2151e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060computer_pointer_effect_not_started\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/effects.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ce5809e6c8c2748e766a4a078a0079e2efbd7a2c42309bd9c02f0d14442dc3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate_computer_pointer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/input_receipts.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4fdee6f9081adb909757526a3aac9b6462ea2d66aff7a10e2d854c77a4a29c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(observed)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_control\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/post_observation.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"10738a69bfb5b8de04735000f9d45b31a4045c7baa565da3c36729a63b361893"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pointer_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b15734f32887a2d2c8635a50e02c180c5b76f479915a449f902e719d412f7c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clipboard_write_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43a1240d50e7f618608d2cbf49db0834d491d9d47e11f1728623fc803d0da80"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pointer_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7445b296c794dedc767043d8ecdb2b2b15d0e2e3d81a3407aaa4fc539820c2f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clipboard_write_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2771eaa051faadf936f781e1a8eae1b41eeffb09d74fc873554735a77993e3c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pointer_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a39d9dc55768933cace6506a96a8e18bee7d982c440961a595498cc608be5a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clipboard_write_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"752d4b356535b28d4382df0bd49674c6f4bc797c25625b3be311ddf75c1ccb46"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pointer_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1d71e6122d497cbcad6126f441f9218266c6e960ff23eeecf88965fd9cf3eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clipboard_write_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fcaace2cdf5899db13ace56d0c9b283a17a04648fc02f87877718100027dbc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pointer_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d176692597bc6b8028940051cd72ee1448a5168a82513b22c7a1b1566c96210"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clipboard_write_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"0052d8e9825743cba4955bb5946850431871589c780c7e75ef475f380cbd2d55"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pointer_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"27af740b995bf234b62be845c7257e59a7b1e92ccd19fe26a74fe6b9bcadc87e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clipboard_write_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d1a8c30d45b130113d553000eefff67d9022237ee8939ee3d9fad566d7895c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pointer_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90a15238fef9cc5d75ed3848dac167eaded666cd5f7f4d7b97c8c332ca57099"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clipboard_write_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a901606a9f37b329de2ae72c5f6b5d3bb75fe0191f26694929dc9b9545bb4c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pointer_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"0107ef0e1e36853e1df897b8c1cd0ea93001d62cc94977b5bbc86e083514bb4e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clipboard_write_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_computer_request_for_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/request.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"97135bfcde5de748f52fe4786468d853f4a6452704da4209efc81147c7ff195a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clipboard_write_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate_computer_response\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/responses.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"509e5c9aa61b39ec3203a8024973e0e91b324d9662eb757edf542278cb6119b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pointer_context.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate_computer_response\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/responses.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"086ccfc14d98a93a8ff63fd351ed852c4ab01f514e42316b468a2df9a27e55f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060scroll_input.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate_computer_response\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/responses.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ff56d979b1a7b28edef9c597f86380b8fb3a82509efdbdff282264a42ea84e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate_display_snapshot\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/computer_tools/snapshot_receipts.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4aab2695d3fb925f1faefc107cc0b0b1bcd861519a9aea6d156261aa8fb897"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022final_warnings\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish_coding_task\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_task/closeout.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bfbbcabaf566bb542376effe3b43fdfda20d0109986482aeca8688f007fa90"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060decision.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish_decision_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_task/closeout.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"610095b7fa349bd0a161bd1de5227e45f463d3e7be52e0831c6b50c04a0aeeb4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060decision.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compact_finish_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_task/closeout.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e89688f1c807b973ac2ac7e27a54535fb7a4e2580a93f94619b7561fa9b6ce0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.sessions.session_project(session_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060explicit_coding_session_project\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_task/project.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9847587e890764a223f0da59eecbb89c760a24c7655b473615b5620cb8133448"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060resume_session_id.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start_coding_workflow\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_runtime/coding_task/startup.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"624f1895f1c89f35f8f64f8d189941ec3689c2ab5ab243201c8a6415ccde5af4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(text_prefix)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060copy\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_request_trace/diagnostics.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fdab28e5ffd3694f9f8df64d52284936efa8b5574c0fd0e766fdc110a47ecd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HeaderValue::from_str(\u0026authorize_session_cookie_header(\u0026session_id,secure))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060oauth_authorize_login\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fc98e2af341144f32644306b41a05075d1dd96f4a1263c2c8ebf3f5d2f003a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HeaderValue::from_str(\u0026return_to_owned)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060oauth_authorize_login\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f262cb7f4fdfc5607a351ae991cb0e2822c96774311d764e56fd1b6943c7a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HeaderValue::from_str(\u0026authorize_session_clear_cookie_header(secure))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060oauth_authorize_consent\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfe1f803ec0f6f5b6b765c50332ff0d99565c4a705bf27a0b4dd03ae25a75b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.user_id.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060oauth_authorize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1e061a6675fe7dd7ca1fdc3dc62a70769b833718cf47fd0f8f718bf398cd84"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060form.client_id.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060oauth_revoke\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oauth_http/revoke.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c116c4a37fa8b0201c322896677836c0acac777896c13af3c030958382e5076"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tool[\u0022name\u0022].as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tools_list_with_exposure\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94972c3c2f269afaada3d0c7ef89d4a9ddfcdcca6d448f61c7680cee34a3d46"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tool[\u0022name\u0022].as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tools_list_with_exposure\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2415227c4f5006f399d59fc4acbf8316c7e7bb3b743d1f7333cd0df188b0d1e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tool.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tools_list_with_exposure\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a420c50ec6ceaae1f1ccb71c7887cea6d997e75f09f02199769493f1622ab0f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060retain_properties\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1b77aacc58e2537795dc7180b0fb4df3fe8de7dcc8e9380730c13af2da7fba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060project_direct_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cac4323ae35c1028658d718914e48800a46f42ef111adc6041d645109e8d990"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060change[\u0022allOf\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060project_direct_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69186e57dc8f26080f3acbf07df49447d53d9dedd8ba9936a0e686fd46cc0bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060edit.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060project_direct_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6943861cfa5ea1e53e90b4e4da6ae18d38f47ff87c2f14183a8f0b90d2dbc9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060project_direct_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6157060498a21b17b668cb406fdbaa0021ca635c5099ac1e18df4414168b6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item[\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060project_direct_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59dba7471949f04524383dcd3a25a0c2c2235a49fad6377d402b60c0f6f5532"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060webcodex_tool_contracts::lookup_tool_definition(\u0022work_on_project\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060bootstrap_description\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/discovery.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a910f50bc50d2a09aed649cf616c9b0391b4fd67fc776d2b9a7f64d7758d402"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060webcodex_tool_contracts::lookup_tool_definition(\u0022work_on_project\u0022).expect(\u0022registered bootstrap\u0022).model_spec\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060bootstrap_description\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/discovery.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e288e7e2c239cb27db77228094f8c81840694ffb91a0c22cf4cb460c9736c0f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026result.output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle_read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/resources.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a19c8031679a2c40442e5eba2dfe13016bdc6bd2baffe73b8faa4ee9c174f10"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060context.artifact_export_caller\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060adapt_tool_result\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/resources.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6caac97ff3c1f8a17089c0de2cf82635a513c2feb265f6a061a6eb880d5002"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tool_registry::work_result_app_tool_descriptors().into_iter().find(|spec|spec.name==\u0022get_work_result_state\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060work_result_thread_entrypoint_tool_json\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"817291e702912dad703bde240f608251117214a8c62e668633326c3762160825"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060definition.model_spec\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060mcp_tools_list_payload_with_exposure\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ba7a4135af212b94970835d5d2b0e58cd3f34ed8a95bf24c2e3dfdc6038e05"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060definition.model_spec\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060mcp_tools_list_payload_with_exposure\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc2b1364920569120951987f176b72846787660e8225eff1841af88508db65d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema.pointer_mut(\u0022/properties/output/properties\u0022).and_then(Value::as_object_mut)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060adapt_native_image_output_schema_for_mcp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c7490c09efe76ba72726d65df939568d78ed872736e6b1662ae7bec5bd0f24"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060outcome.result\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call/response.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fa17747431bfd02c81b22e4151b24917c0a46cecfbdd9a352145df7b986c1f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060finish\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools/call/response.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f7d97ea122cc2cb404275f255a105ad97692d74df15cad591b7819de2c046f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tool.as_object()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_manifest\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd966f421c7153f332631b5abb24b418bb57efaf3478e3fea858d581e1ffafe8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_search_batch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d48cc75daaf18e2f30f1f137126731fc64371a9c7aa1d65aa021c0b5f171d4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060line[\u0022text\u0022].as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_search_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac5fdb7a0a125fdb46cdccef25abb40394b37ad7860929b842fb9ad94522923"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060matched.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_search_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"023016200bb23d57eb44cceca94abc1ce253c7add9489056e84e314ff70ebf38"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_search\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc1bd81873ebc4291165f3d5000de8cc510098da4740f92e2f7f36acc69a1eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut().unwrap().remove(\u0022files\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_search\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"107304f9e4acc093827b7f2640a6e9a7242a3763f2ece2124443564ba0938aa0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060files.as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_search\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7a041380f84c1f80869d3d597a90e5b2e5036a02bc8dab10fa3aecbc942360"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.as_object()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_search\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f867705fedcf90efcfff0da916bee9d8b5b4ad5b3666afafd4beb371c176fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields.remove(\u0022path\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_search\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec93c9c6f93f9bfca1ce932b247e6638d6c42523cd1fe6dc279832ee8dcfebb1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_search\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85150fc9f0b926c5da1bab5fed049afa1980bd55154052b99d6acbbec1edf80"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,\u0022locations\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060locations\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7075f9cb67f34bb9ca1cd9f95651f6a991a3e64ac1dc2a90bb9f9313e64ecef0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,\u0022locations\u0022).unwrap().as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060locations\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7ee34f71abcd788b938250f8566fdb1f18dbcd4af8f4d4eb51ad463d18c089"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060range(\u0026item[\u0022range\u0022])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060locations\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f03c625d12351d5caa47e7916fc5afa98dc4cbaec15c8eec097e80d65a178c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,\u0022symbols\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060symbols\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9fd0e0e950d7c6476ee56329e3a1e8d9e0bd138d15e67e319e8734d7729fd5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,\u0022symbols\u0022).unwrap().as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060symbols\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd58a5f89dea4d806b7a97466d252c23da09b3cdf31fe1c901d2701abbcef1d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,\u0022symbols\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060workspace_symbols\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0787f97956d05e567715d81a814f7f827eeaafc7bce626d57908f038feefb4ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,\u0022symbols\u0022).unwrap().as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060workspace_symbols\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba75e9b5922b0e7dfb0fe3b485288517373203d80896791a1768e96ca71fa313"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,\u0022entries\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d9d30e480f762695b77b8f2285059508f7cf9e1b5cca72d3654c92aa338e9e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,\u0022entries\u0022).unwrap().as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"82412a4a3c199a4b02b169b354d84e0f1bca433afa23680ea4dbb67e6f20ad49"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry[\u0022path\u0022].as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffe7407f9209bbb67dac701701bb4bce6ff7481808c68a999df5190fb06f8d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output[\u0022stdout_tail\u0022].as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060execution\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fe85533cd0489f6dc375c4eee9950acd5740e94f52e0327ab447980fe45cc2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060wait[\u0022outcome\u0022].as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060jobs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c88f705d8c53ee6315698e98ee541308158ec560a92097d695b1bc7287313f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,\u0022items\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060jobs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"463772386f2da7bcfb6c308c74bf68665951bc305e2644389fceeac01f1e2bd7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,\u0022items\u0022).unwrap().as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060jobs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdbd0d530bc77a0c7510d231ae725fee1067e050768cfcc9740ad014aaba962"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,\u0022ready\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060jobs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8062746c3fd4b3653493161037196d2736d9d1bc2fb94b5282a1b19286bfd5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,\u0022ready\u0022).unwrap().as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060jobs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76225f27a749715a1a04d833eb35af2ad31adbbcf164e7cdf6b0544694c0b08"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,\u0022pending_job_ids\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060jobs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b2a7fa26074ded3fe6bdd89038fbdedf22a912aed1e4de0e13bed3fcc1777e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ids.as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060jobs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df9c1de1a1363f8260df80b3ad40de7258a81f68b032fb52132502828a0d01b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,collection)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060inventory\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"1450df7d3d7167c92e6960a1a8ef5761dfc5fc556a47fc838b0359210b543a3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut output,collection).unwrap().as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060inventory\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cli/text/compact.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"93822fa506cd76aa170a8c5201b584ccdf8e499cbbd0cd3b54285a23a14fb57c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060grant_id\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_env\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/project_credential.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c63b426e26e0a5fd3a637aac8f42742ab0cb4d1617ed1630df30f65a98bc5f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060runner_client_id\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_env\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/project_credential.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40790278782fd5205e20ec60fddf158317bc44d024b2e5482233e6dc8afea66"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060credential_file\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_env\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/project_credential.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f53c55cd5cc9832a2b5820dcb7c8c39d434f4e0b1b7cb0f2923a4227821fe5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060agent_token_file\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_env\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/project_credential.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa913a6f7fd64641de811c92ddb3972325b40be6fd6ac82aed0d0831368b0466"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060package_names\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060project_cargo_all_packages_provenance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workspace/src/project_recipe.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb009009d0ed1e306d3af66231121f7aa711df573d95cd7766074b005c685be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026semantic)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060hash_semantic_message\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/assignment.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c1fd688ec77935052b9613bd74aa6831e82999d6c7a99742d68a85e3276139"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060interaction.finish.or(interaction.start)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_overview\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/console.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91dac44ba12551c1be7b2e7a967b90224ea700f03c2f503cd783681a3784c6e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060interaction.finish.or(interaction.start)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060activity_from_interaction\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/console.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"283ca4cf039943a75c2451309adfbd070d0f11dff0f782a4de941b6700182c4d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(tool_failure_evidence_from_events(events,limit))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060tool_failure_summary_from_events\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/events.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e29d9ee38359467b57e99973bac8ce52b9c4168dc44e52f580707ec178163c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serialized_json_len(encoded)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060serialized_json_char_content_len\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"453f97d4ec799869d586c6bdabdc11845ff0443ca412b1e793a32ac9519faf53"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060reduce_instruction_excerpts_to_fit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"426664a8f8baff8a0a0e318b54cf3e49a5acb7aaa6880be6852db3cd2d7fa5ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060latest\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060reduce_instruction_excerpts_to_fit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/handoff_brief.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b839c84721d9770811b908954d3283ea5c8fb9a51808e3374121d9a883f360e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::open_database(database,Some(\u0026legacy),DEFAULT_SESSION_CACHE_BYTES,recent_event_limit,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060with_persistence_limits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"42490861fd0576a8afa59a58848e50ed3f7c15984647f9665332f6b174fa4611"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.inner.lock().unwrap().persistence.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_persistence_failure_for_test\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd9c73e59072c757a681bea50f0fcd5d89fc8d6a47732ebb8ff7f00ff7ddd36"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.inner.lock().unwrap().persistence.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060persisted_json_for_test\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba6d09cd45353670547b098104dcc0865da03ac43060bf34c009f19f4cfe2f4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060database.inventory()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060persisted_json_for_test\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77bbc67eb7517f9171c519d405adc4f6c4191241ddfc8e00512426ab5a8efb9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060database.load(\u0026cold,usize::MAX)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060persisted_json_for_test\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8626d4a01f0d9761abaa1dda8fd0c40eb3aa6baa3e4d1d6b795348268c75dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026serde_json::json!({\u0022version\u0022:SESSION_LEDGER_VERSION,\u0022sessions\u0022:rows}),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060persisted_json_for_test\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f3f596c12bf7bc113efa6bb9c3af5aadb0e6311c4573b459271c6ef1e7766b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.start_session_with_options(SessionCreateOptions::new(project,title,mode,guards))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start_session_with_guards\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"d228b4ed03300b8a8c4812cef6c07c59965aa96d035b9f8def615197209f5d05"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.sessions.get(session_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ensure_coding_session_with_git_baseline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1f811de0fc5288f93a7a71fd346a06ef40f86133712099e633d61336e2f2dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.sessions.get(\u0026session_id).and_then(StoredSession::hot)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ensure_coding_session_with_git_baseline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0e988a07c7d64a40c3c58070f6eef0e747d15992940951c40397cb0afa44df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.summary(\u0026session_id,Some(DEFAULT_RECENT_EVENT_LIMIT))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ensure_coding_session_with_git_baseline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e49abeb0b208738b0cfa113f06d767b3750e1fb3a30c941d0a1690671fea930"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.sessions.get_mut(\u0026session_id).and_then(StoredSession::hot_mut)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ensure_coding_session_with_git_baseline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc69c34dde1bc2bd3325188ca43804a1ca212eeccef49f03429fd40cb4d4ec2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.summary(\u0026session_id,Some(DEFAULT_SUMMARY_LIMIT))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ensure_coding_session_with_git_baseline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8af5ff7c20b9a5b23cf1c4a2a72592856f96b54b82a13105d34074bef52b181"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.console_lists_for_projects(\u0026[project],limit,validation).remove(project)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060console_list_for_project\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"928d4b6ce2e2a92690dd0581c7affc3160ea17992b512e7b2e81bcd8e4c89877"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stored.hot()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060update_execution_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"accd707df01f38d7d323111d12e3fc437056cddc1a881520962e817f91984b85"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.sessions.get_mut(session_id).and_then(StoredSession::hot_mut)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060update_execution_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6148f7509b152fd12218ba0074ff5ebf8413de642948726bcb486a56af0a1e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.summary(session_id,Some(DEFAULT_SUMMARY_LIMIT))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060update_execution_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2caf711bc3fb32423692db40a624e52e94598e031663b76944456256bda1466"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060prepare_durable_mutation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"382c7044a8187057720d69e0b326435fef9b0db6e77dff977b816aedc94c24a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.summary(\u0026session_id,Some(DEFAULT_SUMMARY_LIMIT))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060insert_session\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":2771}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8d44b7c09b15f09d5660236e6391902621f41b133afd2c0797c697e9618283"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.sessions.get(session_id).and_then(StoredSession::hot)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060close_session\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":2795}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b0ffa0e95b74c5701245f554487ce118b733565f2bd3214d45a79c56d5ca2a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.sessions.get_mut(session_id).and_then(StoredSession::hot_mut)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060close_session\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd900263501ee28972280fd2ec4e6cec081deef4f6349f78a26f96de9b9f6476"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.sessions.get(session_id).and_then(StoredSession::hot)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060close_session\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":2821}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea13c56de4c2194784e9bd32e7e8a60176b6325df5504c3fd4edd40c37203ba4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stored.hot_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060post_message\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":2851}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d5e80f5a61c67844b0b73a90c5640e00c916d422e9c6739d0262edf8d8e593"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stored.hot_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060withdraw_message\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"c389838cf3cd3e998a5218fdae53cb41921de3b9bba7082c94fcb4bdc5af4990"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stored.hot_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060replace_message\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3089}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3a2844e9913fef22dd8b6f7fd686327139a6146c8a1868564e6bc5447c93fa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060record.messages.iter().find(|message|message.message_id==input.message_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060replace_message\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1c8e3d27862c557af3cbe7e6161a817746b65795491f2bc4a93177125505b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stored.hot_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_message\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3227}}}],"partialFingerprints":{"codehealthFindingId/v1":"59136543d73ff0c2552d67a7c28548e28d6b95efbec7d709ffc4f2a5010a1022"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stored.hot_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_message_from_wrapper\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3294}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cfbe9812c988cdb2a2d989a5f9c664e81a71a6e68b10c79d05585defb5e2a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stored.hot_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060complete_message\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3371}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb2fe6ff57e8aa466b9798fcbe559bd7e0c0bc0ad74268facb567a2990bd932"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060record.messages.iter().find(|message|message.message_id==input.message_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060complete_message\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store.rs"},"region":{"startLine":3522}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c079f84e8c06134e234ff3088ab18666c8808fa5e6d4d407ab49e5002e28270"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060session_id\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060task_context_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/task_context.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ab69c9322b1368d4b19384add92c35f06ac346ee631206a9e89b7f54a2e763"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value[field][\u0022items\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060task_context_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/task_context.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"85984dd8c78c01f81d4263d892d3d232f92737259cd4e29261cdbfba3aa9309a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.generation.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060mark\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store/records.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6ae9ba4c605ff5893ab1064110943a3e7c3f741b2d3af9cc5600c06cdfc48c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.shared.cvar.wait(state)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060flush\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store/writer.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca4d1ad8db0e9dd5af411630d161aac11b367a4bf62caab98f0ff8c56640eaf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060database.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060persist_batch_observed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store/writer.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d0deed57e51540e3059a05ade8b7bfb9b12d68d9d5fe937b8fbb041a0d7563"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060shared.cvar.wait(state)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060writer_loop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store/writer.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba8c0b9f8dda741415bcaaa85ea61ca118d0c0d49e49df62b6a15b0625e6f8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060shared.cvar.wait_timeout(state,remaining)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060writer_loop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/store/writer.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a347464f55039d54c06add7bb10943944a694b9f0d8cbb0fcb727a7bdf5a5b56"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.connection.lock().unwrap().pragma_update(None,\u0022query_only\u0022,fail)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fail_writes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-workflow-session/src/persistence/database.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6478854a0c409027da3d78a8e1c40b502eb30ce4c498eaecab43d11582ef50"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(\u0026self.evidence)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060projection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/evidence.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8331e04f4a91d3b43031f005e56e0d2d0f2c8fd78db8c3033ce3e8fe87ebab4d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(\u0026self.current.evidence)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060bounded_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/evidence.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"702183f9c95d2f3fe927fcedc6d7c5fe2ec4189a673fcb637a0529576e0e7167"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(summary)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060to_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/evidence.rs"},"region":{"startLine":2042}}}],"partialFingerprints":{"codehealthFindingId/v1":"79eb7f3b2168a1e7ca63007c0098b6f462a032c4484aad046a890aa30888656b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060project_recipe_provenance_files(\u0026resolved_root).map_err(map_project_recipe_error)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_validation_recipe_with_policies_and_exclusions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/recipe.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeaae4d66430426d70946f50ad15832cd32a570d968ed522837119ad2c2798e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ShellJobValidationStep::node_json_test(\u0022vitest\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060resolve_node_native_project_action\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/recipe.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34ad00cbbf0a978876748d148d02b8872cd35dd9ef5cc12b809921a47b92315"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ShellJobValidationStep::node_json_test(\u0022jest\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060resolve_node_native_project_action\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/recipe.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf31a5116262a8af57e3870d5f02ac3d852b75cb2a791dec08c97dd7e9ba431"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060managers.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060node_package_manager\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/recipe.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79c2ca1ba7f528c1541493208647a6717c72c0136e4976596216a3237d8e969"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060validation_evidence_profile_for_tool(self.compatibility_profile().tool_identity)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060evidence_profile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-validation/src/adapters/mod.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cc6f6be0d251def6852ef88359d751e27fabfcb8234cf59c77cfe0ad6280c7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(self)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060to_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-runtime-contracts/src/tool_result.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db7c7729977f15a1925a273bf9ae3be5463a9ccb671b315367bc47d673b3116"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(generator.into_root_schema_for::\u003CToolCall\u003E())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060derive_tool_input_schemas\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/request_schema.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7803a19c43c79676c888fec83bf3951b0af9780822b6b38edda88feaacf95ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root.get(\u0022oneOf\u0022).and_then(Value::as_array)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060derive_tool_input_schemas\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/request_schema.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46d07ff04df67a69033d8f7f756ba509f3fb412da964ea937ce2360fc148ff1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060variant.get(\u0022properties\u0022).and_then(Value::as_object)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060derive_tool_input_schemas\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/request_schema.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d652f5d29ac2391040277eaf613676a3445b5e6c9e53e21db5d5e30980c24d0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060properties.get(\u0022tool\u0022).and_then(|tool|tool.get(\u0022enum\u0022)).and_then(Value::as_array).and_then(|values|values.first()).and_then(Value::as_str)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060derive_tool_input_schemas\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/request_schema.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e04a31888e75d9d032f8bf26edcc835e9a97d4216480ec916dbd5ecdeae6d1a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022][\u0022project\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060project_compatibility_inputs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/request_schema.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d910c98631d9bc5a371d9c51a7e2bae0d5af631d0f7d9c4be685593fe4cb69c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060project_compatibility_inputs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/request_schema.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53d7f1b9b9c83a767091c8b0725c4f9dd2e7a7976604143ed509aad3d1154bd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060query.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060project_compatibility_inputs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/request_schema.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e5526d584d30248ba555d9428a792fc678a354f6cd179cc5010fefcc5ee9c2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060project_compatibility_inputs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/request_schema.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5c32ecf2b5346151ab56636183036c31735c61158ae3efe104d228b061f2f2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema.as_object_mut().unwrap().entry(\u0022required\u0022).or_insert_with(||json!([])).as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060project_compatibility_inputs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/request_schema.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f386f19b1900a600aa8eebfee61cb921d2983f736778cb0748c9d2318032147f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060properties.get(\u0022args\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060decorate_model_wrapper_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/request_schema.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8528a6135607175f8e4b83cc52d8de5d6146bad2c204f3dac5d4dc40aa2cff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060branch[\u0022properties\u0022].as_object()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060normalize_closed_object_union\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/request_schema.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc07320cc9a81a6a3c7c3caf37b55c4b9d744252c14ee17be6db50adfc56f6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(generator.into_root_schema_for::\u003CT\u003E())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060typed_host_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/schema_generation.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"862975d3167f658d121d5be5b0b58fd81852eb582f80e97669d889bf0f4a6a3e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.start_line\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060into_runtime\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_inputs.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce1f969288f0e6571e74e03f57d814222748c1c1d1f668c0386012377f94e9a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.end_line\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060into_runtime\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_inputs.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"937e17ab9da7d6bf55673d5a86be656df51c28d894ed2fab310e8d27c1bd234d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060edit.line_scope\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060serialize_project_text_edits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_inputs.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e047b3e454a6163d53dbe9b654394d8c1f11d0722fe783df180ab27aa8f13851"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(edit)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060serialize_project_text_edits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_inputs.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bd3562afa361c005750610e19742b37b3ef0b793c9db1461c1c1d8e6668590"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060serialize_project_text_edits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_inputs.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92861da068e3a9e4915a3ce25a20d5250883409ab6176a30c5ca8db71629a39"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060definition.adaptive_runtime_direct_rank()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060adaptive_runtime_direct_tool_definitions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/tool_policy.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ce1c5f363b6bf0c7e33fe2076d16d406c99763a78fd8ad853472dca603e673"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060wait_model_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/agent_waits.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5d0b46a8583b8c09825f8591f327928a881ad374d6c30b88d7daf98f935afb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060properties.get_mut(\u0022sources\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060wait_model_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/agent_waits.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f3995ee821ee4771be6b184c0af41b100b9523b1c4218260e0c175e34336fa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sources[\u0022items\u0022][\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060wait_model_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/agent_waits.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ad9bbc6ca6c3a72dbbebf875c7598248b93961b5dd30721c9f4bd558c8d81e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060properties.get_mut(\u0022matches\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060wait_model_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/agent_waits.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"beea35dcf04515910096f191efcb562d28c41262bb847e58ff28cae718e345c2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060matches[\u0022items\u0022][\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060wait_model_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/agent_waits.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5d6d044c2faa742795d061f8a76742ea5952435df0470a4f6e8d50f56ebac0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060merged[\u0022properties\u0022][\u0022output\u0022][\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060project_artifact_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/artifacts.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03445c4597e841a5c678849b4d7785eaccdedf8c62e38e438549dfc029c5917"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output_schema_for_tool(specialist)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060project_artifact_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/artifacts.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa067b749b9a0fde52a3687b25763f57694747cd35da3c9ff38cd5d4c70dc86c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060source[\u0022properties\u0022][\u0022output\u0022][\u0022properties\u0022].as_object()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060project_artifact_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/artifacts.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b321ae311a5e04ce1caebe0f39ce1668d9decb0b341d4afcc1078878e1ed59"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema.get_mut(\u0022properties\u0022).and_then(Value::as_object_mut)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060add_startup_model_metadata\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/coding_tasks.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a665bb612fd67d10d450186d0df26eb86735ece97d2cf5bee4bdf12ef329d2cc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(schemars::schema_for!(webcodex_core::lsp_bridge::LspIndexReadiness))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060startup_semantic_navigation_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/coding_tasks.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09eb274ae6034af09ead86e297b4e69fceffea4406f0c2178f071f3266eadcc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(schemars::schema_for!(webcodex_core::lsp_bridge::LspIndexReadiness))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060work_on_project_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/coding_tasks.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdbc077102b8dd0dff6bec2d239785c25219d94ef293524f7f11c8bfd02b0d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060passive_failure_diagnostics_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"946e2efb9e8c5a475d8e4b5e4c9296b70e389c9ca4cbc8315aa28476edafd666"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields.get_mut(\u0022diagnostics\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060passive_failure_diagnostics_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7bf0432eefb0b8c760436fccd075fb80b95039350f942e3b2261652f7e9939"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields.get_mut(\u0022returned_diagnostic_count\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060passive_failure_diagnostics_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c858164cdf181831a1b3ffa59e0f2d895a9ecf11b1c33dc6a43bae69596dcea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields.get_mut(\u0022failed_test_details\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060passive_failure_diagnostics_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e5cad6c51d35285de60b402c047e38be9d40f7e6c89113fda99fd5627dcf21"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields.get_mut(\u0022test_summary\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060passive_failure_diagnostics_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73cd83c80a1805a0440d568222cfaff967d79e7e7841030ce2476c722cdc382"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060count.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060passive_failure_diagnostics_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b20a4bf59c7676d81452d75c0bb811c2b619b81db770abc4b1c3b6eb722d42"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema.get(\u0022properties\u0022).and_then(Value::as_object).cloned()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060wrapped_typed_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/common.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfc9687d721a361d663cf66ce6996361ead503b9540b1f93579c0393ebb7645"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022required\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060listed_agent_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/communication.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc60bdb98c53689a849eeaaed21ef89900fa8ea81adea8f186f0f8011909b06"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022][\u0022output\u0022][\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060strict_computer_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"641e90c6c1f94162bbcdcadcce8e5478d321b3048a8f38e1f623473d9569c80c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060raw_output_schema_for_tool(name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060merged_gateway_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb34e1732f81bbf52cf4e814771896453b876f4f7b76d48d58777f806a368434"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022][\u0022output\u0022][\u0022properties\u0022].as_object()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060merged_gateway_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"157a1a0b050800e7d677c23532e7f38301732aa210a1250f3ee8ca2ab27109b9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060merged[\u0022properties\u0022][\u0022output\u0022][\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060merged_gateway_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ec1c537b6fa74112113ef201f94659a8f1115f6268006e93cce0d881258a7f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output_schema_for_tool(\u0022computer_accessibility_tree\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060raw_output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe5388f76cfedc1d5b22d44538cb3badd1639ca09b0ea5b1d045148a31ca2b0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(schemars::schema_for!(webcodex_core::computer_scroll_contract::ComputerScrollDirection))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060raw_output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"73409ef47885ce1cd76b8ab44dbe3796e0ed79459e8fbc9fba19f64191c3a2cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(schemars::schema_for!(webcodex_core::computer_scroll_contract::ComputerScrollAmount))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060raw_output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"7803a5090593ea5b01ba0faac97b0380d77d787fab8e1129cc7ccdc10c641167"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022][\u0022output\u0022][\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_computer_recovery_contract\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb37991b4af5e81aa89bed6c493c902365f8bd1c08904bb3d472572dcaca601c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022][\u0022output\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_computer_recovery_contract\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b19fd6078e0cf7da9cfc8fbe742546900db53f8d5bd8c2cce4605a748b782e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022][\u0022output\u0022].as_object_mut().expect(\u0022wrapped Computer output schema\u0022).entry(\u0022allOf\u0022.to_string()).or_insert_with(||json!([])).as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_computer_recovery_contract\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/computer.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcf01b18a8ffb5fdeedf83d7259cf54c09b946266c860c68b1e562df6d6ac40"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022allOf\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/edits.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdce9a2b64243e8e64462254c0ce5783650f1a45519e9a36a47a092d5e94c1e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060read_success_properties.as_object()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060read_files_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/files.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"8716a1ebb6c02a17652f85010a6ce8cd9970bb56db46180644ef5d3acfc157d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060page_call[\u0022properties\u0022][\u0022arguments\u0022][\u0022required\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060git_diff_hunks_recovery_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/git.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac567bd218fd1eb1fac27501096f792fa12f11174dc97295f25b1622c467b8a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output_schema_for_tool(\u0022read_workspace_changes\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060show_changes_output_value_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/git.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecab17659be2ed712c2a8e0e238121fecf510a59bf31d88aa9fd74f650121b3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output_schema_for_tool(\u0022read_workspace_changes\u0022).expect(\u0022read_workspace_changes output schema\u0022).pointer(\u0022/properties/output\u0022).cloned()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060show_changes_output_value_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/git.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"9158d2af67683eb912d3a086dadd2be6f7b3fb79e0ea9456b686ee35f3f5319e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022allOf\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060require_success_output_field\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"559df93b38d6e5f3553b8121a0b4881af7b38209f986f637acfa4b2b07d4aacc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item[\u0022allOf\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060observe_jobs_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a36bd94fcd61f13aefabd5cf0474f0ad811b275a286c54c1481e23ec33ec9d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item[\u0022allOf\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060observe_jobs_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c7181d70d8ce41bfe711027704d77036691bd88d8301eabc31d13a65b6fe6d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item[\u0022allOf\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060observe_jobs_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07a51c94bea12085da53b874a662342592ae5d60277aeba113d4909315242cd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sparse_batch_item[\u0022required\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060observe_jobs_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b52c5c858d534b3a439aa93ce44908ccf8f6e4a0b63c02e9e10ff93bf1c4d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output_schema_for_tool(\u0022run_process\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58d58eec45e29c90c313e97ee6fedbcb9692b1ecedbcb4efe2386e3011d2b0f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022][\u0022output\u0022][\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb3a6eb05e52dfca2d873cafba1bec1bf86fe984caa8c13fbf1a364cbcb9c42"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022allOf\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"e422700e4c0bb5d23fa9816f036b5c81c278b9235a473e99c18eb766ae3c11c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022allOf\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e065f24d724cb752813284148dc03450efdbb6e91935f9c9070acc798ea2a2b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022allOf\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"c638d55c1db204db5429b1cf49c80bb2012631b0c494481d8ded3e46ca20c71f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output_schema_for_tool(\u0022run_process\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58c33e6928753fef68ef2ef0879f6dc946d82fe84129413319cf041a40d1daf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022][\u0022output\u0022][\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2cd6b26843df656df9dceb8ec3de2a0f962472f5a3e1d9cc2b07784e8ae98e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060source.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daf8aa2dded92da003c90816cec098916d6ef4ca8ec4a22bb4301311eb8109f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022][\u0022output\u0022][\u0022properties\u0022][key][\u0022description\u0022].as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54890e463b15e5bac9c8fa450202ad58713a0e21c274c000c3534c247fd296c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022allOf\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/jobs.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6ff7d6d612da7fa1dbdedfa0806a7c1e57ec6fb26116e604a75be12d466c13"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060output_schema_for_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/sessions.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"16607622803e7ce4e26bdce5fa0235320209b989508229ffc641e62f90de301d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022][\u0022output\u0022][\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_skill_recovery_contract\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/skills.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d978eb2754afea24a09ebc7baff04450ea217ab5aa14fd8e97d3bc8f7f9b76bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022][\u0022output\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_skill_recovery_contract\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/skills.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4aa8be975343d625907554a9d7a049f5ddb5d516c24bfc99368e4b8c5a630c6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022][\u0022output\u0022].as_object_mut().expect(\u0022wrapped Skill output schema\u0022).entry(\u0022allOf\u0022.to_string()).or_insert_with(||json!([])).as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_skill_recovery_contract\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/skills.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6146d678927d6d04481c9a65de664c69f197ffc5667dfa714d777bdd834cd5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060model_test_count_assertion_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/testing.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"c101a693b62de610cdc0072fbc23804995f77fc04fb8c59fe2b55ef44b5c4652"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema.as_object_mut().unwrap().remove(\u0022required\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060model_test_count_assertion_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-tool-contracts/src/registry/output_schemas/testing.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f571be63260349f3e338f94092a062369f7f0c31463fd3346c11c24431b205"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_wake(\u0026transaction,\u0026wake_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060claim_next_agent_wake\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"564a4abdae981d3cf66abf12fd227a0db63692f87232ed82ce17b42ab6264b0f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_attempt(\u0026transaction,\u0026attempt_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060claim_next_agent_wake\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7337764052f8d07d6a267d54ac560fa03123d56b550ba917dccabf4fc9c2b0c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_wake(\u0026transaction,wake_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060release_agent_wake_claim\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ae35573352a5c5dd20c5e98ceb1b3de085734af88721b21d0eba0673ad4dca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_wake(\u0026transaction,wake_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060prepare_agent_wake_dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe977f65c9838efbb0c2e455f8f7660d73c272c33c829b87a7a0ce92797b2e3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_attempt(\u0026transaction,attempt_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060prepare_agent_wake_dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c20e45bd9a3cb59ebdbe7db7b993672eeb0cad817e087451886ca257e4a524a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_wake(\u0026transaction,wake_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish_agent_wake_delivery\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"05678a3bc1cdb8f069b2d2c0617bd30f0ddf91fc06179791ee13844e55d2e17b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060wake.consumed_at_unix_ms\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060consume_agent_wake_with_now\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"505e4e47a8cbb3f1423d5247480ffd3e78695cba4d620d1377073f87cff88064"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026(\u0026attempt_id,\u0026consume_token))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060accept_explicit_agent_wake_activation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1b8ff0b96481985c3d8fc44709958146b359e93da9fbfc3ade7596ddba6d31"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_wake(\u0026transaction,wake_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060accept_explicit_agent_wake_activation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_wake.rs"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc74c3a14ce832ed1aeb5f71a94bea7eeeaf124beb8e16e9cc5c190ecc25b0b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026specialty_labels)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060create_agent_identity\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"12072e6f2195588e72bad40f3f5f7c758fff040a57fa2f175a43fac8200a1f1f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_agent(\u0026transaction,\u0026agent_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060create_agent_identity\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"9003b72fb5422d6ec704de4e7fadc17f1787438e6689b0487891b8f7a97dca1a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_agent(\u0026transaction,agent_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060update_agent_identity\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1f36107a26b6dda942d602f3aa44af8afaf7fb6feabf6741cb1de41e0d7fc3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026specialty_labels)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060update_agent_identity\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c910a1eef8f1b1873002cbacfcfccc2ee7e366f7730e112ba0ecb1cfc79dc0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_agent(\u0026transaction,agent_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060update_agent_identity\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"772afe81a5d63908da6d3aa57bed6f82745154e7c11d744a263a9e9836592044"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_endpoint(\u0026transaction,\u0026endpoint_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060attach_agent_endpoint_with_host_window\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53f3033578060cf881a80cd7b146e55ba1db279f01b351c72d57dedfc6bd079"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_endpoint(\u0026transaction,\u0026replacement_endpoint_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060recover_expired_mcp_app_endpoint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f823e0f55809d7ecb6783bd2e652254a8fa3c4e908e6d971d260d46e751e7b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_endpoint(\u0026transaction,endpoint_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060detach_agent_endpoint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8517e7ae0c09242bfa2e192d353204d3d9314b79c737dc8dcdf1260e51e23373"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_endpoint(\u0026transaction,endpoint_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060renew_agent_endpoint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"f782471930b6f4a8b81a79fde3b3b0c29d035b40eaa940e6f554bb96931f3d0b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_endpoint(\u0026transaction,endpoint_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060set_agent_endpoint_binding_projection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdeea37f0e03626f54299160f2ddd9d53b9992175b5a18fe2e2e784b9cac253"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load_message(\u0026transaction,\u0026message_id)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060post_conversation_message\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a3e8e7c2e62b2857b12439527bdcccab755ef1db17e123d8a8509e81a8b7d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060digest_json(\u0022webcodex.communication.request.v1\u0022,value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060communication_request_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/communication.rs"},"region":{"startLine":3297}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7ccc643df22200a139e28b6523f01f7e211f90b6709083370210ed7fdfc008"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.guard.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060deref\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/connection_observation.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1b0850fcc48c5a2a1d74b77722c351a3e250f17c9822d04c72a4c0e3452487"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.guard.as_deref_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060deref_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/connection_observation.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cf9463a12a5b3533819b23c4c0cd4abf32f90c70a0bd6373a3ad3b6976f7ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060digest_json(\u0022webcodex.goal.request.v2\u0022,value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060goal_request_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabf3bedc0943d62472a314d0fb247adbc7a8cc8be19187b472bdcf0434e21bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dispatch_prepared_at_unix_ms\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_goal_stall_continuity\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal_stall.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"813db9ce757de747890aa7759963a280c85dba4994c522d14d4df4d0f6ee7058"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dispatch_prepared_at_unix_ms\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_goal_stall_continuity\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/goal_stall.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af2fd2d05f7cac31378d8f0c607d25ff30b3cb2e44afccaa1d3b3d378e16f10"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.history_reader.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060lock_history_connection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/lib.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ac90bfbdb3e4f8ca30f6bc5173b0a243844d50d982402f786054607e4e6fa4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060order.split(\u0022, \u0022).next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060window_collaboration_page_scoped\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/window_history.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3409471e53bfd376ddff15cb1c331f2812fdfd816ec31a02de8cfca5bf6abd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060order.split(\u0022, \u0022).nth(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060window_collaboration_page_scoped\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/window_history.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa072c4520fec1df98525c57df70c030ed1b27530d7f7f790458cf0080079a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060digest_json(\u0022webcodex.agent-task.request.v1\u0022,value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060task_request_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/invariants.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b961e3fcd101b88b397ddf3e444837f0db9794ad88471a798628a0b9fa54581"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060digest_json(\u0022webcodex.agent-task.endpoint-continuation.start.v1\u0022,\u0026start_identity,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start_agent_task_endpoint_continuation_with_now\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-store/src/agent_task/operations.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfff14070b6a5d43ee9674babbffc49dc83f8025c7eb3c894be5dbbeef69973d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060token.stdout_cursor\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060frozen_shell_job_log_projection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bb75fed20c7228aa02c73cb8248504363042f37714d13b5e242548a07de519"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060token.stderr_cursor\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060frozen_shell_job_log_projection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"db02d9cba11d17211ebb2e11b94f35d94f578d9b0e846424104a6386afde8d2a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060job_operation.context()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start_job\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"def20565c2929c3be3899a8fe608d8cc04f0a03380404481c3dfc72351cb2ff1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.jobs_by_id.get(\u0026job_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start_job\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b9f67728e6f17ce7ff84376dbba7972b2989e3d64ed1b8406499198dae44b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.jobs_by_id.get_mut(job_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060publish_hidden_job\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e324dad25e61b27241619be1a3f34f1145abb4809e9277227869fb606f6c838"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.jobs_by_id.get_mut(job_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060cancel_hidden_job_for_auth\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6d087fdc1b694d781686647dc72af6e5a888fb4b7162db371a90bd3bcb120f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.jobs_by_id.get_mut(job_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060cancel_hidden_job_for_auth\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dde5d70fdb3a3bdad54532347fa34e43c83405ca7b66a472c0a0544e910d73b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.jobs_by_id.remove(job_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060remove_projected_hidden_terminal_job_record\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"471d8f04466dcb713ce31e2783cfdc83ec51e9ed885fb16bdbb86e0b14e9d829"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::job_attention_snapshot_locked(\u0026inner,auth,project_id,session_id,active_limit,terminal_limit,None,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060snapshot_jobs_for_auth_filtered\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f18ca967d252e3dfe0cae2bb244df029d387505a950ee00bee5d4c76ce2f83"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060deadline\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060job_log_with_paging_for_auth\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4192e4f88e17699e2f6a43f5d8ef4b756a507ea56030aca5777178c36c82dee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.jobs_by_id.get_mut(job_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060stop_job_for_auth\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbea1fc8f2a589f1cb9145cafe1fd2ef23114b4fcd28b65273b70dd542b3278"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.jobs_by_id.get_mut(job_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060stop_job_for_auth\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates.rs"},"region":{"startLine":2150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd31727660aef438687f660538419a8fc686ac5df0c0cc2b74ffb8946aca91c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.maintenance.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060renew_maintenance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/maintenance.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e498ccac3607806ffe96500ca01fd35ba5421adcc4535e61dc03f2b086f2a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending_request_locked(\u0026mut inner,\u0026body.request_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060complete_persistent_shell_checked\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/polling.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef16d279105a545cac24a6c23771b44cdd5b5a8e2e682306f3784309ccd417f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060runner.project_inventory.staging.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_project_inventory_page_checked\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/project_inventory.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0a8ad6ce44f405b241fc8b0000695566e940911e44e435c46cd7b3acbbd1e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.guard.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060deref\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/receipts.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bdbb6cb26bb7b8f39d11515cc9c55145f819bcce66dce8a43e42f59975eb7a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.guard.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060deref_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/receipts.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cc4b2a346d07898183fee0e4d5c6222bdf5a74d27c02c065ea8424b1027775"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060JobLifecycleState::from_wire(\u0026snapshot.status)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060record_from_snapshot\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7240e2e1f97e815600ec33320cbd0c64fb1ecfa9c681c14d4f38eae4c64e0de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060JobLifecycleState::from_wire(\u0026snapshot.status)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_snapshot\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/reconciliation.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"42affa210205ca790dbe52102171fb20d809a2e1d372bad5a06252a0f43cd7ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.runners.get(\u0026client_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060register_session\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd65caebfccc09c648ecbeb2ab6e659d13645462c9a8009c302d8d301992e52"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060replaced_instance_id.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060register_session\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6e53d27705cb0521bc33972f6a3530df2ade67aa84853308f14ca65370aa40"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::runner_view_locked(\u0026inner,\u0026client_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060register_session\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7b8ff69d12ae418bf5b50452b22e77602eae4f6767ea665fed19a080370da3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.runners.get_mut(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060list_project_semantic_views_for_auth\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce82221933bec8bfbab6b01acfd77b5bfaedafbe36e0d176d27eb1041b2db2e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::runner_view_with_projects_locked(\u0026inner,\u0026id,false)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060list_project_semantic_views_for_auth\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/runners.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0194aee4f28d17cf1bdefe682c969ed90e5f95d20da5f4c6dc8038c206734fa8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060operation.context_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060into_operation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner-registry/src/job_updates/start.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac1a1583510ee25b465d35561256b189a8cf5d763ac2f1a1cd378354607e5fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var_os(\u0022CARGO_MANIFEST_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/build.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"89767db0ce9fbcaa885aed20125c428ad1da2a7bd5fafcc42f1128f7bd08a19c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle_browser_operation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/browser.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1ed2ea292f6af258748eb97c1bb55f6cd06f426e802f93daa3d9bab0f62427"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060object.remove(\u0022execution_state\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle_browser_operation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/browser.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b7aedd22a02b7e318c5eaa8cc058fc72d2abecd7282a716351049b35d89475"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.changed.wait_timeout(state,remaining)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060observe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"982694c30bf807dd22ba50c439e81de7127cf423095950d47c09c04e5b67712a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.declared_provider_env_presence(\u0026request.provider_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3518750a7f25682bab24983e35dba5357839d4986aac8a70e17d72a19be18a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HotRunnerConfig::new(1,\u0026startup,\u0026startup_managed_ssh,status)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9724aefcc6f3270ed8f4fa7081b39c867c8ab8c51c74d910962d33c3b504010"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.mcp_gateway.apply_config_candidate(\u0026candidate.mcp_gateway)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060reload_internal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"555c10d82d3bce79a457f6d03040e3fe0279e12d03e6ce19d9f2c07042de0008"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060config_wire_atom\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/config.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4a21592a0465609e7b8237084fea861b472449eca59b15251ad9594b46c019"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026webcodex_core::runner_instruction::RunnerInstructionSnapshotResponse{format:webcodex_core::runner_instruction::RUNNER_INSTRUCTION_RESPONSE_FORMAT.into(),generation:current.generation,scan_complete:false,files:Vec::new(),},)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_request_with_outcome\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/dispatch.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"023ec68f6536c5ebcdebb20d49e61d9137bca3e78f513f9ef2f61edab59813a6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026response)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_request_with_outcome\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/dispatch.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"33543dc7899ae87c4a9ae6ed91d86aee12193e3240155410aea9d0cdffced298"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026receipt)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_request_with_outcome\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/dispatch.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"39062623fd62bdab4517b51abf0201fce0c60e0f13b7500ffc9714bb611e17be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060marker.map(|path|path.with_extension(\u0022release\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c4d9476f92ca6329a019a9dfdb81e3e044a4765c95ad42500150ccc43c4f91"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060marker\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/fake_plugin.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0800aa5b6c4536695cd123f7469e001f66ea4e7f0390e1bc8646463fae8aaa2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(serialized)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle_file_read_range_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/files.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1fd5cd25d766b020ac718d208f4c93a91a8ec7d3f3429e733c4732a29f573b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(serialized)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle_skill_read_file_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/files.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"df301de4db5dbaeff1dc2690611370107929cee4e4c9007712566c2c22d30dce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060session.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060with_connection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/mcp_gateway.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98c871d342c0349ce8d7b6c3b5f7063fdd36a6c04fbf978f4d518a453892b65"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(\u0026pending[..valid_up_to])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060decode_utf8_stream\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/output_text.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"67edaab70ab58359e0efc3190339d42d0709e6ee4b6e686c973a134dd8324d7f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060char::from_u32(scalar)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060decode_utf16_stream\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/output_text.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"0676f8f5a74e16e807c9a4817fbc5141446ff8f7691c5f23b5d405f8da9199c6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060char::from_u32(unit as u32)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060decode_utf16_stream\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/output_text.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"529439998cfe02c81a5b5ecc05c60f12803c02603f852983edac4ecb4b67d2fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060conflict.line_scope\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060edit_plan\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"5073b0d5d37796163765832876f080326c7c5829b3c44d84f67724e0f7a0d522"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060summary.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060edit_plan\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/patches.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"be253e0da0f54357d11910ac4a30b4d900b05179f86b9feb0f1655add5c4bfc1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026envelope)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060bounded_project_catalog\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"63018468d590008ad86506a5512f6104487f9dca47250047570b334e660d183b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026entry)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060bounded_project_catalog\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/plugin.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d3fa4007142c3bc0fc5f11fd711e46a30a97d4598aba17926eb2bed4011d63"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026result)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a34aa78f0814628aab3d1572ea3a4218ee16a9bf5b520aad410048a37ff657"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026result)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_format.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0f475794d46fe3c129491b73e10b03f124331053d1428bbe1c79ff71553389"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060wait_requested\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shutdown.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb5db09ccc015e1f60e9c1b476ea48df9f57b0b958c2309b156a958236e2e41"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060descriptor.skill_key()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060namespace_revision\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e418f839a18be7ba1c302d2b70ee1fa56f70bd364490669160c4a4e4782534"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060descriptor.package_revision()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060namespace_revision\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/skill_store.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fdb57094cda77b7ac5e37db9c50a220216f6083a6f83123ce2dd41f5ab97d5d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tempfile::tempdir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fd958418383c28d0d681fd612fafb2ed024041613ccd56dbca9e0757099401"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir(\u0026remote_cwd)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"133c52d598dffd73f17f8b997c50a3a7aeda53c57b1a3050342add49439c18ad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::copy(user_key.with_extension(\u0022pub\u0022),\u0026authorized_keys)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"c458439e5a9c4f844c515c0613c08000b7a37e11867ada949b3fbdba5fb09fb6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TcpListener::bind(\u0022127.0.0.1:0\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"a099d22e305a51b08d7d8e47e99cca42b76b9202ab43bfb2ce40d7a6eec6e3ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060listener.local_addr()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"13896cd6bdf8d3b45d799c7b8fef287f1fa983dabdc25e8dd6a05f4cdb590109"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Command::new(\u0022id\u0022).args([\u0022-un\u0022]).output()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ad6c13c66dad2cd859f82f7cf6a3ecbd47b29772f6187c0d07f0f12280b4c1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(Command::new(\u0022id\u0022).args([\u0022-un\u0022]).output().expect(\u0022resolve SSH test user\u0022).stdout,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b3b87e49c8ec1ae5e460e183b03c477156c3f15ef646320e661cdb9ed121ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(\u0026server_config,format!(\u0022ListenAddress 127.0.0.1\\nPort {port}\\nHostKey {}\\nPidFile {}\\nAuthorizedKeysFile {}\\nPasswordAuthentication no\\nKbdInteractiveAuthentication no\\nChallengeResponseAuthentication no\\nPubkeyAuthentication yes\\nPermitRootLogin yes\\nStrictModes no\\nUsePAM no\\nPrintMotd no\\nLogLevel ERROR\\n\u0022,host_key.display(),temp.path().join(\u0022sshd.pid\u0022).display(),authorized_keys.display(),),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd645b729a5fa53327fcc9a92e8f343e5864f0ab77b21e48f36da8371a1ed9f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(\u0026client_config,format!(\u0022Host {alias}\\n  HostName 127.0.0.1\\n  Port {port}\\n  User {user}\\n  IdentityFile {}\\n  IdentitiesOnly yes\\n  StrictHostKeyChecking no\\n  UserKnownHostsFile /dev/null\\n  GlobalKnownHostsFile /dev/null\\n  LogLevel ERROR\\n\u0022,user_key.display(),),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"941f8ebb795a2f355ed0e4ea8daa79e0b20e467664a56770bdee562d96e42623"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Command::new(\u0026sshd).arg(\u0022-t\u0022).arg(\u0022-f\u0022).arg(\u0026server_config).output()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca353c2ea91257579dc0c3f794e79d642fc398e51604993a381505b8f2e7214"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Command::new(\u0026sshd).arg(\u0022-D\u0022).arg(\u0022-e\u0022).arg(\u0022-f\u0022).arg(\u0026server_config).stdout(Stdio::null()).stderr(Stdio::piped()).spawn()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"919a56313a1c90d3566e77343885c3c108d34de255a68316b2b900bfd242bd4e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.try_wait()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c913e49fdf6783da5f786dfdf5f445d4e3f177b22effcdc7e4a1dd75a205d7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Command::new(\u0022ssh-keygen\u0022).args([\u0022-q\u0022,\u0022-t\u0022,\u0022ed25519\u0022,\u0022-N\u0022,\u0022\u0022,\u0022-f\u0022]).arg(path).status()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060generate_key\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9fc7148294b5652b7941fdea58615daef091a083a874da6b3f1129f90cd430"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060command.output()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060shell_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c083588f82be923b792a8d234686607ad27250a2c9ae0aa1ecdcaf538c46e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060command.spawn()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060bootstrap_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"8787434442a2922aa9f06903abb1ccd0e1a989b01f309068e3c48988f2177a06"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stdin.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060bootstrap_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b629ac609719c30b0fb367f2dbd8c7bb674b8b33c548581c886d7468fc67f9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input.write_all(frame.as_bytes())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bootstrap_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a38cb70f6eabc07b3c35aac482da2395b2ff892ae2ae50eba065c9ca2bfa02d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input.write_all(caller_stdin)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bootstrap_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cdf7bf173824d9ca03e8e29b067df10e55f8c09ce653f9df8d7aa858ac7d92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.wait_with_output()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bootstrap_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d68fbe9b8774fecc2221cd05f8751e618b49254452199c7023388352ac8c944"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_value(serde_json::json!({\u0022request_id\u0022:format!(\u0022request-{job_id}\u0022),\u0022client_id\u0022:\u0022ssh-agent\u0022,\u0022kind\u0022:\u0022start_job\u0022,\u0022job_id\u0022:job_id,\u0022command\u0022:command,\u0022timeout_secs\u0022:60,\u0022requested_by\u0022:\u0022test\u0022,\u0022created_at\u0022:1,\u0022job_context\u0022:{\u0022runtime_project_id\u0022:\u0022agent:ssh-agent:remote-project\u0022,\u0022workflow_session_id\u0022:\u0022wc_sess_6Y770wfrS6xHRiFn\u0022,\u0022ssh_resource\u0022:resource,\u0022project_cwd\u0022:\u0022.\u0022,\u0022purpose\u0022:\u0022other\u0022,\u0022shell\u0022:\u0022remote\u0022,\u0022command_preview\u0022:\u0022remote test command\u0022,\u0022validation_steps\u0022:[]}}))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ssh_job_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd76b2279dda30fb7e1d23cd837ab18a1450c8aa6ee231d2ec5995cbd95ea7f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tempfile::tempdir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ssh_project_registry_dir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5168cc84e4190a682235f691d145bf13725800e591c39fd7d62c7011efec67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(dir.path().join(\u0022remote-project.toml\u0022),\u0022id = \\\u0022remote-project\\\u0022\\npath = \\\u0022/srv/remote-project\\\u0022\\n\u0022,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ssh_project_registry_dir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":2662}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba54a953ed4673f991cab3908a96e2bd8dbecf7afdc68f82dbf33f097ad6679"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_value(serde_json::json!({\u0022request_id\u0022:format!(\u0022req-{action}-{shell_id}\u0022),\u0022client_id\u0022:\u0022ssh-agent\u0022,\u0022kind\u0022:\u0022persistent_shell\u0022,\u0022command\u0022:command.unwrap_or(\u0022\u0022),\u0022timeout_secs\u0022:30,\u0022requested_by\u0022:\u0022test\u0022,\u0022created_at\u0022:1,\u0022job_context\u0022:{\u0022runtime_project_id\u0022:\u0022agent:ssh-agent:remote-project\u0022,\u0022workflow_session_id\u0022:\u0022wc_sess_p0aMg2K8XCywyBgl\u0022,\u0022ssh_resource\u0022:resource,\u0022project_cwd\u0022:\u0022.\u0022,\u0022purpose\u0022:\u0022other\u0022,\u0022shell\u0022:\u0022remote\u0022,\u0022command_preview\u0022:\u0022\u0022,\u0022validation_steps\u0022:[]},\u0022persistent_shell\u0022:{\u0022action\u0022:action,\u0022shell_id\u0022:shell_id,\u0022workflow_session_id\u0022:\u0022wc_sess_p0aMg2K8XCywyBgl\u0022,\u0022runtime_project_id\u0022:\u0022agent:ssh-agent:remote-project\u0022,\u0022cwd\u0022:cwd,\u0022shell\u0022:\u0022bash\u0022,\u0022command\u0022:command,\u0022timeout_secs\u0022:20,\u0022purpose\u0022:null}}))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ssh_persistent_shell_request_at_cwd\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"459bb6bcc8ceb95b50f4f9bd84382174b483d06d6927225624152b56e84ee692"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tempfile::tempdir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fake_ssh\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":3453}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4166f36bd782eaaa168d08049844d8194a57c9730979ab59cbd1807c5db85c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(\u0026source,r#\u0022\nuse std::env;\nuse std::fs::{self, OpenOptions};\nuse std::io::{self, Read, Write};\nuse std::process::{Command, Stdio};\nuse std::thread;\nuse std::time::Duration;\n\nconst PROGRAM_PREFIX: \u0026str = \u0022: WEBCODEX_SSH_PROGRAM_BYTES=\u0022;\n\nfn decode_program_frame(frame: \u0026str) -\u003E Option\u003CString\u003E {\n    let quoted = frame.strip_prefix(\u0022eval \u0022)?;\n    if quoted.len() \u003C 2 || !quoted.starts_with(\u0027\\\u0027\u0027) || !quoted.ends_with(\u0027\\\u0027\u0027) {\n        return None;\n    }\n    Some(quoted[1..quoted.len() - 1].replace(\u0022\u0027\\\u0022\u0027\\\u0022\u0027\u0022, \u0022\u0027\u0022))\n}\n\nfn suffix\u003C\u0027a\u003E(script: \u0026\u0027a str, marker: \u0026str) -\u003E Option\u003C\u0026\u0027a str\u003E {\n    script.rfind(marker).map(|index| script[index \u002B marker.len()..].trim())\n}\n\nfn append_start(path: \u0026str) {\n    let mut file = OpenOptions::new().create(true).append(true).open(path).unwrap();\n    writeln!(file, \u0022start\u0022).unwrap();\n}\n\nfn direct_program_len(args: \u0026[String]) -\u003E Option\u003Cusize\u003E {\n    let bootstrap = args.last()?;\n    let rest = bootstrap.strip_prefix(PROGRAM_PREFIX)?;\n    rest.split(\u0027;\u0027).next()?.parse().ok()\n}\n\nfn main() {\n    let args = env::args().collect::\u003CVec\u003C_\u003E\u003E();\n    if args.get(1).map(String::as_str) == Some(\u0022--grandchild\u0022) {\n        let marker = args.get(2).expect(\u0022grandchild marker\u0022);\n        thread::sleep(Duration::from_secs(3));\n        fs::write(marker, format!(\u0022{}\u0022, std::process::id())).unwrap();\n        thread::sleep(Duration::from_secs(60));\n        return;\n    }\n\n    let host = args.get(5).map(String::as_str).unwrap_or_default();\n    if host == \u0022fake-exit-before-program\u0022 {\n        std::process::exit(0);\n    }\n    if let Some(marker) = host.strip_prefix(\u0022fake-never-read-stop=\u0022) {\n        fs::write(marker, format!(\u0022{}\u0022, std::process::id())).unwrap();\n        println!(\u0022FAKE_SSH_PID={}\u0022, std::process::id());\n        io::stdout().flush().unwrap();\n        thread::sleep(Duration::from_secs(60));\n        return;\n    }\n    if host == \u0022fake-never-read\u0022 || host == \u0022fake-never-read-output\u0022 {\n        println!(\u0022FAKE_SSH_PID={}\u0022, std::process::id());\n        io::stdout().flush().unwrap();\n        if host == \u0022fake-never-read-output\u0022 {\n            io::stdout().write_all(\u0026vec![b\u0027o\u0027; 2 * 1024 * 1024]).unwrap();\n            io::stdout().flush().unwrap();\n            io::stderr().write_all(\u0026vec![b\u0027e\u0027; 2 * 1024 * 1024]).unwrap();\n            io::stderr().flush().unwrap();\n        }\n        thread::sleep(Duration::from_secs(60));\n        return;\n    }\n\n    let mut stdin = io::stdin().lock();\n    let mut owned_script = None;\n    if let Some(program_len) = direct_program_len(\u0026args) {\n        let mut program = vec![0_u8; program_len];\n        if stdin.read_exact(\u0026mut program).is_err() {\n            eprintln!(\u0022fake ssh: incomplete program frame\u0022);\n            std::process::exit(126);\n        }\n        let frame = String::from_utf8(program).expect(\u0022UTF-8 program frame\u0022);\n        owned_script = Some(decode_program_frame(\u0026frame).expect(\u0022valid Windows Direct program frame\u0022));\n    }\n    let script = owned_script\n        .as_deref()\n        .unwrap_or_else(|| args.last().map(String::as_str).unwrap_or_default());\n\n    if let Some(base) = suffix(script, \u0022WC_FAKE_CAPTURE_FRAME::\u0022) {\n        fs::write(format!(\u0022{base}.program\u0022), script.as_bytes()).unwrap();\n        let mut caller_stdin = Vec::new();\n        stdin.read_to_end(\u0026mut caller_stdin).unwrap();\n        fs::write(format!(\u0022{base}.stdin\u0022), caller_stdin).unwrap();\n        print!(\u0022capture-ok\u0022);\n        io::stdout().flush().unwrap();\n        return;\n    }\n    if let Some(path) = suffix(script, \u0022WC_FAKE_EXIT_255::\u0022) {\n        append_start(path);\n        eprintln!(\u0022ambiguous direct ssh exit\u0022);\n        std::process::exit(255);\n    }\n    if script.contains(\u0022WC_FAKE_EXIT_7\u0022) {\n        eprintln!(\u0022remote-like command failure\u0022);\n        std::process::exit(7);\n    }\n    if script.contains(\u0022WC_FAKE_STDIN_FAILURE\u0022) {\n        thread::sleep(Duration::from_millis(100));\n        return;\n    }\n    if script.contains(\u0022WC_FAKE_OUTPUT\u0022) {\n        io::stdout().write_all(\u0026vec![b\u0027o\u0027; 32 * 1024]).unwrap();\n        io::stdout().flush().unwrap();\n        io::stderr().write_all(\u0026vec![b\u0027e\u0027; 32 * 1024]).unwrap();\n        io::stderr().flush().unwrap();\n        return;\n    }\n    if let Some(marker) = suffix(script, \u0022WC_FAKE_TREE::\u0022) {\n        let child = Command::new(env::current_exe().unwrap())\n            .arg(\u0022--grandchild\u0022)\n            .arg(marker)\n            .stdin(Stdio::null())\n            .stdout(Stdio::inherit())\n            .stderr(Stdio::inherit())\n            .spawn()\n            .unwrap();\n        println!(\u0022GRANDCHILD_PID={}\u0022, child.id());\n        io::stdout().flush().unwrap();\n        thread::sleep(Duration::from_secs(60));\n        return;\n    }\n    if let Some(marker) = suffix(script, \u0022WC_FAKE_WAIT_FOR_STOP::\u0022) {\n        fs::write(marker, format!(\u0022{}\u0022, std::process::id())).unwrap();\n        thread::sleep(Duration::from_secs(60));\n        return;\n    }\n    if script.contains(\u0022WC_FAKE_SLEEP\u0022) {\n        thread::sleep(Duration::from_secs(60));\n        return;\n    }\n    print!(\u0022fake-ssh-ok\u0022);\n    io::stdout().flush().unwrap();\n}\n\u0022#,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fake_ssh\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dece0fb86764ada6eaba5f2d29f64305050b656e23569880ced4ee16361548"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Command::new(rustc).arg(\u0022--edition=2021\u0022).arg(\u0022--crate-name=webcodex_fake_ssh\u0022).arg(\u0026source).arg(\u0022-o\u0022).arg(\u0026output).output()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fake_ssh\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":3608}}}],"partialFingerprints":{"codehealthFindingId/v1":"994a3c35e82bf3d84f7b55495cccebc3ab1aef48af3d87df6cca741c03d37330"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060command.spawn()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060direct_windows_ssh_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":3661}}}],"partialFingerprints":{"codehealthFindingId/v1":"0613ed351313b7418cdfa8f8e39344118afeba04ef41fc4a52252987ae7fe6c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stdin.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060direct_windows_ssh_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":3663}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31185eb43b68d25e50306a3363521d7f2c86079c27d25884b3e13a18ba17942"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdin.write_all(caller_stdin)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060direct_windows_ssh_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":3666}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fab863d7fdc7f98506d3cf26484df1c0915493754436ae06edd6c80039ca502"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.wait_with_output()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060direct_windows_ssh_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":3671}}}],"partialFingerprints":{"codehealthFindingId/v1":"88701b867647486bf9f8f8fbe4ccc05650e429ec6a7313d96f709a777450624e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(program)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060stdin_frame\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":3692}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bf375517d19fbed431fb49b9f655498d1bf0ba2fa25d8a8376e19a1aedbc25"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_value(serde_json::json!({\u0022request_id\u0022:format!(\u0022request-{job_id}\u0022),\u0022client_id\u0022:\u0022ssh-agent\u0022,\u0022kind\u0022:\u0022start_job\u0022,\u0022job_id\u0022:job_id,\u0022command\u0022:command,\u0022timeout_secs\u0022:timeout_secs,\u0022requested_by\u0022:\u0022test\u0022,\u0022created_at\u0022:1,\u0022job_context\u0022:{\u0022runtime_project_id\u0022:\u0022agent:ssh-agent:remote-project\u0022,\u0022workflow_session_id\u0022:\u0022wc_sess_xu_vxXzu8_XUSoeY\u0022,\u0022ssh_resource\u0022:\u0022spe\u0022,\u0022project_cwd\u0022:\u0022.\u0022,\u0022purpose\u0022:\u0022other\u0022,\u0022shell\u0022:\u0022remote\u0022,\u0022command_preview\u0022:\u0022remote test command\u0022,\u0022validation_steps\u0022:[]}}))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ssh_job_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":3762}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63974c94250b4fa2cb6433c7fa9203da7a0b3271e5e92cfb3963ac35cdfccad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060request.decode_operation()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ssh_job_operation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/ssh.rs"},"region":{"startLine":3769}}}],"partialFingerprints":{"codehealthFindingId/v1":"e578190534649a5910d083cb247f06747d02260ce23984f45b66b0cc23f04955"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060resolved.steps.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060plan\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/project.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"61205ad02eb7c0cd14504ee578b713064eaeb0135c85a68fc2ec9787e89567e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026result)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/project.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb46a985e7be82ed2cd9a4bb37e03feda4bd22f28b10504fd27550a0f44fb043"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060registry::lookup_adapter(ADAPTER_ID)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_pyright\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/pyright.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab08a0691141d79f4b69d1e75b0d3954d3686cb0033fc1c98a8f2ce9d605e1ca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.get(3)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/validation_tree_helper.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6384f7a0abd4e693f090cbc3c15d5b52595ae0b9f0aa7e2d491b4e3f56ee16"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.get(2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/validation_tree_helper.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a324f90ca8d0dc19215f55796402d4e1eb3542bbeeb392ba82b8e4a6d34e0e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(alive_marker,format!(\u0022DESCENDANT_PID={}\\n\u0022,std::process::id()),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/validation_tree_helper.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0553ea29473b3fe96f66df96c0041ff6917d174bfc27a02561cf48e93cb65b5a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.get(2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_descendant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/validation_tree_helper.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c83ed28d740feb2b2b60ebb72be2fd4dc5a283809528990c4c65471ca3e671c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.get(3)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_descendant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/validation_tree_helper.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81ffdb7c8239fba3d2b25ed76326425f9671f85810508df0fd262b4815c5399"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_exe()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_descendant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/validation_tree_helper.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e11a7f9bab34c23e7f473225a480a087fddea15a183ced09ff261d01f622ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cmd.spawn()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_descendant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/validation_tree_helper.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab43b851b9c5ee5391e9f29789a8a7b3b81bf619c3c2ff34010757cd1c3b807"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(parent_marker,format!(\u0022PARENT_PID={}\\nDESCENDANT_PID={pid}\\n\u0022,std::process::id()),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_descendant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/validation_tree_helper.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17800f179147665e58a8ebedb476d157ac242b6ff4be1f9f13c880fb5b76422"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::io::stdout().flush()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_descendant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/validation/validation_tree_helper.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1605e28b8cab70dd8dec543a666ce0ca3c82d82f0f95209afc56c00a5eb3f820"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060POLLING_IDLE_BACKOFF_STEPS.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060next_delay\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/backoff.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"39190705f0a8dc441fcde63053c9dcd7809774f3fef36ca15d43e89804368361"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.steps.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060next_delay\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/backoff.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ddef8859cc79728c28d25d05081f44004dad67025d1facd98936e6832dd86a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060conn\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060quic_session\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/quic.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9ffcd76bada20c6c01577d5e7a631a30f0baae466d473481e294703c2bff34"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stream_transport()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060submit_result_payload\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4a37991861651880df582bae7e7d82489a7cbbdf36d8b6e45e977e6a084856"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stream_transport()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060submit_persistent_shell_result\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15d0cdb8ca05a9ab7279ca259e12cd70ef783c042c90c69c04a44fc978a2702"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stream_transport()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060send_provider_metadata_best_effort\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e440b6945270e6ee7c3bb81d38c28cae0e9ac74c9c153ae103f4d011adbed0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stream_transport()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060try_send_job_update\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd527518ef27ecd8bcda3bdd6f09794a13b9b9ab584939db942858bd984793b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stream_transport()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060send_job_update\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/result_submission.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"0155f344c5f6a0402fcc57ee0549bad683937c3f35e91d75d4631ba988c3d0e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060initial_scan.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060serve_registered_stream\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/transport/stream.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"802d3f94695bc70680dcaf3ad42f9c97f7ab6b9da11590dda942d2f1f521e418"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060report_path\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060configured_node_project_job_command\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/commands.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"4032b8963a6c3f9c0b157ae8d3612f87f3b2046f2bfdb1fb348f0fceca4e8581"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060terminate_and_collect_pipes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/drains.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dce37669c1d3ad47b8989309def62f39de2b0906d75d6147a8bc809f623a519"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060status\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060terminate_and_collect_pipes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/drains.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7b4047b545c3e176a9dec225b2083138fe0ca2cb5621049322448b3ce13ace"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(stdout.bytes)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060execute_configured_command_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/execution.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd8301a7d4a6f74902c99345268cdf572087163ee442da540bc327231cacc3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(stderr.bytes)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060execute_configured_command_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/execution.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba23d5f562448283363b9e0d538aa74f016b1b2892153b1a9635b532e75742d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060incomplete_utf8_sequence_len(self.pending[0])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060push\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/output.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aedf5590e0763ee048b2c2fa355bfe48049cd26553cf8306cf8d59089a1c9f4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060deadline\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_process_with_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/shell/process.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a047f1ae31496a2f24b8441843b656e267b81c75674456e52a3d7b5245a0dd5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parse_runner_project_toml(\u0026toml_content)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle_project_operation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"940d7a27efe3fadc001ba432c9053a1f6b0d7b341f9292e67e320fe2ddbd4146"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parse_runner_project_toml(\u0026toml_content)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle_project_operation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/lifecycle.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ecd301ca190085f61fcb2ceb946b801c05bb9c32ffc325c55b292456469f48"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060source_root.to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle_prepare_managed_worktree_operation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/managed_worktree.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"25613454d13699d4832a628f369f7be6e53aac4255f1b71d39b4a707b91357d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060build.cwd.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_rust_build\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build/rust.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"4379a88b8084cb297693464016acd1b683686ca4f33e6eb0d46902b0bf80c77f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_rust_build\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/project_build/rust.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"05de0e16fd6fbf9a78133cefbb79cad80c1a5ab85abd9e9585750be7d996a55f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writer.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060with_writer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/input.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87de62ddbc3ecfcaae9b2b7427f600077002311ba5bb2e35ea9e15ad401acaf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.records.get_mut(\u0026input.id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060with_writer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/input.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0754c27ece9846a31e75ecb509320777386516c8ba3873d7b69925216853c58"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060raw_command.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start_shell_job\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/local_shell.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc009fb73cdbc7f3aabc88868df15e03939e4c53f1d1e0989d50c9ed46306277"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060request.cwd.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start_structured_job\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/process.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0435cb057be3fa35dfd64a928fcd4f43c018ad8be68cadd76abecbb74413848"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060commands.pop_front()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start_prepared_shell_job\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"505e67880237d912725d864aa8cb3643d328a14160921a238feb0834af8f2eeb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060commands.pop_front()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start_prepared_shell_job\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/job_manager/shell_worker.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"253e90c99c3a8d3afd5d4f6b4d776611c4dd8d9e974530f653e4e7073af10125"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060heap.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060select_entries\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/files/directory_page.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"754ef819b98ad1095a80f12c178ace38bc2ec5dda6dcfcc577c763488d514595"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060outcome.failure()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_live_acp_probe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/diagnose.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d576173c17e8612d8bd2a97382c18559dd4e8665e424b529de8a2278667daa6f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060outcome.failure()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_live_acp_probe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/diagnose.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"67df4a61c22ca9a1c7a8c57ee2f6b571e6e05124249e0a2a7a24b3d30f80f541"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060outcome.failure()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060write_post_prompt_frame\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/run.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdefa35df5f9b9e6d6f6b10a7cacf2db4ea88a156f92c7b4d22f86b7db2c909"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060outcome.failure()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_turn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/coding_agent/run.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"9674a43c693671cd18d45d2b41c66e8fd2752936ebd2dde126b87d5cb547915f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tempfile::tempdir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060temp_dir_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/program.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7402d51b8ddfe7dc45d23f3149bb637fc9bab98d8e44b03a1316752dda8b99"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(\u0026file,contents)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060temp_dir_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/program.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9b5d04c8c8d373181a3dbfc7848bb37482e74966c2c69695ae8538ed36f4d3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.get(2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ad0f2784d45546767081bdbdb2d642e3e25ac31f0944afb4eb2864f6b8b0c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(marker,std::process::id().to_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7953d6a41d5a7c18c2b6dd6feb126bdec1f507cffab9410e9c11297b94471367"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::io::stdout().flush()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1630582350372b58d03e805ec4a58a744b70975a95f42be06a6746c2838a13ba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.get(2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0492db9750243f78c661c720e67a3cfd90b107becb07f6d0e1d55a07336837c5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_exe()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2673bb2ccf78ba83b4f044599ac439ddb8a6ac8ec3fb33fa7b7e97235068abfa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cmd.spawn()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea8bff49318d872c4c77fe6c393f8943185de8b4296c1f9944e4423ebef98a4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::io::stdout().flush()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b547857add2f5ccd6f3c9d64e437ab421ee43bba9e52f15df056ca7675b1bfdb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.get(2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a55be90a109a87f5b05b326a5a8cf74245985b47a01dda1de3798d623c6630"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::io::stdin().read_to_end(\u0026mut bytes)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"157229f2ecd00bca0be9e4a8d2e2b2b2e080c525d74537f43576f25cac555d74"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(marker,b\u0022parent_eof\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bffe830f5ed230eda41273840760a6eb78d5d8dac268617724b85ea42b50d8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.get(2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_grandchild\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfc05bb9dbebf7ebd02703106e1d1e88395e05d598a28dbeacbb3a28e5fbf15"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_exe()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_grandchild\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e93168a7f92888e1037eb3acc2d855aaf81f3350fa900d548dc6fe8df782977"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cmd.spawn()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_grandchild\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2fc72c30366f9cbf810abe68fc89f3a49acb46f20d52b0a376b6d9db038a49"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::io::stdout().flush()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_grandchild\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-process/src/bin/process_tree_helper.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09c2a451a10e56287d19fe9080c2abf38eda341fe3ad3e6603c9f2eb11f27c5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.child.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060child_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix/launch.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b40e5880c06fecf569cc65b5304d58691987ed0ad900bcb31ac40299bd0f90"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.child.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060disarm\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-persistent-shell/src/unix/launch.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7893967df87070c9a80b1bd8f733575b5fead8a267ca7b7e8046868453130afc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022TARGET\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/build.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"604da2391eedc904ba895d3961a0609e20b689fdf2d26d6e19a3e12eb05e6a83"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[8..40].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_history_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_transitions.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fef9680af0e79c1690845176fe05b2de626511067198bf89102063350db0ad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060record[8..16].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_history_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_transitions.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fba2e6b7991204b4c26fee5a206f840f6936b3c22a03d950a71948efc617fa6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060record[16..48].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_history_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_transitions.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a5b298b57303f306ef93831f682a29bfbb709d46a3878a0c242cdd3a7bf221"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060record[48..80].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_history_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_transitions.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12e3535c068b9f5a7f173bd7e3064b39c9c625c89aac7719cfa51de996d22f5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060record[80..88].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_history_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-openai-tunnel/src/run_transitions.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db49039ad28cab38c4cf9035a225d9f698119cad16f70a9ac96d63e05f1f54e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060LANGUAGES.iter().find(|profile|profile.kind==kind)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060profile_for_kind\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/language.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0ae8aa204783e4d185cfe87b910f92981144afffe860fc9220cf962f3ffb57"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060operation_deadline\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060request_with_timeout_and_encoding_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-lsp/src/supervisor.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8c5d39a8f66544193bf3695083d89caf0ca705751714a8a681122fba4480f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060profile.effective_configuration_id()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060cloudflare_tunnel_profile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"68702e692559eebc5e64a3743f7c75b216a2140d15322f9502b406e03c66e1e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060request.token\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060configure_cloudflare_tunnel_profile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b135a881060f7668ed9557258858866259a1979b14556bdfe773303db3fc17"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060configure_cloudflare_tunnel_profile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/cloudflare_tunnel.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2c6620f62dd663c64f113d3a2bb09a350f09d8b489522606828457d9d18274"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060directory.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060verify_installer_targets\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/installer_authorization.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9130fc4065435dbcc1b8631405f7cbb07f452c8029f131d61f9046d200385039"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env_file.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060service_spec\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":2173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eeb9c733b8a34452ff5a9d90e95537f5ba8d51a1f3878b0f87ef85dd748c3da"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env_file.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060service_spec\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native.rs"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea42badf7fba0b158ac9ce5c6c32e3ca9a6f2fbf7cbd79c196daf95b05e6982"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields.get_mut(name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060task_fields\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/session_service.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2f47c89e9081fd4c0264c26874be1744a858a0bb2a2b2f4156073dfc4c6ce8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields.get_mut(name).unwrap().last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060task_fields\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/session_service.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f049eee224a4d03f5a224e8495f14902cf1f508a8ad39a5871cbef37e468cf2e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields.get_mut(name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060task_fields\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/session_service.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"344891ff1ca129163762e5e85c35bd53cdee9cdecf96df31f25c44b67f860290"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields.get_mut(name).unwrap().last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060task_fields\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/session_service.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d350fead361bbf22ac85f8f2d9703ab18fc97fe03f02860569cb8498d5a9cd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060install\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/session_service.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"84642dc9e9852667e8f0be0d063582835e9787fcd8425be7bce404fb82a07bc9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060install\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/session_service.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e6f37f95925f3ad6252d06cb8a4edba88b2c7ba9d7ff0e953a1815b8403b9a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060credentials\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060commit_profile_files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"db666e885aabb4e85e8af7e4391149d48751508c25db774ebbc70d6ad866d08f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060server_before.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060configure_tunnel_profile_under_lock\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0610bc5dd620b986173eabfa56adba12cf3d477c515beaee45b63a6ba326f2c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060server_before\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060configure_tunnel_profile_under_lock\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f263e98955ddf02136214e459dd525e124e2b314986973e9dd953d30b0af259"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spec.env_file.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060remove_tunnel_fenced\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/tunnel.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae6cdc649930d7fe6ca8e9d0af9505a977913c7f957003ce0e5f71385004885"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060runtime.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060managed_desktop_target\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c2793096356c17702c5fae2b944b9b70f12e12f5353a1e4f7369a0241ff76f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060kind\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060classify_builds\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/windows_package.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d693a1f9c50d9c7be9c5a0a107810dc6116816adf33d3ba7dbbfcab2014a0f64"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060kind\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060classify_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/upgrade/windows_package.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5c4716c3f0096f4c52b46718f5e2196807b56039e07b2efce998681d3a4df0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SERVICE_NAME.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060service_main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/runtime.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5b8df912cfdeacfb06ee363c0f984a4d3b343c212d08e1d5b8cbda25785c29"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RESULT.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060service_main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/runtime.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba91c500e88916770ed7e9235c0c7bd4b6c641376fbffa73e88002fc09357faf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ENTRY.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060service_main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/runtime.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cde3ee4d43c9fc7d81cd652ea6d245e2e770aa7604e2b4849dd50b5e5e10bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060STOP.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060service_main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/runtime.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"00eb70cc74e626ff52249740989f2fbfc7008d993e4ff3a93b77411f99fd6d83"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RESULT.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060service_main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/runtime.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdc6cabccbb07e0ca4daa8bd73e944c6c97123ba474fa0f9687a2c129fbd0c5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SERVICE_NAME.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_windows_service\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/runtime.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2576aff6bd778e2f46273e99282cddee4d37caf2de99d3823cf2440c5d0064"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RESULT.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_windows_service\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/runtime.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ebe93980711bf50719dc3a82e35a709d86737b4630703c563229bf49fbaa2a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060owner.child.stdout.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060capture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/process/unix.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16f076e96ec272db9bf44de3bd54b3bad070d1522780e1b8114eabfc9bc275b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060owner.child.stderr.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060capture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/process/unix.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9800b02ec68858892cc4f0be845dda766436a09e3116738ebf391779375e140c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.child_mut().stdout.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060capture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/process/windows.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab799c735574580be6f70bc9c1435cd97a2e34274a9441d7b9c6219ca1d29a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.child_mut().stderr.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060capture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/process/windows.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8844605a3b1121896940ce4f7ac1c15bde54500a1331e3fb60a375f25951934"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pending.config_change.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ensure_project_authority\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native/project_addition.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7eaf96342815f7a02fe9b57b94e8956c1f8f11f8eff7477c500e1b071223a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pending.config_change.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ensure_project_authority\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native/project_addition.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fe155f18611e7bb05e777378e0d399f186510226de516dfc80df046a303f75"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pending.config_change.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ensure_project_authority\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native/project_addition.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0202c2c7b3e035d921d4a2f7dcc166877cecc5dde5cd489e7d68c16967d293"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pending.config_change.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ensure_project_authority\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/native/project_addition.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8528eb751faf7d1b81b188e0a5bc785d700d8e5cc1b97b48cb3f3c18c627b4e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060working_directory\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060location\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/inventory/configuration.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efbff952194060cda40a7977cb5064dcaaae01b9efff5077e6daa700e6cc042"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060start\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_apply_text_line_range\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_edits_shared.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bf97cc4f66aa004794190a7493e12da7f20c61489c0df044c0107f51626107"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060selected_occurrence\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_apply_text_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_edits_shared.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84dea054c70d97057018b17c2301722f6cb7268c9aa1eb3cc728aff2d87ceeb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060selected_eligible\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_apply_text_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/apply_edits_shared.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c436fa83010f0426d7dc9296a0d9eb8684f994eb9fb411594f44ad3efe1cea2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026self.machine_build_info(binary))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_info_json\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/build_info.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"248efa1faa2738dd15d1ecb88940cae6e08f916e8901ceae52de7e93314852de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060response.error.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate_response_for_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/coding_agent.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdabc39d4f542592ed7d573ed6984421ae090e812395fc425d37e3a881cfa52f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060getrandom::fill(\u0026mut bytes)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060random_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/compact.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26be70a72166c4809d7e08e2cee6b3d39dc5725c16aec8214ee4e95ce619162"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(encoded[index..].to_vec())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060encode_base36\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/job_observation.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da7ae79ba937a902746e34120eca39870753c0931d3952267d579319dd74995"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cursor\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060project_log_stream\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/job_observation.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17bb439f20267b292a081f389f6897653a97eb5b815719f1d591510654d0ce9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(process)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060project_build_invocation_digest\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_build.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"93067fc81771b05ebb19f596fc831202fa69a64f50c23a669bd1541625ae6a60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060combined.scan.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060retain_unavailable_scopes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/project_instructions.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2c3a79aeebef090a8234f2be98f4b0037bc944c3acbf1072c885fc318ad699"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(self)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060to_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runtime_contract.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f841747dcf73aedd761940af3bc16366bb677f28cfddcb155cabe165448bf80"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(json.len())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060encode_quic_json\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/runner_protocol/transport.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fca075aeab986c7b88b65673117ea9da5bc76c609ec8dd6bf735b872323693a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.handle\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060data_handle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/clipboard.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b849baf23f6acc5b020cdfa436acd0381d1b7569fe485a0d9cc4fb2353a2f35b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(offset_x)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060map_windows_pointer_coordinate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/input.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfb469570f2eb30651507c36068ec7edeeabc5531a046b20b425d2328684886"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(offset_y)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060map_windows_pointer_coordinate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/input.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"001ff3958f2ec9a77f15b2f5d377e0e0b1504217da1020ad158bfdc859f4b529"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060key[1..].parse::\u003Cu16\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060windows_key_mapping\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/windows/input.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b150fa9caf89c7452e1d984bc9bf9091080dc4755714d32cf0c301940cab278"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array.iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ax_element_at\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/accessibility.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"31dcc3f5812c403e7de7dcb3ae68f21bb4f1ad2a5ef8d48647e46ffa7287592b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060macos_bound_display_identity(\u0026stable_identity,[stable_marker;16],display_id,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060descriptor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-computer/src/platform/macos/display.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfde8229c59ee627fca25a5bd532a1204896ed5a7edc6cf175e07158902d42d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.join.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060take_join\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-code-mode/src/runtime.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5d9ac20120a49b54d7b6c99fbd4e2159a03ca083b0313136c0b5f9b3b7e862"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.command_tx.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060wait_until\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-code-mode/src/runtime.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a901f15a3425f6ffeb13cbc8bec1c1a847f06ef79fda0c25381040432aff9f9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.event_rx.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060wait_until\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-code-mode/src/runtime.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ac2442fdbaf46b6069609b8051773d6f2e323803f90c99652d690f4a430b54"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.join.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060wait_until\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-code-mode/src/runtime.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"10633c2ca7141d3b3eef0e395a4caa8dabc62e388c405fbf76c34b3f2d2e5f91"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060identities.remove(\u0026task_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060next_in_flight\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-code-mode/src/runtime.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e842c3beae9e24610c33e9df46bf7d2e841dfd1b1cbae05473278e9ab4dafb5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(info)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060management_build_info_json_for_platform\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b43b41884fe54c78c9ef22195e65e346231947f983bee5217f0c667211e0dbd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(info)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060management_build_info_json_for_platform\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdc6f9c29548f5235504511900fe7087003ec7627d2230f52f3c2cc695f0dfd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026raw)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060management_build_info_json_for_platform\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/lib.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c500941a5cb473594abbd123e1f26d8c7e42b6e38266dea7b603c5e7000840"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.runner_monitor.task.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060poll_runner_observation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_runner_observation.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cc6d75d08d2942f60bcd92322ef071763ade36321d880cf5c5961a1f302eca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.child_mut().stdout.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060observe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_tui.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5a8d86e75e33839b58409eadbc910791d2a42d0801e9a57a40970e3437a7ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.child_mut().stderr.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060observe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_tui.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bb0f498418dec1a55e64d7a535b9f290be4f6daf20885e74b69170d41d6483"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.logs.pop_front()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060log\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_tui.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5e85786b9241e22b6994cdcbf838b0807b849d27e2fce0452b345fd9f54a92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060matches.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060select_gateway\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_wsl2_nat.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a0f69856c4d667f7764863b976860b60bf76e150f894972e277d42b7b592b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.wsl2_startup.task.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060poll_wsl2_start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/controller_wsl2_nat_startup.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e192a61db8c2f370112147f94991492a3d0ec8fdb0252eab0d6d2612b47e3ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060headers.as_object()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/mcp_config.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29f395dd9d1e2f8a9bdbc524e769e82d9d8d71ff1df6c7b3cc104118c34f2dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060systemd.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_runner_status\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/runner_service.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8cc63206a6c958f9717185132b05a83e6ee445e08f743b41db93b1adb5695a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060systemd.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_runner_status\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/runner_service.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"c213fba9e468ce4e796b14f6e73624c8f30c6e0f893b457e6f1530d3f628b29f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060systemd.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_runner_status\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/runner_service.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa02429343101a7e48e96bd472ef8b52d1be9c8502f0ae24d45a476c123c408b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060existing_config.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_oauth_connect\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/oauth.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0e0de04202308e93b6cc8482890e59af7a97cbade53254e655c9f4fd82e06f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060local_runner_state_summary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/process.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"58419ba8c8813b7bd590bbae8f6c05b53be2881849113a0b96b0d14391d4da6d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060url::Url::parse(server_url)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060server_host_label\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connect/profile.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8942e16d389f543ab083019495caeadb79f3e87cd06c3bd86f89c257dd7b071"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input.version.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_at\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/update.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"499f0c15321b73a75c1001b7410cd7d8b14319547fe0c54a9ab71aa31b058283"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input.version.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_at\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/update.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c488e603fb738ccc85499cdfad3f113cbbfd99de820421c276747b464cf18a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input.operation_id.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_at\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/environment/update.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c20a415d167e3336f6261d6f28411a79840d3b18fd9fdbf9169ceaab7cfb44"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.collectors.get_mut(target_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drain_target_collector\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed26ba267c45d9ad6e904dbe68dbd8b1019ca6fd35ae939e76785bcc63c64500"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.collectors.get_mut(target_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drain_target_collector\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6855fd0f1cb47c33512ad60ab1ed895c075d9f74eda61a37c950344af9753f2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.collectors.get(target_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060console\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bb7e4bd839e0f54bc465a41bbef5d40244c33c80f6fb386b20f1839b5d2f28"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.collectors.get(target_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060network\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"771ce8d9c37dcbfd8b982a734ff0a9494a2679fa63ca2038658d2b658f478739"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.collectors.get(target_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060diagnostics\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"190803d22f8a243db96ac83f8a1e0819b62ee8db60047c60e83fcbb39d5c543d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.collectors.get_mut(target_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060clear_diagnostics\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e21f99873483cf91f3afceb8819f1428210635e787dd1515d84839c1b428dbc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.browsers.remove(browser_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060touch_current\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/supervisor.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd8b20c8af4b30ddf9a5cc04180dbcb2aee8b439ec0397e1fb1e5022dddd1a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026(ids,\u0026root[\u0022backendNodeId\u0022],docs))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060frame_fence\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/cdp/frames.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"935f5ab6a8c7f68401ec2de518c9a98f68f741eecaafcbc42a5a8e5991a0d8a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.bytes[..4].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060poll\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-browser/src/bridge/protocol.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3abe18e001f5afa3c021277ebf7bd69f600b66fbade9996ecb736a9ab4a96c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var_os(\u0022CARGO_MANIFEST_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/build.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dd912131bac9735f06d35fee9ef54509be8e828319bce30bff01d230be54ff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::path::PathBuf::from(std::env::var_os(\u0022CARGO_MANIFEST_DIR\u0022).expect(\u0022Cargo manifest directory\u0022),).parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/build.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be6ad5c683b605ce9aea0e623354e2baedc0b2e9b465df8bec28067278c516f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::process::Command::new(if cfg!(windows){\u0022npm.cmd\u0022}else{\u0022npm\u0022}).args([\u0022run\u0022,\u0022build\u0022]).current_dir(desktop).stdin(std::process::Stdio::null()).status()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/build.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a580396f84e4ad7d2ad492ffc10bdd9238f7add1a237abdd725aa956435b0218"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Command::new(\u0022cmd\u0022).args([\u0022/C\u0022,\u0022mklink\u0022,\u0022/J\u0022]).arg(link).arg(target).status()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060create_junction\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_data_dir.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"179d4b4ad8a3d1b37c1f5db5fc52baece783f766fd8e2d41f744c5ba5cf1ae6c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CATALOGS[self as usize].get(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_locale.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e10fb574965c9e3f6265f546790124f76fc948b2181bcbdca0cd812d9c6324"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060desktop_builder().build(tauri::generate_context!())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/lib.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac30e1f72d18633ead1493a749dde81ebd6cc939a738b67bbfb7f5144ab7b91"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writer.file.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/lifecycle_log.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"426b92d0e024e200260d4ee529455d2663f3a41646c86122b5ffddc0f452aad9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writer.file.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/lifecycle_log.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7102aefbe453c2f094dbdc9b488ed3912adc82e8a7bc3f6e044336736d76b457"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.file.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060append\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/lifecycle_log.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b3bd0441941eb4cb3eedc2153472baae25383b31fb745f529ff513e83bc561"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.binaries.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ensure_binaries\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc58e84415acd6497c0549986c8cca5287e5e9c35edc943c951a1da4c735abd2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.binaries.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ensure_binaries_until\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/adapter.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bbf9b26bdc59c8b7acad7359b65177e3ba2d8c8081b8fc8c13203a1284b894"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060runtime.runner_config.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060preflight_providers\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/webcodex/settings/provider_preflight.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bdccbd51bc0562a4ba3921076365e5c44d4d84a77596c75870dafe6465a955"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060webcodex_environment::unified_update::RuntimePlatform::current()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060target\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/updates/install/native.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5df7e970f34bb05dcc75aab9e18ae6b802c0da537117dcadca3860c6f8e405e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060InstallerTarget::default_for_non_linux(platform).or_else(||InstallerTarget::for_platform(platform,PackageFormat::Deb))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060target\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/updates/install/native.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a42a39b38724142c591ccd70235e2c6838486d94a0e69d55f6e133beefda2a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.run_on_main_thread(move||crate::tray::handle_menu_event(\u0026handle,\u0026id))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060menu\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa3bc4524a03766558c9efc7ee2eacd42b1d7b683d4a07fa1de2b5bbe0835c6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060webcodex_environment::default_environment_dir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38bbe91d6d4f45609b990fc2c11125348a272b92d2c8a2ea7eadaac83aa040a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060EnvironmentStore::open(webcodex_environment::default_environment_dir().unwrap())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"74dcb07fe9a9c0f22a4e078a6992791a1353c65ebcfeed73868e157a7968aa20"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_exe()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bb51dcf465093752b3d9c7d388c84f96c6e51d3961620c3b78700270a301a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060webcodex_environment::current_account()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07fd73619c2338ed9805bba12a4c3ea84840c6769729bae28648b0c7d99a8d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.save_environment(\u0026EnvironmentRecord{schema_version:ENVIRONMENT_SCHEMA,environment_id:environment_id.into(),request:SetupRequest{service_scope:webcodex_environment::service::ServiceScope::System,mode:EnvironmentMode::Join,server_url:\u0022http://127.0.0.1:1\u0022.into(),project:None,runner:Some(true),runner_display_name:None,account:webcodex_environment::current_account().unwrap(),binaries:RuntimeBinaries{cli:exe.clone(),server:exe.clone(),runner:exe,},},username:None,runner_client_id:None,projects:vec![],configured:true,})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4f2764e416ab03217d5f694a057d29f07734f50a736321b1ea729156fdfbcb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(\u0026dir)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2bee04a1cdc499650d7756d24b893dbe57d8e93690e2ccb5bb62637a74bdd6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060LocalControl::persistent(\u0026dir)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2caa04f022a77d22929a17a49bc8f5a6bbc6b8519c2a1df59ec1fb91c73b41c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060control::serve(\u0026dir,gate.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4aaf00cc0e85aee10f6d5775ba7373363fa5a8a6c9927d2d1389c5ae288990"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gate.snapshot()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"51336a7b4b92cd9b2d52d8d10345ca046ace38722583ab3819a31a519684587c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gate.snapshot()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9927637bd97c33cda7821393e874d64c58e3ef8739a959b3a8a6e8c45e2935c5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gate.snapshot()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da464d0f6b7a29026a5799f1af915012e2fde8c70da9701f2ba834cbf962ea9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060LocalControl::persistent(\u0026dir)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d24544bf54d31be9b00250d5f71a98e69a840f0cab6b01d53c30fe41780f22"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060LocalControl::persistent(\u0026dir).unwrap().snapshot()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1693d16bc218064a448aa71ce884db45e10409c542c5f0f9da8561a5330022"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gate.begin(false,None)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e400ff6374c16cefda680aeec9f96e4249e8decc119418d922dfabf2d59c47fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::computer_control::observe(\u0026state.get_state())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d923dbc8137d5c2276317b96b823ca41e6bf5cb783308e89c5d55ed213bbec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gate.snapshot()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"324bc5baa70b31399dd3dc3e8ea20e42c4fae3945b0d2a0e006d413db2b9335a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gate.snapshot()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c12345bd1b5ae3eddc34f4a8a2bfeea52e7e7c20e04c35582d8d8e114f90dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gate.set_paused(\u0026current.epoch,true)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98b0a39cce44980a66763a321cf58579417eb80b534d59028aa12c47ee31fb5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::computer_control::observe(\u0026state.get_state())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4601c0ed63ea54acc3680f0cc76bbb10ca9adaa7f247d2c383ae04cb706b732"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gate.snapshot()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b505fd9106886aaa25fcd8ab7f40d7810efab24731753e85a51dd0c0b42245f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::desktop_shell::show_main_window(app)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"994ba721f0b8917f504f18a36de885f4aebe215b75c227101c8f84b82806bff8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.get_webview_window(\u0022main\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1cdecf90f514ad7be94450a95d9e1e6ef49ef2e1d5b169aa8ffba5c0623c48"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.get_webview_window(\u0022main\u0022).unwrap().set_title(\u0022WebCodex Computer Control smoke\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"41904e82aade2525262e911b36d5f886f9a98b046109eb5450424ba6a0654e2b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gate.begin(true,None)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbe1a876515df828ff812e8f98065b227cde8c2dbd983ce9fd106761a5d6dcf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.available_monitors()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c670d6c923ce35a09f026ee8786956563dee112a0f6c390ba5935cb918a1c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.available_monitors()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec5f9686330ad61bb2b91d5f5c9c4541e1b1271ee422edc867c9a9bbf91054e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.get_webview_window(\u0026format!(\u0022computer-activity-{index}\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6f52cff869105ce41459ec280b0a6e1fea653dd2f9de4ec517ec1790da8721"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060overlay.hwnd()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e11321270b08f66e295d1e249ee11edcc451295e73acb70f993f53bc56e273"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.get_webview_window(\u0022computer-activity-0\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef4c95731c743d1a5a133cfae5fb8ca077ed7b052cef07fa7dfd4069bc3ea77"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.get_webview_window(\u0022computer-activity-0\u0022).unwrap().is_visible()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7050d2a45a8978f98d8ab1aff08d67cefbdf8af7eb9262151aea1e72f14ab978"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window.is_visible()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd306e37e5e35d54a3d2bd255e201372f690d3da80390d0da71b0336b8cc67b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tx.send(window as usize)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"78377ff2a986ae2223f08faa43c4bc7e2d3e13d8fcc3a51b72b7d80d6cfbb067"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.run_on_main_thread(move||{let class:Vec\u003Cu16\u003E=\u0022STATIC\\0\u0022.encode_utf16().collect();let title:Vec\u003Cu16\u003E=\u0022WebCodex Computer shortcut fixture\\0\u0022.encode_utf16().collect();let window=unsafe{CreateWindowExW(0,class.as_ptr(),title.as_ptr(),WS_OVERLAPPEDWINDOW|WS_VISIBLE,120,120,360,120,std::ptr::null_mut(),std::ptr::null_mut(),std::ptr::null_mut(),std::ptr::null(),)};assert!(!window.is_null());assert_ne!(unsafe{SetWindowLongPtrW(window,GWLP_WNDPROC,keyboard_window_proc as*const()as isize,)},0);unsafe{SetForegroundWindow(window)};tx.send(window as usize).unwrap();})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"066232b6529c5e59f3a2dc049223f2c988db661f50d97eb4a3669e92bf46fe24"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rx.recv_timeout(Duration::from_secs(3))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c673a866a572d88abf26190f688942780e50e1f0ba6dcf4a70745cd86abe62e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gate.begin(true,None)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"5313e75d01c3b48a30a4c50fef240a160f14a30fbf98d5db58f5999d0a0cdb94"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gate.snapshot()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e667f02948b22d8000dbe7ca402d07df2a440fcf2fd34172f1ae3ae18848e3b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.run_on_main_thread(move||{assert_ne!(unsafe{DestroyWindow(keyboard_target as _)},0);})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/computer_native_smoke.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3b8e5b9a1f5f9e3519d9f1a6b3d081a00113b88aec89e1ac6ba66df82346fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060project_identity.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060refresh_runtime_status\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e63043ab91c9e1b64574d957b0b17a68d3e42a69d67f7ef0773eb4b8351843"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.config.runtime.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resume_saved_runtime\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"119873b0ba292ea280076ee23544e6934c9b1aa597345cce041dd2bab32cdde9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env_file.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060configure_local_setup\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"f059c49379a813fba1c0f861e2bd553414d6b3d6aacf47b18fdff2b22f953685"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start_quick_share\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/desktop_core.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"4260d3dc690bf013d8ecaa7ebe224a0e756b21eac1d4fdc6b5dfc360b8204aec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060selection_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/runtime_shell.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c6e1d954f17211a58dd57cbc734e95eeb6a02e9eea75c4723bc2853d5bda95"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060persistent_trace_target\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/diagnostics/tracing.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c222962932853930e4c6496ec40b17da2175b5f3218bc0fde1cc9cfb474fbc8a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060local_trace_target\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/state/diagnostics/tracing.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e640eee60c22e592f0796e46a4aaab6ebab7560cd2932a3a1f13db2be83959ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.run_on_main_thread(move||crate::tray::handle_menu_event(\u0026handle,id))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060menu\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"574a172ffa88a85f933ebef8f966952f8364422ffd885e933c5ce831bbd32cc4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window.eval_with_callback(\u0022document.querySelector(\u0027button[aria-current=page]\u0027)?.textContent ?? \u0027\u0027\u0022,move|value|{let _=tx.try_send(value);},)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060active_page\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabf7139eaa927b65871b13d28368ea594330f519a87d46aadecf397b88f1baf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rx.recv_timeout(Duration::from_secs(3))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060active_page\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3822371c657f83756c01334e877ea6a77445f1cb81bd736f5489710983cde8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.get_webview_window(\u0022main\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8bd3ef12de7e6006320a8e55efe0fd43f809df8bc2609ab14d7e9a225d488c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.get_webview_window(\u0022main\u0022).unwrap().close()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"279b08eda75f2656159f608cf8ed643e48456db01aa2ec89e3bade641e5bb584"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.get_webview_window(\u0022main\u0022).unwrap().close()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exercise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ae2eef7340af01c32b98cf7868c0959a7e16e62ee72992306ad49d66ca141b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tempfile::tempdir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_native_smoke\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7ef376b39e8613e13c67a3b4500c3c06148cc5650383b67cc3ff093c6e9f4e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060webcodex_environment::current_account()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_native_smoke\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d751221030449fd3a120e80cd451ff499df9cf5e18a54ae024520bafde4ddb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Command::new(\u0022icacls.exe\u0022).arg(root.path()).args([\u0022/inheritance:r\u0022,\u0022/grant:r\u0022,\u0026format!(\u0022*{sid}:(OI)(CI)F\u0022),\u0022*S-1-5-18:(OI)(CI)F\u0022,\u0022*S-1-5-32-544:(OI)(CI)F\u0022,]).stdin(Stdio::null()).output()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_native_smoke\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"88379200e73a661d0b5788f75e5c9576db6b8d1b532c504080645349048a12c0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(root.path().join(directory))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_native_smoke\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e33d01c3351c2afe235d7be02c4198e88268bb6f8524eeadcd68ea7fb58bf0b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_exe()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_native_smoke\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4a9a8719d5825ef66660797953a26ff63285d8d2a8adf2f031a93d03d697ca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Command::new(std::env::current_exe().unwrap()).args([\u0022--exact\u0022,test_name,\u0022--ignored\u0022,\u0022--nocapture\u0022,\u0022--test-threads=1\u0022,]).env(CHILD_ROOT,root.path()).env(\u0022APPDATA\u0022,root.path().join(\u0022roaming\u0022)).env(\u0022LOCALAPPDATA\u0022,root.path().join(\u0022local\u0022)).env(\u0022WEBCODEX_DESKTOP_DATA_DIR\u0022,root.path().join(\u0022desktop\u0022)).env_remove(\u0022WEBCODEX_DESKTOP_BIN_DIR\u0022).stdin(Stdio::null()).output()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_native_smoke\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5779db8185107cf0a57c135eeb1dc9310cb76bd0336ff231b303d60c5eb3dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var_os(\u0022APPDATA\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_native_smoke\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07efb4e55d5e5f221ef715948336169d9b54d03ebf339c6240395adf236f115"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var_os(\u0022WEBCODEX_DESKTOP_DATA_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_native_smoke\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e63da6b9662e53fe3204527420970b4af5f5d82806b64bd3c03159cf788c1e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060webcodex_environment::default_environment_dir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_native_smoke\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07b415ce66c1a0c48a16b2a83243b2a56f61a5b5959cd9d4ccc97400b37a4cd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::desktop_builder().any_thread().build(context)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_native_smoke\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src-tauri/src/desktop_shell/native_smoke.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4668d4c41e8a1aa0b59c6c04d8cb733925a41c5299fe26e6eea4d34b7589abd7"}},{"ruleId":"X5","level":"note","message":{"text":"Nullable reference types not enabled everywhere: 0/1 C# file(s) are in a nullable-enabled context. This repository commits no project file, so nothing sets \u003CNullable\u003Eenable\u003C/Nullable\u003E for it: a file is enabled only by its own \u0060#nullable enable\u0060, by a Unity \u0060csc.rsp\u0060 with \u0060-nullable:enable\u0060 for its assembly, or as a file-based app (\u0060#:\u0060 directives) whose \u0060#:property Nullable\u0060 does not turn it off. 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 parse failure: \u0060_matches_python_command\u0060 returns \u0060False\u0060 when \u0060(SyntaxError, ValueError, RecursionError, tokenize.TokenError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/agent_temporal_evidence.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9c7adab8b2557d90bd90c50d433cb6318147a720a0878eb919c91d8a023a54"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060window_headers\u0060 returns \u0060{}\u0060 when \u0060(OSError, ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/claude_window_headers.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b44ebd4b7df73854dda7ea10a7c427d3905ed6165a9ff27d169e9001b9c9d9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060real_subdirs\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connections.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"52110f06fed053b543f5ef79571f9d05bfde4f0e17fabc8010b413085b847175"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060connections_for_server\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/connections.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a37f89dd8889c7e1ecd98e2abdbc42517ab16a300d6aaac937073ea38268512"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060query_status_output\u0060 turns every \u0060Err\u0060 into \u0060\u0022unknown\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-cli/src/webcodex_cli/service.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e6a73e58f97ae8135c5771161a605a1957c6846e61c877ba4a3a68e13d67c2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060to_stdout_json\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022format\u0022:\u0022webcodex.agent_lsp_result.v1\u0022,\u0022success\u0022:false,\u0022error\u0022:{\u0022code\u0022:\u0022lsp_protocol_error\u0022,\u0022message\u0022:\u0022failed to serialize result\u0022}}\u0022#.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/lsp_bridge.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fbac4b06e8e641b5adce32aa017d4f029c661bf0526b2ac303561c49bbd7c2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060to_stdout_json\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022format\u0022:\u0022webcodex.validation_bridge_result.v1\u0022,\u0022success\u0022:false,\u0022error\u0022:{\u0022code\u0022:\u0022protocol_error\u0022,\u0022message\u0022:\u0022failed to serialize result\u0022}}\u0022#.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-core/src/validation_bridge.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f188096db379bcaf736e8561d38eb1ae89a4c6ccc4c1afc59f936ed24b5cf90"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_runner_project_shell_contexts_from_dir\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-runner/src/webcodex_runner/projects/catalog.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a948a076d0e0a8a8ffeb0cd1e937d351fbc58038b6b7e654c44e4e88f2191f2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060allowed_oauth_resource_indicators\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":"src/oauth_http/managed_authorize.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"9946f5d371f624c1f0a015a6fe94d2b6f8a6ae5c74cb7afd359f97b1fd3e7159"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_persisted_share_project_roots\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":"src/project_entry_share.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"831e171f82af391874fb8f90b3ef2ddb589b59a518b69f950576e408a2ceadd4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadSelectionPreference\u0060 swallows every exception into \u0060return \u0022accent\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":"frontend/src/ui/selectionPreference.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"208c8448a4b766f15b09267264f117a8844d32c707a7bfb0fb91b8f952b7991b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060storedAppearance\u0060 swallows every exception into \u0060return \u0022system\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":"apps/desktop/src/hooks/useAppearance.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f12be0d470da474dbdada9d8b0a400cb864f48752c30e46e94d63924220e86"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060storedLocale\u0060 swallows every exception into \u0060return \u0022zh-CN\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":"apps/desktop/src/i18n/locale.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"df97d4be3dae9d0c705996d7d002519686bb95c75a7fb8c732a48b0cf1352616"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060display\u0060 swallows every exception into \u0060return \u0022\u2014\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":"frontend/src/admin-react/model.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ada77c10df139b90ea3b6432ab907bee93965b9cd7c17bd04977ed1640da254"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadAppearancePreference\u0060 swallows every exception into \u0060return \u0022system\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":"frontend/src/runtime_storage.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87ec49edc19fc231b0ab10b61567146d180ed784e3061410f2f25006e778082"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadWorkspaceViewPreference\u0060 swallows every exception into \u0060return \u0022home\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":"frontend/src/runtime_storage.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c361cbe9b31009f07164860d634e5c021e77f717e93c96337b4272bf7bea087"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadRememberedRuntimeCredential\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":"frontend/src/runtime_storage.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a83d6bea6f627eb3343dc24fef07fec0b86c439b2737b36a86b32a1502b4c5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadDraft\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":"frontend/src/runtime_storage.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"978ba74f6dc7f6609c105c75fca1fd32b49a224ea1d5814bcaabde9cbd0d8f54"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060WindowBoardSplit\u0060 swallows every exception into \u0060return 400\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":"frontend/src/runtime-v2/components/WindowBoardSplit.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"915abce0beb7460419b0be25bf426a72dcecf8f06fdadb2d188de7681825bce9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060captureProtectedNpmEnvironment\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":"npm/webcodex/bin/wrapper.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ba3b17c2694aa85d958fdedbd5d2077d076944b1aa3092f1bbfe4a2fba627f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060displayUrl\u0060 swallows every exception into \u0060return \u0027(unavailable)\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/agent-browser/src/config.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d459891220b4f688c079a14281d999ea0202c9c72911043843b6b292187fae"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060mappingSiteIdentity\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":"plugins/campus-application/src/mapping-memory.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20222272902fb8223f7c7bc82c3738795d18e44b90c9f4d9ac5ba6c61625c3a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022client_secret=\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022client_secret=\u0022)\u0060 also satisfies \u0060lower.contains(\u0022secret=\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":"src/tool_runtime/checkpoint.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd94597709441f8caa3ee941acde1fead94cdd8fc1359e7655662564439a7c68"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022working directory\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022working directory\u0022)\u0060 also satisfies \u0060lower.contains(\u0022directory\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":"src/tool_runtime/validation.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d16fba6782fbc653c00228ca3a01a6c05a30c81e73a8028ff47047baf52f68"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060cmd.contains(\u0022/usr/bin/head\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060cmd.contains(\u0022/usr/bin/head\u0022)\u0060 also satisfies \u0060cmd.contains(\u0022/bin/head\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":"src/tool_runtime/tests/files/search.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93caafb6f845e21dec96d99556769e6316b5714f05964b0fa2dc0ffa6ea03e3"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060target.startswith(\u0022//\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060target.startswith(\u0022//\u0022)\u0060 also satisfies \u0060target.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/check_markdown_links.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5033eef627fe3e50761ec897db4dac4e324ae51ee0c895487d94d0c1ba0c56f2"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060stderr.contains(\u0022service not found\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060stderr.contains(\u0022service not found\u0022)\u0060 also satisfies \u0060stderr.contains(\u0022not found\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/webcodex-environment/src/service/macos.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"182620f432e262164f6df93957de77519cab7e1c9387962085dfb6b7ddd62445"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-116","guid":"c0134ca8-adc7-6959-bd17-5253a265d101","name":"Improper Encoding or Escaping of Output","shortDescription":{"text":"Improper Encoding or Escaping of Output"},"helpUri":"https://cwe.mitre.org/data/definitions/116.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-290","guid":"379b1e66-a292-7b59-aa1e-a5bb4a6a99e9","name":"Authentication Bypass by Spoofing","shortDescription":{"text":"Authentication Bypass by Spoofing"},"helpUri":"https://cwe.mitre.org/data/definitions/290.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-345","guid":"d80d4b65-bbbe-b65d-958e-7ac466af18f9","name":"Insufficient Verification of Data Authenticity","shortDescription":{"text":"Insufficient Verification of Data Authenticity"},"helpUri":"https://cwe.mitre.org/data/definitions/345.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-444","guid":"8989da48-caaf-a955-b9ef-53767db527d8","name":"Inconsistent Interpretation of HTTP Requests (\u0027HTTP Request Smuggling\u0027)","shortDescription":{"text":"Inconsistent Interpretation of HTTP Requests (\u0027HTTP Request Smuggling\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/444.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-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"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":97,"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."]}]}