{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"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":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"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":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"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":"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":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.ChatPanel (cyclomatic 301): ChatPanel.ChatPanel has cyclomatic complexity 301 (threshold 15). To reduce it, separate the cases: extract each independent 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: 5 other methods here (ChatPanel.ChatPanel::selectModel, ChatPanel.ChatPanel::runComposerCommand, ChatPanel.ChatPanel::send, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":5485}}}],"partialFingerprints":{"codehealthFindingId/v1":"49059ccc02251d581413b889b6ebad31204155cac8525a4ee1c712fab177066d"}},{"ruleId":"D1","level":"warning","message":{"text":"AddAgentDialog.AddAgentDialog (cyclomatic 297): AddAgentDialog.AddAgentDialog has cyclomatic complexity 297 (threshold 15). Of this number, 159 points are the body\u0027s own statements and 138 belong to 41 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":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee2dfc000d229103d0e7b1003898481cb07f773d59544e31de765edcfcc68ef"}},{"ruleId":"D1","level":"warning","message":{"text":"FileViewer.FileViewer (cyclomatic 248): FileViewer.FileViewer has cyclomatic complexity 248 (threshold 15). Of this number, 161 points are the body\u0027s own statements and 87 belong to 20 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":"ui/src/components/FileViewer.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ce08faed6bf1e595c5d69ca4dc252a858f8d00d4853685620e09d9354df4e3"}},{"ruleId":"D1","level":"warning","message":{"text":"NewProjectForm.NewProjectForm (cyclomatic 232): NewProjectForm.NewProjectForm has cyclomatic complexity 232 (threshold 15). Of this number, 187 points are the body\u0027s own statements and 45 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":"ui/src/components/NewProjectForm.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfabb0e5c69b8428a3bd8e579d024064bbdb16f43ca3b35891f385a3628e132"}},{"ruleId":"D1","level":"warning","message":{"text":"App.App (cyclomatic 229): App.App has cyclomatic complexity 229 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between 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 (App.App::renderContentTab) 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":"ui/src/App.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ca5589d47fbafe222b49fdb6fe11a34b7fe01216d54ce9a598b7fb5c28fe98"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.computeToolActivity (cyclomatic 146): ChatPanel.computeToolActivity has cyclomatic complexity 146 (threshold 15). Of this number, 132 points are the body\u0027s own statements and 14 belong to 8 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1465be5aaadad4bf01506fdfb3c90f7457493f7a18e1ebb87157307fb8e63d"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.Transcript (cyclomatic 120): ChatPanel.Transcript has cyclomatic complexity 120 (threshold 15). Most of this is not in the body itself: 6 of the 120 points are its own statements and the rest belongs to 25 function literals inside it that branch (lines 4935, 4918, 4819, \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4590}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfc764dbe65d07bbf3d7a10bf0162e9c1b717d87c3258190c30691a7d0e9e9e"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.ChatPanel::send (cyclomatic 120): ChatPanel.ChatPanel::send 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. This shape REPEATS in the file: 5 other methods here (ChatPanel.ChatPanel, ChatPanel.ChatPanel::selectModel, ChatPanel.ChatPanel::runComposerCommand, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":6975}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc25a5f045e04533c17c9014982dfadcada1534665c5f3d4d4e61cd44ef8ceb"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatSearch.ChatSearch (cyclomatic 119): ChatSearch.ChatSearch has cyclomatic complexity 119 (threshold 15). Of this number, 60 points are the body\u0027s own statements and 59 belong to 13 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatSearch.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5475a1acf9e130d671c5867e8d4154d7b240e746ba3d5f8d2522ad97e77257f9"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::app::imp::run_event_loop (cyclomatic 112): openresearch_cli::commands::app::imp::run_event_loop has cyclomatic complexity 112 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/commands/app.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a826b3f1494975c0c5ea7c9c74d25d8149c3890f4b0d0f99957b447a9a98d3f"}},{"ruleId":"D1","level":"warning","message":{"text":"Onboarding.Onboarding (cyclomatic 109): Onboarding.Onboarding has cyclomatic complexity 109 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 46 belong to 20 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":"ui/src/components/Onboarding.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7735a1bf8eb5e14d76385a611b9b1d3d70542fba8b10ac6f499c8d5e9ab3413"}},{"ruleId":"D1","level":"warning","message":{"text":"Actor::run (cyclomatic 103): Actor::run has cyclomatic complexity 103 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/engine/transport/mod.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cb0b95897d4a47063c8dcaecc3a881fa748b582738961faaba86d894d2549c"}},{"ruleId":"D1","level":"warning","message":{"text":"orx-chart.html.draw (cyclomatic 95): orx-chart.html.draw has cyclomatic complexity 95 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 43 belong to 13 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent-skills/orx-figures/assets/orx-chart.html"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f9c06c018fd6238fcd6a26c1e093cec53150694043abf0451949dc2be292a3"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelPicker.ModelPicker (cyclomatic 93): ModelPicker.ModelPicker has cyclomatic complexity 93 (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 (ModelPicker.ModelPicker::moveFocus) 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":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"de677684b7f4b322bcc4c3815a1a5f43f079cef10bd179335152b9110572b202"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatHost::send_message_showing (cyclomatic 88): ChatHost::send_message_showing has cyclomatic complexity 88 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/local/chat/mod.rs"},"region":{"startLine":5988}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8e999dd49c4d35b88fcecd052234ec190d6872a50d738c3ec4fe1fac1a90ad"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::claude::apply_event (cyclomatic 78): openresearch_cli::local::harness::claude::apply_event has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/claude.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9e99edd4286df0da5ac50a1dc587466a85f7d7981fc1383e564efe8bec8917"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.AgentList::harnessRow (cyclomatic 75): SettingsPage.AgentList::harnessRow has cyclomatic complexity 75 (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: 3 other methods here (SettingsPage.AgentList, SettingsPage.AgentList::providerRow, SettingsPage.AgentList::foundRow) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56f6bc8d236ab7ab857cea9f192946b5d2b97c19cd56fd50462536fe3f7032f"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.OpenResearchSection (cyclomatic 75): SettingsPage.OpenResearchSection has cyclomatic complexity 75 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32c52926ff6b9ddfbc631a7c51ac2a06e2248dd75c16247c10f045f01dcc574"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.SshSection (cyclomatic 69): SettingsPage.SshSection has cyclomatic complexity 69 (threshold 15). Most of this is not in the body itself: 7 of the 69 points are its own statements and the rest belongs to 13 function items inside it that branch (a function literal at line 1848, hostAction, a function literal at line 1914, \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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"c166d9b79ded0753b46c4a5fe13386a91cd4579777b0532e174174a85476a3f8"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelList.ModelList (cyclomatic 68): ModelList.ModelList has cyclomatic complexity 68 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 51 belong to 20 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":"ui/src/components/ModelList.tsx"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4ace6d290e2d7706d77552f32d02f5c96e416fd703c3eec54a307697732412"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.SessionRow (cyclomatic 68): ChatPanel.SessionRow has cyclomatic complexity 68 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 43 belong to 16 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":5117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf897e4bad6eb945436a5fbdeab516894e4980c06f0cf8ffe93022c1c1663ea"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteRuntime.RemoteSetup (cyclomatic 64): RemoteRuntime.RemoteSetup has cyclomatic complexity 64 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 6 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/RemoteRuntime.tsx"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"126362d5681e82bea7b5bbadf710bca6d51e17c6cf1253bfdacfce61ebc092dd"}},{"ruleId":"D1","level":"warning","message":{"text":"ComposerEditor.ComposerEditor (cyclomatic 62): ComposerEditor.ComposerEditor has cyclomatic complexity 62 (threshold 15). Most of this is not in the body itself: 9 of the 62 points are its own statements and the rest belongs to 16 function items inside it that branch (a function literal at line 598, createState, a function literal at line 548, \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":"ui/src/components/ComposerEditor.tsx"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef76ebeb19aee91d83e46d4ea84940064a146d51b64af57f322cb6ca7cf5b9d"}},{"ruleId":"D1","level":"warning","message":{"text":"Host::request (cyclomatic 60): Host::request 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/orx-host/src/server.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac83643c3c79860a2bf3d9ddb5e8c8a1bb86fb376685f8e45436a03e320a55d0"}},{"ruleId":"D1","level":"warning","message":{"text":"UsageMenu.UsageMenu (cyclomatic 60): UsageMenu.UsageMenu has cyclomatic complexity 60 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 7 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":"ui/src/components/UsageMenu.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae97ff1a4579a3c051acb63729776b6ac8d267b52de888dfcdac30995da01d78"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpHoverCard.ExpHoverCard (cyclomatic 59): ExpHoverCard.ExpHoverCard has cyclomatic complexity 59 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ExpHoverCard.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f988604376228794280ae0d04e959228e351a370f139acadead0fe4397d2af74"}},{"ruleId":"D1","level":"warning","message":{"text":"Host::slurm_queue (cyclomatic 58): Host::slurm_queue has cyclomatic complexity 58 (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/orx-host/src/server.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"27015aa812e474d75fd4cc2abd1e9dced6f9ae5f5a8f8b9f4feadeef3e45bd25"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::run_turn_app_server (cyclomatic 56): openresearch_cli::local::harness::codex::run_turn_app_server has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/local/harness/codex.rs"},"region":{"startLine":3545}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa685f4faff13d20566f4a97380c0dc355473a795e67edcc1e9bf37b31cd5f76"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.GitTab (cyclomatic 56): SettingsPage.GitTab has cyclomatic complexity 56 (threshold 15). Of this number, 45 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4414}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8188bf9e9c0f2c6f3159230be0d18e18355897729c0dcaaa9f7f60e36e5e92"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::commit (cyclomatic 55): Engine::commit 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/engine/reconcile.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc5cc094b2281de528047e13a5c78b94a204beb647dff5c49ef8fe608176618"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.SlurmSection (cyclomatic 54): SettingsPage.SlurmSection has cyclomatic complexity 54 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 27 belong to 8 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e0309f8d5924fdc8c4a6cdaf035d0a649cd39d0b81c9a2e35c0ec50e45d818"}},{"ruleId":"D1","level":"warning","message":{"text":"workspaceState.parsePane (cyclomatic 53): workspaceState.parsePane 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":"ui/src/workspaceState.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38d9616b0dd92f3fd4f87e6e006bc534245f9becec86ad5f4746b093405c053"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelPicker.OptionPicker (cyclomatic 52): ModelPicker.OptionPicker has cyclomatic complexity 52 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 22 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":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e4034724a561dadfb2b8468fb4bf91342e2f0758aa4e1afd1f3defcc2e603c"}},{"ruleId":"D1","level":"warning","message":{"text":"AcpAuthDialog.AcpAuth (cyclomatic 51): AcpAuthDialog.AcpAuth has cyclomatic complexity 51 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 21 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AcpAuthDialog.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba02578c31fd22ebcd974bd9d800189c34be6749f12dfad84a87b2de5fff4e91"}},{"ruleId":"D1","level":"warning","message":{"text":"useOverleafSync.useOverleafSync (cyclomatic 50): useOverleafSync.useOverleafSync has cyclomatic complexity 50 (threshold 15). Most of this is not in the body itself: 11 of the 50 points are its own statements and the rest belongs to 12 function literals inside it that branch (lines 189, 280, 300, \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":"ui/src/useOverleafSync.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c107f3870c2b351612f9eb0c4cec1509aedd89682d628f4af147fbca1e56ff4"}},{"ruleId":"D1","level":"warning","message":{"text":"orx_host::wrapper::wrap (cyclomatic 49): orx_host::wrapper::wrap 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/orx-host/src/wrapper.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f466d1d9bcd88e53d70609287f279fbd27f7712ed2cdfffc43014f73ac0d72"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::claude::run_attempt (cyclomatic 49): openresearch_cli::local::harness::claude::run_attempt 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/local/harness/claude.rs"},"region":{"startLine":2850}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a43bf49409bf3f44216a1bf0cbb060ed9389dba2cb81c3da2f92d461c32f72"}},{"ruleId":"D1","level":"warning","message":{"text":"WorktreeTab.WorktreeTab (cyclomatic 49): WorktreeTab.WorktreeTab has cyclomatic complexity 49 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 8 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/WorktreeTab.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c558b5971f732732cc558189af04af72ae5a93f2c93a23cb9dc0feffe5e56f"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.PromptCard (cyclomatic 49): ChatPanel.PromptCard has cyclomatic complexity 49 (threshold 15). Of this number, 47 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3242}}}],"partialFingerprints":{"codehealthFindingId/v1":"232385136ae387e25e9b4140320001acd34bdd543258f340580662720de99f65"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlPreview.HtmlPreview (cyclomatic 48): HtmlPreview.HtmlPreview has cyclomatic complexity 48 (threshold 15). Most of this is not in the body itself: 9 of the 48 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 189, 257, 253, \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":"ui/src/components/HtmlPreview.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9630c3fcffa3e9ffc622fb41980f450b39dad0b51c090ea5e8dcfde5976ae77"}},{"ruleId":"D1","level":"warning","message":{"text":"Actor::login (cyclomatic 47): Actor::login has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/engine/transport/mod.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f8c1edd0308877584bcd0c35f5c1154b60edc0ec64908f9c76a0b4c0368f0b"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::run (cyclomatic 47): openresearch_cli::commands::up::run has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/commands/up.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cb20f7d95e8523a07b17ee249a903f4f16419f4cc9fbea4edc1ee1237c444e"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::compute::validate_run_args (cyclomatic 46): openresearch_cli::compute::validate_run_args has cyclomatic complexity 46 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compute.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f21875cdb429741d918d745adfceda03f97e6cd9dc8e29f28b1d5b9cf5359c5"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.VercelSection (cyclomatic 46): SettingsPage.VercelSection has cyclomatic complexity 46 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 7 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"52636fe1929ffbe6859016127997519c22d6a012d56b3a4a8565326ed190c52b"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigureArgs::body (cyclomatic 45): ConfigureArgs::body 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":"src/commands/compute.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4b8db47b4e2dda07b3647ccc1fa246f3427cf0c9e04e315c952274c0197a0d"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.StorageTab (cyclomatic 42): SettingsPage.StorageTab has cyclomatic complexity 42 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 15 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4592}}}],"partialFingerprints":{"codehealthFindingId/v1":"741441bb2b504514ab004d5c947a22f4969103cb01c5e52d619b7252999b2cda"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::dispatch (cyclomatic 41): openresearch_cli::dispatch has cyclomatic complexity 41 (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/main.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"325841a9318f1f02ef325fcd7de744d96668fe001bae4703fc68a92c72294213"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::run_turn_exec (cyclomatic 41): openresearch_cli::local::harness::codex::run_turn_exec 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/local/harness/codex.rs"},"region":{"startLine":4697}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9400017db5cdd8b41dd294ef086a431d59658755581a7b0a66722f02638d10"}},{"ruleId":"D1","level":"warning","message":{"text":"markdownLivePreview.collectFormatting (cyclomatic 41): markdownLivePreview.collectFormatting has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 1 of the 41 points is its own statement and the rest belongs to one function literal inside it that branches (line 257). 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":"ui/src/markdownLivePreview.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3122d2767426605604eea485d075e8bad2ebfea30882b9411ee7145d2719388a"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.HfSection (cyclomatic 41): SettingsPage.HfSection has cyclomatic complexity 41 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 13 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3302}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e673c62604d52b81a832b40268e83de1dea2374cf541f4a95ca2a96908480d"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatHost::recover_turn (cyclomatic 40): ChatHost::recover_turn 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/local/chat/mod.rs"},"region":{"startLine":5392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e1c3cd480aaeed24d85883a455cd15d50cabc3a21e9d0e71b9c313824e2d10"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::storage::scan (cyclomatic 40): openresearch_cli::local::storage::scan 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/local/storage.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fb079a435f29f893e3cab06e729bc52220095b89cb5b3fd7d9bd4821f4ff11"}},{"ruleId":"D1","level":"warning","message":{"text":"HarnessSetupDialog.HarnessSetup (cyclomatic 39): HarnessSetupDialog.HarnessSetup has cyclomatic complexity 39 (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 (HarnessSetupDialog.HarnessSetup::verify) 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":"ui/src/components/HarnessSetupDialog.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ba15180620d8994bfb7ee6f766d2103107179c81c960f1c951f3017eb882e5"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.K8sSection (cyclomatic 39): SettingsPage.K8sSection has cyclomatic complexity 39 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 13 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c6f2f7d35866e3803e445689f412390a0b74ab80c71924fff9125e5962aff1"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.shellCommandSegments (cyclomatic 39): ChatPanel.shellCommandSegments has cyclomatic complexity 39 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 17 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4b1cea66ece203db024b94a0fa1fb6505f565b1e6f4ecd4e5e2476b63f7be7"}},{"ruleId":"D1","level":"warning","message":{"text":"OverleafPanel.OverleafPanel (cyclomatic 39): OverleafPanel.OverleafPanel has cyclomatic complexity 39 (threshold 15). Of this number, 31 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":"ui/src/components/OverleafPanel.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a11aa261893808a3b9efc5878824d3c14479fa03c237e1127f0d2db7a6845ab"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionHoverCard.SessionHoverCard (cyclomatic 38): SessionHoverCard.SessionHoverCard has cyclomatic complexity 38 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 12 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":"ui/src/components/SessionHoverCard.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd775463d62f086020f6a6008664872c98ae353b46409b1fbff9192de1000d38"}},{"ruleId":"D1","level":"warning","message":{"text":"Events.QueryEvents (cyclomatic 38): Events.QueryEvents has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 7 of the 38 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 116, 129, 138, \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":"ui/src/queries/Events.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"11801ff85bb1fdddb20478d54332f8d6729d7bc591ad6934d222e84071b2944f"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceConnection.WorkspaceConnection (cyclomatic 38): WorkspaceConnection.WorkspaceConnection has cyclomatic complexity 38 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 6 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/WorkspaceConnection.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01aa3bc077930b69b0f5d537a6a16f884a3a77b888da51872bcd7f6f8d817e7"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.alphaxivActivity (cyclomatic 38): ChatPanel.alphaxivActivity has cyclomatic complexity 38 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"425e203bd260d3bbdec9522a6627bad192ed9b6f80021816293ebc95cfbd412c"}},{"ruleId":"D1","level":"warning","message":{"text":"RunContactNotice.RunContactNotice (cyclomatic 37): RunContactNotice.RunContactNotice has cyclomatic complexity 37 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 2 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":"ui/src/components/RunContactNotice.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"07070ade40b0df88dca3e25dfa5d64a79636a9ebdac07eb94a47515a3a3bda7d"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.UpdatesTab (cyclomatic 37): SettingsPage.UpdatesTab has cyclomatic complexity 37 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 12 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3859}}}],"partialFingerprints":{"codehealthFindingId/v1":"332860857ea5d8ed97f2c4feb441f4c7e81943017d81eb5753cfabe4c599a15d"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::acp::host::spawn (cyclomatic 36): openresearch_cli::local::acp::host::spawn 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/local/acp/host.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf2eeb51aea9f8c2f7ae21772980e8bb8068aded6f8363d3c3481f0aaa1b0d6"}},{"ruleId":"D1","level":"warning","message":{"text":"orx_chart.validate_views (cyclomatic 36): orx_chart.validate_views has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent-skills/orx-figures/assets/orx_chart.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a0e33f29a85d7a27c2793c91edba762e0c01bcd4b731ea2bfbbb556ff310a8"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.DefaultDestinationEditor (cyclomatic 36): SettingsPage.DefaultDestinationEditor has cyclomatic complexity 36 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 19 belong to 7 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e9760fcaf8317d9a8cecd752d5f9c4c07c1720b8e32dec43876da2872d8e9e"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.ToolActivityLabel (cyclomatic 36): ChatPanel.ToolActivityLabel has cyclomatic complexity 36 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 12 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f96c1de5005e791d827ba23b55bf4289787d92ed8dfb1c4a5a8ca3f9c58e939"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::run_cli (cyclomatic 35): openresearch_cli::run_cli 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. This is NOT this file\u0027s highest cyclomatic complexity: openresearch_cli::command_name (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f435ec1aeca5f7b4d844d356349c419ae0cb8d2158585ea3054e4e5496c2d3"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up_remote::connect_once (cyclomatic 35): openresearch_cli::commands::up_remote::connect_once 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/commands/up_remote.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"c907b05b70920a408318cec8c09c240d27d9c262c93fcc2aec4b59aef4367542"}},{"ruleId":"D1","level":"warning","message":{"text":"orxCommand.shellWords (cyclomatic 35): orxCommand.shellWords has cyclomatic complexity 35 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/orxCommand.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64ae180c97da0ecd55088042e7e09598dca3c77715ab7d7b1f2003c6177e328"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.ToolGroup (cyclomatic 35): ChatPanel.ToolGroup has cyclomatic complexity 35 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2816}}}],"partialFingerprints":{"codehealthFindingId/v1":"7107977c865449e669910a365f5531f57320a70b5e3a3785bc482791ad26376b"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::hosts::parse (cyclomatic 34): openresearch_cli::jobs::ssh::hosts::parse 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":"src/jobs/ssh/hosts.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f257c5bed5847b9e947bc90a8d9f0fb9f24196b50b2a5650cbce161b648769c6"}},{"ruleId":"D1","level":"warning","message":{"text":"keyboardNavigation.navigateKeyboardList (cyclomatic 34): keyboardNavigation.navigateKeyboardList has cyclomatic complexity 34 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/keyboardNavigation.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f67f63fc63902b2ff9a952fbc9344b25175d8984cccba9b07a2b5a271c4b607"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteRuntime.RuntimeRoot (cyclomatic 34): RemoteRuntime.RuntimeRoot has cyclomatic complexity 34 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 14 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":"ui/src/RemoteRuntime.tsx"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"5926b6ec0e4a6abc778df2bbee26deb3e33d7f9a6d3a33af927ba7a753f0b14f"}},{"ruleId":"D1","level":"warning","message":{"text":"AcpHarnessDialog.AcpHarnessDialog (cyclomatic 34): AcpHarnessDialog.AcpHarnessDialog 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. This shape REPEATS in the file: one other method here (AcpHarnessDialog.AcpHarnessDialog::run) 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":"ui/src/components/AcpHarnessDialog.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbb90fccb741e42f13df272bb839f3bd82a41ea7bb67b4991711c7c8416ab05"}},{"ruleId":"D1","level":"warning","message":{"text":"Header.Brand (cyclomatic 34): Header.Brand has cyclomatic complexity 34 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/Header.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29af13135cca531eb63b44cd6b7b68f38042175380a09adeb6224fa5a6e999f"}},{"ruleId":"D1","level":"warning","message":{"text":"ArtifactsTab.ArtifactsTab (cyclomatic 34): ArtifactsTab.ArtifactsTab has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 15 of the 34 points are its own statements and the rest belongs to 13 function items inside it that branch (a function literal at line 585, a function literal at line 699, reveal, \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":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d07bbb2212822eb1ef0bc4d4f53a4da90e6e96f0c19092a0ba1b62a1ca34ee"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeView.TreeView (cyclomatic 34): TreeView.TreeView has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 4 of the 34 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 510, 626, 493, \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":"ui/src/components/TreeView.tsx"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a073c8a54ce01e4b9e1cf023be4fd0c41cf11c67ccf42eb076245be828a635ef"}},{"ruleId":"D1","level":"warning","message":{"text":"Host::launch (cyclomatic 33): Host::launch 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/orx-host/src/server.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a6f75abb4a4ebb29c9cb654a70d9a01d4277015c5796325348c00458f1a430"}},{"ruleId":"D1","level":"warning","message":{"text":"events.createEvents.useOrxEventStream (cyclomatic 33): events.createEvents.useOrxEventStream has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to 24 function literals inside it that branch (lines 321, 305, 300, \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":"ui/src/events.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49b05a4a555336aa66ad2e31ac365cd8ea353924339c8d4fce5add8c67bb1cf"}},{"ruleId":"D1","level":"warning","message":{"text":"SshConnectTerminal.CommandTerminal (cyclomatic 33): SshConnectTerminal.CommandTerminal has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 5 of the 33 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 237, 286, 195, \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":"ui/src/components/SshConnectTerminal.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51f5fd335e448b85390e4706eb16a67a30348a81041a54cac4b44924430ed71"}},{"ruleId":"D1","level":"warning","message":{"text":"HarnessSetupDialog.SetupRun (cyclomatic 33): HarnessSetupDialog.SetupRun has cyclomatic complexity 33 (threshold 15). Of this number, 23 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":"ui/src/components/HarnessSetupDialog.tsx"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c573c077d6a2288ddf6a23c92cef45371c4ecd1c1029817173278d816b0907d1"}},{"ruleId":"D1","level":"warning","message":{"text":"DetailDrawer.TerminalView (cyclomatic 33): DetailDrawer.TerminalView has cyclomatic complexity 33 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/DetailDrawer.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b487efeb88039fa3eb25715eb7eeb6e211f81a2a9457f532fe570cf363f82e0"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeHost::acquire_turn (cyclomatic 32): ClaudeHost::acquire_turn 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/local/claude.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dc2ec060d2ae89070b0372305f8cb7cb5fee05f6a5ab49bc411e4fe0a7ddfb"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::api_v2::read_log (cyclomatic 32): openresearch_cli::commands::up::api_v2::read_log 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/commands/up/api_v2.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea03c527426e83d0c657c519f0672db924d7f97184cd23196f6ec1f6d4ca16d"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceTools.SideChatPicker (cyclomatic 32): WorkspaceTools.SideChatPicker has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 14 of the 32 points are its own statements and the rest belongs to 12 function literals inside it that branch (lines 268, 166, 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":"ui/src/components/WorkspaceTools.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1387688084bce8ba082ed750b3bdfa574d2462786fab5eb9bd7d9aceeca9ae81"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryPicker.SignedInLibraryPicker (cyclomatic 32): LibraryPicker.SignedInLibraryPicker has cyclomatic complexity 32 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 10 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/LibraryPicker.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b298030fb56c56a57568cb1daed5f6c19502b43f623760c5fee25cb182994812"}},{"ruleId":"D1","level":"warning","message":{"text":"chatRendering.questionReplies (cyclomatic 32): chatRendering.questionReplies has cyclomatic complexity 32 (threshold 15). Of this number, 31 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":"ui/src/chatRendering.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8a7b1e817cadc455777d6aa2761ee306ea1e5567d0ce29454e6dc3b102173f"}},{"ruleId":"D1","level":"warning","message":{"text":"Broker::dispatch (cyclomatic 31): Broker::dispatch 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/jobs/ssh/service/mod.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"1292cf749d1d8bca5642aa2982bca9a8f2bfda121f631014ccce183871af27ab"}},{"ruleId":"D1","level":"warning","message":{"text":"LogTerminal.LogTerminal (cyclomatic 31): LogTerminal.LogTerminal has cyclomatic complexity 31 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 8 belong to 6 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/LogTerminal.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c48ce7ca1788fa0b73391ceda9efd2f195830047018aab4f72625bb4ec1fa5e"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.ResearchToolRun (cyclomatic 31): ChatPanel.ResearchToolRun 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 3137, 3178, 3217). 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3115}}}],"partialFingerprints":{"codehealthFindingId/v1":"81341e5eba108d6661e3494afcd3794359c776810d1a024d8d8c9e45c8237028"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.AssistantTurn (cyclomatic 31): ChatPanel.AssistantTurn has cyclomatic complexity 31 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 10 belong to 6 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3964}}}],"partialFingerprints":{"codehealthFindingId/v1":"af57f43604e8e8c7e083b01804f644898c08609bb32a2510daa1494047189eb0"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenResearch::inspect (cyclomatic 30): OpenResearch::inspect 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/engine/adapters/openresearch.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"851bcb1231be2ff4cdfaba0108c7283dd5ee3eded23667ff2d08d83640565f61"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatHost::drain_queue (cyclomatic 30): ChatHost::drain_queue 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/local/chat/mod.rs"},"region":{"startLine":4933}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7dca62c855267ea9a388ca03d96468d404898b32d78e51ab3821cefad706af"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::harness_setup::run (cyclomatic 30): openresearch_cli::commands::up::harness_setup::run 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/commands/up/harness_setup.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b989f7b28f0422e532188fe35985b5938a10c0e743c4cf09c6b935c7f08de5"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::jobs::kubernetes::prepare_docs (cyclomatic 30): openresearch_cli::jobs::kubernetes::prepare_docs 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/jobs/kubernetes.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"e753a52dcbdfde2809b4676fa9db7db20b36f5adb1afd5b3b19a746e9e849e25"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::apply_notification (cyclomatic 30): openresearch_cli::local::harness::codex::apply_notification 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/local/harness/codex.rs"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1868342d7a2023f34b7e0496ebf49ae275b05589cbe3ef8a627d79ce2a17ccb7"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.TinkerSection (cyclomatic 30): SettingsPage.TinkerSection has cyclomatic complexity 30 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 9 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3186}}}],"partialFingerprints":{"codehealthFindingId/v1":"677f83a5fe802621b5233cb5d273b21295cb90de91f4c9a4f65bfd586646b4d4"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.commandRunIds (cyclomatic 30): ChatPanel.commandRunIds 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb378d0a4dd805201dd5df88e772cd95133f0645958b2f0587b9d88d11274ae"}},{"ruleId":"D1","level":"warning","message":{"text":"Store::cleanup_run_artifacts_locked (cyclomatic 29): Store::cleanup_run_artifacts_locked 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/store.rs"},"region":{"startLine":2844}}}],"partialFingerprints":{"codehealthFindingId/v1":"642b31b6979ab3b824b5606a25873ede5373db3a416f34bf6273861b404f0894"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::relay_pty (cyclomatic 29): openresearch_cli::commands::up::relay_pty 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/commands/up.rs"},"region":{"startLine":7511}}}],"partialFingerprints":{"codehealthFindingId/v1":"8125672660ee24b3313d72a2a111f0f33594aaca165d13c439cf739eeff2adf0"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::agent_tools::call (cyclomatic 29): openresearch_cli::commands::up::agent_tools::call 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/commands/up/agent_tools.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"74303eafa00139c7c658607b7633a08d019c7bc2f4ca3538bd9b254b4ecea971"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::api_v2::events (cyclomatic 29): openresearch_cli::commands::up::api_v2::events 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/commands/up/api_v2.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"833077f51cae6a29d5a7a77cd1c8703a462d18c8887463eaa9d02646bc5903cd"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::item_to_part (cyclomatic 29): openresearch_cli::local::harness::codex::item_to_part has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/codex.rs"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"37274f2dc58dd009f030fe8b86d7b0e790155a4b6c0768ea095fdb561430e843"}},{"ruleId":"D1","level":"warning","message":{"text":"orx-chart.html.drawDiagram (cyclomatic 29): orx-chart.html.drawDiagram has cyclomatic complexity 29 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 6 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":"agent-skills/orx-figures/assets/orx-chart.html"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb6af67b4db6224890a21e3d3229696a05880b9861145b752198944106f1655"}},{"ruleId":"D1","level":"warning","message":{"text":"api.createApi.json (cyclomatic 29): api.createApi.json 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":"ui/src/api.ts"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf60ac3bacda84053b56ad634c38a715da092ff9d83c85b019332aac1d903031"}},{"ruleId":"D1","level":"warning","message":{"text":"AccountChip.AccountChip (cyclomatic 29): AccountChip.AccountChip has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AccountChip.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"643d16c54ab80191ed662481916c829facba42e83ffd1609d293e6707c18b166"}},{"ruleId":"D1","level":"warning","message":{"text":"ShareProjectDialog.ShareProjectDialog (cyclomatic 29): ShareProjectDialog.ShareProjectDialog has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 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":"ui/src/components/ShareProjectDialog.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70bf50fd34200021e0de00a77120d6de6af6025d0b033c0f00a78a83518f9c6"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.AgentList (cyclomatic 29): SettingsPage.AgentList 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. This shape REPEATS in the file: 3 other methods here (SettingsPage.AgentList::harnessRow, SettingsPage.AgentList::providerRow, SettingsPage.AgentList::foundRow) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"7728b2c7de1e91c2ea5ea7f4d4d3d6c1b37b368e2872050b6c293d4641503804"}},{"ruleId":"D1","level":"warning","message":{"text":"ExperimentsTable.ExperimentsTable (cyclomatic 29): ExperimentsTable.ExperimentsTable has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 9 of the 29 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 110, a function literal at line 54, requestCancel, \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":"ui/src/components/ExperimentsTable.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd9feb390ed325da59c1c4537d3454ea7d9419440652eca39c83f52a841ad17"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowMenu.WindowMenu (cyclomatic 29): WindowMenu.WindowMenu has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 2 of the 29 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 85, 27, 78, \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":"ui/src/components/WindowMenu.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e96b182b5e9a9c9c6e067655a648f248007dcfa9e474e015415c57830fdc8f"}},{"ruleId":"D1","level":"warning","message":{"text":"orx_host::wrapper::state (cyclomatic 28): orx_host::wrapper::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":"crates/orx-host/src/wrapper.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"a959baec49e704e8f7bb6a53e29d521f5fdc538a8763d7529e7bd0120bb5fe70"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::deliver_notify (cyclomatic 28): Engine::deliver_notify 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/engine/notify.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5264ee019e404cb0d9c6e87c6f982aa631bfe3d13affd59e84df047530f7ab6e"}},{"ruleId":"D1","level":"warning","message":{"text":"ApiClient::logs_to (cyclomatic 28): ApiClient::logs_to 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/plane/local_plane.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b226f872046bc20d654f54b6aa1375b9ac9d5305159e43760652ede0183570"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::set_ui_state (cyclomatic 28): openresearch_cli::commands::up::set_ui_state 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/commands/up.rs"},"region":{"startLine":6825}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8a4449bcf2102df71f01dc02b2a4b3cbdf8ff2f8302ec217cd5ba1b0c863c5"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::engine::reconcile::observed (cyclomatic 28): openresearch_cli::engine::reconcile::observed 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/engine/reconcile.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df846c08fd1e2e0aac1192e2a247576566eecb848ab6e15ec735cadb49074e3"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::service::transport::connect (cyclomatic 28): openresearch_cli::jobs::ssh::service::transport::connect 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/jobs/ssh/service/transport.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b251d6fe7364d5e74adb9d6c61675a3d2aa610de470a95139860868951d588"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::overleaf_live::run_connection (cyclomatic 28): openresearch_cli::local::overleaf_live::run_connection 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/local/overleaf_live.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdfda285f115dc4a3ccb4c9320357d6c04cae2bb56f0be8d538f913943bc47f"}},{"ruleId":"D1","level":"warning","message":{"text":"dev.parseArgs (cyclomatic 28): dev.parseArgs has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dev.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca18ca523d0a113e53c1a697f189a430e9d9b08e95a7696a658addc677f9ba5"}},{"ruleId":"D1","level":"warning","message":{"text":"markdownNormalization.normalizeCurrencyDollars (cyclomatic 28): markdownNormalization.normalizeCurrencyDollars 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":"ui/src/markdownNormalization.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"08317295035d81e0d043f7a2c508e6791c20b5c4dd27714a727371e8776bab39"}},{"ruleId":"D1","level":"warning","message":{"text":"ExperimentOverview.ExperimentOverview (cyclomatic 28): ExperimentOverview.ExperimentOverview has cyclomatic complexity 28 (threshold 15). Of this number, 27 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":"ui/src/components/ExperimentOverview.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7668524df844a3178246608bebfefd50b41d85392d427324b97d28b732e20c"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.ModalSection (cyclomatic 28): SettingsPage.ModalSection has cyclomatic complexity 28 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 11 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2074fe0dfbbcab0703a8c0ce5fa6a193f0c8115589037ad8affc6f42945accd"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.EnvRow (cyclomatic 28): SettingsPage.EnvRow has cyclomatic complexity 28 (threshold 15). Of this number, 18 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3446}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8acb4b72600a6d6bdbb701bb25e8316c3d82f9f6097357caca82398752829c3"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.Message (cyclomatic 28): ChatPanel.Message has cyclomatic complexity 28 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 10 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3595}}}],"partialFingerprints":{"codehealthFindingId/v1":"a431458e4fd24522798d59f1243b8928f019ed31c0fee234cb85b89d5000fd58"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatHost::stop_turn (cyclomatic 27): ChatHost::stop_turn 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/local/chat/mod.rs"},"region":{"startLine":7026}}}],"partialFingerprints":{"codehealthFindingId/v1":"568600e7fa515c5a1b22e694242ea6eb179e757c2fd4388de74ab2b7c8608ee4"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::agent_tools::wait (cyclomatic 27): openresearch_cli::commands::up::agent_tools::wait 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/commands/up/agent_tools.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb5c21317c66717af9b06626e6d3d69bb8f05ac9c556810d7dec12cfc24a775"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::auth::detect (cyclomatic 27): openresearch_cli::local::harness::acp::auth::detect 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/local/harness/acp/auth.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27753c03e9a0cca31dc7f3cadc7e7442e115ac259a55f4a52a845bb645e1a45"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::cursor::run_turn (cyclomatic 27): openresearch_cli::local::harness::cursor::run_turn 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/local/harness/cursor.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"f099143ea67254a723060230e621b9e84c4cb9969eb12ceb47a7277fbf8c4826"}},{"ruleId":"D1","level":"warning","message":{"text":"orx_figstyle._text_collisions (cyclomatic 27): orx_figstyle._text_collisions has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent-skills/orx-figures/assets/orx_figstyle.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe12da49d1913621163685ee601f153dadb60cdcbde997d1f9bde9f653a4408"}},{"ruleId":"D1","level":"warning","message":{"text":"dev.main (cyclomatic 27): dev.main has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dev.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"00039d5f70ad3c8fbe1273d4296ada5a4b65cebaff34748513b50cd51106528e"}},{"ruleId":"D1","level":"warning","message":{"text":"Md.Md (cyclomatic 27): Md.Md has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 2 of the 27 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 510, 478, 499, \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":"ui/src/components/Md.tsx"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"6035b774891a6e3d7d23e0576265fd66c86ae7011cf3a2792d422b78e59c258a"}},{"ruleId":"D1","level":"warning","message":{"text":"useProjectWorkspace.createProjectPersistence.useProjectWorkspace (cyclomatic 27): useProjectWorkspace.createProjectPersistence.useProjectWorkspace 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 200, 193, 179, \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":"ui/src/useProjectWorkspace.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac24e68c0ab31f0cdbf0be1f1bf1dae0f8deef463c81fa787c9e5d422175eb66"}},{"ruleId":"D1","level":"warning","message":{"text":"Machines.MachineWorkspaces (cyclomatic 27): Machines.MachineWorkspaces has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 5 of the 27 points are its own statements and the rest belongs to 14 function items inside it that branch (a function literal at line 239, selectRemote, a function literal at line 193, \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":"ui/src/Machines.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9316c09017dacb02c19b047635c90d94cf742b335f3466a0132b6b9c7def6bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::scan_legacy (cyclomatic 26): Engine::scan_legacy 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/engine/legacy.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"31849af564d91710c9aca593d33b8965da1253be06ea2040b92b79011c88175a"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::handle_event (cyclomatic 26): Connection::handle_event has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/overleaf_live.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8d6e7dd5f94a3c0d0404bc06df865ea96b9c9e8830c8bdc1811974f8f8ac57"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::manage_local_file (cyclomatic 26): openresearch_cli::commands::up::manage_local_file has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up.rs"},"region":{"startLine":4148}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe493f107c51b33b08c67bc7f985e192c70a899e6db1d4575ee27f216ec1ec83"}},{"ruleId":"D1","level":"warning","message":{"text":"AddAgentDialog.OAuthPanel (cyclomatic 26): AddAgentDialog.OAuthPanel has cyclomatic complexity 26 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff0e45edd5edcc3020b315f60308a72b700d544ff117e7e417891de25e9cc0a"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceTools.WorkspaceTools (cyclomatic 26): WorkspaceTools.WorkspaceTools has cyclomatic complexity 26 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 9 belong to 6 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/WorkspaceTools.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c4d06039a89ab93a52fe1029835aa905066417fb858d8c54a4710872cdc245"}},{"ruleId":"D1","level":"warning","message":{"text":"QuestionDock.QuestionDock (cyclomatic 26): QuestionDock.QuestionDock has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 9 of the 26 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 154, 192, 152). 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":"ui/src/components/QuestionDock.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52c30a1dec763955fd28253e0c9379aa9eabba6aaa9b5e055420ba33214a5d6"}},{"ruleId":"D1","level":"warning","message":{"text":"ArtifactsTab.PreviewPane (cyclomatic 26): ArtifactsTab.PreviewPane 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":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a85608b559daec2d5bbad68b96283c76e6e4d93aa45dc139770bee709a1f3d2"}},{"ruleId":"D1","level":"warning","message":{"text":"Codex::detect_at (cyclomatic 25): Codex::detect_at 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/local/harness/codex.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"680d899306e2d0455a69a12d0e2e1b711f545c4a15fa5f04425c64c1d9398678"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalPlane::experiment_status (cyclomatic 25): LocalPlane::experiment_status 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/plane/local_plane.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"759c38f71e1008910b7d160a9ee7ba22ca2abecd235ed86ad763e018defa85a5"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::chat::preserve_tool_targets (cyclomatic 25): openresearch_cli::local::chat::preserve_tool_targets 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/local/chat/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d475e9a3f228ac1354d43858062da9358e9944558d9e913161c5532d8ea2d0"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::native_store::reconcile_link (cyclomatic 25): openresearch_cli::local::native_store::reconcile_link 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/local/native_store.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3432b4b3d0095d577dac56d0a8a1893379b49002ba12f34622a8e83671ba5cd"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::overleaf::plan (cyclomatic 25): openresearch_cli::local::overleaf::plan 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/local/overleaf.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b24a4c7f593d1b9eaa9aca42168289b5bef3a0c344dbdfd5c641d1b3909ec5"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentIcon.AgentIconPicker (cyclomatic 25): AgentIcon.AgentIconPicker has cyclomatic complexity 25 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 11 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AgentIcon.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"027dc4234be9a05ae8d5c1f88c1b87c46a1c623045d10d1005cfcbf3675212fa"}},{"ruleId":"D1","level":"warning","message":{"text":"OverleafPanel.OverleafButton (cyclomatic 25): OverleafPanel.OverleafButton has cyclomatic complexity 25 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 9 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/OverleafPanel.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce74f8ee7c55f800136ad7365492fdf582af58b74b2d584f0299fa41b9b1e6a0"}},{"ruleId":"D1","level":"warning","message":{"text":"App.parseFilePath (cyclomatic 25): App.parseFilePath has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b413b9ad47671f4d91e0df529a14da8410eb932393758909a354a618eb8c10b"}},{"ruleId":"D1","level":"warning","message":{"text":"orx_host::exec::run (cyclomatic 24): orx_host::exec::run 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/orx-host/src/exec.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59f5174161b962abd3d7d8c5d4effaa47a156bc57d173f9e3a05f9b61df6497"}},{"ruleId":"D1","level":"warning","message":{"text":"Local::start (cyclomatic 24): Local::start 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":"src/engine/adapters/local.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"449c805f6eb9efec83c462771cb57399903ee3326e968b7a1e169d604373bd38"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::compute::run_command (cyclomatic 24): openresearch_cli::commands::compute::run_command has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/compute.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d513564a7c54c1a399247185b73ef5812f903585d621175b0e0753c73dcdc59"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::compute_settings::check (cyclomatic 24): openresearch_cli::commands::up::compute_settings::check 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":"src/commands/up/compute_settings.rs"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52292e076f7bf637503642f3279e0b0f6209bca71802f4678e5e8f17373eff0"}},{"ruleId":"D1","level":"warning","message":{"text":"runDisplay.runNotice (cyclomatic 24): runDisplay.runNotice 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":"ui/src/runDisplay.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a049aff81c849a1258bdf40c777d4292f7e2c106bb0ba06ca883e8b0bf8d2d"}},{"ruleId":"D1","level":"warning","message":{"text":"RunContactNotice.copy (cyclomatic 24): RunContactNotice.copy 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":"ui/src/components/RunContactNotice.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd57bb42dae6b6e157b14e0c8ec73daa6d0198c091d14bd3d4c62ef559ffa52"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelSettings.ModelSettings (cyclomatic 24): ModelSettings.ModelSettings has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 5 of the 24 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 118, a function literal at line 88, a function literal at line 74, \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":"ui/src/components/ModelSettings.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd06243e0fda59239089bae3e0931ca403a8d888697993f058cb1f86184ca5c"}},{"ruleId":"D1","level":"warning","message":{"text":"ResumeDialog.ResumeDialog (cyclomatic 24): ResumeDialog.ResumeDialog has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 9 of the 24 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 134, a function literal at line 166, a function literal at line 70, \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":"ui/src/components/ResumeDialog.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b641162e0c47a985608eceb1c1600c407e3e296ad0e40f891e81a24421a147"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.markdownFromSelectionNode (cyclomatic 24): ChatPanel.markdownFromSelectionNode 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e16ae0b07f79b0a4c6b60a9374c2cd859284cf5c7d833d033474badd8a1b53c"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.ChatPanel::selectModel (cyclomatic 24): ChatPanel.ChatPanel::selectModel 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 shape REPEATS in the file: 5 other methods here (ChatPanel.ChatPanel, ChatPanel.ChatPanel::runComposerCommand, ChatPanel.ChatPanel::send, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":6227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e46085bb9b26f8dc6c145175a062a3a48a7de25ea6f8077f361cd4d6ef98dde"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::observe (cyclomatic 23): Engine::observe 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/engine/reconcile.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfc4e6e37151159c817d044b6c21e9f578538d3cff93d816f2809617bc1f231"}},{"ruleId":"D1","level":"warning","message":{"text":"Codex::compact (cyclomatic 23): Codex::compact 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/local/harness/codex.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bf984df886abfc1d9d1073eb074442d4f09514e3b68799dd3651ecc0e1a66b"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::move_data_dir (cyclomatic 23): openresearch_cli::commands::up::move_data_dir 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/commands/up.rs"},"region":{"startLine":6047}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82f86290df7e1694082e892ab16899142b008818064a40c8e7120c6e5840db0"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::update_chat_session (cyclomatic 23): openresearch_cli::commands::up::update_chat_session 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/commands/up.rs"},"region":{"startLine":9969}}}],"partialFingerprints":{"codehealthFindingId/v1":"0404be0a95c68688f1d839e9d04e28fb1d4defb7a42224e6a1b1f613488de5db"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::update::apply (cyclomatic 23): openresearch_cli::commands::update::apply 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/commands/update.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"501c0ba2c44bf2c6cc830f29c6b4cfb7d2be493960bb72c2e9fffaf26bcad468"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::chat::handoff::snapshot (cyclomatic 23): openresearch_cli::local::chat::handoff::snapshot 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/local/chat/handoff.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4848687c542e2db0c31cd391385f956b357decf04975fa6a557532ddce321307"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::experiments::archive_ids (cyclomatic 23): openresearch_cli::local::experiments::archive_ids 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":"src/local/experiments.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07a8feeb0cd9fa5bd6acddc9f82328412ccd4fb12d931294af043c2d27cfae3"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::opencode::found_providers (cyclomatic 23): openresearch_cli::local::harness::opencode::found_providers 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/local/harness/opencode.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"204a7b3ccd5f1c51be1f7c33bad2c5097af864fe5def18afbe16f99d7f59884a"}},{"ruleId":"D1","level":"warning","message":{"text":"invalidation.createInvalidation.invalidateWrite (cyclomatic 23): invalidation.createInvalidation.invalidateWrite 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":"ui/src/queries/invalidation.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe8e661102a7240d8c5722483061e2d2e5bb7532c0e02e02b517f932220efd8"}},{"ruleId":"D1","level":"warning","message":{"text":"files.createFileQueries.resolvedFileQuery (cyclomatic 23): files.createFileQueries.resolvedFileQuery has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 130, 155, 121, \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":"ui/src/queries/files.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec658a52ff647157a4cc98e45676ec204a3377365268bcfc01a7a604c604562"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelList.ModelRow (cyclomatic 23): ModelList.ModelRow has cyclomatic complexity 23 (threshold 15). Of this number, 14 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":"ui/src/components/ModelList.tsx"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b8028add3f9d25e35acc944696cb53b3c0062615f3a82e3ec16951283b078e"}},{"ruleId":"D1","level":"warning","message":{"text":"ExperimentLineage.Rail (cyclomatic 23): ExperimentLineage.Rail has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 10 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 159, line). 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":"ui/src/components/ExperimentLineage.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"377e43b0715bd3a17b789e7bb41f8541dac7ebbc5484414e56018519abd278c5"}},{"ruleId":"D1","level":"warning","message":{"text":"chatSearch.chatSearchRanges (cyclomatic 23): chatSearch.chatSearchRanges has cyclomatic complexity 23 (threshold 15). Of this number, 22 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":"ui/src/chatSearch.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f4f69959620cb341eeedeabd8b1d92e8f632423f054567998e409985a4a835"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.AgentList::providerRow (cyclomatic 23): SettingsPage.AgentList::providerRow 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 shape REPEATS in the file: 3 other methods here (SettingsPage.AgentList, SettingsPage.AgentList::harnessRow, SettingsPage.AgentList::foundRow) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"8636309a205cebf56ec394d881cac95cbb4c671c733fe3c6e389992139e63fe6"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.RaySection (cyclomatic 23): SettingsPage.RaySection has cyclomatic complexity 23 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 10 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ed5b8569c4e719c82a940cb15937e1e8477d3430a3bb73f655e6cf8391ed2b"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime::collect_log (cyclomatic 22): Runtime::collect_log 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":"src/engine/runtime.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"51156e0b7bf7b2a6c1b11b71342b9781b27bbffbde2c10796904b29478a277bc"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::engine::adapters::ssh::observations (cyclomatic 22): openresearch_cli::engine::adapters::ssh::observations 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/engine/adapters/ssh.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"22dd5ad06c0d87c403e6ccb4d481622685c145e3b67ac4af0bd57ed8c30bd228"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::service::run (cyclomatic 22): openresearch_cli::jobs::ssh::service::run has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/ssh/service/mod.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7dcec78bd73ff33bdcc0678784d6691cc3e8094ecf638a2872e5dbe0954c3e0"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::auth::config_auth::grok_checked (cyclomatic 22): openresearch_cli::local::harness::acp::auth::config_auth::grok_checked 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/local/harness/acp/auth/config_auth.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdde2a6cb70de17d3e24cfec1b0dd2974d549357b748a09a3dcf32a5477980f"}},{"ruleId":"D1","level":"warning","message":{"text":"workspaceState.parseDestination (cyclomatic 22): workspaceState.parseDestination has cyclomatic complexity 22 (threshold 15). Of this number, 19 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":"ui/src/workspaceState.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c436be553d35792440611dd695d719ef7472fc8f69c548642268f0d98359217a"}},{"ruleId":"D1","level":"warning","message":{"text":"orxCommand.parseOrxLit (cyclomatic 22): orxCommand.parseOrxLit 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":"ui/src/orxCommand.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f52650f860ad09a10a02b752a685251ea6bc050d1215826a7ef12590d46bdb"}},{"ruleId":"D1","level":"warning","message":{"text":"fileMentions.matchFileMentions (cyclomatic 22): fileMentions.matchFileMentions has cyclomatic complexity 22 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 9 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":"ui/src/fileMentions.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05d9df33793f45ae61852d813ff4063e79bf954d4b784170675c1af0551157c"}},{"ruleId":"D1","level":"warning","message":{"text":"SshConfigDialog.SshConfigDialog (cyclomatic 22): SshConfigDialog.SshConfigDialog has cyclomatic complexity 22 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 11 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":"ui/src/components/SshConfigDialog.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabf958f48f245ecfaa3d9c5640d72bd9ab2c2dfe24c0c37c26cb2815c7e63ca"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.RecordRow (cyclomatic 22): SettingsPage.RecordRow has cyclomatic complexity 22 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 7 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bf7cfe192b3b12f88266187e4e00a9389fd99b530bb642888a472664279ab7"}},{"ruleId":"D1","level":"warning","message":{"text":"StatusStrip.StatusStrip (cyclomatic 22): StatusStrip.StatusStrip has cyclomatic complexity 22 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/StatusStrip.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e04c0b08550b9b85e432af8ecbbc1b9a8e40a57d6306d331f21fe349e0836f"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.commandExperimentIds (cyclomatic 22): ChatPanel.commandExperimentIds 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"80556a4dd4e41d7f94550181e7ff2f9d29664f9caab6d36a1a6b0b652e440a68"}},{"ruleId":"D1","level":"warning","message":{"text":"TabStrip.TabStrip (cyclomatic 22): TabStrip.TabStrip has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 5 of the 22 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 26, 103, 15, \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":"ui/src/components/TabStrip.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"189cd11a448520a5b582fc0260b5a6f24359cb6a387ddf7fe2b10f2a7aa0bdfc"}},{"ruleId":"D1","level":"warning","message":{"text":"requestAuth (cyclomatic 22): requestAuth has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/acp/zcode-runtime.cjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74d5349d9e6a02a1eb11929dd7ba87a2e351b198e51e0ba631fa09fafea43a4"}},{"ruleId":"D1","level":"warning","message":{"text":"orx_host::legacy::cancel_container (cyclomatic 21): orx_host::legacy::cancel_container 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/orx-host/src/legacy.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c60f05a904e4c3b83fb28d506c4c6d95fa844991f5dc8c1443430d47c29465"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime::tick (cyclomatic 21): Runtime::tick 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/engine/runtime.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7733b55bb393abe1a46766e0d03ebb5b80c3bcb787647302f090a1ef5d3443"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::app::imp::build_menu (cyclomatic 21): openresearch_cli::commands::app::imp::build_menu 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/commands/app.rs"},"region":{"startLine":2160}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f00c2f9a9ef21c0be0b98f26b7f1e4d0e9fc11dc1109a0e5af7352b19824e4"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::engine::adapters::openresearch::kept_page (cyclomatic 21): openresearch_cli::engine::adapters::openresearch::kept_page 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/engine/adapters/openresearch.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabca5e8db6630ba7fde054ffa35cf412bd76c6f0c676c453e2946e1fdda33cb"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::apply_event (cyclomatic 21): openresearch_cli::local::harness::acp::apply_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":"src/local/harness/acp.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"643f1cef24b7c19f683c8fe3b81a15a80189c41504cbf10f887449296343c790"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::managed::asset (cyclomatic 21): openresearch_cli::local::harness::managed::asset 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/local/harness/managed.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"9270b335fcb70eb3fc08820da8dfe15dd0c07770803206885fd99cdeb35af604"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::managed::catalog::latest (cyclomatic 21): openresearch_cli::local::harness::managed::catalog::latest 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/local/harness/managed/catalog.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3354a60f30a452bcc97480798135e4b1870354e70202be2787ca185f0cc70910"}},{"ruleId":"D1","level":"warning","message":{"text":"orx_figstyle._audit (cyclomatic 21): orx_figstyle._audit has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent-skills/orx-figures/assets/orx_figstyle.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cdf407c862a1f0d2657945768a5e44fd915f10236b957bccc22eacb477359a"}},{"ruleId":"D1","level":"warning","message":{"text":"helper.slurm_status (cyclomatic 21): helper.slurm_status 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/jobs/ssh/helper.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb1eefe900bbc0596e9272cd675a92aa1f39514d422b8798c544b16d4ffcfb8"}},{"ruleId":"D1","level":"warning","message":{"text":"orx-chart.html.drawHeatmap (cyclomatic 21): orx-chart.html.drawHeatmap has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 10 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":"agent-skills/orx-figures/assets/orx-chart.html"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb27e42d3f3a3f3b1460723a89585e2f2f71c3a061cb40cf9bad2dc663e7174c"}},{"ruleId":"D1","level":"warning","message":{"text":"acp.nativeOptions (cyclomatic 21): acp.nativeOptions has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 50, 45, 57). 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":"ui/src/acp.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b881750d7a35f0b856211ec23662bc94bb1bf8c524e70e98d8cc87f49487e9"}},{"ruleId":"D1","level":"warning","message":{"text":"HarnessSetupDialog.HarnessSetup::verify (cyclomatic 21): HarnessSetupDialog.HarnessSetup::verify 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 (HarnessSetupDialog.HarnessSetup) 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":"ui/src/components/HarnessSetupDialog.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bd1cccea8f4b7cfaddfa37901c2236b425fed86999d94b98406246bb315950"}},{"ruleId":"D1","level":"warning","message":{"text":"workspaceTabs.applyPane (cyclomatic 21): workspaceTabs.applyPane has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 3 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":"ui/src/workspaceTabs.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e69a65ec84c90b1ccf762918e2ddccef9efd473d2f499d27685821265b3dced"}},{"ruleId":"D1","level":"warning","message":{"text":"chatRendering.splitResponseParts.turns (cyclomatic 21): chatRendering.splitResponseParts.turns has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 254, 258, 270). 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":"ui/src/chatRendering.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9595627e41cc3822e801fc66cafb7cb7b77b8d947f436e2cf6ecd4d7d00bd7"}},{"ruleId":"D1","level":"warning","message":{"text":"AcpHarnessDialog.AcpHarnessDialog::run (cyclomatic 21): AcpHarnessDialog.AcpHarnessDialog::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. This shape REPEATS in the file: one other method here (AcpHarnessDialog.AcpHarnessDialog) 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":"ui/src/components/AcpHarnessDialog.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"419c43def403776243b6d40b322ab41968c0b50886618b4d02f895187e53c369"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.harnessStatus (cyclomatic 21): SettingsPage.harnessStatus 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"47aba77666e4a86228046c7b6cc332877a09a99b8525b20d62699f52a5c0cc18"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeView.ExpNode (cyclomatic 21): TreeView.ExpNode 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":"ui/src/components/TreeView.tsx"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a618b092a211d68005246d950309929186ca3c40711975bad415dd5d53fc2a"}},{"ruleId":"D1","level":"warning","message":{"text":"routePages.ProjectsPage (cyclomatic 21): routePages.ProjectsPage has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/routePages.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a843d6fa31f13f2fba93a244ad236650d82b8c468bbf4fac364c2b7915e560a"}},{"ruleId":"D1","level":"warning","message":{"text":"launch (cyclomatic 21): launch has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to 8 function items inside it that branch (ensureBackend::providerRuntimeHeadersResponder, ensureBackend::request, a function literal at line 113, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/acp/zcode-runtime.cjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90b4d4a2f88812c77349c5f519b805b6f0ed230897367d0e23430f2e6a0cbdc"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerDescriptor::live (cyclomatic 20): ServerDescriptor::live 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/commands/remote_host.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f487cd9ac70cef7011250f8e6b373224b03f8e8892087df10944501ca2aa259f"}},{"ruleId":"D1","level":"warning","message":{"text":"Local::observe (cyclomatic 20): Local::observe has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/adapters/local.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"113ca69b287cee870a1d08ba1985345757314349fb178e7c9de6a48371b0ce66"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::recover_gated (cyclomatic 20): Engine::recover_gated 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/engine/submit.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a22824640e7867a116f9962da6cba980fbaeaee32737f559952bef387db623"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCode::detect_at (cyclomatic 20): ClaudeCode::detect_at 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/local/harness/claude.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9e4d7c59efd2a274b8cb38fae029a53077d3c887280e6957f1308c081769f8"}},{"ruleId":"D1","level":"warning","message":{"text":"Store::search_chat_messages (cyclomatic 20): Store::search_chat_messages has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/store/search.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b09962f3fbc344e9c5b20b96a03a3af943be3c8d535038f31e2bdc3d030d15"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::compute_settings::set_slurm_settings (cyclomatic 20): openresearch_cli::commands::up::compute_settings::set_slurm_settings 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/commands/up/compute_settings.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5066727af81305a6459aa400512c24bb8b0b348c35a0d65d62ad10d478cea7"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up_remote::prepare_remote_session_inner (cyclomatic 20): openresearch_cli::commands::up_remote::prepare_remote_session_inner 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/commands/up_remote.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2424f8c0dbd90305ae7769759108f586de25e392e29782b6fee79bc4a14031c"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::chat::subagent::snapshot (cyclomatic 20): openresearch_cli::local::chat::subagent::snapshot 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/local/chat/subagent.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0060dc55e2252eb5c6821cead49edb023d87d278afaf7056b528e664b6fd877"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::auth::config_auth::kimi_checked (cyclomatic 20): openresearch_cli::local::harness::acp::auth::config_auth::kimi_checked 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/local/harness/acp/auth/config_auth.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9e0be2c0f7df271063a55f8bab022e4375866c064f99a30a8e8eae47d9f4cc"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::claude::run_turn (cyclomatic 20): openresearch_cli::local::harness::claude::run_turn 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/local/harness/claude.rs"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"209a894fa579f7c6cdc60d5e73ea354451aba759eeb94ae206a7a44490ed195f"}},{"ruleId":"D1","level":"warning","message":{"text":"Tooltip.Tooltip (cyclomatic 20): Tooltip.Tooltip has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to 5 function items inside it that branch (show, hide, a function literal at line 86, \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":"ui/src/components/ui/Tooltip.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c0c0e7d0d1008f809c73954a62c7d7003be3bfcb4406e3c8efb5d640db54e9"}},{"ruleId":"D1","level":"warning","message":{"text":"chatState.reducer (cyclomatic 20): chatState.reducer 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":"ui/src/queries/chatState.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fe0210de83ec499ffa1bbfff4e90eefb8c7596abd5f84e4e4540b985ddcf66"}},{"ruleId":"D1","level":"warning","message":{"text":"workspaceTabs.restoreWorkspace (cyclomatic 20): workspaceTabs.restoreWorkspace has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/workspaceTabs.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bf18ed7c91311d50db106ff2e31a0a8439476fe44a3066e03ad92e7db774a2"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.AgentList::foundRow (cyclomatic 20): SettingsPage.AgentList::foundRow 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 shape REPEATS in the file: 3 other methods here (SettingsPage.AgentList, SettingsPage.AgentList::harnessRow, SettingsPage.AgentList::providerRow) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8623e179a72de7408ebd2d9feba74b991ee95fd3a96b044892c357021e5ed10"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.ComputeTab (cyclomatic 20): SettingsPage.ComputeTab has cyclomatic complexity 20 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 10 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d918b6226738eeda3c15c4c8bf685b702d8fdd23d115409b268db778f831ea"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.currentTranscriptSelection (cyclomatic 20): ChatPanel.currentTranscriptSelection has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"58feea6778065d8b86d52c1979dd81ae08dfc5f65582db43d1c45821635fe97a"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.heredocMarker (cyclomatic 20): ChatPanel.heredocMarker 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"3052c2b9c0f225c0e2955692a396fd00d2e74424866cce1796aae0b3530bca1f"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.TurnStatusRow (cyclomatic 20): ChatPanel.TurnStatusRow has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2e5672a13df4385e10db5410afbb91f52ac852420ee244c06161a80bceb5fc"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.renderParts (cyclomatic 20): ChatPanel.renderParts has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4109}}}],"partialFingerprints":{"codehealthFindingId/v1":"70351190e31528839f67c73c776f397fa98f5f7fd8a502146358f1f3043d53ed"}},{"ruleId":"D1","level":"warning","message":{"text":"ReproducePage.ReproducePage (cyclomatic 20): ReproducePage.ReproducePage has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 41, 50, 36). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ReproducePage.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea77cbf6b8eb58099e9b16df5dc8fb1decafef82ca240e1eb013278683f80cdc"}},{"ruleId":"D1","level":"warning","message":{"text":"orx_host::wrapper::stop (cyclomatic 19): orx_host::wrapper::stop 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/orx-host/src/wrapper.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcacdb69cfe0e3115ebf932828f8e83d1e94735aac23d451a7d66d0150e4f71b"}},{"ruleId":"D1","level":"warning","message":{"text":"SshHostReader::read_file (cyclomatic 19): SshHostReader::read_file 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/commands/up/compute_settings.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89fd175cdfb0e5bb1ca95a930e636cb89fc99034f33cccec9330d8f4c920f8f"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatHost::launch_turn_ctx_locked (cyclomatic 19): ChatHost::launch_turn_ctx_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":"src/local/chat/mod.rs"},"region":{"startLine":6692}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f381520445756a2214e4760bb209039a5fc2f4122cb78c599c903760ef8e3f"}},{"ruleId":"D1","level":"warning","message":{"text":"ApiClient::wait (cyclomatic 19): ApiClient::wait has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plane/local_plane.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ff17fa8866114b7e4226b3efe56e2fc510c5a2853af8338576c6d9d6a273fc"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::mcp::run (cyclomatic 19): openresearch_cli::commands::mcp::run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/mcp.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"419fba20ad0560ae000f6564ba0032ea89c9bc64785ea730b4c73aa46f9bee2a"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::start_pty_with_env (cyclomatic 19): openresearch_cli::commands::up::start_pty_with_env 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/commands/up.rs"},"region":{"startLine":7203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60c6fe87aab36dd6f79df0afd02e8e33df74f43414a593f0e7bd13e7f411f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::spawn_catalog_fill (cyclomatic 19): openresearch_cli::commands::up::spawn_catalog_fill 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/commands/up.rs"},"region":{"startLine":9222}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8c5e3f272cef5f049921beb1ee397d89750e78df39166fd0335aa0dbe0639c"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::compute_settings::configure (cyclomatic 19): openresearch_cli::commands::up::compute_settings::configure 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/commands/up/compute_settings.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc052ca40fed83f662819033f57fb7715e7bd2cbca75f563a95cad610a04eef"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::engine::transport::ssh::failure (cyclomatic 19): openresearch_cli::engine::transport::ssh::failure 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/engine/transport/ssh.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f7adc3515e54b01387b0ff8031501a78fd00531cabcf8ff9270aa5fd21c89d"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::jobs::kubernetes::inspect_job (cyclomatic 19): openresearch_cli::jobs::kubernetes::inspect_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":"src/jobs/kubernetes.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8075d0c5ada4a56ace09d94f2d90689b6414f00da0166437d63c59284c067e5"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::antigravity::normalize_tool (cyclomatic 19): openresearch_cli::local::harness::antigravity::normalize_tool 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/local/harness/antigravity.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"8669dbdc7165c671210ce7b9f97a8ceca3915a8b596a0a71e179996717712ca7"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::plan_gate::is_readonly_git (cyclomatic 19): openresearch_cli::local::harness::plan_gate::is_readonly_git 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/local/harness/plan_gate.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"089d95046d13ab49cf776b5a329e54ec256e37483f0493effe64a0b12f9eaa9a"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::projects::prepare_path (cyclomatic 19): openresearch_cli::local::projects::prepare_path 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/local/projects.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9f452a0a32bf81f4031e1ba522a07095c7eea785c59d22e8cc15a426a3f816"}},{"ruleId":"D1","level":"warning","message":{"text":"zcode-auth.check (cyclomatic 19): zcode-auth.check has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/acp/zcode-auth.cjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cbed84cea4e7450e1a20e69bc4e281d21086e8620afda2ed1c225df2903400"}},{"ruleId":"D1","level":"warning","message":{"text":"remarkFigures.remarkFigures.transform::visit (cyclomatic 19): remarkFigures.remarkFigures.transform::visit 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":"ui/src/remarkFigures.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe554d2df5813a8722fd76547d7f92d63879e69b8011ca0ab8a91fc717a7a8c"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeTab.CodeTab (cyclomatic 19): CodeTab.CodeTab has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 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":"ui/src/components/CodeTab.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2160c381f0a9a57d0e1c4baba03ebbf0687e2b52f51eb724c22f469198dcced"}},{"ruleId":"D1","level":"warning","message":{"text":"ResearchCards.RunCard (cyclomatic 19): ResearchCards.RunCard has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"ui/src/components/ResearchCards.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f852b4d62b285e4028fd327596d234c0988e8e474860338fa05afd014a7a39f"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.TargetTile (cyclomatic 19): SettingsPage.TargetTile 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2879}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f90e701c9c3025067300c0cbe2175ee07b5b83351ebc5b2e600f78fdc9e3bc1"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.ChatPanel::runComposerCommand (cyclomatic 19): ChatPanel.ChatPanel::runComposerCommand has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 5 other methods here (ChatPanel.ChatPanel, ChatPanel.ChatPanel::selectModel, ChatPanel.ChatPanel::send, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":6417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cffe3ab9fd3cd6d9d7ab8d9cd4a8eaa1fdd178e75550fa247389ed5174bbf8"}},{"ruleId":"D1","level":"warning","message":{"text":"Slurm::observe (cyclomatic 18): Slurm::observe has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/adapters/slurm.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"150353bc74cd6f2f15ed4bdc3e971af278b033054ecc8c3bac1ce95e12ace7e6"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::reread_watch (cyclomatic 18): Engine::reread_watch 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/engine/legacy.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"07116b0c59e842d5718747405a70ba9c4c21c0eab075df3e865576168e096531"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteRun::from_backend (cyclomatic 18): RemoteRun::from_backend 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/jobs/ssh/cleanup.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c84f5094c00bbc2eb244a0e8e2b2eeebf54844e27fbb8d8b560dbc46a2e3b7"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatHost::respond (cyclomatic 18): ChatHost::respond 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/local/chat/mod.rs"},"region":{"startLine":7254}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce0b71f5c3e4eb3d094bf3ded41c89423ca8d4c45cfbbc798786497f29a05b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::poll_local (cyclomatic 18): Connection::poll_local 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/local/overleaf_live.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cee432915ae2fc7e79f89bdd3e8dbe7bf16cbf37e1526769285f8e32b6b12d"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::overlay_claude_auth (cyclomatic 18): openresearch_cli::commands::up::overlay_claude_auth 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/commands/up.rs"},"region":{"startLine":8432}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bedf97f2428ad34de893abea4f92697450a09a012cecdcfa3e7a7bb98fce9f2"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::service::logs::persist (cyclomatic 18): openresearch_cli::jobs::ssh::service::logs::persist 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/jobs/ssh/service/logs.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b22b25d2989a766bc4b7f90b1a32c9e342e3a7940d7cffe9f95972a0cdd5129"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::claude::read_loop (cyclomatic 18): openresearch_cli::local::claude::read_loop 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/local/claude.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fd29dee395d507deaa67ab482b7d6cdee942cf9bd39c6b18e16b75aa4ba1b3"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::codex::read_loop (cyclomatic 18): openresearch_cli::local::codex::read_loop 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/local/codex.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4e8aeb5bfd30361b2366ae2af97d65336a404f9c1fa9465e9258823f0fee0b"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::cursor::apply_event (cyclomatic 18): openresearch_cli::local::harness::cursor::apply_event 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/local/harness/cursor.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"4621d1685a63e9ebeba3cc9bda126264028beb142aba310a1ffed1610166aea3"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::opencode_v2::prompts (cyclomatic 18): openresearch_cli::local::harness::opencode_v2::prompts 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/local/harness/opencode_v2.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef4e6848576b1a379898f1c8ca2c0eac19b9ea635e7b8047b5c76a379bd6b35"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::share::import_staged (cyclomatic 18): openresearch_cli::local::share::import_staged 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/local/share.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4884d3d19661891655e5af3a722c86a7f46001c9a50554c09940962f42bb59"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::slurm::directives (cyclomatic 18): openresearch_cli::local::slurm::directives 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/local/slurm.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6554e0f29752aeeb27f73fe4ffe33037a1b8d5f6cfed4220b0f2bb30565837"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::ssh_identity::local_keys (cyclomatic 18): openresearch_cli::local::ssh_identity::local_keys 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/local/ssh_identity.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"983e72dc444e891a11dc2d1778d706ce4f2461b7b5fa487ef69d26f102b0438b"}},{"ruleId":"D1","level":"warning","message":{"text":"markdownTarget.resolveMarkdownTarget (cyclomatic 18): markdownTarget.resolveMarkdownTarget 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":"ui/src/markdownTarget.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15d3c9e41000a0b5fac880a4f32b7d21589704ff1b547b15bb24f58b595b8e2"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelPicker.ModelPicker::moveFocus (cyclomatic 18): ModelPicker.ModelPicker::moveFocus 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 shape REPEATS in the file: one other method here (ModelPicker.ModelPicker) 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":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"373ef43c0de2f6fd90c5b39a59be3673095059284660fe4cca7f8aea6862d51e"}},{"ruleId":"D1","level":"warning","message":{"text":"Md.replaceMentions (cyclomatic 18): Md.replaceMentions 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":"ui/src/components/Md.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"e735e1a4672dfaa9a305a31e248c443701cfedf4564a39940e5456877c07a2b5"}},{"ruleId":"D1","level":"warning","message":{"text":"experimentLineageModel.layoutLineage (cyclomatic 18): experimentLineageModel.layoutLineage has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 5 function items inside it that branch (visit, a function literal at line 232, lanesNeeded, \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":"ui/src/components/experimentLineageModel.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13354a5b1c2979f72d311446dcf6bedc5847f8baec58282176e503765c16042"}},{"ruleId":"D1","level":"warning","message":{"text":"AccountChip.LoginSession (cyclomatic 18): AccountChip.LoginSession has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 199, 178, 194, \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":"ui/src/components/AccountChip.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d0c598b1df3aec249dadab8c41ca2c7c3e7af4ed7b7f1c3a83441dfd7b835b"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.OverleafCard (cyclomatic 18): SettingsPage.OverleafCard 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4334}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb35fe09133cb22820243f5883f391d947541924921b64e4f8bdb52a63ca1ed5"}},{"ruleId":"D1","level":"warning","message":{"text":"Usage.PlanRows (cyclomatic 18): Usage.PlanRows 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":"ui/src/components/Usage.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfee9c676fea452f61a4d78958d3954e70e0b5f4dce616c170c46d120b1bb49"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.ToolRow (cyclomatic 18): ChatPanel.ToolRow has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b69a35c9a092d49d1d709ed4a416417fa51e9f6db57d579d20abbfe9aafa29f"}},{"ruleId":"D1","level":"warning","message":{"text":"SkillsTab.SkillsCard (cyclomatic 18): SkillsTab.SkillsCard has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SkillsTab.tsx"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd5eb02b42d97fab07c6a7fe4419cde87b782214d381de738336459cd8edfa3"}},{"ruleId":"D1","level":"warning","message":{"text":"CsvTable.CsvTable (cyclomatic 18): CsvTable.CsvTable 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 6 function literals inside it that branch (lines 202, 131, 162, \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":"ui/src/components/CsvTable.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb1731a8b25c0f84d0ac9596f67305774c013465114f6eda589729d2d224f89"}},{"ruleId":"D1","level":"warning","message":{"text":"App.App::renderContentTab (cyclomatic 18): App.App::renderContentTab 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 shape REPEATS in the file: one other method here (App.App) 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":"ui/src/App.tsx"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed97edb1c390f66f869092efbec226625c1bdd5b6928d9f331be042d43be0716"}},{"ruleId":"D1","level":"warning","message":{"text":"check (cyclomatic 18): check 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/local/harness/acp/deepseek-auth.cjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"feca7a2ae10292eb0f719f2f0c2d37e126bb296319ac64a13d36fbf61167e47a"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenCode::detect_at (cyclomatic 17): OpenCode::detect_at 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/local/harness/opencode.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9758a635bf8d1508345244e2039a8f62b2911801cd8f8053408a14cc62a6c279"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseLease::acquire (cyclomatic 17): DatabaseLease::acquire 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/local/opencode_db.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"3069f85b3e2fbf78bc0bd2b16dc012b75bbd2fbeb999b2cc54e63a5a7e8b6fc5"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::publish_harness (cyclomatic 17): openresearch_cli::commands::up::publish_harness 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/commands/up.rs"},"region":{"startLine":8961}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f812791ddf242145b402c3c09ba39bc19c3c43e9b2f137bcaa028893ee0cc2"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::agent_tools::delegate (cyclomatic 17): openresearch_cli::commands::up::agent_tools::delegate 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/commands/up/agent_tools.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a31c2ec540e2317b10e9e741800da871dd1b2fd20c53290359c57bd0379304d"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::harness_setup::connect (cyclomatic 17): openresearch_cli::commands::up::harness_setup::connect 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/commands/up/harness_setup.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"66de66b9b4f3cc7f3ffbbaf4941a7dcfda0c8114844497cfa640ce5405dc398e"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::jobs::huggingface::stream_once (cyclomatic 17): openresearch_cli::jobs::huggingface::stream_once 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/jobs/huggingface.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"0972b037632f2e49a94c8488e255507a11166b256d55d4aa531f3ee4f4a7a0cd"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::hosts::split_destination (cyclomatic 17): openresearch_cli::jobs::ssh::hosts::split_destination 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/jobs/ssh/hosts.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3992339633473887d943eebc00485d0fbdef1f00cde67af784e6a9285dd9d57"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::chat::handoff::context (cyclomatic 17): openresearch_cli::local::chat::handoff::context 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/local/chat/handoff.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c9b295e468b93d0f237662bb901f76977a0946286becff5e96b5990636639c"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::open_session (cyclomatic 17): openresearch_cli::local::harness::acp::open_session 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/local/harness/acp.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dcb5d8f55747c4526ff9e953d0a4ecd3506aed42872a7dd8bf4ac849124dc6"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::auth::config_auth::minimax_login (cyclomatic 17): openresearch_cli::local::harness::acp::auth::config_auth::minimax_login 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/local/harness/acp/auth/config_auth.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8442d2985534e6243cf41b35a558d325b39177b3c4308f911c37bb47a96162ed"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::apply_sub_notification (cyclomatic 17): openresearch_cli::local::harness::codex::apply_sub_notification 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/local/harness/codex.rs"},"region":{"startLine":3084}}}],"partialFingerprints":{"codehealthFindingId/v1":"895ccfca4f92afdf01c9157d8a969a95e085f6b69b4052d212b7c0da1c4099b3"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::managed::unpack (cyclomatic 17): openresearch_cli::local::harness::managed::unpack 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/local/harness/managed.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"94037272b2f457238fbfb3541952e9e8a846bff3bd13b234a3406e1a39441a87"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::opencode_v2::run_turn (cyclomatic 17): openresearch_cli::local::harness::opencode_v2::run_turn has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/opencode_v2.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b879b89c1cc9951faeb6816fb1eb12b7a7e77bb7e91ca94dd70aa48867ffe5dd"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::opencode_v2::merge_projection (cyclomatic 17): openresearch_cli::local::harness::opencode_v2::merge_projection 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/local/harness/opencode_v2.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"788508b88536957e78f8028a5fc8f285c6ef08a99aa30c3225c6a66b5b55e19a"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::native_store::home_session_files (cyclomatic 17): openresearch_cli::local::native_store::home_session_files has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/native_store.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de2a4331b047236e69dadef03fe70d1eaedc099f40cd9c7a6fe093e3f7731fb"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::storage::migrate (cyclomatic 17): openresearch_cli::local::storage::migrate 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/local/storage.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9efc2f5c4d6f7e9ae8ba864b76f232174c077eea6eec9ed3853a897facb0dc7"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::user_skills::instructions_selected_in (cyclomatic 17): openresearch_cli::local::user_skills::instructions_selected_in 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/local/user_skills.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0262a118724e40ddcef1ca618c1eaf1205665fc553fad2332a0b0bdbe19eeae"}},{"ruleId":"D1","level":"warning","message":{"text":"runDisplay.runDisplay (cyclomatic 17): runDisplay.runDisplay 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":"ui/src/runDisplay.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4909629bd33fd30690a69e1a2115e014175532fb909086d36f23a1124ba8e31"}},{"ruleId":"D1","level":"warning","message":{"text":"useProjectWorkspace.createProjectPersistence.save (cyclomatic 17): useProjectWorkspace.createProjectPersistence.save 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":"ui/src/useProjectWorkspace.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4d95c402789cee688e93dcdbb3d904f8e3110024a3342c76e222ea4b4f52d4"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteStopDialog.RemoteStopDialog (cyclomatic 17): RemoteStopDialog.RemoteStopDialog 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":"ui/src/components/RemoteStopDialog.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdc83c38ba7ac138f77d01052bffb71860df12fc706ccd05598b9e83b4a7cf7"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateBanner.useRestartApp.restart (cyclomatic 17): UpdateBanner.useRestartApp.restart has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 88, retired). 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":"ui/src/components/UpdateBanner.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99b01231c878539cc74cfcf62a47f6332941d747e4c801054750e4440fad022"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.AnnotationsPopover (cyclomatic 17): ChatPanel.AnnotationsPopover has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7e973f472dd2753506067930811c1d038e03e9cc0d68b144d5b1791767333a"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.commandReadTarget (cyclomatic 17): ChatPanel.commandReadTarget 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0db3c22f99f76022d4d798edc1456cfaca3a74e91d22f81c19b137f423b8677"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenSharedProject.PickFolder (cyclomatic 17): OpenSharedProject.PickFolder 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, 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":"ui/src/components/OpenSharedProject.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb52cfbff09ab2471486717dd8061b7e7030aab220bad9aab72b9bb3b49382f1"}},{"ruleId":"D1","level":"warning","message":{"text":"Host::summary (cyclomatic 16): Host::summary 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/orx-host/src/server.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"546f5b8bcc47b20243680544b043c5722ee0ce5ed5c1d6e7d6924238d5d04a60"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeClient::compact (cyclomatic 16): ClaudeClient::compact 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/local/claude.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a86eaf85d2f609326b9cb466ffb2d86d6a350690bab2116dbd10c6403b1d98"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::handle_update (cyclomatic 16): Connection::handle_update 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/local/overleaf_live.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a661be228f51312234433674a6c3b612f70be5879cfd69c271c58a08560586"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::alphaxiv_mcp::handle (cyclomatic 16): openresearch_cli::commands::alphaxiv_mcp::handle 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/commands/alphaxiv_mcp.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"247ddaeda9f641fd470bae0d9b0d750dccb5064f14ecb6cb1fd9148969747c0c"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::ssh_connect_socket (cyclomatic 16): openresearch_cli::commands::up::ssh_connect_socket 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/commands/up.rs"},"region":{"startLine":7324}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fc93cf03b7bc35e95a71f86ce1ad11342beb66ed32abf0216f9b890233d1ca"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::event_loop (cyclomatic 16): openresearch_cli::commands::up::event_loop 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/commands/up.rs"},"region":{"startLine":10767}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec12446fb73e79e04d44b02f3e5440c59edb8112f021c626e4cb921741859b21"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::commands::up::run_events (cyclomatic 16): openresearch_cli::commands::up::run_events 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/commands/up.rs"},"region":{"startLine":10906}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2367baf9c20b6634ea07c106cf71beaff549cb6871e82a28287d5e7eb43bc55"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::prepared::resolve_with_agent (cyclomatic 16): openresearch_cli::jobs::ssh::prepared::resolve_with_agent 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/jobs/ssh/prepared.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"293c810818b4d01b352fcae4f5ed8b62ce681eb9e959d6665c77ed22980d8bcb"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::chat::news::deliver_news (cyclomatic 16): openresearch_cli::local::chat::news::deliver_news 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/local/chat/news.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2487efc70276443dcccdb884f55f82cca753f24c4d56a21c8aa26601824328"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::git::initialize (cyclomatic 16): openresearch_cli::local::git::initialize 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/local/git.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"764e1e01359ed3cde342a6820d2066061a41302471be2c62b4552e102157b3f3"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::prompt_session (cyclomatic 16): openresearch_cli::local::harness::acp::prompt_session 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/local/harness/acp.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fdee65dc76173e175bb57e739b65d4c5d76fc81376404e55878a5fec4eba8f"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::installed_plugin_skills_dirs (cyclomatic 16): openresearch_cli::local::harness::codex::installed_plugin_skills_dirs 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/local/harness/codex.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bddb5fd8ca3fae7207cac788297dc6475f812a4025e7ba7ce2eb6f48cc479d5"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::route_sub_event (cyclomatic 16): openresearch_cli::local::harness::codex::route_sub_event has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/codex.rs"},"region":{"startLine":3262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6c4a8cfcc6fc391e6c1ad06e23e56f5a71617905cc64c57f75cc99bbbcfcb3"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::spend::seven_days (cyclomatic 16): openresearch_cli::local::spend::seven_days 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/local/spend.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"af251c6caf7c6eb364132b51854a7a69cce964f431dc3b7677721f24b3fe5e54"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::ssh_identity::offered_identities (cyclomatic 16): openresearch_cli::local::ssh_identity::offered_identities 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/local/ssh_identity.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e35e1fc8f81c395cda24416231e1bf64b7cea1c47cf088c4118f11a4548195a"}},{"ruleId":"D1","level":"warning","message":{"text":"openresearch_cli::local::user_skills::collect_mirrored (cyclomatic 16): openresearch_cli::local::user_skills::collect_mirrored 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/local/user_skills.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"995a7c4df1e9f506bd556c4ce9753cdfbd7d182adf52c1a603b182aa45392c17"}},{"ruleId":"D1","level":"warning","message":{"text":"helper.dispatch (cyclomatic 16): helper.dispatch 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/jobs/ssh/helper.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42c51d88f8d06fe020b0555f99d069e787280edad1cb22037cc03be9c968120"}},{"ruleId":"D1","level":"warning","message":{"text":"orx-chart.html.sliceRows (cyclomatic 16): orx-chart.html.sliceRows has cyclomatic complexity 16 (threshold 15). Of this number, 11 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":"agent-skills/orx-figures/assets/orx-chart.html"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a09eeb09067fd5943b241eebe98c671eb9dbdff78e322e93a3ba0801d3a031e"}},{"ruleId":"D1","level":"warning","message":{"text":"desktop_zoom.window.addEventListener(\u0022keydown\u0022) (cyclomatic 16): desktop_zoom.window.addEventListener(\u0022keydown\u0022) 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/commands/desktop_zoom.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d4f710f61c2f690c77deae2c032fb6f4397990acd394fe2fcab1ce71070d56"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalModelSetup.LocalModelGuide (cyclomatic 16): LocalModelSetup.LocalModelGuide has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/LocalModelSetup.tsx"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5c2e91df7a2bf412ee0a20806c47848033d0612df7edd2d1562dbc4b69a2bb"}},{"ruleId":"D1","level":"warning","message":{"text":"AddAgentDialog.canConfigureHarness (cyclomatic 16): AddAgentDialog.canConfigureHarness 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":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e74fb521937a2c2ee8438c16047a3a27a9925d21ae3a882981f2bd71d11c14"}},{"ruleId":"D1","level":"warning","message":{"text":"FileReference.FileReference (cyclomatic 16): FileReference.FileReference has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/FileReference.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b80be066079abf863a9c30d2e0b8bdb4da56d8e61161833991618fcb5085e6"}},{"ruleId":"D1","level":"warning","message":{"text":"keyboardNavigation.navigateKeyboardRow (cyclomatic 16): keyboardNavigation.navigateKeyboardRow has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/keyboardNavigation.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ad65ab874f518d8b9e097c42beb93159f0c290815af4b3bd7c58acdc89f4ac"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentMessageCard.SentCard (cyclomatic 16): AgentMessageCard.SentCard 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":"ui/src/components/AgentMessageCard.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec5f70aa0a86fda250852e2d660f2ff6d3a17168ffeb0f453c3fa9e31f1df8c"}},{"ruleId":"D1","level":"warning","message":{"text":"markdownLivePreview.findMathTokens (cyclomatic 16): markdownLivePreview.findMathTokens 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":"ui/src/markdownLivePreview.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9a47c0b9dbd2e048fa85eebf9decd19b498e5832e73ed3230c306b7f498e06"}},{"ruleId":"D1","level":"warning","message":{"text":"ExperimentRunBanner.RunRow (cyclomatic 16): ExperimentRunBanner.RunRow 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":"ui/src/components/ExperimentRunBanner.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a5fae1f21b9f1f4156edb901504e4c602cad7cc58200afea7f285140278090"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPage.SettingsView (cyclomatic 16): SettingsPage.SettingsView has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4973}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e696e44b7c96a2669f718f0b523b90447a2903f04123f4d31b1fa9e002a4bef"}},{"ruleId":"D1","level":"warning","message":{"text":"StatusStrip.UsagePanel (cyclomatic 16): StatusStrip.UsagePanel has cyclomatic complexity 16 (threshold 15). Of this number, 13 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":"ui/src/components/StatusStrip.tsx"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba9db27126ed45bfe32ff90017426679e399eb52301ea1019aaf68e9fd3ad21"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.resolvePosixPath (cyclomatic 16): ChatPanel.resolvePosixPath 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2349d1baa3971ac3d748c1c9b6d4d4a2a80db43062a7bacd3c068930003525"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.SubagentTranscript (cyclomatic 16): ChatPanel.SubagentTranscript has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4296}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bff74526745f3190cb0b51e478582c96744a8ae7692b0ee2c0085fac4919e55"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.useTranscriptAnnouncement (cyclomatic 16): ChatPanel.useTranscriptAnnouncement has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 4514, 4540, 4520, \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4506}}}],"partialFingerprints":{"codehealthFindingId/v1":"703fc91efb45dd552a530d257d1834167acb62edd3aa8df3fd859b2c86beec9b"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.ChatPanel::send::restoreComposer (cyclomatic 16): ChatPanel.ChatPanel::send::restoreComposer has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: 5 other methods here (ChatPanel.ChatPanel, ChatPanel.ChatPanel::selectModel, ChatPanel.ChatPanel::runComposerCommand, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7055}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98c3c7caa82cdbdeea0f5933914c2b4a118655443bea9d93fceb0e255ec5581"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPanel.ChatPanel::runShell (cyclomatic 16): ChatPanel.ChatPanel::runShell has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 5 other methods here (ChatPanel.ChatPanel, ChatPanel.ChatPanel::selectModel, ChatPanel.ChatPanel::runComposerCommand, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7382}}}],"partialFingerprints":{"codehealthFindingId/v1":"e887abfd365d363c1edce0bc1c601ca8175572710217285220ec40afa527e882"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfPreview.PdfPreview (cyclomatic 16): PdfPreview.PdfPreview 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 7 function items inside it that branch (a function literal at line 79, a function literal at line 234, a function literal at line 119, \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":"ui/src/components/PdfPreview.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f1f7070c5ce5646e46fded6a2da478364af55fb7860f06889ba379043ef947"}},{"ruleId":"D1","level":"warning","message":{"text":"csv.parseCsv (cyclomatic 16): csv.parseCsv has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/csv.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6973a969f8105d6656b1b32987d46a4d2ae43fac52409150044426d46b520e1c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) 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":"src/commands/desktop_zoom.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5531e3d765a741bbdd6286b59cb755e105c48f9dcbd21039dea70dfbdf96b49a"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.ChatPanel (cognitive 287): ChatPanel.ChatPanel has cognitive complexity 287 (threshold 15). Drivers by points: if/else 278 (368 pts), ternaries 195 (310 pts), boolean chains 301, error handling 21 (26 pts), loops 6 (7 pts), match/switch 2 (nesting depth added 211). To reduce it, split the body into named stages: move each independent 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: 6 other methods here (ChatPanel.ChatPanel::selectModel, ChatPanel.ChatPanel::runComposerCommand, ChatPanel.ChatPanel::setGoal, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":5485}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32a605dfc241161b943f0071ff8bedacc2cdbf5bbe5a6ae564e7c5331c23f18"}},{"ruleId":"D2","level":"warning","message":{"text":"Actor::run (cognitive 263): Actor::run has cognitive complexity 263 (threshold 15). Drivers by points: if/else 50 (155 pts), loops 14 (48 pts), match/switch 9 (31 pts), boolean chains 29 (nesting depth added 161). 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/engine/transport/mod.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"465a212dd11e16c9b186a09cb8237b2ff6b7f839e657406333d2a3b690b5d59d"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.computeToolActivity (cognitive 257): ChatPanel.computeToolActivity has cognitive complexity 257 (threshold 15). Drivers by points: ternaries 50 (140 pts), if/else 47 (91 pts), boolean chains 25, match/switch 1 (nesting depth added 134). Of this number, 240 points are the body\u0027s own statements and 17 belong to 8 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b0c26e5678a8ddc73fcd11a51288e7ccf9e700c6a5483c6d621e779947a889"}},{"ruleId":"D2","level":"warning","message":{"text":"AddAgentDialog.AddAgentDialog (cognitive 255): AddAgentDialog.AddAgentDialog has cognitive complexity 255 (threshold 15). Drivers by points: boolean chains 127, ternaries 48 (79 pts), if/else 48, error handling 1 (nesting depth added 31). Of this number, 125 points are the body\u0027s own statements and 130 belong to 41 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":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f790e30327cee14cf800117c979eaaea63e8a332ef4d361ab73df97d1d64d7"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::claude::apply_event (cognitive 196): openresearch_cli::local::harness::claude::apply_event has cognitive complexity 196 (threshold 15). Drivers by points: if/else 53 (163 pts), match/switch 10 (22 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 124). 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/local/harness/claude.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3961ab2f7d0dbf6ebbd7322a206ba28da992f39bf4ff6a125fa6f94df31d19"}},{"ruleId":"D2","level":"warning","message":{"text":"NewProjectForm.NewProjectForm (cognitive 173): NewProjectForm.NewProjectForm has cognitive complexity 173 (threshold 15). Drivers by points: boolean chains 89, ternaries 35 (55 pts), if/else 23 (26 pts), error handling 3 (nesting depth added 23). Of this number, 122 points are the body\u0027s own statements and 51 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":"ui/src/components/NewProjectForm.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"92793da66d60c2f9e8efc2760ed14eca439c9415f34afa4607678162d740d030"}},{"ruleId":"D2","level":"warning","message":{"text":"FileViewer.FileViewer (cognitive 153): FileViewer.FileViewer has cognitive complexity 153 (threshold 15). Drivers by points: ternaries 36 (107 pts), boolean chains 91, if/else 39 (55 pts), error handling 2 (nesting depth added 87). 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. This shape REPEATS in the file: one other method here (FileViewer.FileViewer::save) 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":"ui/src/components/FileViewer.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"933e641e45f83581a66dd7c63ae0f23da79469643b40829095ea33e3ee5e12e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.ChatPanel::send (cognitive 146): ChatPanel.ChatPanel::send has cognitive complexity 146 (threshold 15). Drivers by points: if/else 46 (74 pts), ternaries 19 (33 pts), boolean chains 32, error handling 4 (7 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 6 other methods here (ChatPanel.ChatPanel, ChatPanel.ChatPanel::selectModel, ChatPanel.ChatPanel::runComposerCommand, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":6975}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb87017ee272067f47441dc2f4a632be79886ec95d66082da7f7b8ffef29879"}},{"ruleId":"D2","level":"warning","message":{"text":"App.App (cognitive 142): App.App has cognitive complexity 142 (threshold 15). Drivers by points: if/else 201 (242 pts), boolean chains 205, ternaries 77 (90 pts), loops 12 (15 pts), error handling 3 (nesting depth added 57). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (App.App::renderContentTab) 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":"ui/src/App.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb9d2e4199cf1c14c638533e45f0a76960aaf358cce65f5fea5573ff089d0bd"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatHost::send_message_showing (cognitive 140): ChatHost::send_message_showing has cognitive complexity 140 (threshold 15). Drivers by points: if/else 64 (108 pts), boolean chains 21, match/switch 6 (9 pts), loops 1 (2 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/local/chat/mod.rs"},"region":{"startLine":5988}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7d4c5ee327c8406b121c119c71aa21996392db23fda4adbd76152ddf8d8f7a"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelPicker.ModelPicker (cognitive 138): ModelPicker.ModelPicker has cognitive complexity 138 (threshold 15). Drivers by points: boolean chains 70, ternaries 37 (47 pts), if/else 21 (nesting depth added 10). Of this number, 78 points are the body\u0027s own statements and 60 belong to 33 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":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f83db299a23c4e99d738cb88d15352ed9ac52272ae75af6d1d6c5d3cb7d5185"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::app::imp::run_event_loop (cognitive 134): openresearch_cli::commands::app::imp::run_event_loop has cognitive complexity 134 (threshold 15). Drivers by points: if/else 40 (86 pts), match/switch 15 (30 pts), loops 5 (11 pts), boolean chains 7 (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":"src/commands/app.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cc0b8d9916d3fb1a375443fb76dd090f2485708e15627103a102370eeb2a7e"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatSearch.ChatSearch (cognitive 126): ChatSearch.ChatSearch has cognitive complexity 126 (threshold 15). Drivers by points: boolean chains 48, ternaries 20 (46 pts), if/else 27 (32 pts) (nesting depth added 31). Of this number, 70 points are the body\u0027s own statements and 56 belong to 13 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatSearch.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a12f3a9fc2815eeb1cd41aca6cf78af68998e42a7f93d33d519084450b0d358"}},{"ruleId":"D2","level":"warning","message":{"text":"Onboarding.Onboarding (cognitive 125): Onboarding.Onboarding has cognitive complexity 125 (threshold 15). Drivers by points: ternaries 30 (69 pts), boolean chains 41, if/else 13, error handling 2 (nesting depth added 39). Of this number, 87 points are the body\u0027s own statements and 38 belong to 20 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":"ui/src/components/Onboarding.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd6057aeb503bbf33fcc39f75f2cb0f8cf22ea072415fde6544e0114e265e56"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.Transcript (cognitive 120): ChatPanel.Transcript has cognitive complexity 120 (threshold 15). Drivers by points: if/else 36 (45 pts), boolean chains 38, ternaries 25 (30 pts), loops 6 (7 pts) (nesting depth added 15). Most of this is not in the body itself: 4 of the 120 points are its own statements and the rest belongs to 25 function literals inside it that branch (lines 4918, 4935, 4705, \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4590}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b66f925584b58375c2aa516c48b98461cdb7811660a01bb35c9ff3f723137b"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.SshSection (cognitive 118): SettingsPage.SshSection has cognitive complexity 118 (threshold 15). Drivers by points: ternaries 23 (83 pts), boolean chains 25, if/else 4 (9 pts), error handling 1 (nesting depth added 65). Most of this is not in the body itself: 6 of the 118 points are its own statements and the rest belongs to 13 function items inside it that branch (a function literal at line 1848, hostAction, a function literal at line 1914, \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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdac32131976fa71cb227574652f0e89efd7052846a5c23e79129e09e0bbf5ff"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::claude::run_attempt (cognitive 108): openresearch_cli::local::harness::claude::run_attempt has cognitive complexity 108 (threshold 15). Drivers by points: if/else 26 (68 pts), match/switch 9 (26 pts), boolean chains 8, loops 3 (6 pts) (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/claude.rs"},"region":{"startLine":2850}}}],"partialFingerprints":{"codehealthFindingId/v1":"0382dd03cb1d1998836a3f8adfde4de589b24c19f600c395c76275a4315ef51d"}},{"ruleId":"D2","level":"warning","message":{"text":"orx-chart.html.draw (cognitive 106): orx-chart.html.draw has cognitive complexity 106 (threshold 15). Drivers by points: ternaries 33 (56 pts), boolean chains 27, if/else 14 (17 pts), loops 4 (6 pts) (nesting depth added 28). Of this number, 51 points are the body\u0027s own statements and 55 belong to 13 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent-skills/orx-figures/assets/orx-chart.html"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2acea1b835830332c799bc5c37e9110f353cbd4b306d2c7e7929cdf9811b5b"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::run_turn_app_server (cognitive 104): openresearch_cli::local::harness::codex::run_turn_app_server has cognitive complexity 104 (threshold 15). Drivers by points: if/else 28 (65 pts), match/switch 12 (28 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into 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/local/harness/codex.rs"},"region":{"startLine":3545}}}],"partialFingerprints":{"codehealthFindingId/v1":"a222312094dc7cd9843b7e13c339330ca905d12c90cf1acb7f5ec5ceef858b20"}},{"ruleId":"D2","level":"warning","message":{"text":"Host::slurm_queue (cognitive 101): Host::slurm_queue has cognitive complexity 101 (threshold 15). Drivers by points: if/else 16 (40 pts), match/switch 15 (36 pts), loops 11 (15 pts), boolean chains 10 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/server.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4c53196289f85ec51c1b74c562cc794e4c45a1dd9e08a20bb1e94815ad42cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Host::request (cognitive 86): Host::request has cognitive complexity 86 (threshold 15). Drivers by points: if/else 25 (55 pts), boolean chains 15, loops 4 (9 pts), match/switch 4 (7 pts) (nesting depth added 38). 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/orx-host/src/server.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9d975eb9fbab7294a690549ddd165b0563da252299680860219930140d1aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::storage::scan (cognitive 85): openresearch_cli::local::storage::scan has cognitive complexity 85 (threshold 15). Drivers by points: if/else 21 (57 pts), loops 6 (14 pts), boolean chains 9, match/switch 2 (5 pts) (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":"src/local/storage.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"146b9719d17369086c15f3c1599f37231aee23d3112998de9ee32269a6dc7486"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.OpenResearchSection (cognitive 83): SettingsPage.OpenResearchSection has cognitive complexity 83 (threshold 15). Drivers by points: ternaries 17 (56 pts), boolean chains 27 (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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"2242c9c5548cdd4b9c1c9d83b4027398c47f9b1dbc105999ea124795d51bbaaf"}},{"ruleId":"D2","level":"warning","message":{"text":"orx_chart.validate_views (cognitive 82): orx_chart.validate_views has cognitive complexity 82 (threshold 15). Drivers by points: if/else 15 (47 pts), boolean chains 13, ternaries 3 (13 pts), loops 4 (9 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent-skills/orx-figures/assets/orx_chart.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4c74a89bd3cbc425442a6146a23d968a3d7f5947085c17305a6b87eb0ef312"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryPicker.SignedInLibraryPicker (cognitive 77): LibraryPicker.SignedInLibraryPicker has cognitive complexity 77 (threshold 15). Drivers by points: ternaries 18 (65 pts), boolean chains 7, if/else 3 (5 pts) (nesting depth added 49). Of this number, 47 points are the body\u0027s own statements and 30 belong to 6 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":"ui/src/components/LibraryPicker.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f088479af8ab81ce99129efc1d29f0a5e84265e0e26c25d7d8cb63f41c6088"}},{"ruleId":"D2","level":"warning","message":{"text":"orx_host::wrapper::state (cognitive 75): orx_host::wrapper::state has cognitive complexity 75 (threshold 15). Drivers by points: if/else 17 (48 pts), match/switch 5 (17 pts), loops 1 (7 pts), boolean chains 3 (nesting depth added 49). 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/orx-host/src/wrapper.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb6eaefcabd3287f2fb9c880dfba8e0a84d7d8db4133570528bab021b4d2ee2"}},{"ruleId":"D2","level":"warning","message":{"text":"markdownLivePreview.collectFormatting (cognitive 75): markdownLivePreview.collectFormatting has cognitive complexity 75 (threshold 15). Drivers by points: if/else 24 (43 pts), ternaries 9 (21 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 33). None of this is in the body itself: all 75 points belong to one function literal inside it that branches (line 257). 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":"ui/src/markdownLivePreview.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9affd9063366341e21e3fbd38db195a803a7f259e73c048096b87d6612a06cb"}},{"ruleId":"D2","level":"warning","message":{"text":"orx_host::wrapper::wrap (cognitive 72): orx_host::wrapper::wrap has cognitive complexity 72 (threshold 15). Drivers by points: if/else 20 (37 pts), match/switch 8 (17 pts), boolean chains 13, loops 3 (5 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/orx-host/src/wrapper.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"60062f7e4dc91c12e375aa7a532383e215f0acd64b6f0ab3f95e7b89b853d59d"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::relay_pty (cognitive 72): openresearch_cli::commands::up::relay_pty has cognitive complexity 72 (threshold 15). Drivers by points: if/else 15 (57 pts), match/switch 5 (12 pts), loops 2, boolean chains 1 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up.rs"},"region":{"startLine":7511}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaaeccbfd3ec627090565f6b101560122fcf9ab099fe756a6b0655602f9f4c9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Actor::login (cognitive 71): Actor::login has cognitive complexity 71 (threshold 15). Drivers by points: if/else 32 (52 pts), match/switch 7 (10 pts), boolean chains 9 (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":"src/engine/transport/mod.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"0419d2ca3d984b3103d408cd4d052d0d4c34327154fb4dbbd1ebcac56172b438"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::commit (cognitive 69): Engine::commit has cognitive complexity 69 (threshold 15). Drivers by points: if/else 28 (39 pts), boolean chains 25, match/switch 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/reconcile.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"94218ebda717066e6f8069d6d968a98e908710ed28f3c9c68e9d6e07544c0ffe"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::run (cognitive 67): openresearch_cli::commands::up::run has cognitive complexity 67 (threshold 15). Drivers by points: if/else 33 (51 pts), boolean chains 8, match/switch 3 (5 pts), loops 2 (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":"src/commands/up.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea6bbcd85dd05678453dba1974f1d787bff17fc400a5ffddc8858d713c3c676"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelList.ModelList (cognitive 66): ModelList.ModelList has cognitive complexity 66 (threshold 15). Drivers by points: boolean chains 23, if/else 19 (22 pts), ternaries 15 (19 pts), loops 2 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 49 belong to 20 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":"ui/src/components/ModelList.tsx"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a922d16287e8e0baaf01f6437d90547bcc0db8ed9216d5f7f1a6065071e4426"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.PromptCard (cognitive 66): ChatPanel.PromptCard has cognitive complexity 66 (threshold 15). Drivers by points: ternaries 12 (32 pts), boolean chains 21, if/else 9 (13 pts) (nesting depth added 24). Of this number, 64 points are the body\u0027s own statements and 2 belong to one function item 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3242}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7b43dec667293c604e9644225d272b19f295cd6d518f69821c2673cd7c5258"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::run_turn_exec (cognitive 63): openresearch_cli::local::harness::codex::run_turn_exec has cognitive complexity 63 (threshold 15). Drivers by points: if/else 27 (51 pts), match/switch 6 (8 pts), loops 2 (3 pts), boolean chains 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/local/harness/codex.rs"},"region":{"startLine":4697}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb4015192de69caded6ca6b4dde84ec038008353ccc002f174dbd03837fcf76"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.SessionRow (cognitive 63): ChatPanel.SessionRow has cognitive complexity 63 (threshold 15). Drivers by points: if/else 27 (31 pts), boolean chains 23, ternaries 9 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 46 belong to 16 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":5117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b447c455c04fa03c8cc23c79ff4aafb3a2ce20d78b29c00089f2d3a03e6d97a"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::acp::host::spawn (cognitive 62): openresearch_cli::local::acp::host::spawn has cognitive complexity 62 (threshold 15). Drivers by points: if/else 27 (51 pts), boolean chains 6, match/switch 4 (5 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":"src/local/acp/host.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3a0e06f9dff59d6b74d80b78c520e0bc1e37bf53a20a7bd7ae519bd1f9d0d7"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.SlurmSection (cognitive 62): SettingsPage.SlurmSection has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 13 (29 pts), boolean chains 21, if/else 6 (11 pts), error handling 1 (nesting depth added 21). Of this number, 37 points are the body\u0027s own statements and 25 belong to 8 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc37897bfbad19f6aa39cdf8bada81884f80b08f09bb76bca71ace49ffa71ad"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.AgentList::harnessRow (cognitive 61): SettingsPage.AgentList::harnessRow has cognitive complexity 61 (threshold 15). Drivers by points: boolean chains 38, ternaries 12 (22 pts), if/else 1 (nesting depth added 10). 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: 3 other methods here (SettingsPage.AgentList, SettingsPage.AgentList::providerRow, SettingsPage.AgentList::foundRow) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"b645852844e171a932f512024f15b0e5c47c461b7cb3d5c85ad4a417886a52f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Broker::dispatch (cognitive 60): Broker::dispatch has cognitive complexity 60 (threshold 15). Drivers by points: if/else 25 (53 pts), boolean chains 4, loops 1 (3 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/jobs/ssh/service/mod.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"e261bfba673059ca292ded67e215f390dd3c0893de1500f6ddcfb9373e7f7069"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposerEditor.ComposerEditor (cognitive 60): ComposerEditor.ComposerEditor has cognitive complexity 60 (threshold 15). Drivers by points: if/else 29, boolean chains 16, ternaries 12 (14 pts), error handling 1 (nesting depth added 2). Most of this is not in the body itself: 6 of the 60 points are its own statements and the rest belongs to 16 function items inside it that branch (a function literal at line 598, a function literal at line 548, a function literal at line 667, \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":"ui/src/components/ComposerEditor.tsx"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e376e08f872cbae6cd5b78cabaa1bc02421d54ae7f0c0094d8dd044c196af93a"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.commandRunIds (cognitive 60): ChatPanel.commandRunIds has cognitive complexity 60 (threshold 15). Drivers by points: if/else 13 (29 pts), ternaries 6 (16 pts), loops 6 (11 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"565a629a16d55a290f641a5a56a6764472b84c902fda40cae2b8cf291ec88225"}},{"ruleId":"D2","level":"warning","message":{"text":"TurnCtx::apply_target_events (cognitive 59): TurnCtx::apply_target_events has cognitive complexity 59 (threshold 15). Drivers by points: if/else 11 (51 pts), loops 2 (8 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/local/chat/mod.rs"},"region":{"startLine":8922}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edad7228ea77cba457bb8d85da8519e7371045e6cdfbc89523f27e7c71e32a4"}},{"ruleId":"D2","level":"warning","message":{"text":"orxCommand.shellWords (cognitive 58): orxCommand.shellWords has cognitive complexity 58 (threshold 15). Drivers by points: if/else 19 (43 pts), boolean chains 12, ternaries 1 (2 pts), loops 1 (nesting depth added 25). Of this number, 54 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/orxCommand.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef442f7e1efa57e98a7e046e458a835947ff06671451e48b749da979c6fb03a9"}},{"ruleId":"D2","level":"warning","message":{"text":"AcpAuthDialog.AcpAuth (cognitive 58): AcpAuthDialog.AcpAuth has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 13 (46 pts), boolean chains 20, if/else 9 (10 pts), error handling 1 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (AcpAuthDialog.AcpAuth::verify) 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":"ui/src/components/AcpAuthDialog.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c37fca59eed588c2073a67174e35d3a2152bb45cd2292d74f055793b0e8da1"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteRuntime.RemoteSetup (cognitive 58): RemoteRuntime.RemoteSetup has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 11 (35 pts), boolean chains 21, error handling 1, if/else 1 (nesting depth added 24). Of this number, 53 points are the body\u0027s own statements and 5 belong to 5 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":"ui/src/RemoteRuntime.tsx"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d6814973d871aba701aa0bd163a0966ac55e474ed0c7c39cdc379807abdc83"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentIcon.AgentIconPicker (cognitive 56): AgentIcon.AgentIconPicker has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 17 (46 pts), boolean chains 6, if/else 1 (4 pts) (nesting depth added 32). Of this number, 36 points are the body\u0027s own statements and 20 belong to 6 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":"ui/src/components/AgentIcon.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5430ab830a54550211da513b1e16c7facebb63fe7ec97bc0a25f44fa9bd2965"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatHost::recover_turn (cognitive 55): ChatHost::recover_turn has cognitive complexity 55 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 10, match/switch 5 (9 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/local/chat/mod.rs"},"region":{"startLine":5392}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b79da14a985285df016fa07cab91794c94729a557df073698cf9a69b7924fe"}},{"ruleId":"D2","level":"warning","message":{"text":"ApiClient::logs_to (cognitive 55): ApiClient::logs_to has cognitive complexity 55 (threshold 15). Drivers by points: if/else 11 (33 pts), match/switch 4 (11 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plane/local_plane.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a611aa79a2ab57fcebc9e2c9539d0cc99723c5ad98e5331d4e708b3e6465f3"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::harness_setup::run (cognitive 55): openresearch_cli::commands::up::harness_setup::run has cognitive complexity 55 (threshold 15). Drivers by points: if/else 21 (38 pts), match/switch 5 (11 pts), boolean chains 6 (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":"src/commands/up/harness_setup.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"610ca5145eb163e78bfc37cd82c97cf05d3bb58b00376d9dcfcdb2689dfe4dd9"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalPlane::experiment_status (cognitive 54): LocalPlane::experiment_status has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (31 pts), match/switch 6 (16 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plane/local_plane.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b095c788d0e7bdc4bfb41ffdb77a7f950aa3976d3b4ccba7c5230851a3e7abd6"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::jobs::kubernetes::prepare_docs (cognitive 54): openresearch_cli::jobs::kubernetes::prepare_docs has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (41 pts), loops 7 (9 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/kubernetes.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb09722bac2b04fe04e16b8b7692ac720d67825a28ae72567d698f0eb555f98"}},{"ruleId":"D2","level":"warning","message":{"text":"WorktreeTab.WorktreeTab (cognitive 54): WorktreeTab.WorktreeTab has cognitive complexity 54 (threshold 15). Drivers by points: ternaries 19 (30 pts), boolean chains 19, if/else 4, error handling 1 (nesting depth added 11). Of this number, 44 points are the body\u0027s own statements and 10 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/WorktreeTab.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"33487a089f7577371f74d7a983881b5e3e228953d6cecb10c8c5a189dfcccedf"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatHost::drain_queue (cognitive 53): ChatHost::drain_queue has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (46 pts), boolean chains 6, match/switch 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":"src/local/chat/mod.rs"},"region":{"startLine":4933}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7ec518c7d6f36e5843fc2cdcbed2534952c2c352316ebaf77c234fa01c2990"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up_remote::connect_once (cognitive 53): openresearch_cli::commands::up_remote::connect_once has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (30 pts), match/switch 11 (16 pts), boolean chains 5, loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up_remote.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"292d1064a67e6aa954e36c99b8df44a62b23626d91053ecba5400fc71cc6ec21"}},{"ruleId":"D2","level":"warning","message":{"text":"UsageMenu.UsageMenu (cognitive 53): UsageMenu.UsageMenu has cognitive complexity 53 (threshold 15). Drivers by points: boolean chains 29, ternaries 18 (21 pts), if/else 3 (nesting depth added 3). Of this number, 46 points are the body\u0027s own statements and 7 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":"ui/src/components/UsageMenu.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0904537f9db9db3b2fe0ba2c23c9adf4f9691b2de458fd7bcbee457dadf03672"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::service::transport::connect (cognitive 52): openresearch_cli::jobs::ssh::service::transport::connect has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (41 pts), match/switch 3 (6 pts), loops 5 (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/jobs/ssh/service/transport.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc08708452bda8aa63f594925a051ff39c78550028bb4a48d1e541f73be3fea"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::hosts::parse (cognitive 51): openresearch_cli::jobs::ssh::hosts::parse has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (41 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (3 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/jobs/ssh/hosts.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3640a378914e8ca17b17af51c05fab21ed78594e7ff429cd38d6b019119783dc"}},{"ruleId":"D2","level":"warning","message":{"text":"OverleafPanel.OverleafPanel (cognitive 51): OverleafPanel.OverleafPanel has cognitive complexity 51 (threshold 15). Drivers by points: ternaries 19 (31 pts), boolean chains 15, if/else 4, error handling 1 (nesting depth added 12). Of this number, 40 points are the body\u0027s own statements and 11 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":"ui/src/components/OverleafPanel.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc2f8f11cf89c132eb753a44ae48fb484c5aaec14df1881773d7877f5e89024"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::run_cli (cognitive 50): openresearch_cli::run_cli has cognitive complexity 50 (threshold 15). Drivers by points: if/else 34 (47 pts), boolean chains 2, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ebe45ba4c70b5694e1855b15f32c0f1ae2aff53a7349456809e64e532ef259"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::compute::validate_run_args (cognitive 50): openresearch_cli::compute::validate_run_args has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (31 pts), boolean chains 15, loops 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compute.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"635a521936844fccf015a992c0609c4e932e529865fde9244a97f5534df21314"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpHoverCard.ExpHoverCard (cognitive 50): ExpHoverCard.ExpHoverCard has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 16 (19 pts), boolean chains 18, if/else 9 (10 pts), loops 2, error handling 1 (nesting depth added 4). Of this number, 43 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ExpHoverCard.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bbc4154ccb0d551bede97f799222929423e822de9cb5d8bc62661b052acd74"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::agent_tools::wait (cognitive 49): openresearch_cli::commands::up::agent_tools::wait has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (35 pts), loops 4 (8 pts), boolean chains 5, match/switch 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":"src/commands/up/agent_tools.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"74faaa62396400ee1b44cee18dd5649f61f98b4c8145168685f6bad4ef27ef09"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::service::run (cognitive 49): openresearch_cli::jobs::ssh::service::run has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (30 pts), match/switch 4 (10 pts), loops 2 (5 pts), boolean chains 4 (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":"src/jobs/ssh/service/mod.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ce65472f6d8aabcca7f83253598a6e94cc5420f6703328ac7f15317632f8e4"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::chat::subagent::snapshot (cognitive 48): openresearch_cli::local::chat::subagent::snapshot has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 3 (8 pts), match/switch 2 (7 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":"src/local/chat/subagent.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a34a7379659769b8436c089842672b4f86ed7a32a74769180a946406cfae0e9"}},{"ruleId":"D2","level":"warning","message":{"text":"workspaceState.parsePane (cognitive 48): workspaceState.parsePane has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 6 (18 pts), if/else 8 (15 pts), boolean chains 14, 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":"ui/src/workspaceState.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"05def93d63f05091ca7d78002592e4fab974b36ace8ea4bd11eb10b2d1db8587"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenResearch::inspect (cognitive 47): OpenResearch::inspect has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (37 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/adapters/openresearch.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"6688a8768b38b53e68defb963c68256a536d383fd415c00e16f2cab7ce8aec7b"}},{"ruleId":"D2","level":"warning","message":{"text":"ApiClient::wait (cognitive 47): ApiClient::wait has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (38 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 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":"src/plane/local_plane.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3f83850b95b642be536d7eaa423fc0dc16804a904603bd2b0bc4f72160836d"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.K8sSection (cognitive 47): SettingsPage.K8sSection has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 11 (27 pts), boolean chains 15, if/else 3, error handling 2 (nesting depth added 16). Of this number, 33 points are the body\u0027s own statements and 14 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"2573a66617bc3a97982e83001e12c23bc8d299de6c0ceb01521e5b0114375f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::update_chat_session (cognitive 46): openresearch_cli::commands::up::update_chat_session has cognitive complexity 46 (threshold 15). Drivers by points: if/else 26 (43 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up.rs"},"region":{"startLine":9969}}}],"partialFingerprints":{"codehealthFindingId/v1":"59057a866fde39f1f9920e6ab9d94773151a4512a663ed777ba85df4d3c9b085"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::api_v2::events (cognitive 46): openresearch_cli::commands::up::api_v2::events has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (29 pts), match/switch 4 (10 pts), boolean chains 6, 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/commands/up/api_v2.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"1957bff7795b5cced0d2a521728cb6c7f680fcddf62f827720480d4fe4d3592a"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionHoverCard.SessionHoverCard (cognitive 46): SessionHoverCard.SessionHoverCard has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 10 (19 pts), boolean chains 16, if/else 9 (11 pts) (nesting depth added 11). Of this number, 26 points are the body\u0027s own statements and 20 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":"ui/src/components/SessionHoverCard.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"948f610e2d6b7a24e11e76d1584db823c8cf0935697e524893b8105cd95d122a"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::cleanup_run_artifacts_locked (cognitive 45): Store::cleanup_run_artifacts_locked has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 6 (8 pts), match/switch 4 (8 pts), boolean chains 5 (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/store.rs"},"region":{"startLine":2844}}}],"partialFingerprints":{"codehealthFindingId/v1":"c714510a45dc704bdd86e4836b1c32bff1b11e57ea17544ce3831356d9ab64e9"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.UpdatesTab (cognitive 45): SettingsPage.UpdatesTab has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 12 (29 pts), boolean chains 10, if/else 5, error handling 1 (nesting depth added 17). Of this number, 36 points are the body\u0027s own statements and 9 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3859}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ebd8fca8cdc039f9af9683aab18f8dca1077d7c5c4655f6866ee7a1e3ee775"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeHost::acquire_turn (cognitive 44): ClaudeHost::acquire_turn has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 11, match/switch 3 (8 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/local/claude.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e6b19331b07ded65b26b4fd47c49abec912f79aeac98062c5fdf8f1f460ff6"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::apply_event (cognitive 44): openresearch_cli::local::harness::acp::apply_event has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (37 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/acp.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"070471de4535fd2c443faf85d4ce19a66e9b0dd3ce65f699049947d79c8613e7"}},{"ruleId":"D2","level":"warning","message":{"text":"orx_figstyle._text_collisions (cognitive 44): orx_figstyle._text_collisions has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 8 (13 pts), boolean chains 5, error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent-skills/orx-figures/assets/orx_figstyle.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba6c10b1158fc5774a0d747b4289fb805e7ec439fb4dac6a000f6654c5535c5"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.GitTab (cognitive 44): SettingsPage.GitTab has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 26, ternaries 7 (13 pts), if/else 5 (nesting depth added 6). Of this number, 35 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4414}}}],"partialFingerprints":{"codehealthFindingId/v1":"9451198c38fb7cb3fc3be1dc5d6f307035ed568aad0c5c017a2198035918cf53"}},{"ruleId":"D2","level":"warning","message":{"text":"Header.Brand (cognitive 44): Header.Brand has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 18 (31 pts), boolean chains 13 (nesting depth added 13). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/Header.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"16923f8ee312acaeefdcdff2128900678cfce83f7c6e422baaf76473fe6eaaba"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigureArgs::body (cognitive 43): ConfigureArgs::body has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 6, loops 4 (5 pts), match/switch 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":"src/commands/compute.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ed4b4ba561343b4bb83c0158aed207fac1406d8b70efeb45da3107ebaae905"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::apply_notification (cognitive 43): openresearch_cli::local::harness::codex::apply_notification has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (42 pts), match/switch 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":"src/local/harness/codex.rs"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd6e045f6433847f9290e040b600465a17e2827c2cd46c0008a425bf23ec51b"}},{"ruleId":"D2","level":"warning","message":{"text":"runDisplay.runNotice (cognitive 43): runDisplay.runNotice has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (24 pts), ternaries 7 (17 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":"ui/src/runDisplay.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c760d1224ff8e593994bec3eef45d975fe740a4f07b67967e433342885eacd20"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelPicker.OptionPicker (cognitive 43): ModelPicker.OptionPicker has cognitive complexity 43 (threshold 15). Drivers by points: boolean chains 20, ternaries 9 (14 pts), if/else 9 (nesting depth added 5). Of this number, 28 points are the body\u0027s own statements and 15 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56f98d4809b6db0dc2f3c9d499b68e7cf50ac23e020ae45b8b2739ba139452f"}},{"ruleId":"D2","level":"warning","message":{"text":"Events.QueryEvents (cognitive 43): Events.QueryEvents has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (23 pts), ternaries 5 (11 pts), boolean chains 9 (nesting depth added 8). Most of this is not in the body itself: 6 of the 43 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 116, 138, 129, \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":"ui/src/queries/Events.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b07276fabe35c0571c8d1818a448e5c4474ac41899b10ec647097f36eb63e74"}},{"ruleId":"D2","level":"warning","message":{"text":"ResumeDialog.ResumeDialog (cognitive 43): ResumeDialog.ResumeDialog has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 12 (30 pts), if/else 7 (8 pts), boolean chains 5 (nesting depth added 19). Most of this is not in the body itself: 13 of the 43 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 134, a function literal at line 166, pick, \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":"ui/src/components/ResumeDialog.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ee582720b4d28f5b5866d9e21d0de8c069c533c0cfaaabc45aceea8173b356"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatHost::stop_turn (cognitive 42): ChatHost::stop_turn has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (40 pts), boolean chains 1, 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":"src/local/chat/mod.rs"},"region":{"startLine":7026}}}],"partialFingerprints":{"codehealthFindingId/v1":"e037098017a998a01ba3b0dd52378dd9e02287d729273a5bde9e417b6676cd16"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::experiments::archive_ids (cognitive 42): openresearch_cli::local::experiments::archive_ids has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 7 (16 pts), boolean chains 5, match/switch 1 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/experiments.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1935b18c37b1ba3ff007596da2a287031c9d2c372d178924725fb8d952d7d348"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.commandExperimentIds (cognitive 42): ChatPanel.commandExperimentIds has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 5 (11 pts), loops 4 (10 pts), boolean chains 4 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8669a17764ebbac93d254c00908f2708c89ce08569818cda7dfeb5cf2045f5c"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.ResearchToolRun (cognitive 42): ChatPanel.ResearchToolRun has cognitive complexity 42 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 4 (10 pts), ternaries 5 (10 pts), boolean chains 8, match/switch 1 (nesting depth added 18). Most of this is not in the body itself: 2 of the 42 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 3137, 3178, 3217). 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e866b4109a5db5ef82565dbe5b14d23ec17d05b05432a7da9d63bcaa7fa59de"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::api_v2::read_log (cognitive 41): openresearch_cli::commands::up::api_v2::read_log has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 17, 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/commands/up/api_v2.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"78589cdaa4ef060a407e4a701baf26790f85f5ac00699bf43273596781349d5c"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::chat::handoff::snapshot (cognitive 41): openresearch_cli::local::chat::handoff::snapshot has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (33 pts), boolean chains 3, match/switch 1 (3 pts), loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/handoff.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a98b3163d59e1318d7229bac3dbb8ed1daf9658885efa73aaaebb18927325e"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::claude::read_loop (cognitive 41): openresearch_cli::local::claude::read_loop has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 2, match/switch 1 (2 pts), boolean chains 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/local/claude.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cb844a67b1538319c6ffd4362547ec56fb044a32259bdfdf79a2e911e1883a"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::managed::catalog::latest (cognitive 41): openresearch_cli::local::harness::managed::catalog::latest has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (36 pts), loops 1 (3 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/local/harness/managed/catalog.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"146e9239e0b6ac8b57051618db358f240f74e05be0b40e6dc409cefac944da78"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.VercelSection (cognitive 41): SettingsPage.VercelSection has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 16 (20 pts), boolean chains 18, if/else 2, error handling 1 (nesting depth added 4). Of this number, 33 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20a194d8bf9b47aa0b9b8294292bf12f973b74af81a0f2b17c30d26440719bf"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.alphaxivActivity (cognitive 41): ChatPanel.alphaxivActivity has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 19 (36 pts), boolean chains 4, match/switch 1 (nesting depth added 17). Of this number, 35 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a7d10e7e687df04f021be25ae092859ecf4659b0eec87e12cd389e6d03f2ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Slurm::observe (cognitive 40): Slurm::observe has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (30 pts), match/switch 3 (5 pts), loops 2 (3 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":"src/engine/adapters/slurm.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97003da04e02af6f046cd0ba2daad5ac52f1516894c114cd5c9ceab703edd4f"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::chat::preserve_tool_targets (cognitive 40): openresearch_cli::local::chat::preserve_tool_targets has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (19 pts), loops 8 (19 pts), boolean chains 2 (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/local/chat/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5ca5fc48f1615918a1076612a7101763752565f50163357873a32b893cbfb6"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::overleaf_live::run_connection (cognitive 40): openresearch_cli::local::overleaf_live::run_connection has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 7 (10 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/overleaf_live.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dd5bd364fcdea9f3b2b73e70712830d7d5b8a22d55d50d1df88ba541506213"}},{"ruleId":"D2","level":"warning","message":{"text":"markdownNormalization.normalizeCurrencyDollars (cognitive 40): markdownNormalization.normalizeCurrencyDollars has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 5, loops 5, ternaries 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":"ui/src/markdownNormalization.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7c9abf807a2141a69a6767f4fa5fd1741a1730a4e59aa517c8716442902106"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceConnection.WorkspaceConnection (cognitive 40): WorkspaceConnection.WorkspaceConnection has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 19 (30 pts), boolean chains 9, if/else 1 (nesting depth added 11). Of this number, 39 points are the body\u0027s own statements and 1 belongs to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/WorkspaceConnection.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2408fb3243bbc92f9a02ec67e5425a16bd660a01c8854a9ff23e9ffdaca4cab"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.ToolActivityLabel (cognitive 40): ChatPanel.ToolActivityLabel has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 18, if/else 9 (11 pts), ternaries 6 (11 pts) (nesting depth added 7). Of this number, 26 points are the body\u0027s own statements and 14 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"333813f8d3a1af5f80c242614b21404eca1caa7ee03b62fccab6541f4747916d"}},{"ruleId":"D2","level":"warning","message":{"text":"orx_host::exec::run (cognitive 39): orx_host::exec::run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 1 (4 pts), boolean chains 3, loops 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/exec.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edd038fa52ca9505f2f17f3d3727390d3c5f95b8baa906ee9ba63c9c4c88483"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime::collect_log (cognitive 39): Runtime::collect_log has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (9 pts), match/switch 3 (9 pts), boolean chains 6 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/runtime.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f415f2583d35b306d9426bf713d7d20859e0214e1ad9972e9cb54e8f2e93547"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::reclaim_orphaned_run_artifacts (cognitive 39): openresearch_cli::commands::up::reclaim_orphaned_run_artifacts has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 3 (10 pts), match/switch 2 (9 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":"src/commands/up.rs"},"region":{"startLine":5469}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dbcdffc11e5b33d1c34c8918c782e11a2cd5695df5e886eb765993bfab0d1a"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::overleaf::plan (cognitive 39): openresearch_cli::local::overleaf::plan has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 2 (6 pts), boolean chains 3, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/overleaf.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e2bfaa2c5f3ee07d2ffb40531de1d5f8809203476a64d2b753a645f174b8f9"}},{"ruleId":"D2","level":"warning","message":{"text":"orx-chart.html.drawDiagram (cognitive 39): orx-chart.html.drawDiagram has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 8 (20 pts), if/else 4 (8 pts), loops 4 (6 pts), boolean chains 5 (nesting depth added 18). Of this number, 33 points are the body\u0027s own statements and 6 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":"agent-skills/orx-figures/assets/orx-chart.html"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff06e569c18bcb5d9df0caf67f69eda22c21a6acff27cbd19a1f51ff2eed31d"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.ToolGroup (cognitive 39): ChatPanel.ToolGroup has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 13 (19 pts), boolean chains 14, if/else 4 (6 pts) (nesting depth added 8). Of this number, 36 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2816}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb85f32d8700eaeeff7e1f6eb913c863f6c5d49b8e8971fe36d4fe4b45058ac"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::open_session (cognitive 38): openresearch_cli::local::harness::acp::open_session has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (33 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 21). 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/local/harness/acp.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe23fd98dd0a077c3a4a24272e8ffe3344c6d6a329b3fd45ad7a1f6364b54592"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::auth::config_auth::grok_checked (cognitive 38): openresearch_cli::local::harness::acp::auth::config_auth::grok_checked has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 7, loops 1 (2 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":"src/local/harness/acp/auth/config_auth.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"6338b859b4e378bc995f38a9f854d94a8698349118d926098a7f17c29492407f"}},{"ruleId":"D2","level":"warning","message":{"text":"routePages.ProjectsPage (cognitive 38): routePages.ProjectsPage has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 6 (21 pts), boolean chains 11, if/else 1 (6 pts) (nesting depth added 20). Of this number, 26 points are the body\u0027s own statements and 12 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/routePages.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"595c665629f4cfe18c2f04eacb0b16133864a3912e136381c1f1cb363218cb44"}},{"ruleId":"D2","level":"warning","message":{"text":"orx_host::wrapper::stop (cognitive 37): orx_host::wrapper::stop has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 4, match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/wrapper.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d230e39ee63a3302c7e3370c279e095efc68d0f49cf2c2cfca25cc5e2d6092"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::scan_legacy (cognitive 37): Engine::scan_legacy has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 6, loops 6 (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/engine/legacy.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24d7c25223183cbbf520260b178957453ac8d5f1e5be7909b9f1e47a5286821"}},{"ruleId":"D2","level":"warning","message":{"text":"Codex::detect_at (cognitive 37): Codex::detect_at has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 8, match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/codex.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b394fa2e3c569af44ba68929fd64bc140c005b0a43d379f7b7c1725ab8b410"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::mcp::run (cognitive 37): openresearch_cli::commands::mcp::run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (30 pts), match/switch 2 (5 pts), loops 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":"src/commands/mcp.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f886044307b0f8cc188bf72c2c8b57022e6d459cedefb74e9bd91a553d96e01"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::agent_tools::call (cognitive 37): openresearch_cli::commands::up::agent_tools::call has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 2 (4 pts), match/switch 2 (3 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":"src/commands/up/agent_tools.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5d6211b7e6e6176293a5ec07ccdc9eb7061292a7ed448697728eff00b88ee1"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::codex::read_loop (cognitive 37): openresearch_cli::local::codex::read_loop has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 3 (9 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":"src/local/codex.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee1212f96cf04d8c2bed23866cc5b6e7c83c5f816d155200caefdefa4f25a26"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::apply_sub_notification (cognitive 37): openresearch_cli::local::harness::codex::apply_sub_notification has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (8 pts), boolean chains 2, match/switch 1 (nesting depth added 23). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/codex.rs"},"region":{"startLine":3084}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cadeb860d53cbdd3b03e20e5a6369a4e8babe996573732f0bf5b74c2586c2b"}},{"ruleId":"D2","level":"warning","message":{"text":"api.createApi.json (cognitive 37): api.createApi.json has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 10, ternaries 2 (6 pts), error handling 1 (2 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":"ui/src/api.ts"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecc8ca90c84549d1543f938f9dc5a84441d7c087733fcaa1a90e0e0df37c63c"}},{"ruleId":"D2","level":"warning","message":{"text":"DetailDrawer.TerminalView (cognitive 37): DetailDrawer.TerminalView has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 14 (23 pts), boolean chains 11, if/else 3 (nesting depth added 9). Of this number, 33 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/DetailDrawer.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5450b9851f647327d7a28e39cd45b453d071c0df717dc77cbfb644ca382a22"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::recover_gated (cognitive 36): Engine::recover_gated has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 3 (8 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":"src/engine/submit.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5af7978f7226f38daf992bd8358d713b2cd8e1816fc43ce3715717b48fc4534"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCode::detect_at (cognitive 36): ClaudeCode::detect_at has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (30 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/claude.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5496bafee187f99435d02d9d51022eefbe73f6aeaa7d7a9bf104b13b8eac1567"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::opencode::found_providers (cognitive 36): openresearch_cli::local::harness::opencode::found_providers has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 8 (12 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/opencode.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c51dab02aa4e2c8cda719aa105d4622083fccafddb45ff8e1d1ff641991503"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::search_chat_messages (cognitive 35): Store::search_chat_messages has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/store/search.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d1fa660202ed08af59cac88008b3feeda3040ec27a89704acb3bc4c08f4394"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::prompt_session (cognitive 35): openresearch_cli::local::harness::acp::prompt_session has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/acp.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b465cdba6008f031cb3cef52dff9cf9aa0c31ec61b8b12d249ec80736f9661"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::cursor::run_turn (cognitive 35): openresearch_cli::local::harness::cursor::run_turn has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 5 (8 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/cursor.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"4264bbc69ca73d14ab625b31e0fffc3bbb4f35336784191621e7f77375eab66f"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::opencode_v2::prompts (cognitive 35): openresearch_cli::local::harness::opencode_v2::prompts has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 4 (5 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/opencode_v2.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"7976dd4e35648498ccfb4e5a2034b0a7d3f6f19ae59de93031d8957001a0e1e6"}},{"ruleId":"D2","level":"warning","message":{"text":"helper.slurm_status (cognitive 35): helper.slurm_status has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (8 pts), boolean chains 5, ternaries 1 (3 pts), error handling 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/jobs/ssh/helper.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef0b8a2ad7ae88071f1fab54cff1def5016dc39be2dc598fdce6c3f39d7365b"}},{"ruleId":"D2","level":"warning","message":{"text":"dev.parseArgs (cognitive 35): dev.parseArgs has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (nesting depth added 8). Of this number, 32 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dev.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ceafb201379149bcc8a67e95e9db1998c3b0c02721333476b932f54a56910f"}},{"ruleId":"D2","level":"warning","message":{"text":"chatSearch.chatSearchRanges (cognitive 35): chatSearch.chatSearchRanges has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 8 (12 pts), boolean chains 6, ternaries 1 (nesting depth added 12). Of this number, 34 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":"ui/src/chatSearch.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e456db5f7b4f210bec49ee364e577901f7af76b6eebfcf058420256f1082f074"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.Message (cognitive 35): ChatPanel.Message has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 17, if/else 9 (17 pts), ternaries 1 (nesting depth added 8). Of this number, 19 points are the body\u0027s own statements and 16 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3595}}}],"partialFingerprints":{"codehealthFindingId/v1":"5579abc5bead24984bb927282bc9aa6e00f32c7e247d4b570b82088b7c6616cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Host::launch (cognitive 34): Host::launch has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (25 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/orx-host/src/server.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f4c3bacca5b1af088bf8c5e48b69af5c4c7b6715f125b49321fa498e12806e"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime::tick (cognitive 34): Runtime::tick has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 5 (10 pts), loops 4, boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/runtime.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc563daa51b7ad1548cbc751ca6ae8055cb4e60875441018d90b4782f5e2e00"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::chat::subagent::apply_antigravity_record (cognitive 34): openresearch_cli::local::chat::subagent::apply_antigravity_record has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 2 (6 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/local/chat/subagent.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5e521225bb640cc0aa93de24ecb47ee2114819d48dbe55a535d8ac72b64c2a"}},{"ruleId":"D2","level":"warning","message":{"text":"orx_figstyle._audit (cognitive 34): orx_figstyle._audit has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent-skills/orx-figures/assets/orx_figstyle.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0701f1f03d4b833dbfb0c4937198aff32db94021e931dd33cfa5160e1d37663"}},{"ruleId":"D2","level":"warning","message":{"text":"dev.main (cognitive 34): dev.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 5 (10 pts), boolean chains 2, match/switch 1 (nesting depth added 14). Of this number, 30 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dev.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"190641fed162c6a7957c4364ed7381da800483411be2d888fb27fc3152b12847"}},{"ruleId":"D2","level":"warning","message":{"text":"files.createFileQueries.resolvedFileQuery (cognitive 34): files.createFileQueries.resolvedFileQuery has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 12 (21 pts), boolean chains 7, if/else 2 (5 pts), loops 1 (nesting depth added 12). Most of this is not in the body itself: 4 of the 34 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 130, 155, 121, \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":"ui/src/queries/files.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e789d291549910d6418fde0d7f8ab9ca09c2a960b9556904dd49cdee187b5ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"useProjectWorkspace.createProjectPersistence.useProjectWorkspace (cognitive 34): useProjectWorkspace.createProjectPersistence.useProjectWorkspace has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 8, ternaries 1 (3 pts), loops 1 (nesting depth added 7). Most of this is not in the body itself: 3 of the 34 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 200, 193, 179, \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":"ui/src/useProjectWorkspace.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33a156d61a969c053e5677dd2bb7d026e56edd9b470b04c9c5212b0a45bcadd"}},{"ruleId":"D2","level":"warning","message":{"text":"keyboardNavigation.navigateKeyboardList (cognitive 34): keyboardNavigation.navigateKeyboardList has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 9, ternaries 4 (7 pts) (nesting depth added 6). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/keyboardNavigation.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e854878239d7eedc1f785968097afedee58c747eabe2f33ee5ac4cb4ff3238"}},{"ruleId":"D2","level":"warning","message":{"text":"chatRendering.questionReplies (cognitive 34): chatRendering.questionReplies has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 7, loops 4 (6 pts) (nesting depth added 13). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/chatRendering.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29ba9a5ba5a9847c7227e3a10d7a22992bb8cca27f9a9e331df0c86808b7ddd"}},{"ruleId":"D2","level":"warning","message":{"text":"OverleafPanel.OverleafButton (cognitive 34): OverleafPanel.OverleafButton has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 9 (22 pts), boolean chains 8, if/else 4 (nesting depth added 13). Of this number, 28 points are the body\u0027s own statements and 6 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/OverleafPanel.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c08574c2b2cf2be118521efc5a8a350a761d6889872a7cb1475b43ffff6c44"}},{"ruleId":"D2","level":"warning","message":{"text":"Local::observe (cognitive 33): Local::observe has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 3 (8 pts), boolean chains 4, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/adapters/local.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90f428c63359f82d2b6db33ebc45f3bf20dd4eca9056a8e981bed556b1b1466"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeClient::compact (cognitive 33): ClaudeClient::compact has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 2 (6 pts), boolean chains 4, 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":"src/local/claude.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc19739a464af90764a261da839a15d1942e63ed27d5a8d272dd1add0caaadf2"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::event_loop (cognitive 33): openresearch_cli::commands::up::event_loop has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 3 (9 pts), loops 3 (7 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":"src/commands/up.rs"},"region":{"startLine":10767}}}],"partialFingerprints":{"codehealthFindingId/v1":"57408fadab05c3b36e1a29fc75cf379c46014f78a64e82b8100a7d17716a47c0"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::jobs::huggingface::stream_once (cognitive 33): openresearch_cli::jobs::huggingface::stream_once has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/huggingface.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"20154998d1637436ebc6183448e34b52b0445039861ec3ea785a618dc2d7d3fa"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::item_to_part (cognitive 33): openresearch_cli::local::harness::codex::item_to_part has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 8, loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/codex.rs"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1208c527838343eebf07213269cb5183065b09456a20ea416e6ea0bc76961d"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::managed::catalog::npm_install (cognitive 33): openresearch_cli::local::harness::managed::catalog::npm_install has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (9 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/managed/catalog.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0ce73a6e39604abf6a60bdd511b3aeffc4e989bafc30496f4777b0c823b81d"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.HfSection (cognitive 33): SettingsPage.HfSection has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 18, ternaries 8 (11 pts), error handling 2, if/else 2 (nesting depth added 3). Of this number, 21 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3302}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cc2b9e12fc99162258fadaf28b9c2dd961cebf83c07f761064402f0d9aae27"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeView.TreeView (cognitive 33): TreeView.TreeView has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 6 (10 pts), boolean chains 6, loops 4 (nesting depth added 5). Most of this is not in the body itself: 3 of the 33 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 510, 493, 626, \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":"ui/src/components/TreeView.tsx"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5749b32ce93214e33d58654f36481f07b4b4e6b9b997461e88b07c5559e5ed3"}},{"ruleId":"D2","level":"warning","message":{"text":"Adapter::drain_log (cognitive 32): Adapter::drain_log has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 5 (13 pts), boolean chains 2, 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/engine/adapters/api.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"989d7bc2b607ecdcd593b6019abbe1ccd83ab14e443567c45342e1c6b8a4c95c"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::update::apply (cognitive 32): openresearch_cli::commands::update::apply has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/update.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d30668aab73a213283add3115da27a6d26f83149abc7a688f3997ebdc64d96"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::route_sub_event (cognitive 32): openresearch_cli::local::harness::codex::route_sub_event has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 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/local/harness/codex.rs"},"region":{"startLine":3262}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c3856fb6080c8417e6469ae2dcf51f681dc42a3d0ed8dac13aa0758d1da551"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::native_store::reconcile_link (cognitive 32): openresearch_cli::local::native_store::reconcile_link has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 6, match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/native_store.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba06b196a7f57b8d6e4a7da73be2ebc2478ac168285e4bf78cf9dfd5190e944"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.DefaultDestinationEditor (cognitive 32): SettingsPage.DefaultDestinationEditor has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 14, ternaries 7 (11 pts), if/else 6, error handling 1 (nesting depth added 4). Most of this is not in the body itself: 15 of the 32 points are its own statements and the rest belongs to 7 function items inside it that branch (save, changeBackend, changeFlavor, \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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"3098ab1e55c5545359ffb090ab7da2d1ad30a3265b21b302e8e1d0dcccf0d503"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.StorageTab (cognitive 32): SettingsPage.StorageTab has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 16, ternaries 5 (8 pts), if/else 6, error handling 2 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 16 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4592}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a35aa7e92f1ce16416df4ccbe7bbe808e927937c2f39edccec3c3e7d06d0388"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerDescriptor::live (cognitive 31): ServerDescriptor::live has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 3 (6 pts), boolean chains 5, 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/commands/remote_host.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25fe3c29da9efccb2b5b407da3df6f82092c80b9e14b95ba87bc823a2d8caa8"}},{"ruleId":"D2","level":"warning","message":{"text":"Ssh::observe (cognitive 31): Ssh::observe has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/adapters/ssh.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cd8c7df9457f2b7fd4519b212bc43e1928da26513d1e37b70ad6ce4c458aa3"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::spawn_catalog_fill (cognitive 31): openresearch_cli::commands::up::spawn_catalog_fill has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 5, 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/commands/up.rs"},"region":{"startLine":9222}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfad8a24c40e292b343aaddd00a4756e3ad4be4006a36b68dbb9447b42ea327"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::opencode_v2::merge_projection (cognitive 31): openresearch_cli::local::harness::opencode_v2::merge_projection has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/opencode_v2.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d398f13721418e25489649de30c81e075726a41d731d3dfc98bb905db0c930"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::native_store::home_session_files (cognitive 31): openresearch_cli::local::native_store::home_session_files has cognitive complexity 31 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 4 (7 pts), boolean chains 1, match/switch 1 (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/local/native_store.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"05381b08af61c4c3c324957f68ce233667ccecc6cb8b53c33684e02d77fbe286"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteRuntime.RuntimeRoot (cognitive 31): RemoteRuntime.RuntimeRoot has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 13, if/else 11 (13 pts), ternaries 3 (5 pts) (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 13 belong to 4 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/RemoteRuntime.tsx"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"1980779256c72f269147eae35dd5f7fd3b36105101e783078530d6151f850f23"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.heredocMarker (cognitive 31): ChatPanel.heredocMarker has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (5 pts), boolean chains 4, ternaries 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2874edc60bea2a92bff59ac36451f1aac467cf49a112cbe9a8d2034fa63d00f"}},{"ruleId":"D2","level":"warning","message":{"text":"launch (cognitive 31): launch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 1 (4 pts), boolean chains 3, error handling 2 (3 pts), other 3 (nesting depth added 12). Most of this is not in the body itself: 8 of the 31 points are its own statements and the rest belongs to 8 function items inside it that branch (ensureBackend::request, ensureBackend::providerRuntimeHeadersResponder, a function literal at line 113, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/acp/zcode-runtime.cjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4986debea0465f7c82fc2e11cdb2647a51be24919e478415848375751b2b26"}},{"ruleId":"D2","level":"warning","message":{"text":"orx_host::wrapper::cleanup (cognitive 30): orx_host::wrapper::cleanup has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 1 (4 pts), boolean chains 3 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/wrapper.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa984acef8a63fd6e8954a768c05b003c3aa90c1eec5dad7038ad0c0b7827c5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::deliver_notify (cognitive 30): Engine::deliver_notify has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 7, match/switch 2 (3 pts), 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, and where an else follows 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/engine/notify.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"266219f45edbe8b583bb0fad19d488764c8cc4fd35e74a0a84c00835a94ecacd"}},{"ruleId":"D2","level":"warning","message":{"text":"workspaceTabs.restoreWorkspace (cognitive 30): workspaceTabs.restoreWorkspace has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (29 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":"ui/src/workspaceTabs.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7c24d2412190aa58dfa9912e0c82fe4b96ae8b581508dcdb22cc9c667b1667"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceTools.WorkspaceTools (cognitive 30): WorkspaceTools.WorkspaceTools has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 11 (19 pts), boolean chains 11 (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 14 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/WorkspaceTools.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43534e94505a523dfbd2e1cb476d3eafef1acc82d68a63af10ca3be1af4694f"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountChip.AccountChip (cognitive 30): AccountChip.AccountChip has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 12 (17 pts), boolean chains 12, if/else 1 (nesting depth added 5). Of this number, 28 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AccountChip.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e850f92c6c40b5ff7c34e656c084444e00468eb0a3acef6a303601cb456b70"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.shellCommandSegments (cognitive 30): ChatPanel.shellCommandSegments has cognitive complexity 30 (threshold 15). Drivers by points: if/else 21 (46 pts), boolean chains 9, loops 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ChatPanel.shellCommandSegments::scanSubstitution) 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2095d1055c5195a1a6ac9ae2630b977a5309a62ff839dea9b22873f6c9d2cea"}},{"ruleId":"D2","level":"warning","message":{"text":"ArtifactsTab.ArtifactsTab (cognitive 30): ArtifactsTab.ArtifactsTab has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10, ternaries 8 (9 pts), boolean chains 8, error handling 3 (nesting depth added 1). Most of this is not in the body itself: 11 of the 30 points are its own statements and the rest belongs to 13 function items inside it that branch (a function literal at line 585, reveal, a function literal at line 608, \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":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9efbbb778245526472917417928d56295222bd1c2ab928c3e414e765bab54c"}},{"ruleId":"D2","level":"warning","message":{"text":"ExperimentsTable.ExperimentsTable (cognitive 30): ExperimentsTable.ExperimentsTable has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 8 (10 pts), if/else 8 (9 pts), boolean chains 7, loops 3, error handling 1 (nesting depth added 3). Most of this is not in the body itself: 10 of the 30 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 110, requestCancel, a function literal at line 54, \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":"ui/src/components/ExperimentsTable.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5d17f25ab4dad01aad0655702b149265625332cffc4c74eebe75871986c722"}},{"ruleId":"D2","level":"warning","message":{"text":"App.parseFilePath (cognitive 30): App.parseFilePath has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 8 (13 pts), boolean chains 4 (nesting depth added 6). Of this number, 28 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb226a4155c5a84276630730e3dcc0774501968e5dac1628649ec54ad17f2ca"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowMenu.WindowMenu (cognitive 30): WindowMenu.WindowMenu has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 11, ternaries 5 (6 pts) (nesting depth added 2). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 85, 27, 78, \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":"ui/src/components/WindowMenu.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c545ce9c6232c7f45fbec0040a498cc5f1b20a2f02859759a0001c207455454"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatHost::launch_turn_ctx_locked (cognitive 29): ChatHost::launch_turn_ctx_locked has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (22 pts), match/switch 3 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":6692}}}],"partialFingerprints":{"codehealthFindingId/v1":"beeddd7ea2624a2a5183b74648675dcbebee6a1ec65321286481a5703cf84aca"}},{"ruleId":"D2","level":"warning","message":{"text":"Codex::compact (cognitive 29): Codex::compact has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 6 (11 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/codex.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbce0487d06b0bc4b2d094c099496b14e5dfe6dd96dd95f1f7ebdbce52164f0"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::set_ui_state (cognitive 29): openresearch_cli::commands::up::set_ui_state has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up.rs"},"region":{"startLine":6825}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddab0823e694b4feca62f1d80d5612548b5f2a8882f39f41a06c3e405c41646"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::chat::news::deliver_news (cognitive 29): openresearch_cli::local::chat::news::deliver_news has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (9 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/local/chat/news.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49e5d1f3d8b25a4486613aa92e3fc6f756ce54a4c0cb8c5c1b9f71f3aaae1f9"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::git::initialize (cognitive 29): openresearch_cli::local::git::initialize has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (29 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/local/git.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a93261d3aace7290e38bc04e02058288566f8f1588780bb6323ebb3b2ab142"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::auth::config_auth::minimax_login (cognitive 29): openresearch_cli::local::harness::acp::auth::config_auth::minimax_login has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/acp/auth/config_auth.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e902464cc924fa53993a1d908634cf398f1dfe8033357b0e912c2d65920efc16"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::opencode_v2::run_turn (cognitive 29): openresearch_cli::local::harness::opencode_v2::run_turn has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 4, 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/local/harness/opencode_v2.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e72371e2901aa2d91e903b8d7614c4ad90293898e1b8fbab3ec749035c4ced"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::ssh_identity::local_keys (cognitive 29): openresearch_cli::local::ssh_identity::local_keys has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (7 pts), boolean chains 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":"src/local/ssh_identity.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8ab0a00b557e2ea2baf9c41555d18877fa3bfcde2acc74d89aef470064cbc4"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlPreview.HtmlPreview (cognitive 29): HtmlPreview.HtmlPreview has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 9, ternaries 3, loops 1 (2 pts) (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 7 function literals inside it that branch (lines 189, 257, 253, \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":"ui/src/components/HtmlPreview.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aeb19abf32af35424274f3f5650fc5c0c708ca0c9398c1ee1cfb84d27957979"}},{"ruleId":"D2","level":"warning","message":{"text":"Md.replaceMentions (cognitive 29): Md.replaceMentions has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 6, ternaries 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":"ui/src/components/Md.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87952728242068b1a8a15dfb302dbcfb0773204f3bdc1c8bc56864e786bb7a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Md.Md (cognitive 29): Md.Md has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 9 (12 pts), boolean chains 10, if/else 6 (7 pts) (nesting depth added 4). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 510, 478, 499, \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":"ui/src/components/Md.tsx"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"da89dc57bd1d60c52cc2a0cfddb97f85d49b1e8cd4d9b638bddecded049932a2"}},{"ruleId":"D2","level":"warning","message":{"text":"RunContactNotice.RunContactNotice (cognitive 29): RunContactNotice.RunContactNotice has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 22, ternaries 4 (5 pts), error handling 1, if/else 1 (nesting depth added 1). Of this number, 26 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":"ui/src/components/RunContactNotice.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"255b742aba7ae999c8689a703b86ab6cc630db990958566fce00d6a03390bdd0"}},{"ruleId":"D2","level":"warning","message":{"text":"AcpHarnessDialog.AcpHarnessDialog::run (cognitive 29): AcpHarnessDialog.AcpHarnessDialog::run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 3 (7 pts), boolean chains 4, 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. This shape REPEATS in the file: one other method here (AcpHarnessDialog.AcpHarnessDialog) 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":"ui/src/components/AcpHarnessDialog.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2776f566f81042d524ccebff3b09f48b809a1f2a138286b440e7571dbb45cc23"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::poll_local (cognitive 28): Connection::poll_local has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 3, 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/local/overleaf_live.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce07cdeb1384f19b0b64594cfbd9772e26331bfb9b6d96efde6822054e312d2"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::ssh_connect_socket (cognitive 28): openresearch_cli::commands::up::ssh_connect_socket has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 3 (10 pts), loops 2 (5 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":"src/commands/up.rs"},"region":{"startLine":7324}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dcfb02ae83f9cdd8a40c351e6bad13dd3d06a53653cd1b275eaa445ce2cb27"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::latex_templates::write_into_session_in (cognitive 28): openresearch_cli::local::latex_templates::write_into_session_in 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, split the body into named stages: move each independent step or branch into 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/local/latex_templates.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"542a93274a14a6a02942282765c40d48a8f197b703615119d2c03db60a38e75c"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::share::import_staged (cognitive 28): openresearch_cli::local::share::import_staged has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 6 (8 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":"src/local/share.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f40094dc21ef24ab9f551a4b268970d5757c41f4966d91457bbcf1a7122f9a"}},{"ruleId":"D2","level":"warning","message":{"text":"zcode-auth.check (cognitive 28): zcode-auth.check has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 4 (8 pts), boolean chains 3, error handling 2 (3 pts), loops 1 (nesting depth added 10). Of this number, 27 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":"src/local/harness/acp/zcode-auth.cjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5203efff586fb062e002b01927de4b40123025609c9cfdf06c87852d21bbf54b"}},{"ruleId":"D2","level":"warning","message":{"text":"remarkFigures.remarkFigures.transform::visit (cognitive 28): remarkFigures.remarkFigures.transform::visit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 4 (9 pts), boolean chains 5, loops 3 (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":"ui/src/remarkFigures.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f8847b322d8f7540cc9dca2a7d437f03cac0874e83bf05002807e9edf235dd"}},{"ruleId":"D2","level":"warning","message":{"text":"HarnessSetupDialog.SetupRun (cognitive 28): HarnessSetupDialog.SetupRun has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 12, ternaries 5 (11 pts), if/else 5 (nesting depth added 6). Of this number, 20 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":"ui/src/components/HarnessSetupDialog.tsx"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ff45c80cb6bfcef34d97b0e0c1447d63d40deda132dff49faa1a31f44a16f9"}},{"ruleId":"D2","level":"warning","message":{"text":"fileMentions.matchFileMentions (cognitive 28): fileMentions.matchFileMentions has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 4 (10 pts), boolean chains 5, loops 1 (nesting depth added 14). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/fileMentions.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dfd97ff42187cd043dba46d453020d64e28ee96bd659d7f901e68f3cbed547"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::observe (cognitive 27): Engine::observe has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 5, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/reconcile.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"925cada203c0d0968f08290063d8297ac6541bd4c99361543bd37755e8271094"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteRun::from_backend (cognitive 27): RemoteRun::from_backend has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/ssh/cleanup.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6653a965e153aef2dbeaf6f111e7a0453582405c399b9439d4d683c99246b48c"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::joined (cognitive 27): Connection::joined has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/overleaf_live.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae35a2f3d64bf701f5c07a2505726aedc42e91ce4b4c05f6da297917446aa747"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::engine::adapters::openresearch::kept_page (cognitive 27): openresearch_cli::engine::adapters::openresearch::kept_page has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, loops 3 (4 pts), match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/adapters/openresearch.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"259ab0139911437bcc9f016554bb0bd0a735f658d6815b10b59db59cc73327f4"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::jobs::kubernetes::inspect_job (cognitive 27): openresearch_cli::jobs::kubernetes::inspect_job has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, loops 2 (3 pts), match/switch 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":"src/jobs/kubernetes.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7c4965d0fa267d7fa410cacaabfef2f89482ea3d39dcf85c8f975a8d9661d0"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::chat::watch_run_notices (cognitive 27): openresearch_cli::local::chat::watch_run_notices has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 4 (10 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":9869}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ee202d81d83a732e7165f0712a9808cc7c0d26b8e3afd3684b9ebaeb2a905b"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::claude::run_turn (cognitive 27): openresearch_cli::local::harness::claude::run_turn has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 6, match/switch 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/claude.rs"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"696dac34e99a4eea3eabf9856d3856e918faaf57f896e026c604925ba682e93a"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::reconcile_items (cognitive 27): openresearch_cli::local::harness::codex::reconcile_items has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (19 pts), boolean chains 5, 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":"src/local/harness/codex.rs"},"region":{"startLine":2527}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee66eca45943b7f5242b746b4f2cd3753d4e7471868376350036c6b737d15e71"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::model_routes::models (cognitive 27): openresearch_cli::local::model_routes::models has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 3 (9 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/model_routes.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5e2515e5d405adcca2af947207f524557f1e1aeae1522cf80cf681eb374b7c"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::projects::prepare_path (cognitive 27): openresearch_cli::local::projects::prepare_path has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (24 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":"src/local/projects.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"98498fdb3bd03adc54069c5411f329bf0ae1f848024bc2c61c47f963ac2d9768"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::ssh_identity::offered_identities (cognitive 27): openresearch_cli::local::ssh_identity::offered_identities has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (9 pts), loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/ssh_identity.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d41fed63d962dd78703cc8334147d8a5fad0129ecdba37643a94937aefed6a"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::user_skills::collect_mirrored (cognitive 27): openresearch_cli::local::user_skills::collect_mirrored has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 5 (9 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/user_skills.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc808d20becaf4f308464d4442d335eb170362f530a3e54b31dfcdadbc376206"}},{"ruleId":"D2","level":"warning","message":{"text":"events.createEvents.useOrxEventStream (cognitive 27): events.createEvents.useOrxEventStream has cognitive complexity 27 (threshold 15). Drivers by points: if/else 20, boolean chains 6, error handling 1. None of this is in the body itself: all 27 points belong to 24 function literals inside it that branch (lines 300, 413, 426, \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":"ui/src/events.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c057fa0092970c64c4268846417482f673be70acc52b12cee70c1be65344a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ExperimentLineage.Rail (cognitive 27): ExperimentLineage.Rail has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 9 (10 pts), boolean chains 4, loops 2 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ExperimentLineage.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"111a3265d70a8c72113e91f5d4f1a87018575459ebd3894ed11b995e65bdd6fb"}},{"ruleId":"D2","level":"warning","message":{"text":"markdownLivePreview.findMathTokens (cognitive 27): markdownLivePreview.findMathTokens has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 3, loops 2 (3 pts), ternaries 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":"ui/src/markdownLivePreview.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fa97044a515a8e35b18fd2b730b82be6debf616aefea41dc75a1bc4c707847"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.AssistantTurn (cognitive 27): ChatPanel.AssistantTurn has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 12, ternaries 9 (12 pts), if/else 3 (nesting depth added 3). Of this number, 21 points are the body\u0027s own statements and 6 belong to 6 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3964}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aefca17d2fdb6895e15ffa2c55760617c128ffb520d1b13c82a2ee5830d2547"}},{"ruleId":"D2","level":"warning","message":{"text":"SshHostReader::read_file (cognitive 26): SshHostReader::read_file has cognitive complexity 26 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 5 (9 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/compute_settings.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d36b51eb5700c58949c2d1ecfe56262e26f577793baa1e85c14e1d1f04e29ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::reread_watch (cognitive 26): Engine::reread_watch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/legacy.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ccb654b1c2e94ebdf704f3d44bdb88453c59899b6b5d0e8671f6467a25db62"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatHost::request_permission (cognitive 26): ChatHost::request_permission has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (10 pts), loops 2 (6 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":4002}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c81195e47e2bc0c04adfb03cbe2e0fbd046bcd7ed2e1787e6f829cff03d40bc"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::alphaxiv_mcp::handle (cognitive 26): openresearch_cli::commands::alphaxiv_mcp::handle has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 4 (8 pts), boolean chains 3 (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/commands/alphaxiv_mcp.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed393882d3bb93b8da66792d011fc947b1229c58289736f774521cde3f1ce9e"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::compute_settings::set_slurm_settings (cognitive 26): openresearch_cli::commands::up::compute_settings::set_slurm_settings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (23 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/compute_settings.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1fb05a6607f7a585030fd8c03fe6dbf1d584852be3893dc10a71299e8ab345"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::chat::handoff::context (cognitive 26): openresearch_cli::local::chat::handoff::context has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/handoff.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba857eed3f51a720ec477b41ede619714dafc476becb8def2a623f98f91ec58"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::auth::detect (cognitive 26): openresearch_cli::local::harness::acp::auth::detect has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 5 (9 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/local/harness/acp/auth.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c23742ff07e52e4a2997a06d9568e1e9409919ef0501fb2f16f0da11b42b13d"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::user_skills::migrate_project_scoped (cognitive 26): openresearch_cli::local::user_skills::migrate_project_scoped has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 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/local/user_skills.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a31b68d9955ed98908e93d6ef808a98be7605e325007439763258555d0347f3"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::user_skills::instructions_selected_in (cognitive 26): openresearch_cli::local::user_skills::instructions_selected_in has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, 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":"src/local/user_skills.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"f050ee86fddbdee92994b4b40e0bba20d5076bfb635a21143ad27df3718777ad"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeTab.CodeTab (cognitive 26): CodeTab.CodeTab has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 10 (18 pts), boolean chains 6, if/else 2 (nesting depth added 8). Of this number, 18 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":"ui/src/components/CodeTab.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e865d974fb48c670afdff35b1b229d35a9db32d1ae372734c571c5694c40fe58"}},{"ruleId":"D2","level":"warning","message":{"text":"ShareProjectDialog.ShareProjectDialog (cognitive 26): ShareProjectDialog.ShareProjectDialog has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 14, ternaries 7 (12 pts) (nesting depth added 5). Of this number, 24 points are the body\u0027s own statements and 2 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":"ui/src/components/ShareProjectDialog.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"94946d4f9f115767a967488398721f74bcc9534695825c4d66bdb9172eb6ebe9"}},{"ruleId":"D2","level":"warning","message":{"text":"AcpHarnessDialog.AcpHarnessDialog (cognitive 26): AcpHarnessDialog.AcpHarnessDialog has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 25, if/else 15 (21 pts), ternaries 10 (15 pts), error handling 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. This shape REPEATS in the file: one other method here (AcpHarnessDialog.AcpHarnessDialog::run) 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":"ui/src/components/AcpHarnessDialog.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d048990b7c58bcc3aaccd62504925ab8d10d9718723a2730bddef4f83c7eff97"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.RaySection (cognitive 26): SettingsPage.RaySection has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 7 (12 pts), boolean chains 10, error handling 2, if/else 2 (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 12 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ff3cf07cbbd5cb13557f3a46270cf3302571c6e772d0e8f934f88abe87c622"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.markdownFromSelectionNode (cognitive 26): ChatPanel.markdownFromSelectionNode has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, ternaries 3 (6 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c035006bf596a4cf2bc3c7e1bef98835ee71645423b2efb34f1b6972a904f3"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.commandReadTarget (cognitive 26): ChatPanel.commandReadTarget has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8de24dafaa1152fdeb188d44150abf76e719b066807b655a9fe677d4056da7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Host::summary (cognitive 25): Host::summary has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 4, 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/orx-host/src/server.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"283af475527e5335c1c13230dc8b313ce02757dc40c35b479fd57d7331871a52"}},{"ruleId":"D2","level":"warning","message":{"text":"orx_host::legacy::cancel_container (cognitive 25): orx_host::legacy::cancel_container has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 8 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/legacy.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77f294dc18379c1f493b7d1f1f4c1c8906ed0fc15f12d663db5d007bd3b83e1"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatHost::respond (cognitive 25): ChatHost::respond has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":7254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8aed2a50cd1b857f856639658e07566f66e16a06989107008cdee4e3dfa612"}},{"ruleId":"D2","level":"warning","message":{"text":"ApiClient::events (cognitive 25): ApiClient::events has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plane/local_plane.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bbddef6b4185ae1efa86125fc916ba84309dac678187b1ac783ded87dc8197"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::compute::run_command (cognitive 25): openresearch_cli::commands::compute::run_command has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/compute.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b9a08cc35e7314cab4fed0ddbb6ae7c449a6be5b1c803d9e032cd799bf9b4f"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::start_pty_with_env (cognitive 25): openresearch_cli::commands::up::start_pty_with_env has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 4 (8 pts), loops 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":"src/commands/up.rs"},"region":{"startLine":7203}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b5e35078144fc40ecb0ce0b9ec23f23a630247c1d348c6dc9a6f210573a8fa"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::spawn_cursor_account_details (cognitive 25): openresearch_cli::commands::up::spawn_cursor_account_details has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 1 (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/commands/up.rs"},"region":{"startLine":9164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8429c6579d8d7ef187e302387bf3d59e6d64e8d99e68bc14ec7e8e8ee58e5128"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::harness_setup::sign_in::screen_text (cognitive 25): openresearch_cli::commands::up::harness_setup::sign_in::screen_text has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 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":"src/commands/up/harness_setup/sign_in.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc29e4bd103d0347c366c0f978feaba07972a97b5d28db4b2a21788a3c86806"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::engine::reconcile::observed (cognitive 25): openresearch_cli::engine::reconcile::observed has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/reconcile.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1893bebb8a2843f30c57026db52a8285008fc498f641127fe4af847b19bf2f"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::chat::process_run_notices (cognitive 25): openresearch_cli::local::chat::process_run_notices has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2, 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/local/chat/mod.rs"},"region":{"startLine":9793}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90793d367ac765648fd1ad374e76b52ffce0fac5a7b648453ed219fb1836393"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::cursor::apply_event (cognitive 25): openresearch_cli::local::harness::cursor::apply_event has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (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/local/harness/cursor.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3f0f226dd63cc894f6159b5a3e619348a83c46c343694c377d5cc92c67c21f"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::overleaf::collect (cognitive 25): openresearch_cli::local::overleaf::collect has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/overleaf.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"84959df0ba7a8ed27ecc200749ab2c89a430456deac7c66db5bb096e0e992f2e"}},{"ruleId":"D2","level":"warning","message":{"text":"AddAgentDialog.OAuthPanel (cognitive 25): AddAgentDialog.OAuthPanel has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 8 (12 pts), boolean chains 6, if/else 6, error handling 1 (nesting depth added 4). Of this number, 13 points are the body\u0027s own statements and 12 belong to 4 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":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9eecdf57250d55d84b28b670456b74970d595fad88f904a6328750433c73a1"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlPreview.assembleDocument (cognitive 25): HtmlPreview.assembleDocument has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (4 pts), ternaries 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":"ui/src/components/HtmlPreview.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18af7a2e710ad5dd69b9ff10522758ce75acf1fc186bacd7d0f1da885f62548"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.AgentList (cognitive 25): SettingsPage.AgentList has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 92, ternaries 44 (68 pts), if/else 6, error handling 1 (nesting depth added 24). 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: 3 other methods here (SettingsPage.AgentList::harnessRow, SettingsPage.AgentList::providerRow, SettingsPage.AgentList::foundRow) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ba4791724b2aa4088a8a051646aaf28adbdbebe6f6f73365a34ca3d6c8ee76"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.ComputeTab (cognitive 25): SettingsPage.ComputeTab has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 11 (14 pts), if/else 5 (8 pts), boolean chains 3 (nesting depth added 6). 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 items inside it that branch (renderTarget, a function literal at line 3114, a function literal at line 3072, \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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba068079f24baa439c1f1fd8102c99aa7ecf93ad86a181de41ff206c9cac2153"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.EnvRow (cognitive 25): SettingsPage.EnvRow has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (7 pts), ternaries 5 (7 pts), error handling 1 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 11 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3446}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e64f28a5cb6d0593b134816966b619fc24364967ad48462d929328a4b890675"}},{"ruleId":"D2","level":"warning","message":{"text":"useOverleafSync.useOverleafSync (cognitive 25): useOverleafSync.useOverleafSync has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15, boolean chains 9, ternaries 1. Most of this is not in the body itself: 4 of the 25 points are its own statements and the rest belongs to 12 function literals inside it that branch (lines 264, 189, 219, \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":"ui/src/useOverleafSync.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0d1b7ccf368cef8d9f3758a46dd7475df77cb7212bfeb061f7a307eb53f83c"}},{"ruleId":"D2","level":"warning","message":{"text":"Machines.MachineWorkspaces (cognitive 25): Machines.MachineWorkspaces has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 7 (9 pts), if/else 8, boolean chains 7, loops 1 (nesting depth added 2). Most of this is not in the body itself: 5 of the 25 points are its own statements and the rest belongs to 14 function items inside it that branch (a function literal at line 239, selectRemote, a function literal at line 193, \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":"ui/src/Machines.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f926145f933394d72a79973627611ce62c513e60c761dd2ff9b9b33464d26c96"}},{"ruleId":"D2","level":"warning","message":{"text":"Api::force_stop_runs (cognitive 24): Api::force_stop_runs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (7 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/api_v2.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcd49a5dd4a86623c72cd8a9be9ebcdf1ac31fa802d7d91611ac7304be8daeb"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime::observe (cognitive 24): Runtime::observe has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/runtime.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e31a89506b380246bb275a27d22b297586d2ac1626cce2751d08da7cdf232a"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime::compute (cognitive 24): Runtime::compute has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (5 pts), boolean chains 2, 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/engine/runtime.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d748143203a0e3c32053e187176c18799b1de9a1a1d79644055d482a22fada9e"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::apply_saved_configuration (cognitive 24): Client::apply_saved_configuration has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/acp/host.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb221325dfd0206076c03382ce4dcfd2f3b5007e118b25b25b001c22b1ac916"}},{"ruleId":"D2","level":"warning","message":{"text":"Host::reap_idle_at (cognitive 24): Host::reap_idle_at has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (20 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":"src/local/acp/host.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0f900ae9c82fce24599b280cb73638e13b510b552289b34eca80b7f33e8753"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::handle_update (cognitive 24): Connection::handle_update has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 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":"src/local/overleaf_live.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"de300dfed3d3dc96b5525bc6fe8ccd0f39b5bf9773e0c4165e8d604351f5c37f"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::replace_native_usage_aggregate (cognitive 24): Store::replace_native_usage_aggregate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (5 pts), match/switch 1 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/store/telemetry.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29bba0ebd66d26d7f7ebaca1ffaed7276b6c9bce56272405f8f66d0a467d0e3"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::manage_local_file (cognitive 24): openresearch_cli::commands::up::manage_local_file has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9, match/switch 6 (9 pts), boolean chains 4, loops 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/commands/up.rs"},"region":{"startLine":4148}}}],"partialFingerprints":{"codehealthFindingId/v1":"089b9235c7067af8ee4117698e6b31e9b560b4fa5a2ca2225fdfa8da9a1f48c6"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::run_events (cognitive 24): openresearch_cli::commands::up::run_events has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up.rs"},"region":{"startLine":10906}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68a0c9f0d1a6d65566937b97670b9f6f05c0dd952a4027c7fd6fa24729f00fa"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::service::logs::persist (cognitive 24): openresearch_cli::jobs::ssh::service::logs::persist has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, match/switch 1 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/ssh/service/logs.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d61ed8818f3f0f07a805c9d5e18ee2ed973f0dba5e6d1296e5ddb3c033458ae"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::codex::installed_plugin_skills_dirs (cognitive 24): openresearch_cli::local::harness::codex::installed_plugin_skills_dirs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/codex.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0600e4f5048c77502108d33a307ba1150e377024cab7d40de186552d99c01d4"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::latex::compile (cognitive 24): openresearch_cli::local::latex::compile has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (5 pts), boolean chains 3, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/latex.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bf9680e87c72339d6327b5fd929eb38eb0d359c8e27434f83b7c7610784d12"}},{"ruleId":"D2","level":"warning","message":{"text":"invalidation.createInvalidation.invalidateWrite (cognitive 24): invalidation.createInvalidation.invalidateWrite has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (19 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":"ui/src/queries/invalidation.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e73705e90901d45916785fb07d2b4186f9897857b4b633be58c985f3dca3436"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.TargetTile (cognitive 24): SettingsPage.TargetTile has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 11 (18 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2879}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2163c2a7abcbc65450af63923334397661cc9942d27ef2836906bc642a91435"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.TinkerSection (cognitive 24): SettingsPage.TinkerSection has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 12, ternaries 6 (8 pts), error handling 2, if/else 2 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 10 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3186}}}],"partialFingerprints":{"codehealthFindingId/v1":"193a404d4afa6d271e5d1e7b2f6fe0c576cb09ff20503c5bb277be97887371e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Local::start (cognitive 23): Local::start has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 5 (6 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/adapters/local.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31e4c152bacbf32c42d727bf2cacd1831a26eaf7ce533ad234020436afb0cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::finalize_turn_usage (cognitive 23): Store::finalize_turn_usage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/store/telemetry.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be0edc34f22d25c0b3a61076c774a5b15afef4fafee8bcd2c6b2a04a8975922"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::overlay_claude_auth (cognitive 23): openresearch_cli::commands::up::overlay_claude_auth has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, match/switch 2 (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":"src/commands/up.rs"},"region":{"startLine":8432}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6719ce96636f0cbef9d4a5bdfc6e38e99a1758025a625d5081fe4d726a25e27"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::publish_harness (cognitive 23): openresearch_cli::commands::up::publish_harness has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, 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/commands/up.rs"},"region":{"startLine":8961}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a2b8ca2414080d25888a15234ed0b5f949ef0d25a1c1d543473320b9a2f674"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up_remote::prepare_remote_session_inner (cognitive 23): openresearch_cli::commands::up_remote::prepare_remote_session_inner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (16 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, and where an else follows 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/commands/up_remote.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed294f0ba12a59e3bcf661fe6350f21f0b590146807bbe195bf765858dba7f80"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::prepared::resolve_with_agent (cognitive 23): openresearch_cli::jobs::ssh::prepared::resolve_with_agent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/ssh/prepared.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"20da91bbb31384bffc3010a1bc0e18396be2834eba54c6398ec8c475774a3f9a"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::chat::upsert_preserving_children (cognitive 23): openresearch_cli::local::chat::upsert_preserving_children has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 1 (4 pts), match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9becb13a5af622191a69b7118b44a830d84b5591eb5d1b4632f475895a84d6"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::model_routes::read (cognitive 23): openresearch_cli::local::model_routes::read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/model_routes.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"701e29aa1d03dc67cd016352b3cd5c110315c07fd96c6e664ec9a09d386aa8d0"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::storage::migrate (cognitive 23): openresearch_cli::local::storage::migrate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (5 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/storage.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02c32f018d43d36f04070bb3bac60c00ff6a62c7ccad679d82e149608bf9517"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::user_skills::save_zip_in (cognitive 23): openresearch_cli::local::user_skills::save_zip_in has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/user_skills.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18d1ac072b9efd574112b6f5feed9776fc6814388c9f4f53af37d318f21fae7"}},{"ruleId":"D2","level":"warning","message":{"text":"SshConnectTerminal.CommandTerminal (cognitive 23): SshConnectTerminal.CommandTerminal has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 4 (5 pts), boolean chains 4 (nesting depth added 3). Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 195, 208, 286, \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":"ui/src/components/SshConnectTerminal.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8341b2ee1494a79f317fb4bfc2f69b4a932358e00ba698773cd77c815d1858"}},{"ruleId":"D2","level":"warning","message":{"text":"HarnessSetupDialog.HarnessSetup (cognitive 23): HarnessSetupDialog.HarnessSetup has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 24, if/else 10 (13 pts), ternaries 6 (7 pts), error handling 1 (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. This shape REPEATS in the file: one other method here (HarnessSetupDialog.HarnessSetup::verify) 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":"ui/src/components/HarnessSetupDialog.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c327b0818c8554e393a2e51b68c3faa95dafd908e3cf944f7aebc7aa8b9ad8"}},{"ruleId":"D2","level":"warning","message":{"text":"ExperimentOverview.ExperimentOverview (cognitive 23): ExperimentOverview.ExperimentOverview has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 16, ternaries 6, if/else 1. Of this number, 22 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":"ui/src/components/ExperimentOverview.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"796aee7ed37213f21ace82f77af8d0dede38e5eb43e1de5ea71fe7cd4bc287a9"}},{"ruleId":"D2","level":"warning","message":{"text":"LogTerminal.LogTerminal (cognitive 23): LogTerminal.LogTerminal has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (10 pts), boolean chains 9, if/else 4 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 5 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/LogTerminal.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70a36b17bdd03cba2f74770bb416ac2d304f87df2f315fc54132913694a67df"}},{"ruleId":"D2","level":"warning","message":{"text":"workspaceTabs.applyPane (cognitive 23): workspaceTabs.applyPane has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 2, ternaries 1 (nesting depth added 3). Of this number, 20 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/workspaceTabs.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c24170c63b4e5ba6ce99fd77ca386612b54d921eabad6ab5dfd600228cc437"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposerEditor.findChips (cognitive 23): ComposerEditor.findChips has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (21 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":"ui/src/components/ComposerEditor.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46668bd05cb4bee29c8b59e4bf3c790fe8744b330f15c446e3d06c4409d68af"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelSettings.ModelSettings (cognitive 23): ModelSettings.ModelSettings has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, if/else 6, ternaries 4 (5 pts), loops 1 (nesting depth added 1). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 118, a function literal at line 88, a function literal at line 74, \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":"ui/src/components/ModelSettings.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b9f54fa923e13f492cd23cbad4b44a4dff7170ab45ed653418d0b5d271e469"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.harnessStatus (cognitive 23): SettingsPage.harnessStatus has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11, ternaries 3 (7 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a7e2a7c7d92cbfe211bb826db414d03275976d9c78fd309aa5c25f7c7af846"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.OverleafCard (cognitive 23): SettingsPage.OverleafCard has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 12 (20 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4334}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2a8c8e2b77763120b7c6f4e8a9a928e6a93c518d03d7673002f858c679a2d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.renderParts (cognitive 23): ChatPanel.renderParts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 7, ternaries 1 (3 pts), loops 1 (nesting depth added 6). Of this number, 20 points are the body\u0027s own statements and 3 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4109}}}],"partialFingerprints":{"codehealthFindingId/v1":"536f796f09023aa53c3205e5072f1afd251c45bf1b6a3f425ec2e304220db8ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.ChatPanel::runShell (cognitive 23): ChatPanel.ChatPanel::runShell has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 2 (5 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 6 other methods here (ChatPanel.ChatPanel, ChatPanel.ChatPanel::selectModel, ChatPanel.ChatPanel::runComposerCommand, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7382}}}],"partialFingerprints":{"codehealthFindingId/v1":"4538e55284ef3d769ad4090e2c0c9c4b4536412a937e9c23d06c330b1b883b42"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime::quote (cognitive 22): Runtime::quote has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 2 (5 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/runtime.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f674a27f7b08ab4935dbdd9d893d7b94dc35f0c620062846a225a4da042646f"}},{"ruleId":"D2","level":"warning","message":{"text":"Broker::session (cognitive 22): Broker::session has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/ssh/service/mod.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77e547b3529ba8642c082c0afe872ff4380321727b71cb005770d37b968c611"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatHost::steer_message (cognitive 22): ChatHost::steer_message has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 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/local/chat/mod.rs"},"region":{"startLine":5189}}}],"partialFingerprints":{"codehealthFindingId/v1":"205caa91d1fcd9595f66c207f29a5fb57f4ff2d6885060101ecb262e498ed6a4"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenCode::detect_at (cognitive 22): OpenCode::detect_at has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 5, match/switch 1 (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/local/harness/opencode.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"12997d30496f940b1679bf8a8b86603d56b8ba27db0dd00a90a9c6dd1d07e1d3"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::compute_settings::configure (cognitive 22): openresearch_cli::commands::up::compute_settings::configure has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (6 pts), loops 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/compute_settings.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"640050cfee8852bc686232f2fb83d4c3708b1f6d6ce3ea738cd7d7012916affd"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::prepared::snapshot_contents (cognitive 22): openresearch_cli::jobs::ssh::prepared::snapshot_contents has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/ssh/prepared.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfc1591873e09b75ec71d1562eb23bd8082ece16e5a9e47cd2fbbe0a8eb2308"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::auth::config_auth::kimi_checked (cognitive 22): openresearch_cli::local::harness::acp::auth::config_auth::kimi_checked 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":"src/local/harness/acp/auth/config_auth.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0e0160bdf746e58323f94e64770c34044e0b297c14d8b44609f5909fed2b16"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::managed::unpack (cognitive 22): openresearch_cli::local::harness::managed::unpack has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), boolean chains 3, 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":"src/local/harness/managed.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3eff6eb2649cee5d644793974d716e151f6b613b47190624ef9ddd6a4f4e33"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::model_routes::filter_agents (cognitive 22): openresearch_cli::local::model_routes::filter_agents has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/model_routes.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"d055a946edb8a42ca57890779dca36793cd5d1029f102eb7a20c0c1d4f7287bf"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::spend::seven_days (cognitive 22): openresearch_cli::local::spend::seven_days has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 6 (7 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/spend.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"39db09f201b5d504238ee310dce8ed963d14542f9bb1bf4931fa8fd6b59a438b"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::updates::linux_app::update (cognitive 22): openresearch_cli::updates::linux_app::update has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (21 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/updates/linux_app.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d622633c887bbd7f5f57dfae5063eda848161eb81ed3126731520610e28393e"}},{"ruleId":"D2","level":"warning","message":{"text":"helper.dispatch (cognitive 22): helper.dispatch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 2 (4 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":"src/jobs/ssh/helper.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f86455712ad37bdf754e119a9bb2042c07b0b17b544e1b7b85810d9ee044bde"}},{"ruleId":"D2","level":"warning","message":{"text":"dev.replaceLive (cognitive 22): dev.replaceLive has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 4 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dev.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedb76415c32b1b89eaeda7dcb9c33c4d30b9388c1fc85d6fa76a3dcc2373c2a"}},{"ruleId":"D2","level":"warning","message":{"text":"orxCommand.parseOrxLit (cognitive 22): orxCommand.parseOrxLit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, ternaries 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":"ui/src/orxCommand.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bd75529ce305b38ed94a68d3eb82a01ce9bd5726df862fa95078adbcda7134"}},{"ruleId":"D2","level":"warning","message":{"text":"HarnessSetupDialog.HarnessSetup::verify (cognitive 22): HarnessSetupDialog.HarnessSetup::verify has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, 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. This shape REPEATS in the file: one other method here (HarnessSetupDialog.HarnessSetup) 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":"ui/src/components/HarnessSetupDialog.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d19fb40023ef6b64993fb3521f7ae3df8e1f9322f12f7fd222ce8cd29237e11"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteHostDialog.RemoteHostDialog (cognitive 22): RemoteHostDialog.RemoteHostDialog has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 6 (16 pts), boolean chains 5, if/else 1 (nesting depth added 10). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 137, 61, 95). 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":"ui/src/components/RemoteHostDialog.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1930792e919e5e5d0ff3a71ca7cd53955666d4084e998298b82131cd7f3d8d"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.AgentList::foundRow (cognitive 22): SettingsPage.AgentList::foundRow has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, ternaries 7 (11 pts) (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. This shape REPEATS in the file: 3 other methods here (SettingsPage.AgentList, SettingsPage.AgentList::harnessRow, SettingsPage.AgentList::providerRow) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"528ec1304b0c90fdf27aacbffd71aea165c3f76f94fd77dbfc1ec18280cbc621"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.codeSummary (cognitive 22): ChatPanel.codeSummary has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"4335d4d393c9bfe5544e09716330ab0d302e848af13a710f848ac40d63ccde30"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.ChatPanel::selectModel (cognitive 22): ChatPanel.ChatPanel::selectModel has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 10 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 6 other methods here (ChatPanel.ChatPanel, ChatPanel.ChatPanel::runComposerCommand, ChatPanel.ChatPanel::setGoal, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":6227}}}],"partialFingerprints":{"codehealthFindingId/v1":"26597d9177a7c479e2cc7cf4ae05dcd3601ec6a452c956f2112a1c5207737bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"csv.parseCsv (cognitive 22): csv.parseCsv has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/csv.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"533b0935d9f3acc96a573f3f2a7ea35a737f6a0a583fc64e1ea5e6b79d695ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseLease::acquire (cognitive 21): DatabaseLease::acquire has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, 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":"src/local/opencode_db.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dea8d7b322746ac685560f62d789ce84e3a342d2b39381273e7f045ba083421"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::agents::rows (cognitive 21): openresearch_cli::commands::agents::rows has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 4 (9 pts), boolean chains 2 (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/commands/agents.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcba61d9153885d0146986aa63af0729e5d4b8076bbc0d5f3c10a6e6ac576f4"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::remote_host::handle_control (cognitive 21): openresearch_cli::commands::remote_host::handle_control has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/remote_host.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8a0c54c280d9d9d5d6b89d557ff2d5356f15f4152bec1829953fd515b7ffcb"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::project_file (cognitive 21): openresearch_cli::commands::up::project_file has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (4 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/commands/up.rs"},"region":{"startLine":3933}}}],"partialFingerprints":{"codehealthFindingId/v1":"326737116350c7ff692b9928ed077c9473be226659b9976599dd295dab7ef4ca"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::claude::installed_plugin_skills_dirs (cognitive 21): openresearch_cli::local::harness::claude::installed_plugin_skills_dirs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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/local/harness/claude.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"9140f85cf9b23f47939123a191f42248e4f7529bb43a6adc6e68138d7ebdf752"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::cursor::apply_tool_call (cognitive 21): openresearch_cli::local::harness::cursor::apply_tool_call has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/cursor.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64c6c0aac0abb19ae60299fe0a30d23bb857c8108608d710e6bbbe299241e4b"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::store::public_backend (cognitive 21): openresearch_cli::store::public_backend has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (6 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/store.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc27c80af6e2990a772aa0fd57de86293b7a29d1864b613adae39a3a08413aa"}},{"ruleId":"D2","level":"warning","message":{"text":"orx-chart.html.sliceRows (cognitive 21): orx-chart.html.sliceRows has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), boolean chains 5, ternaries 2 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent-skills/orx-figures/assets/orx-chart.html"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dff246112ec47e196dd9f7d0333ba097027cd9c03519b63ae0eb133b1b10da8"}},{"ruleId":"D2","level":"warning","message":{"text":"orx-chart.html.drawHeatmap (cognitive 21): orx-chart.html.drawHeatmap has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 8 (11 pts), boolean chains 6, if/else 2, loops 2 (nesting depth added 3). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 219, color, a function literal at line 220). 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":"agent-skills/orx-figures/assets/orx-chart.html"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7be3c15d4d41885f6cff00b1d886f33272a630decc6ba5b8ea2f116f82e15f"}},{"ruleId":"D2","level":"warning","message":{"text":"Tooltip.Tooltip (cognitive 21): Tooltip.Tooltip has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 5 (6 pts), boolean chains 5 (nesting depth added 2). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 5 function items inside it that branch (show, hide, a function literal at line 86, \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":"ui/src/components/ui/Tooltip.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a19eae9a4f14010fda2fec2b999ceada6e8b99a2140bb2b580446c4568b740"}},{"ruleId":"D2","level":"warning","message":{"text":"markdownTarget.resolveMarkdownTarget (cognitive 21): markdownTarget.resolveMarkdownTarget has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 6, boolean chains 4, 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":"ui/src/markdownTarget.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7197ec3d44eb99737992ab7974a50e783415b45c60706f2d4b76500f19658d3"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceTools.SideChatPicker (cognitive 21): WorkspaceTools.SideChatPicker has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, if/else 6, ternaries 4 (5 pts) (nesting depth added 1). Of this number, 11 points are the body\u0027s own statements and 10 belong to 12 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/WorkspaceTools.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffde87c1219144efbe199b35172a6952b062b29ec29b27c034be215f21f16187"}},{"ruleId":"D2","level":"warning","message":{"text":"Tracker.onMutation (cognitive 21): Tracker.onMutation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/tourGeometry.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"628e30a12aa0f5a81f9de69029e00d62036a318089e32c44c610cdb5e654bbfe"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.ModalSection (cognitive 21): SettingsPage.ModalSection has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, ternaries 6 (8 pts), error handling 2, if/else 2 (nesting depth added 2). Of this number, 11 points are the body\u0027s own statements and 10 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"94da22357338feaf80e3e85a884a9603cbaad0c7553742e31abf53a03fdcb9f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.turnReceipt (cognitive 21): ChatPanel.turnReceipt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3887}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7d052b3e69b42cc33be35ebfeb6a56818d12bd3390ed28d30842d0314d54ac"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.useTranscriptAnnouncement (cognitive 21): ChatPanel.useTranscriptAnnouncement has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 7, boolean chains 2 (nesting depth added 6). None of this is in the body itself: all 21 points belong to 5 function literals inside it that branch (lines 4514, 4540, 4520, \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4506}}}],"partialFingerprints":{"codehealthFindingId/v1":"4025cc7e18a32c7325845afe1d777856fb7b1586ef18726012f53e553760381b"}},{"ruleId":"D2","level":"warning","message":{"text":"App.App::renderContentTab (cognitive 21): App.App::renderContentTab has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, ternaries 3 (7 pts), if/else 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (App.App) 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":"ui/src/App.tsx"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ad25f1a95b7e9eac4ae2f97bcb5ca160b4fb79d7455707bf8c06ec24458baf"}},{"ruleId":"D2","level":"warning","message":{"text":"requestAuth (cognitive 21): requestAuth has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7, other 6, ternaries 3 (4 pts), boolean chains 3, error handling 1 (nesting depth added 1). Of this number, 14 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/acp/zcode-runtime.cjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"364e218a709001ff6ca44fbff4416c509af4cbbf05723eb8df005b936b016481"}},{"ruleId":"D2","level":"warning","message":{"text":"orx_host::wrapper::cancel (cognitive 20): orx_host::wrapper::cancel has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, 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/orx-host/src/wrapper.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d341249f17b6f15b966126524c72766499a28b19deec9b279360fec0db101e3"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeHost::reap_expired_at (cognitive 20): ClaudeHost::reap_expired_at has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/claude.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"564cffeab2bfbdb81aa8cc503d14b19add6f662cd9fd795e2ace3c283d11f390"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::handle_event (cognitive 20): Connection::handle_event has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/overleaf_live.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81b46fde32ed05fd0d6e5f6a5eec4ef0c21d133b53770ab039301c49e19a8f7"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::move_data_dir (cognitive 20): openresearch_cli::commands::up::move_data_dir has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 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/commands/up.rs"},"region":{"startLine":6047}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bbdf158f6e0eea8591449b8812488f32d8a046f1d2b855f7d265c0c6a31f2b"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::detected_harnesses (cognitive 20): openresearch_cli::commands::up::detected_harnesses has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6 (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/commands/up.rs"},"region":{"startLine":8896}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9b96b62d0d9ca2b486f9b38b765668ae88ea3f35256f9df04cf9d2e74679a7"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::harness_setup::keep_current (cognitive 20): openresearch_cli::commands::up::harness_setup::keep_current has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 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/commands/up/harness_setup.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"711173b877b72c2fb853ac0252831a9de9af5a26c33a7a4243430cc6177b1581"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up_remote::supervise_connection (cognitive 20): openresearch_cli::commands::up_remote::supervise_connection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up_remote.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a27aeb5ac08b2ebe4878ff97c9c09b4ecbf9a77eafe2363f8074b6f39e8fa46"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::engine::transport::ssh::failure (cognitive 20): openresearch_cli::engine::transport::ssh::failure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 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":"src/engine/transport/ssh.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"0deafb5c1ad1fdde3480b805543b1227a705d7948c84bcc00d30e940c51ba11e"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::acp::spawn_one_shot (cognitive 20): openresearch_cli::local::acp::spawn_one_shot has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 4 (6 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/acp.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"90efb3a8769e7966c4a0d0f9030e139ebf2202d535b16802b19e509fa70c329f"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::agent_profiles::prepare_home_in (cognitive 20): openresearch_cli::local::agent_profiles::prepare_home_in has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (7 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/agent_profiles.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7feda9195f0ed4a6246050e0d34e5a992c75cf6e19cf8ba13ae50cee13e695"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::advertised_models (cognitive 20): openresearch_cli::local::harness::acp::advertised_models has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to one function item inside it that branches (choices). 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/local/harness/acp.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"57256a28de35a8ef0b9f702f35e740b7779ac675bc0d9f7b8359571ea785ca41"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::acp::auth::config_auth::zcode_checked (cognitive 20): openresearch_cli::local::harness::acp::auth::config_auth::zcode_checked has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/acp/auth/config_auth.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"51717d23d0b6ce14931ce406c2a1af581957e9dd1f029b4ba5b50b8c380dd8ab"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::opencode::delete_found_provider (cognitive 20): openresearch_cli::local::harness::opencode::delete_found_provider has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 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":"src/local/harness/opencode.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c7057485a9f98d944f96c43b2a5be6810abf28237835fede701b6b7c61a846"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::overleaf_live::transform_component (cognitive 20): openresearch_cli::local::overleaf_live::transform_component has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 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":"src/local/overleaf_live.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25943cc1172cb9fd0c47ebc8ce7935bbab45c3602ff05e56034f06eac8a52c2"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::starter::walk (cognitive 20): openresearch_cli::local::starter::walk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 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/local/starter.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f8b8f47d89e9d09cae72bb2c0004cc413408ad723ffb80088fdd699eeaf767"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::updates::macos_app::update (cognitive 20): openresearch_cli::updates::macos_app::update has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (19 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/updates/macos_app.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a5333fa191f6dfe12179722c61c53adde1622d5c2dd28a0908ea7c2fc7f73a"}},{"ruleId":"D2","level":"warning","message":{"text":"logWindow.createLogFollower.read (cognitive 20): logWindow.createLogFollower.read has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, ternaries 1 (3 pts), 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":"ui/src/logWindow.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"113dfd7192b879ef60f18a77e1b340b977a4daf2b3ed14a6b9b4ab9ad0bddf2e"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlPreview.inlineAssets (cognitive 20): HtmlPreview.inlineAssets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, 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":"ui/src/components/HtmlPreview.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a791d589635b9de2a26f616092df13e88a4dce6c2c990b811b39a33ed59e79c"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteStopDialog.RemoteStopDialog (cognitive 20): RemoteStopDialog.RemoteStopDialog has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 5, 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":"ui/src/components/RemoteStopDialog.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f64a02a85b1dda1baa21b6026c62b423b439173e068f1bd9d48c71e9302038"}},{"ruleId":"D2","level":"warning","message":{"text":"chatRendering.splitResponseParts.turns (cognitive 20): chatRendering.splitResponseParts.turns has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, ternaries 3 (5 pts), if/else 4 (nesting depth added 2). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 254, 258, 270). 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":"ui/src/chatRendering.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5f2a864e31dcd04bd23ba57a6096223ff5d6bd519adebb37da3b9a4858fc03"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateBanner.useRestartApp.restart (cognitive 20): UpdateBanner.useRestartApp.restart has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 5). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 88, retired). 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":"ui/src/components/UpdateBanner.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b111d7df4a535af48f0527719b191f9d50d638259255c9bb356de3955db1f55"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillsTab.SkillsCard (cognitive 20): SkillsTab.SkillsCard has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (8 pts), boolean chains 7, if/else 4, error handling 1 (nesting depth added 3). Of this number, 11 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SkillsTab.tsx"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcc12f6af6506cd1d2b82eb8c14c285bc8aa9594519e70dad6a5f7fd4593aa7"}},{"ruleId":"D2","level":"warning","message":{"text":"Antigravity::detect_at (cognitive 19): Antigravity::detect_at has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/antigravity.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f57fe6603f26fe22252c9c32be8f7ba1ab3731c4e7db7bd53f7034c02723ea3"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::remote_host::ensure_started (cognitive 19): openresearch_cli::commands::remote_host::ensure_started has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/remote_host.rs"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"afaa1031d55c1e22725705edab6b230c36a4c1e40472f5ebba4be2e205f00d65"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::serve::handle (cognitive 19): openresearch_cli::commands::serve::handle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/serve.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a84c53906344f33e3f3f5e3e37a2cab0b5c0d569983270de6ddee2eb5c9bcf"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::spawn_claude_auth_monitor (cognitive 19): openresearch_cli::commands::up::spawn_claude_auth_monitor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up.rs"},"region":{"startLine":5791}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c85716550a1b47bd6a08d4d0cc24098112f756644ecbc230ec2954d081866a9"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::agent_tools::delegate (cognitive 19): openresearch_cli::commands::up::agent_tools::delegate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 3, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/agent_tools.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c3b42c2980fd08171dd9c13553b9cc3084a62feeaa1b0247dc9a6f1158a7dd"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up_remote::forward_alphaxiv (cognitive 19): openresearch_cli::commands::up_remote::forward_alphaxiv has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (8 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/commands/up_remote.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4df31a8d524aa75dce8a9625b958ec0a9e67fd6dd1a2f79c119ad321262427"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up_remote::sanitized_request_headers (cognitive 19): openresearch_cli::commands::up_remote::sanitized_request_headers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up_remote.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdb0a74904757e59a16a5e861d0d14d004dbd00895aa71fc9cbafbc3bd515cc"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::hosts::split_destination (cognitive 19): openresearch_cli::jobs::ssh::hosts::split_destination has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (6 pts), match/switch 4 (6 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/ssh/hosts.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58a0899a07b1a74746d7fcf53e23d2c2c4be856ede656367bdb260ca8d62ddb"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::hosts::add (cognitive 19): openresearch_cli::jobs::ssh::hosts::add has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, 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/jobs/ssh/hosts.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"548f734f276c3bab2c2f11e77ba1597ab5ab011c7f586a2d051e744c36e600f6"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::chat::stop_process_tree (cognitive 19): openresearch_cli::local::chat::stop_process_tree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function 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/local/chat/mod.rs"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f5073e209debd4bb586795d0cdb9d1e591045499c480db156610387236c838"}},{"ruleId":"D2","level":"warning","message":{"text":"api.createApi.followOperation (cognitive 19): api.createApi.followOperation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 1 (4 pts), error handling 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":"ui/src/api.ts"},"region":{"startLine":2879}}}],"partialFingerprints":{"codehealthFindingId/v1":"4332807d9dcc3409cd3b8f59d88ce8a3a9390dc07e464f9bd3244aa4863fdc78"}},{"ruleId":"D2","level":"warning","message":{"text":"chatState.reducer (cognitive 19): chatState.reducer has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 4, if/else 1 (2 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/queries/chatState.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7688f4aed127902fe61519ebb60e340cbdfa00446d13e7406575891d8f839d3"}},{"ruleId":"D2","level":"warning","message":{"text":"acp.nativeOptions (cognitive 19): acp.nativeOptions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 7 (8 pts), boolean chains 3 (nesting depth added 2). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 50, 57, 45). 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":"ui/src/acp.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a22a5aeb94edcafd69530a68b36e09a9b46ad62ad763b31e73403918ff60e3"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.AgentList::providerRow (cognitive 19): SettingsPage.AgentList::providerRow has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, ternaries 5 (9 pts) (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. This shape REPEATS in the file: 3 other methods here (SettingsPage.AgentList, SettingsPage.AgentList::harnessRow, SettingsPage.AgentList::foundRow) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedfa174cb86bb9149c03a5b943e1996f718bb4fe1687c91d90b31b48021ce4f"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.GithubSettings (cognitive 19): SettingsPage.GithubSettings has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (13 pts), boolean chains 5, if/else 1 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2a74e0dae1f68745a1088d512a558ccff44c845ab4c2fabf352cb65d58cc01"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.shellCommandSegments::scanSubstitution (cognitive 19): ChatPanel.shellCommandSegments::scanSubstitution has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 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. This shape REPEATS in the file: one other method here (ChatPanel.shellCommandSegments) 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a30d8424125abc942da3a9c8aa490af5e19d82e37656c6f24a9e28aa71c30f2"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.ChatPanel::runComposerCommand (cognitive 19): ChatPanel.ChatPanel::runComposerCommand has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 6 other methods here (ChatPanel.ChatPanel, ChatPanel.ChatPanel::selectModel, ChatPanel.ChatPanel::setGoal, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":6417}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6a22fe66ca4f4bd271ff65a40f9715227a18346bf0867458a2e00a6694b1c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.ChatPanel::setGoal (cognitive 19): ChatPanel.ChatPanel::setGoal has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 4 (6 pts), error handling 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. This shape REPEATS in the file: 6 other methods here (ChatPanel.ChatPanel, ChatPanel.ChatPanel::selectModel, ChatPanel.ChatPanel::runComposerCommand, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":6504}}}],"partialFingerprints":{"codehealthFindingId/v1":"9868721e53178ea32f6614767758387e7c78ab8ae9bd99af74de2c045a1ddab3"}},{"ruleId":"D2","level":"warning","message":{"text":"FileViewer.FileViewer::save (cognitive 19): FileViewer.FileViewer::save has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (4 pts), boolean chains 2, 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. This shape REPEATS in the file: one other method here (FileViewer.FileViewer) 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":"ui/src/components/FileViewer.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f86bcad5738d3d5364b206fb6313f7f11dbd4cd70f4c528ea4654601690f7d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchiveMenu.archiveActionsByExperiment (cognitive 19): ArchiveMenu.archiveActionsByExperiment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ArchiveMenu.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"823d68607e5b6f42d84613434d3a7ba96c6b5e52c4256478f7ca6a17e86e30d5"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeView.ExpNode (cognitive 19): TreeView.ExpNode has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, ternaries 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":"ui/src/components/TreeView.tsx"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9586a7c15b80b161cb9beda6748795232a8d72ab23c2289debd9cc0deec312be"}},{"ruleId":"D2","level":"warning","message":{"text":"Duty::start (cognitive 18): Duty::start has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, match/switch 2 (3 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/rental.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f3d832e3788d55f7976b783f8fe3fd92d5d43c894ff4ae2975a5d0b83d671b"}},{"ruleId":"D2","level":"warning","message":{"text":"orx_host::server::serve (cognitive 18): orx_host::server::serve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/server.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3a819084eb50e99e767c061ad3359be8962541d21dbd83862a9c73281d98b8"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor::detect_at (cognitive 18): Cursor::detect_at has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/cursor.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec259000255c96948876af0bf7ba8680c4ae6465a661b23c12a4833a6a16b63"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentHost::ensure_started (cognitive 18): AgentHost::ensure_started has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/opencode.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d53d3fa5187ee79ad5585f1d55d00dc82e41664646d65c75a192ab3986e2dd"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::alphaxiv_mcp::run (cognitive 18): openresearch_cli::commands::alphaxiv_mcp::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (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/commands/alphaxiv_mcp.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbdaca38d3be00d1bb96b56a87c97042f037cdd505b783f1f0e406f0295ab70"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::file_serve::requested_byte_range (cognitive 18): openresearch_cli::commands::file_serve::requested_byte_range has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (17 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":"src/commands/file_serve.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6cc959d667f997d5d75fc4a854c3ac760b1473fa198d6c0af9abfbecc0f407"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::project::run (cognitive 18): openresearch_cli::commands::project::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (3 pts), loops 1 (2 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":"src/commands/project.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54437ce6a73babe1fa5a984ac7038d4588d7e482edaaf3acbf26e9cdb98e6bc"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::serve::serve_events (cognitive 18): openresearch_cli::commands::serve::serve_events has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/serve.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f321abbe7d6cdbb8476f293cc6ccb89b4ca2d5ac066532afe1aee92c9afa598"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::harness_setup::connect (cognitive 18): openresearch_cli::commands::up::harness_setup::connect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, 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/commands/up/harness_setup.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2d7fdb22314a9ba72d465cfc0dcc3d35968b0f806d19293b89cbac0d86d71e"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::chat::news::answer_text (cognitive 18): openresearch_cli::local::chat::news::answer_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 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/local/chat/news.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cefca6224c46dc9c35182f5dd12f034f1584f264a00b4a199241a93132e9c30"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::git::prepare_initial_snapshot (cognitive 18): openresearch_cli::local::git::prepare_initial_snapshot has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 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/local/git.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dbc764b1fe3b775e466cbb7310a89cd1e3d2fa0cf80b0b70b201732eaa418c"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::managed::asset (cognitive 18): openresearch_cli::local::harness::managed::asset has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (6 pts), boolean chains 3 (nesting depth added 4). 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/local/harness/managed.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b83cba523bb3fb3dee6e3962e7932e7a56464cbc89f95191883710567cbb7f1"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::opencode_v2::discover_models_within (cognitive 18): openresearch_cli::local::harness::opencode_v2::discover_models_within 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/local/harness/opencode_v2.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee880ca8554b8bc59bfa70f01ca4516c44d0b6164c53bb90db0ba2843e3d379d"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::opencode_db::delete_session_rows (cognitive 18): openresearch_cli::local::opencode_db::delete_session_rows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/opencode_db.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adb2b0d4d7957ae2767338250a3f5efe6e3cee6d58db360496a731897a19a73"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::opencode_signin::run_attempt (cognitive 18): openresearch_cli::local::opencode_signin::run_attempt has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 3 (5 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":"src/local/opencode_signin.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fd4153eed8e07547ee355955d98e3ec23711981dcea59888597e40908b75d8"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::user_skills::tally (cognitive 18): openresearch_cli::local::user_skills::tally 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/local/user_skills.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1dbd81fdb605151ba42871cf108ea08e27973393ada35518bf3ce3ee530d60"}},{"ruleId":"D2","level":"warning","message":{"text":"check-styles.findStyleViolations (cognitive 18): check-styles.findStyleViolations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/scripts/check-styles.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d484da29c3c56c57bcfebdbf4626dea7a4fbceeee0facaeab615feea7115ad"}},{"ruleId":"D2","level":"warning","message":{"text":"logWindow.createLogFollower.sync (cognitive 18): logWindow.createLogFollower.sync has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 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":"ui/src/logWindow.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ea388103bb6ffeb3f75e4a5e7af89265ee6d27c660914049d74067bcbef142"}},{"ruleId":"D2","level":"warning","message":{"text":"runDisplay.runDisplay (cognitive 18): runDisplay.runDisplay has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 4 (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":"ui/src/runDisplay.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7127dee0b7a06d4f4c52a04345af874679caf81d1a841d1fcefec92061882f0"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateBanner.UpdateBanner (cognitive 18): UpdateBanner.UpdateBanner has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9 (14 pts), boolean chains 3, if/else 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":"ui/src/components/UpdateBanner.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac1b3d4bffb081e1a5b913810839a039121f02fa53560857669dbe7b2015c86"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.RecordRow (cognitive 18): SettingsPage.RecordRow has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, ternaries 4 (5 pts), if/else 2 (nesting depth added 1). Of this number, 15 points are the body\u0027s own statements and 3 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5da26841288ec8e9a9c4cfc6b2dac58a8040ecf7a329d876469685521f32f3"}},{"ruleId":"D2","level":"warning","message":{"text":"StatusStrip.StatusStrip (cognitive 18): StatusStrip.StatusStrip has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (5 pts), ternaries 2 (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 3 function literals inside it that branch (lines 42, 37, 49). 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":"ui/src/components/StatusStrip.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"979af0d2a8b86f220df34ca663f3c169a4b48741a0a975ed14bfeb16f09e817f"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestionDock.QuestionDock (cognitive 18): QuestionDock.QuestionDock has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 5, ternaries 1. Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 154, 152, 192). 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":"ui/src/components/QuestionDock.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff01d7a6820f4c91449d0e3edaddc34fdb104846d2056db27dd0785572167d43"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.resolvePosixPath (cognitive 18): ChatPanel.resolvePosixPath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, ternaries 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5a067aa8ebda9a2b32285a629e8671b48a5645bf32776224a25026625795a4"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.TurnStatusRow (cognitive 18): ChatPanel.TurnStatusRow has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (10 pts), boolean chains 4, if/else 4 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 3 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c42ed3fd523f67d7c1b0180159f7eb7e5980bb8539812d49edb66b5865ef7b3"}},{"ruleId":"D2","level":"warning","message":{"text":"ArtifactsTab.PreviewPane (cognitive 18): ArtifactsTab.PreviewPane has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, if/else 6, ternaries 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":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecae93187cf3240960bcc13ca746635d55cfd61fcc2e11283f731fce9d615c1"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvTable.CsvTable (cognitive 18): CsvTable.CsvTable has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10 (12 pts), boolean chains 4, if/else 2 (nesting depth added 2). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 202, 131, 162, \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":"ui/src/components/CsvTable.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1974ba75ec0801c232c2407d5b8a6e56315e88a6dd6abfcf1e0f0eecbe339d3"}},{"ruleId":"D2","level":"warning","message":{"text":"check (cognitive 18): check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, other 4, loops 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/acp/deepseek-auth.cjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"634aaba18663741444086a14f0af550b842b7efa968d203074789d44239939c1"}},{"ruleId":"D2","level":"warning","message":{"text":"orx_host::platform::signal (cognitive 17): orx_host::platform::signal 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/orx-host/src/platform.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7509261d5a4249c906dd21cb08dd9221ac53cdb2069523ac1d73beabfecd2ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime::collect_pending (cognitive 17): Runtime::collect_pending has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (4 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/engine/runtime.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"233afae4780271cd33d9b2e18de88da1b9c839cc6d70df1c84dfcb44f17dcac7"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatHost::set_agent (cognitive 17): ChatHost::set_agent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 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":"src/local/chat/mod.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"192372d7a594d7453a9bf66545771e6e675281e582f0eda220f290e40da60fe9"}},{"ruleId":"D2","level":"warning","message":{"text":"Codex::resume_from_prompt (cognitive 17): Codex::resume_from_prompt 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":"src/local/harness/codex.rs"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"b717c382d17ffabee8421837c274af1c55148b67409a8d0a92fcaa544539651e"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseLease::prepare_with_sessions (cognitive 17): DatabaseLease::prepare_with_sessions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/opencode_db.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b82d48c58c710fa8055943d68795cfb9a5b10013222ec1e817590c42918d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::repath (cognitive 17): Connection::repath has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 2, match/switch 1 (2 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/local/overleaf_live.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ebb14ba8acf5ccac9fbe9601a894692c87961edc6fcf217ade494465c3d310"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::alphaxiv::print_library (cognitive 17): openresearch_cli::alphaxiv::print_library has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 4 (8 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/alphaxiv.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b328886038e50bc30db900bcf19110a4a1fb7ec2e2baf9b42f6451469290b3"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::agents::run (cognitive 17): openresearch_cli::commands::agents::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), 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":"src/commands/agents.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d8c43b54a8898420163ed9928d8250e8dda36a6740e369b989df8eb884fdef"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::app::imp::build_menu (cognitive 17): openresearch_cli::commands::app::imp::build_menu has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (7 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":"src/commands/app.rs"},"region":{"startLine":2160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af981a36c0d3ef5d05de2ea5fc1a19916de20515c606ebcee84796ef50692de"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::enqueue_claude_catalog (cognitive 17): openresearch_cli::commands::up::enqueue_claude_catalog has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 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":"src/commands/up.rs"},"region":{"startLine":8581}}}],"partialFingerprints":{"codehealthFindingId/v1":"02102295797de45e12b945302fa06d335dfaec4d943ef2bfb159a37f620b3eb1"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::model_feed::annotate (cognitive 17): openresearch_cli::commands::up::model_feed::annotate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/model_feed.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bca630d885de3fb3211cf27ef5ad60d627697cc48d306eab10bb5ed3b08902"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::datadir::validate_target (cognitive 17): openresearch_cli::local::datadir::validate_target 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":"src/local/datadir.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf878a671e7de89314de2e650045945b1e03d571a7a2c3fec0303a3f361a2b7"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::model_routes::plain_name (cognitive 17): openresearch_cli::local::model_routes::plain_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 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":"src/local/model_routes.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2c9ca2d5ea510dbba5710b0a773d71d8f17b82badf5c3e5e8dc9f223e81f30"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::starter::brief_parts (cognitive 17): openresearch_cli::local::starter::brief_parts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/starter.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10568070141cd0d1d8ad7a5fc3a15d691763e64430760b376cf07a44e371582"}},{"ruleId":"D2","level":"warning","message":{"text":"workspaceState.parseDestination (cognitive 17): workspaceState.parseDestination has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 7, ternaries 1 (2 pts), error handling 1 (nesting depth added 1). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, 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":"ui/src/workspaceState.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ad7772c9f1234665260c9a08e822114cd5e577fdbb8d9bc3200753db1ee2b7"}},{"ruleId":"D2","level":"warning","message":{"text":"AcpAuthDialog.AcpAuth::verify (cognitive 17): AcpAuthDialog.AcpAuth::verify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 1 (3 pts), error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (AcpAuthDialog.AcpAuth) 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":"ui/src/components/AcpAuthDialog.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4535dc34e760302db665d0bd5e6cb3d06ef59a65f0d795fb39dcdacfecc277"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelList.ModelRow (cognitive 17): ModelList.ModelRow has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, ternaries 4, if/else 2. 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, 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":"ui/src/components/ModelList.tsx"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d83954bc3edf3a6e9bbbfc1a2651c4489e6c86883503394dcc0f0c2b9677219"}},{"ruleId":"D2","level":"warning","message":{"text":"experimentLineageModel.layoutLineage (cognitive 17): experimentLineageModel.layoutLineage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 2 (nesting depth added 3). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 5 function items inside it that branch (visit, lanesNeeded, size, \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":"ui/src/components/experimentLineageModel.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e338331fdb98bf933de7476ad1fa181cbf1421c240ce6ffc17d68890b753b2"}},{"ruleId":"D2","level":"warning","message":{"text":"PlanStrip.PlanStrip (cognitive 17): PlanStrip.PlanStrip has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, ternaries 3 (4 pts) (nesting depth added 3). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 107, a function literal at line 58, a function literal at line 56, \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":"ui/src/components/PlanStrip.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f12479d0910bdc6ec3a203ced2c1e9e0680e7d974b5067271b34c096d4ffdc"}},{"ruleId":"D2","level":"warning","message":{"text":"markdownLivePreview.collectMath (cognitive 17): markdownLivePreview.collectMath has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (5 pts), ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/markdownLivePreview.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c680937caf496c32c45d19ca18dcf87c1ed64f94bd7e46d948df2e9f17c8a8"}},{"ruleId":"D2","level":"warning","message":{"text":"SshConfigDialog.SshConfigDialog (cognitive 17): SshConfigDialog.SshConfigDialog has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, ternaries 5 (7 pts), if/else 2, error handling 1 (nesting depth added 2). Of this number, 10 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SshConfigDialog.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc428f9f81d09a6faa34ffc21dbc44f0f02104ba034d31039fd57cf88b7c779"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::retire_ssh_config (cognitive 16): Engine::retire_ssh_config has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), match/switch 2 (6 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/engine/ssh_config_cleanup.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3357efb41274760f535ee2dc382af2aa253425253935e7b18111b35dd0a7f613"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatHost::run_shell_command (cognitive 16): ChatHost::run_shell_command 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":"src/local/chat/mod.rs"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb9a273673892d2c054067f3aee268a316d85f654af969950ec366dabf260ee"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatHost::fork_turn (cognitive 16): ChatHost::fork_turn 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/local/chat/mod.rs"},"region":{"startLine":5736}}}],"partialFingerprints":{"codehealthFindingId/v1":"551e9869331f39bb466d589aa8f8e194cb9285486f8d8f6a800089e013968c7c"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::metrics::render (cognitive 16): openresearch_cli::commands::metrics::render has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 2 (5 pts), loops 3, 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/commands/metrics.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62d77c054908da8af9df4a7f12b84032eb4212efb9f2870bf40c3990cf8f6ab"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::remote_host::spawn_detached_host (cognitive 16): openresearch_cli::commands::remote_host::spawn_detached_host has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/remote_host.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"2302a78de434b3fb05393de75225ccbd9fd058cbf1fcddbb20ab7cd9a8cea705"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::commands::up::reclaim_remote_run_dirs (cognitive 16): openresearch_cli::commands::up::reclaim_remote_run_dirs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (6 pts), 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":"src/commands/up.rs"},"region":{"startLine":5555}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f2dad6d5d9791b2a0a3540b5616090bcedbce1a21af5981632a80ec2785770"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::jobs::ssh::service::ensure (cognitive 16): openresearch_cli::jobs::ssh::service::ensure has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/ssh/service/mod.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9be6d6f0bcdc262bcb30dbdace4bf97dc04f2047972a5047fcea37c3b046c5"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::chat::record_native_invocations (cognitive 16): openresearch_cli::local::chat::record_native_invocations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":8526}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf32237fcc9a0ac37709c0c0516d76a1ea2de242b182d4986e10ee9a775ff26a"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::chat::news::chat_news (cognitive 16): openresearch_cli::local::chat::news::chat_news has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/news.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab29913ef862bf734ed47e796e971fbf251d905d427639b7e919280f73a034c8"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::git::changed_files (cognitive 16): openresearch_cli::local::git::changed_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (6 pts), 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":"src/local/git.rs"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"1054f3a5e6f49cf1dc761ee9bad75bcb7f201284a89c328257c4ebd2fed36a2e"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::managed::install (cognitive 16): openresearch_cli::local::harness::managed::install has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, 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/local/harness/managed.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"9981028631b901d8be15d51ab692d6ef87861dcf997fd0cb49b7104236a4778d"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::harness::selection::resolve_models (cognitive 16): openresearch_cli::local::harness::selection::resolve_models has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/selection.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"766a1506cd7fabfa5ff3ce3ef4d9e513f1d1d45d3cf66b35c1728c0c09fa030d"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::latex::run_with_timeout (cognitive 16): openresearch_cli::local::latex::run_with_timeout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (4 pts), loops 3, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/latex.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"08aaf7c3668b24c57036022425f336df537591b5bb7da85b527cfabfaa0f77c8"}},{"ruleId":"D2","level":"warning","message":{"text":"openresearch_cli::local::user_skills::write_into_session_in (cognitive 16): openresearch_cli::local::user_skills::write_into_session_in 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":"src/local/user_skills.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e38b5f3f24bfade0cb6e372982a9c5bb5e1f8eee4b961b69fdfbf85aab13ba"}},{"ruleId":"D2","level":"warning","message":{"text":"dev.serve (cognitive 16): dev.serve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (3 pts), error handling 2, boolean chains 1 (nesting depth added 4). Of this number, 11 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":"dev.ts"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c83c041a03e58b8d1013888793cac0336061141ed0e42c16e1b40d3b76906b8"}},{"ruleId":"D2","level":"warning","message":{"text":"katexHealing.longestValidPrefix (cognitive 16): katexHealing.longestValidPrefix has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, ternaries 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":"ui/src/katexHealing.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"28169e08e9764a10ab3a8973c2fbb3e755d137c6fb5df54fccc6c845d0a61f6b"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalModelSetup.LocalModelGuide (cognitive 16): LocalModelSetup.LocalModelGuide has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 6, if/else 2 (nesting depth added 1). Of this number, 13 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/LocalModelSetup.tsx"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"482c0d26c1dd21f2613a99bfd6a611cf67211f7e774212cc30a1886c9f6f31f1"}},{"ruleId":"D2","level":"warning","message":{"text":"GitDiff.GitDiffExplorer (cognitive 16): GitDiff.GitDiffExplorer has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (11 pts), boolean chains 3, if/else 2 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/GitDiff.tsx"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"45900fcd44e43ac20fada22a4c29fb0e43b6869c85fca48b2e9617480469aef9"}},{"ruleId":"D2","level":"warning","message":{"text":"chatRendering.agentTranscript (cognitive 16): chatRendering.agentTranscript has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (5 pts), boolean chains 2, ternaries 1 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 5 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":"ui/src/chatRendering.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d20e19f1dfa03ad4773ad807e4809c7b45f51da4274a9b011b6988860b1034"}},{"ruleId":"D2","level":"warning","message":{"text":"chatRendering.partIsVisible (cognitive 16): chatRendering.partIsVisible has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 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":"ui/src/chatRendering.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2e0908f94d2d3b2aa9acf8d6188e6673314fedc02da8298495dcab689346e4"}},{"ruleId":"D2","level":"warning","message":{"text":"ExperimentRunBanner.RunRow (cognitive 16): ExperimentRunBanner.RunRow has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, ternaries 5 (7 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":"ui/src/components/ExperimentRunBanner.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"686b543ea36170bc5d1597180d6129009f2bacde1e7e96922071a5371493aa2d"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPage.harnessSetupPath (cognitive 16): SettingsPage.harnessSetupPath has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (10 pts), boolean chains 3, if/else 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cc174701200f0417276c196ff24a1734451acc8caf8c84939fbc1ebd0f7d70"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.ToolRow (cognitive 16): ChatPanel.ToolRow has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, ternaries 5 (6 pts), if/else 4 (nesting depth added 1). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"b466e0edd86bcc744ac6cb64d919889415d9fde136c59d0b26dd013b2b2c96bb"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPanel.ChatPanel::send::restoreComposer (cognitive 16): ChatPanel.ChatPanel::send::restoreComposer has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (7 pts), ternaries 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. This shape REPEATS in the file: 6 other methods here (ChatPanel.ChatPanel, ChatPanel.ChatPanel::selectModel, ChatPanel.ChatPanel::runComposerCommand, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7055}}}],"partialFingerprints":{"codehealthFindingId/v1":"767a5ebfad322fba0a48c5c13e0ffbd7b8370c2c7a83d779e929c931edb490a7"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfPreview.PdfPreview (cognitive 16): PdfPreview.PdfPreview has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 5, ternaries 4 (5 pts) (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 7 function items inside it that branch (a function literal at line 79, a function literal at line 234, a function literal at line 119, \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":"ui/src/components/PdfPreview.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e150d2396510df96b3061925a056c610b75efadc3aaf238553359c8f76d392"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeView.elideHiddenRegions (cognitive 16): TreeView.elideHiddenRegions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). None of this is in the body itself: all 16 points belong to 3 function items inside it that branch (visit, a function literal at line 168, hasMine). 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":"ui/src/components/TreeView.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af1e128f03765af16a1c7213b17fef281ff676333e29138fef91a5e92f0cf53"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/up.rs: FileTooLong \u2014 7839 significant 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 335 free functions. The bar is 500 significant lines; this is 7339 over it, 15.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":"src/commands/up.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58494f47d6684ed4e927af19e81b4ac7974389f92d753a6071839d6e711126e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/ChatPanel.tsx: FileTooLong \u2014 7151 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 6651 over it, 14.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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"493c182fd3a89f2cd3fd365c6c34d97aeb98d56ac24d17d139eccf3f05c9a770"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chat/mod.rs: FileTooLong \u2014 6755 significant 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 125 free functions. The bar is 500 significant lines; this is 6255 over it, 13.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":"src/local/chat/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab34b5039a9c366d787dbe7a2a67162b361e4eec952f9f13ff6bfc2897e6dec6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: api.createApi: FunctionTooLong \u2014 createApi runs 1023 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 923 over it, 10.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":"ui/src/api.ts"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"c602185492417b18507fb8ac9e60f4c132f6bbd7302c196351fc0b8ea8eb059c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Store: ClassTooLong \u2014 3851 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 274 methods, 3 blocks, lines 940-6325. The bar is 400 significant lines; this is 3451 over it, 9.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/store.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae4dc55e1212d9a5e77f718726bec44fae20b850f036548c3f3ea2116929c85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/store.rs: FileTooLong \u2014 4744 significant 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: Store (3 blocks, 940-6325), declaring 35 free functions. The bar is 500 significant lines; this is 4244 over it, 9.49\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/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c346a650307521c33eda41193e609d6d2e21ef6582aa31367712bb58f811f6b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Store: TooManyMethods \u2014 274 methods, declared across 5 files: src/store.rs (235), store/telemetry.rs (25), store/acp.rs (7), store/costs.rs (5), \u002B1 more file(s). The bar is 30 methods; this is 244 over it, 9.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":"src/store.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b9c3bf1cda9cb3d0b5609800fc4ffdc34b1e3cc4c34302ce03719e20c2566c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/SettingsPage.tsx: FileTooLong \u2014 4113 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3613 over it, 8.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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dac90031676ed0186e71c03303268b627dd833caaa051e26dac9c1e1fd4405"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ChatHost: ClassTooLong \u2014 3277 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 96 methods, 4 blocks, lines 2004-8132. The bar is 400 significant lines; this is 2877 over it, 8.19\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":2898}}}],"partialFingerprints":{"codehealthFindingId/v1":"e450c08263a98e5b6e81ac1f63e63ff5f249a40c8b56b36da51c6c914c14cfee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: harness/codex.rs: FileTooLong \u2014 3006 significant 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 124 free functions. The bar is 500 significant lines; this is 2506 over it, 6.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":"src/local/harness/codex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca30e36bed81d11ad20e26d8761b2d5cb3c89d47daf4b9d240dd6ea57f30291f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ModelPicker.ModelPicker: FunctionTooLong \u2014 ModelPicker runs 584 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 484 over it, 5.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":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24803d843f29624ebc9a0c40683ecab24bb0b9fc29f13ba42254f1b0a06d07a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChatHost.send_message_showing: MethodTooLong \u2014 send_message_showing runs 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) in one body. The bar is 100 significant lines; this is 432 over it, 5.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/local/chat/mod.rs"},"region":{"startLine":5988}}}],"partialFingerprints":{"codehealthFindingId/v1":"7493dba143d9b5fddd4e226c4c52e0fc367566be94961dde48f29989b18504d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: NewProjectForm.NewProjectForm: FunctionTooLong \u2014 NewProjectForm runs 532 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 432 over it, 5.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":"ui/src/components/NewProjectForm.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"37849d73436dbdb8b932cc8da19e6d3f56e41564eb6304b49ea11ee05a2402a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AddAgentDialog.AddAgentDialog: FunctionTooLong \u2014 AddAgentDialog runs 512 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 412 over it, 5.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":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ea197c383c286cf7ad3b6bfb8ad1b71f89a3277e58c98bbff3810067cb7a77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::commands::app::imp::run_event_loop: FunctionTooLong \u2014 openresearch_cli::commands::app::imp::run_event_loop runs 486 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 386 over it, 4.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/commands/app.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9c78aa2d7c8ac28cbbf1ce0f2344085166ef85e5b880b5eef99d36c3819dae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.open_at_with_move_lock: MethodTooLong \u2014 open_at_with_move_lock runs 462 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 362 over it, 4.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/store.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62173e7db5e56fcf94165f056d57113fa60841ce928512fde668d5cd8817fe7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/api.ts: FileTooLong \u2014 2274 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1774 over it, 4.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f188d7499438047c5015a915ca906f50f962aa71a5aa97b8d1ed1498942b4126"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/App.tsx: FileTooLong \u2014 2230 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1730 over it, 4.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"704578a0e1183c9ddd70ff5b87422e0f802dba520bffaedadb82bfbec5401a19"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SettingsPage.AgentList: FunctionTooLong \u2014 AgentList runs 424 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 324 over it, 4.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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"49658cba360e862224cf7114215f8cdd580052a3dfe018dabd50f0a573ac7238"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/up_remote.rs: FileTooLong \u2014 2040 significant 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 97 free functions. The bar is 500 significant lines; this is 1540 over it, 4.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":"src/commands/up_remote.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bf2f08fb7fea57a3c9d40a3cfc42a6967d6139690d67ca74016e910a3a64e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: harness/claude.rs: FileTooLong \u2014 1924 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 66 free functions. The bar is 500 significant lines; this is 1424 over it, 3.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/local/harness/claude.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59d62d744bf82036c4e8b13aa4566e882af9ca2d083ace566e0e196b7f1cbb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::commands::up::router: FunctionTooLong \u2014 openresearch_cli::commands::up::router runs 351 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 251 over it, 3.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":"src/commands/up.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe9b2a0ed64bcb177e640e6974b2f4e202ef2be48880f09fb06b6552c42b7b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/git.rs: FileTooLong \u2014 1704 significant 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 119 free functions. The bar is 500 significant lines; this is 1204 over it, 3.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/local/git.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"263b16e5a58e2a3870d259d870d30bc94521cda150f96fa956e2713c0085e6a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::demo::seed_at: FunctionTooLong \u2014 openresearch_cli::local::demo::seed_at 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/local/demo.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3841fc26550605eb20b66b77dfba02de81833c2bb80a84a153556380d1fe9be"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChatHost: TooManyMethods \u2014 96 methods. The bar is 30 methods; this is 66 over it, 3.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":2898}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccf1de010b972a3c2a3fa7425a739cc82a2c501b03a8d929eae405a340a2b66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/app.rs: FileTooLong \u2014 1579 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1079 over it, 3.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/commands/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84253b31dc3e469714bc736bafeb7cf6f04797143ccfce9096d8d91886c4604"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SettingsPage.SlurmSection: FunctionTooLong \u2014 SlurmSection runs 306 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e87f202020613bcd32af6c2d3cc3a34ce01a193df7e994fcb762f0586b79314"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Onboarding.Onboarding: FunctionTooLong \u2014 Onboarding runs 301 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 201 over it, 3.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/Onboarding.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5626e04a16a75096423546e9a79363f118853b132d499b3a5f6501d5a9664a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/client.rs: FileTooLong \u2014 1490 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 77 free functions. The bar is 500 significant lines; this is 990 over it, 2.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"488cbe8dec63b1bafe7f9cbaf8ada93b252c91995703cd097977566a0b2ca3ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::harness::claude::apply_event: FunctionTooLong \u2014 openresearch_cli::local::harness::claude::apply_event runs 291 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 191 over it, 2.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":"src/local/harness/claude.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9966b3fb0b32a432745359f9ababb408dc754e42737858db7044a9395ae9cf14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: up/compute_settings.rs: FileTooLong \u2014 1409 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 77 free functions. The bar is 500 significant lines; this is 909 over it, 2.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/compute_settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e42eb71340779012180fd68c39581eb508834e7be5c21bb7955b78d5dbced3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Actor.run: MethodTooLong \u2014 run runs 277 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 177 over it, 2.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/transport/mod.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e494e10f0c555b09e159f89ae759e271316806c86202576afd0b792dede87d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: settings.createSettingsQueries: FunctionTooLong \u2014 createSettingsQueries runs 277 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 177 over it, 2.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/queries/settings.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae60e82cccf623315d840e5f3c024f067bf0ba881f2bb6c8952fc7ad4e937e5a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChatHost.recover_turn: MethodTooLong \u2014 recover_turn runs 276 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 176 over it, 2.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":5392}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5ac826f92368dc157cd7d53cf8c967eb02110c8c92b0ecc8cd613df346c6c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: events.createEvents: FunctionTooLong \u2014 createEvents runs 276 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 176 over it, 2.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/events.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f66ddd4a2f9b30722dec16cf44cac7d40bd8370102768fb0236672c2027ee7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/updates.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), declaring 99 free functions. The bar is 500 significant lines; this is 855 over it, 2.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/updates.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4536a9454f760eae1822ec1243b16708bf09cafcf0757f4923f80542576ea3ea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Host.slurm_queue: MethodTooLong \u2014 slurm_queue 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/orx-host/src/server.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdcd17c4949c039d47334209009d271925e51d6fe3456eda0fd6a33923be44a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: LibraryPicker.SignedInLibraryPicker: FunctionTooLong \u2014 SignedInLibraryPicker runs 271 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/components/LibraryPicker.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff4846c54bbcc1bb2f4193f3fe3981d5043ada98674cd96c6bc1c2220e6da82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/demo.rs: FileTooLong \u2014 1332 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 832 over it, 2.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/demo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8a43a50726f7de49409b096d49433d0c439aa4de1fe3facb4cbb2af13dc12f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::harness::codex::run_turn_app_server: FunctionTooLong \u2014 openresearch_cli::local::harness::codex::run_turn_app_server runs 266 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 166 over it, 2.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/codex.rs"},"region":{"startLine":3545}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f229f2ef66c931f10360c8c319371fe8c1749400ecbc9f71f43b107fff5b9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::commands::up::run: FunctionTooLong \u2014 openresearch_cli::commands::up::run runs 265 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 165 over it, 2.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/commands/up.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c9772a340b65888c23dd8fc1184f9e83079ace2c3238940fbbd9a18a6a1c9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/overleaf_live.rs: FileTooLong \u2014 1304 significant 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 804 over it, 2.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/overleaf_live.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23aa084c9d8d0787004891a05689517bf1f43462292ab96c4d0f8aa840ef5fff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Host.request: MethodTooLong \u2014 request runs 257 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 157 over it, 2.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/server.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"139aeed372da9082d9ed289d6a621bb82c419527f1132ac097e3c493b3c7e52e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ModelList.ModelList: FunctionTooLong \u2014 ModelList runs 240 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 140 over it, 2.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":"ui/src/components/ModelList.tsx"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c97483451c4801016ec6e0938f6cfceeff2272b767da60e4b6a2af78d829144"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: orx_host::wrapper::wrap: FunctionTooLong \u2014 orx_host::wrapper::wrap runs 235 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/orx-host/src/wrapper.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85d039938137ec658ac7606b5fae36ec144c0cc0888249b4e034dcc530a93ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemoteRuntime.RemoteSetup: FunctionTooLong \u2014 RemoteSetup runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/RemoteRuntime.tsx"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ef9bf8a20619ee3ad7e53b5a4bcaf661b78552751adad1d53e981d7b9ff2c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.rs: FileTooLong \u2014 1167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: Host (2 blocks, 25-1167). The bar is 500 significant lines; this is 667 over it, 2.33\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fda27244e056b7ebd0c5f6eda4da1b46441270436239c488a9f1a46bb25a4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: WorkspaceConnection.WorkspaceConnection: FunctionTooLong \u2014 WorkspaceConnection runs 229 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/WorkspaceConnection.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7d738e4569f863e5591de4e47ab18b8569b2c04a9d810f3099956f8e7504f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ArtifactsTab.ArtifactsTab: FunctionTooLong \u2014 ArtifactsTab runs 228 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc455a5f3f110195ddf9a01e85e03a44e2defd05fc7f796dd88ad86f6dd6500"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::harness::codex::run_turn_exec: FunctionTooLong \u2014 openresearch_cli::local::harness::codex::run_turn_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":"src/local/harness/codex.rs"},"region":{"startLine":4697}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bee153818319c8ce0bd8aec923d6cfba95752ebe566806c4c8fcf7f819bd80"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::acp::host::spawn: FunctionTooLong \u2014 openresearch_cli::local::acp::host::spawn runs 224 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 124 over it, 2.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/acp/host.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"071822b5a50d32351fe60f0627d17281b81a9811733b180b260063f84a1d15a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SettingsPage.SshSection: FunctionTooLong \u2014 SshSection runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4023c8253a8363e0821f6c498e88ca8a80420242ae3dcef5aeb97cfccc33af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ModelPicker.OptionPicker: FunctionTooLong \u2014 OptionPicker runs 220 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 120 over it, 2.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51d79873d716db79d0cf53f6042bfeb3894310241a43c67dae0a10da45cf334"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/ModelPicker.tsx: FileTooLong \u2014 1099 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 599 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":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b574ef728b75395a379cfbbbe7ad2c3dae4a30047e759e58a5d91b0cba64557d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Host: ClassTooLong \u2014 867 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 2 blocks, lines 25-1167. The bar is 400 significant lines; this is 467 over it, 2.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/orx-host/src/server.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d729f782eb78b032d4651ce7d7ac6803771962f665aa99bfccc25b8d7f0599bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/remote_host.rs: FileTooLong \u2014 1044 significant 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 544 over it, 2.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/remote_host.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e7a281d5028be042d13f4f4444e1b81c6bf5b9c59563352f06d28ea23587a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/claude.rs: FileTooLong \u2014 1020 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 520 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/claude.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac5ca6c0d0b79a6a1724f14d50c9cb128442f18745db7bd38bf2d9e13786cf6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useOverleafSync.useOverleafSync: FunctionTooLong \u2014 useOverleafSync runs 202 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/useOverleafSync.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1025450bc93620ae3f64205863dd713a2f2b07c0ed62345c3215abb70afbd61c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/AddAgentDialog.tsx: FileTooLong \u2014 1006 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 506 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d62435ae29470638f69a2e054fa477ff43b37b4b969b98dc5db3778d42d8ca4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Runtime: ClassTooLong \u2014 804 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 3 blocks, lines 179-1281. The bar is 400 significant lines; this is 404 over it, 2.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/runtime.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd56bac45e41717216493d5d8be4d32e52e046ad2e1a51cabbe2749d743f8c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PdfPreview.PdfPreview: FunctionTooLong \u2014 PdfPreview runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/PdfPreview.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"894f2e005ed7501e4e3966f2ab29437b5ccc0c7f08d65000a9ddf79e6c63721a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/runtime.rs: FileTooLong \u2014 970 significant 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: Runtime (3 blocks, 179-1281). The bar is 500 significant lines; this is 470 over it, 1.94\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0597ad7084ec9033c97b7608b8353a941d41c05803428ead3cb03a0261ab747"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Actor.login: MethodTooLong \u2014 login 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":"src/engine/transport/mod.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cd03051ce0fc71e6fa00a674a9521e1d9d4e20b5666242032fbfde93955cbe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: openresearch_cli::config: TooManyFunctions \u2014 56 free functions. The bar is 30 free functions; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d3a7c432888511602cebc4a70f9cb32a0f1e621c08d63441960cca6bdf885f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: harness/opencode_v2.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), declaring 34 free functions. 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":"src/local/harness/opencode_v2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5ea7f7382e3106d6ffa383bf168809962212788c6c765f71170b3d8e1ad734"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Local.start: MethodTooLong \u2014 start 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":"src/engine/adapters/local.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7df042903f01e2394679947dafa1fe885a94c195fb3c177b7d3f66346551ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 908 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 408 over it, 1.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8051fac64e936f7c1865babf7d506a8673f918fe3a29b7d5daf1e9c85ef2e6ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jobs/kubernetes.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). The bar is 500 significant lines; this is 406 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":"src/jobs/kubernetes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"031bd5c51f91fc258f657e3e2dcf72a58af00b6582729104af910753f1cbb62d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ExperimentsTable.ExperimentsTable: FunctionTooLong \u2014 ExperimentsTable runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ExperimentsTable.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f252cbbe285ee6ff02f98e1ffb7d084f8a1544b8451e7b42d69322e1de0a7b6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::jobs::ssh::service::transport::connect: FunctionTooLong \u2014 openresearch_cli::jobs::ssh::service::transport::connect 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/jobs/ssh/service/transport.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13512ed606f73b4c56fb4a89c40af199c9a1a97f24f875a844924340f0c0b9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ExpHoverCard.ExpHoverCard: FunctionTooLong \u2014 ExpHoverCard runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ExpHoverCard.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4e4fcd35a88ff2b8bafe28e24a77b190052fb32a4e01902b9762dbcc802a1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OpenResearch.inspect: MethodTooLong \u2014 inspect 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":"src/engine/adapters/openresearch.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb3b1fc88b26271a55dc69c9590b17515f3d3ef05c8ac06f71725a481c06a23"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: WorktreeTab.WorktreeTab: FunctionTooLong \u2014 WorktreeTab runs 179 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/components/WorktreeTab.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"798a9971ab04eaff8da6c67463f12ca624598d1e04845d4de4bd807fac8ee823"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SettingsPage.UpdatesTab: FunctionTooLong \u2014 UpdatesTab runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3859}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b465b61592cdd95976448e2883a1fd2e2644186970d695479d288347ccabbed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::harness::claude::run_attempt: FunctionTooLong \u2014 openresearch_cli::local::harness::claude::run_attempt 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":"src/local/harness/claude.rs"},"region":{"startLine":2850}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fce9315b8d82f2ad2b853115dfb6cd399b132701f74fef1fbd86d0a767e1123"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ChatSearch.ChatSearch: FunctionTooLong \u2014 ChatSearch 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":"ui/src/components/ChatSearch.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a7dcf643f53f51c00620173f3b78076991fe9fb19b8cbd08b4c5d453a97f55"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: up/api_v2.rs: FileTooLong \u2014 862 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 362 over it, 1.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/api_v2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e897085761e6506b02bd28f3bf57f7d6ab32e2b1b1572d786303b24dd2d6038e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::commands::up::agent_tools::call: FunctionTooLong \u2014 openresearch_cli::commands::up::agent_tools::call runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/agent_tools.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c187c487cb86ce1ba90c415ebf46ac53d31173e48a320615829a5aafba208d2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: harness/cursor.rs: FileTooLong \u2014 853 significant 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 353 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/cursor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efc33f72c6416f31a050b0ea901adc61f02d1420640b1b1f14610f27c77854c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jobs/vercel.rs: FileTooLong \u2014 851 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 351 over it, 1.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/vercel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a3b887a812496176dc8b359d42a82f51fde3e5d0dd48e6d255d39f0cb9238c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Broker.dispatch: MethodTooLong \u2014 dispatch runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/ssh/service/mod.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"3529936ac4a2952f4683784213bc2d56de22939aed154a9f0aed083ca09b484e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: CsvTable.CsvTable: FunctionTooLong \u2014 CsvTable runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/CsvTable.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b351219a8a4d6392d36f02652e46c6293965834b775ed78b1079dcf55d508c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ExperimentOverview.ExperimentOverview: FunctionTooLong \u2014 ExperimentOverview runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ExperimentOverview.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f76e15edc824137ef1632ed8948dd22cb2b6ad49e41c9e57372660a849c63f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useProjectWorkspace.createProjectPersistence: FunctionTooLong \u2014 createProjectPersistence runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/useProjectWorkspace.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b19ddeb8dd49530ca17952fcf25e77306b5b04e9a0923b01cbbf4fd8c813e8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/user_skills.rs: FileTooLong \u2014 836 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 56 free functions. The bar is 500 significant lines; this is 336 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/user_skills.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da7974ff6e4b7cbb91b39d9f5e7393d6e7832c5e4cc394a44cc55538cf466b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/codex.rs: FileTooLong \u2014 835 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 335 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/codex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d31992830dffdde5ca133568fe417af7fedc83298a75f688db6f523e94da668"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transport/mod.rs: FileTooLong \u2014 832 significant 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: Actor (2 blocks, 375-1139). The bar is 500 significant lines; this is 332 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":"src/engine/transport/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2faafb46af55f0328e5c277956b039437af9a439444dbaaf4b2f59b8a5f9ede"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.commit: MethodTooLong \u2014 commit 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/engine/reconcile.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcea7ffc0e16b2d9feb6dd6a74823146ccd948d91e7d3a1588db15a21221437"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::commands::up_remote::prepare_remote_session_inner: FunctionTooLong \u2014 openresearch_cli::commands::up_remote::prepare_remote_session_inner 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":"src/commands/up_remote.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"2818ccfa05069bbe5debae423c576dc85df07e38dc51a338873496ef618beb3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::demo::assistant_parts: FunctionTooLong \u2014 openresearch_cli::local::demo::assistant_parts 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/local/demo.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab9d971269def763d33c611a2de6d3753b37dab237e5da054e62c6b23386851"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/native_store.rs: FileTooLong \u2014 797 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 56 free functions. The bar is 500 significant lines; this is 297 over it, 1.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/native_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"790661bac2dc0e0d4e225dc214e72e76234ba51bc56aa77712a41fb33acd38e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::commands::up::harness_setup::run: FunctionTooLong \u2014 openresearch_cli::commands::up::harness_setup::run 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":"src/commands/up/harness_setup.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2887e2af3fac77089c2ad6e73aea6e35060a47f8250f893dbb423a3acf9eb9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/FileViewer.tsx: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 284 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/FileViewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27685dad0031e36e392bbf4b9be8f91c6856243301bbeed0c882df1deb19490"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: OverleafPanel.OverleafPanel: FunctionTooLong \u2014 OverleafPanel runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/OverleafPanel.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f8b395bd8ea5a39ba7664585a8306f4a72839d411eaedd2c3385b5e54cea4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dev.ts: FileTooLong \u2014 773 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 273 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dev.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50209dee7af0bcb75d449abebaaba3a684aa345c883007196f8d76a21d65193f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/share.rs: FileTooLong \u2014 772 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 272 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/share.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"370418d4f2161eead00f7d7d79ef2e307a85589ec3f2be5ed866ecd09edd6ac6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SettingsPage.DefaultDestinationEditor: FunctionTooLong \u2014 DefaultDestinationEditor runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"929d43adf64258ff2cbf08454d6e9a3a77e55a7e17a92fe4c149f43d8fb7c643"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SettingsPage.StorageTab: FunctionTooLong \u2014 StorageTab runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4592}}}],"partialFingerprints":{"codehealthFindingId/v1":"015ee794d2f8d276d2617b175b8fca0841f96416e2f8195e3ae6c909e3c9e3c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plane/local_plane.rs: FileTooLong \u2014 761 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 261 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/plane/local_plane.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1013d354b3a57f7eb830349e447819af26c599bc3eedef80012c9acd7e2d82e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: files.createFileQueries: FunctionTooLong \u2014 createFileQueries runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/queries/files.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32ab3e6daeb17364e9fb0ae01a083d33aed29858fd3844897bebbc318e6900c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::demo::literature_assistant_parts: FunctionTooLong \u2014 openresearch_cli::local::demo::literature_assistant_parts 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":"src/local/demo.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2227f6b805130585b0454b5e6e8d1091c3b49959e67c04278d4c563f0237ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/telemetry.rs: FileTooLong \u2014 749 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: Store (194-976). The bar is 500 significant lines; this is 249 over it, 1.50\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/store/telemetry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea982ef7891d45a9925262e808aea3b04472bf6db4a91da48e88264b9e836227"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/telemetry.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 88 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":"src/telemetry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2aa0389ee911a70a47f32b8d87d7829eb23a93caaed9cbe595bd8d02fa4b0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: logWindow.createLogFollower: FunctionTooLong \u2014 createLogFollower runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/logWindow.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebfc370835c57401f41e6dbeb48206b908e02717a8896dd14b8fcc2c8e20eeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/openresearch.rs: FileTooLong \u2014 739 significant 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: OpenResearch (3 blocks, 250-1003). The bar is 500 significant lines; this is 239 over it, 1.48\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/adapters/openresearch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c8ba12c24e97b43cede47ac7c54d35d4001bc72518a3b99155480fe77eabf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/overleaf.rs: FileTooLong \u2014 735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 235 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/overleaf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bd2cf35f11b32ab3b2e8df766b346dee0e3eb35df360c1f55a8ced7a12738a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::jobs::kubernetes::prepare_docs: FunctionTooLong \u2014 openresearch_cli::jobs::kubernetes::prepare_docs 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/jobs/kubernetes.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37a035c9c3b27825dfd4f1494d151297597f0d8387e9c6cdfa360470994e127"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.search_chat_messages: MethodTooLong \u2014 search_chat_messages 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/store/search.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e976a9810408ba1ad44e2ebe8a00e72a45a69917b9c7bf4876e3716fd6cad20"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ModelPicker: ClassTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 184 over it, 1.46\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":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0825f5dd9db97c793e987ea606118307b34aa146f8ae619db641e8153c58f60"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::harness::codex::item_to_part: FunctionTooLong \u2014 openresearch_cli::local::harness::codex::item_to_part 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/local/harness/codex.rs"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3e597de86601afdb756a370c119ec116f0abce3b84cb8b90054973324897d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: service/mod.rs: FileTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 228 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/ssh/service/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9729990a63008530324883741a211e53e90829a0ace3bd162560327f190e1d6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/compute.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":"src/compute.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8f87c12d85596894e81187df2d7336beb8b9f62138c639fb18ff36ec47085c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/settings.ts: FileTooLong \u2014 726 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 226 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":"ui/src/queries/settings.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"621db2650e4fb9c9f6a8bec3324b2aa25033191796d0c80c9f64c6690831757d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DetailDrawer.TerminalView: FunctionTooLong \u2014 TerminalView runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/DetailDrawer.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8091f5a94017d3f4426abb32cf3fd68914c53ec535b33e181a12703b2c0a34c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::harness::managed::catalog::latest: FunctionTooLong \u2014 openresearch_cli::local::harness::managed::catalog::latest 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/local/harness/managed/catalog.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"776d2f33a4be4fded4d547540827837aa53528f89b27c1243d09d2c4886a2d1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/opencode.rs: FileTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 216 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/opencode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ae36f9c9f20ca02dd3883117dd4307c0467c03e5d8fe6beaf15e54f9cb0461"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transport/ssh.rs: FileTooLong \u2014 707 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 207 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/transport/ssh.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de567afbf61e395f1727b60d41b2a93b847b095571c1b031c02c4ca0d35af889"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TurnCtx: TooManyFields \u2014 42 stored fields beside 39 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/local/chat/mod.rs"},"region":{"startLine":8357}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9ded7d4a5e1bcbbbafbc38776b8734b9e68d1a39372c53f0cde1d75d8b7dcb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::commands::up::api_v2::read_log: FunctionTooLong \u2014 openresearch_cli::commands::up::api_v2::read_log 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/commands/up/api_v2.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efc5c9dc3d9306ba702d647cf540629fb9c00ed666b7217401776b14038be15"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::commands::up_remote::connect_once: FunctionTooLong \u2014 openresearch_cli::commands::up_remote::connect_once 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/commands/up_remote.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"860beb2c488057654dd85425789a6882e36910e53762eb47fb14c92f50f6d04c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ArtifactsTab.TreeRows: FunctionTooLong \u2014 TreeRows runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae204b73888b39b805e0cbad37686d25a56265f6861c114e43291d550d12ef99"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Host.launch: MethodTooLong \u2014 launch 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/orx-host/src/server.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"0432d56a97e9f684b315d0b8be2b8bcd979353842ffdd2cfce3cbdc815e00eb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SettingsPage.VercelSection: FunctionTooLong \u2014 VercelSection runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9c6bc2b403030cfddaa0a7b31e3d67159789582622b4ef4c15423d367c9002"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Actor: ClassTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 2 blocks, lines 375-1139. The bar is 400 significant lines; this is 152 over it, 1.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/transport/mod.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"183cc0a7b15d923deb16d6b52b89ff56b1fa26301979a45ecc52c986db04bc2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Machines.MachineWorkspaces: FunctionTooLong \u2014 MachineWorkspaces runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/Machines.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"74995ef47dfe95d97ea0ef77a7e37096aef2900df9919990ba12925a82d3a73e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: acp/host.rs: FileTooLong \u2014 687 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 187 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/acp/host.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc686e737e2f5722546a89a3625795c901b8953ef8e02453860ef7d0844fb9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::jobs::kubernetes::inspect_job: FunctionTooLong \u2014 openresearch_cli::jobs::kubernetes::inspect_job 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/jobs/kubernetes.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d03e72a1935af622351946c6ad970c507bea1c5128a4e7cf09a6d6b6ee9749"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/trackio.rs: FileTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 175 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/trackio.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57551b4c7148f8eddcdf786e722347418171cd3f54562f9b1d454cd15053a6bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: harness/opencode.rs: FileTooLong \u2014 671 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 171 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/local/harness/opencode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5495bc57adc0574d3b5d5379c170fd064f472be674c70bda85e28f86ead703"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: WorkspaceTools.SideChatPicker: FunctionTooLong \u2014 SideChatPicker 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":"ui/src/components/WorkspaceTools.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a20c9d2e1f3769261418f1b68d46e60576c57c5c12606b6128dae755710173f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/wrapper.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/orx-host/src/wrapper.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68519270208dc033f525d6a69376a5daf130c7f87d920d4a5d483ea8a605ff3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NewProjectForm: ClassTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 132 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/NewProjectForm.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c99ee0f0f4b3c852577fe1bbb2539a0e8547d458c44bcb60e6c1b2d0cf213c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::commands::up::move_data_dir: FunctionTooLong \u2014 openresearch_cli::commands::up::move_data_dir 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/commands/up.rs"},"region":{"startLine":6047}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d3aa5ab37761bfedda7ba76b00e616e38b8f0ab42d980990825426d88703f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChatHost.launch_turn_ctx_locked: MethodTooLong \u2014 launch_turn_ctx_locked runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":6692}}}],"partialFingerprints":{"codehealthFindingId/v1":"763a10f9aa6956fd3be04b97dd5d6838ce4417d5769dadb2ceaec4e63d14fd1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ResumeDialog.ResumeDialog: FunctionTooLong \u2014 ResumeDialog runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/components/ResumeDialog.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6648fbd456140397e5620b5c9b77c64f1cbffcca5dfae8e1d3455fa71f85a983"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: orx_host::exec::run: FunctionTooLong \u2014 orx_host::exec::run 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/orx-host/src/exec.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"110bb5c639104a87f3c78bdbc5ec1eda7d0bdd8e32471f5e73cf84b6b67e3985"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::harness::opencode_v2::run_turn: FunctionTooLong \u2014 openresearch_cli::local::harness::opencode_v2::run_turn 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/local/harness/opencode_v2.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bcdbd4d857a0c79a0f0c0e90ffebfcf4cf001ab65d2b4753003b1871248919"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FileTypeIcon.glyphFor: FunctionTooLong \u2014 glyphFor runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/FileTypeIcon.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6ab1ff9856b206004e2dfc6461e95ca973fce8f390f1c2d9b411f5dd38907a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: LogTerminal.LogTerminal: FunctionTooLong \u2014 LogTerminal runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/LogTerminal.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abdb5e01589b23d822a7c04234a560ef7da21ff9a69bfa8a841c7a9a1e7b5e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemoteHostDialog.RemoteHostDialog: FunctionTooLong \u2014 RemoteHostDialog runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/RemoteHostDialog.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cb2fb13dc1e4a4787ddc507bcfd701310eaf333f71c052d5b6a0f420bdd79b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OpenResearch: ClassTooLong \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), 6 methods, 3 blocks, lines 250-1003. The bar is 400 significant lines; this is 124 over it, 1.31\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/adapters/openresearch.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac73df42127ebcc653775e71fb678ac401db4c08c954a33697ced52f220a1f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: harness/acp.rs: FileTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 155 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/acp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"439b0f7a309decd407b1bd20ee1baf3546d6af58bb7d86f637d76ea989f6d9ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/local_models.rs: FileTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 155 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/local_models.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d486f0215024ddea3953891bfac6ec44e36d6b902914abe0b727226818a8fcb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::commands::up::update_chat_session: FunctionTooLong \u2014 openresearch_cli::commands::up::update_chat_session runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up.rs"},"region":{"startLine":9969}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2ee9129500dd596ba25b2202a31863f2eecda7c94b8bd7614d6bb36f46e98c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: events.createEvents.useOrxEventStream: FunctionTooLong \u2014 createEvents.useOrxEventStream runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/events.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"469c5bc94389e7efdee195e7a949ec20164b3e2893b79b3ddd9722b4f5f44fe6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TurnCtx: 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":"src/local/chat/mod.rs"},"region":{"startLine":8357}}}],"partialFingerprints":{"codehealthFindingId/v1":"541679cb2abd85063932729ba417a1e58ea77ec6a0073b2073083de99ab9721d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/ArtifactsTab.tsx: FileTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 145 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ce6976bea201bb2373c92d58cd35791cbf2dd2f11267e194bc06f08dbe9323"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SettingsPage.GitTab: FunctionTooLong \u2014 GitTab 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4414}}}],"partialFingerprints":{"codehealthFindingId/v1":"376f50216afdb0c9110de58dfd8bd6602a7cddf5529519895793a48806e310e5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AddAgentDialog: ClassTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 112 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baff5c1aa2cf581b3073eee1c5339d85ff8f323c4c76558cb0065603638cbdb8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TurnCtx: ClassTooLong \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), 39 methods, 2 blocks, lines 8357-9349. The bar is 400 significant lines; this is 111 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":8357}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef56734f49952aa24e3e89a1440085307c3a4d7353199c92e0b2d667a7e67794"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: up/harness_setup.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":"src/commands/up/harness_setup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d4e91c3c67f59af79e9b3b3b10bd1cd5a3a3c918db5123765996c14bc98319"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::claude::spawn_client: FunctionTooLong \u2014 openresearch_cli::local::claude::spawn_client 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/local/claude.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"4810b3cc0f7fb1f79a4587b12f8e9b47312b8cdb9cdf18a015f300d365df0d86"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ModelSettings.ModelSettings: FunctionTooLong \u2014 ModelSettings runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/components/ModelSettings.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b692f378679ba82fed75c50e75e51d89d7c28a3b198f60e0b4b377f7ec540787"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Connection: ClassTooLong \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), 20 methods, 2 blocks, lines 733-1486. The bar is 400 significant lines; this is 104 over it, 1.26\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/overleaf_live.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf25cd806ffaf5e7723179e64bd8a3a49056bd8206f771d190b672940360cd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::commands::up::set_ui_state: FunctionTooLong \u2014 openresearch_cli::commands::up::set_ui_state 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/commands/up.rs"},"region":{"startLine":6825}}}],"partialFingerprints":{"codehealthFindingId/v1":"0913a1a5b0dd852d947d17baad992cb37de0f1cc339ff5deab26352219b3dfc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: harness/antigravity.rs: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 121 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/antigravity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8dcf3b5c833702866d6c883522bf11c162c6c6b1a4f1b51dd0b68f798103b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::harness::cursor::run_turn: FunctionTooLong \u2014 openresearch_cli::local::harness::cursor::run_turn 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/local/harness/cursor.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe47c759e8aa53670ffd903c3c7dc47279f487e6c84834dfe1a6d196a35d466"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/alphaxiv.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/alphaxiv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9e1a57fb52c4791a4698ac21507805470426ea878e3a8fb9a8832e6f0a042b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/ssh.rs: FileTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 77% of them inside a single declaration: Ssh (3 blocks, 42-874). The bar is 500 significant lines; this is 111 over it, 1.22\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/adapters/ssh.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"742799b89cd8d3e2f60440bf608cfff908e5a391e6f58f78a555a61ed6b8630c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::storage::scan: FunctionTooLong \u2014 openresearch_cli::local::storage::scan 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/local/storage.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"82110e2a4d512f74a2ee6618d52c00f9310e284f114615d1c33023c819211c39"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.create_demo_snapshot: MethodTooLong \u2014 create_demo_snapshot 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/store.rs"},"region":{"startLine":2547}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6aaaaccc3681ed89f52ba4facb9cf8e4d650907e4210ef01bac712ef9f59d8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.finalize_turn_usage: MethodTooLong \u2014 finalize_turn_usage 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/store/telemetry.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cef4bb513d010ea1bf1da6e31e3c5c03d0eb8175cd0d26e05cbe80c5752afda"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jobs/modal.rs: FileTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 108 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":"src/jobs/modal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd20fea7d01aed70287182de95c3031c933b6e132dd30938d682882a94f010e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dialog.createDialogs: FunctionTooLong \u2014 createDialogs runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/dialog.tsx"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"71baadb74a7e2d56a4f0e7b4da78f577f5c927ab809c1f84d5263e095f88919e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Events.QueryEvents: FunctionTooLong \u2014 QueryEvents runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/queries/Events.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ae01e149cc03234e50a1b5175ba718b554789204acc090fc8ab7ccfde9dc18"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SettingsPage.K8sSection: FunctionTooLong \u2014 K8sSection runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"764d6663a89ee9875d4421fe9e863f4166ecbe207008319a24b6a3cdd1ec5768"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Ssh: ClassTooLong \u2014 471 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 3 blocks, lines 42-874. The bar is 400 significant lines; this is 71 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/engine/adapters/ssh.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4265ded7175c3c34b0398b65431332ed9072ed7d46944eb84eaa3ca270bbbed7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: harness/managed.rs: FileTooLong \u2014 587 significant 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 87 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/local/harness/managed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"117786161d57c31d3bc46c5ea7f35df07776da260a3a942f7a4cffa2991c2f40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/compute.rs: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 84 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/compute.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef5a3a4c9d04fee25f029fe5d57f762e08ba2775cab7e642c0c3624c5e70cf3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Engine: TooManyMethods \u2014 35 methods, declared across 6 files: engine/mod.rs (12), engine/submit.rs (10), engine/reconcile.rs (6), engine/legacy.rs (3), \u002B2 more file(s). The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/mod.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"0650a00f209e4e01769bba5411ffb25ab6b29704e871802aeae69a383e5a7a87"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: HarnessInfo: TooManyFields \u2014 35 stored fields beside 5 methods. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/detect.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa910223f0518a58eeaf95d48c3f44e2212c9d46997e5ada0fa796bf787e40b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::overleaf_live::run_connection: FunctionTooLong \u2014 openresearch_cli::local::overleaf_live::run_connection 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/local/overleaf_live.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d802c2137fabf344331a86daf49ffa38b5b3a5edbfbd3f86c29e8afa5150742"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: CodeEditor.CodeEditor: FunctionTooLong \u2014 CodeEditor runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/CodeEditor.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15ed7e0f27bc9871fb612d01c719c53bf776193227d058c39a3d968208a1e04"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: HtmlPreview.HtmlPreview: FunctionTooLong \u2014 HtmlPreview runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/HtmlPreview.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"789d4653d077ab3890fea97bade74b9613f9073fa5ad339c6a2e9a4aa0cae13b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SettingsPage.ComputeTab: FunctionTooLong \u2014 ComputeTab runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"158c3dd1a066a33a8a103355f5c72230a0de3330beb7d3bbb2bd7eaf72c80aff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: terminal.mountTerminal: FunctionTooLong \u2014 mountTerminal runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/terminal.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82468da9dd7df0faaf1adc77b4340ca18793416658b6ac82911e8734edbeb94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/NewProjectForm.tsx: FileTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: NewProjectForm (63-664). The bar is 500 significant lines; this is 79 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/NewProjectForm.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10919685822d3d45427feec4377d25bbc8d42dafc127adb8bececa69b0e8c8a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ArtifactsTab.PreviewPane: FunctionTooLong \u2014 PreviewPane runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ea4ec82a2e04e136d32481f0d9cc15da87fb062ce0378dfd96254ff929fc0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SettingsPage.OpenResearchSection: FunctionTooLong \u2014 OpenResearchSection runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"4451d1323b8c39504b92a0a368e67fb8d16162b73d3ffd0ce87734b00bdcf9f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: chat.createChatQueries: FunctionTooLong \u2014 createChatQueries runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/queries/chat.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"45488ad4deb38445a9ecfc1a1f7052a7c790973bd171065a104a0ee490633679"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/model_routes.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":"src/local/model_routes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92c8d5a61d1f5a0fa71e76f39fa21147db0af1ed8affadeb46f1702b2284c6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: harness/detect.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), declaring 33 free functions. The bar is 500 significant lines; this is 70 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":"src/local/harness/detect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26763ffda2ae72c3d5788965d0b3454dee1aed962d0becc290c320f70e87cba2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConfigureArgs.body: MethodTooLong \u2014 body 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/commands/compute.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"465c99a294f557b2963ecfe1c57d3ccc0aad52c34f9f1ecec963f961778aa05e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClaudeHost.acquire_turn: MethodTooLong \u2014 acquire_turn 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/local/claude.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5201ec1b7ebc4ade1d5c5771d0e296fc37f966647c9ea7c6a494cf5f9fd3a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: HarnessSetupDialog.HarnessSetup: FunctionTooLong \u2014 HarnessSetup runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/components/HarnessSetupDialog.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f522cccf97b4d37e75032f4a239a950e306bbded6219c0007dd7f4dbabd43d21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jobs/huggingface.rs: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 69 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":"src/jobs/huggingface.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe561784d96647301430bd4384ba1136646fe8bc8da2f37b70d850f961d14df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/opencode_db.rs: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 69 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":"src/local/opencode_db.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b9a0b44c19b0c7ed6cb0a69bbd44f358a7a56ea984721dad5f6a197c04d349"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChatHost.fork_turn: MethodTooLong \u2014 fork_turn runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":5736}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e88070e0b1cbdb95f4fc0e58fc743eabbed9857ab684a11bce47d3cf0bdfc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::run_cli: FunctionTooLong \u2014 openresearch_cli::run_cli 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/main.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a610b53279ac0cfd0d838a1b4f579cadbd4eba79b7ad04187cb1db7532f3ad4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::commands::project::run: FunctionTooLong \u2014 openresearch_cli::commands::project::run 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":"src/commands/project.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4470cb56895b5ac7ece246fe979201bf34af3188d59122dc57c51402d77609cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SessionHoverCard.SessionHoverCard: FunctionTooLong \u2014 SessionHoverCard 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":"ui/src/components/SessionHoverCard.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"722f0bc0e6f39f23eadfd3dd6d37ad914b966eabccaef5c95546e3f6a5524440"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::harness::claude::run_turn: FunctionTooLong \u2014 openresearch_cli::local::harness::claude::run_turn 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/local/harness/claude.rs"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"603f807e7a374f8e47289813503bea20a8da8aada2ec8670f6a6b7be2b07cb47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SshConnectTerminal.CommandTerminal: FunctionTooLong \u2014 CommandTerminal runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SshConnectTerminal.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c99c2d0036dde3f48e05d800b83698f2e34c1daaa40d8e1ea2c092a94ae0f8c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.deliver_notify: MethodTooLong \u2014 deliver_notify 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/engine/notify.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a0437bee587e96b5870644023691eab8872f28b31220386d36d1f455c82bcd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChatHost.set_agent: MethodTooLong \u2014 set_agent 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/local/chat/mod.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"384ca9d0a3f00aca926f25b46a5d866b66b1db55461e983d38577908cfa0d0ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: UsageMenu.UsageMenu: FunctionTooLong \u2014 UsageMenu runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/components/UsageMenu.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f6c9e21ef50931199936c5f92ee8ee21773e1c62c198934abfd512cdc4c07e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: invalidation.createInvalidation: FunctionTooLong \u2014 createInvalidation runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/src/queries/invalidation.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"608610bcfd4aeb8efd9b2258e7dc05e813881ff86ad980cfabdbf207b590e838"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: up/agent_tools.rs: FileTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 39 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":"src/commands/up/agent_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"306479b9b8d890bf65bda449250d6802524c25732fdfe81b7b909f88a1c5a8fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jobs/ssh.rs: FileTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/ssh.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e28e0ed2e01d2499e86cd173eea99c78092a1f0925418632b72766c890462d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/acp.rs: FileTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/acp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"900064d1b09777aefa52019b2db4ad82fc2697d005a19063870c538c106e891e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Runtime.collect_log: MethodTooLong \u2014 collect_log 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/engine/runtime.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4b2b45a23003cb377d39066bdd7ee330b8739762650bbddaba5602b462f824"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::chat::handoff::context: FunctionTooLong \u2014 openresearch_cli::local::chat::handoff::context 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/local/chat/handoff.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ca4715e032cd3dfc074e0922ac5f74d94aac6711d225fbb4e23bb23a338583"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClaudeHost: ClassTooLong \u2014 427 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 3 blocks, lines 966-1593. The bar is 400 significant lines; this is 27 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/local/claude.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"3311c286890472220a7a199001a221fb1b8c65b1b97d16995bf6dd73e6678e7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/ComposerEditor.tsx: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 33 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":"ui/src/components/ComposerEditor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c427ab6edbe8044ad115e4972aa7a5d006549d21787c32b9d66a54dde68e22a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Local: ClassTooLong \u2014 424 significant 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, 3 blocks, lines 60-639. The bar is 400 significant lines; this is 24 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/adapters/local.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a90ad6b1e9525c31dacae2209dc9813bdedb68beb135bac3ac5a4fab60a2f3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ApiClient.logs_to: MethodTooLong \u2014 logs_to 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/plane/local_plane.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"87114d0b3ad97b840e91691d8afaaed20645654273335d84a5abbde3b74afbdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/starter.rs: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 25 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/starter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c52906d3f3b4516d223c6ee56ce46d033e92bba162b11718d6eba9977d5e5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::engine::reconcile::observed: FunctionTooLong \u2014 openresearch_cli::engine::reconcile::observed 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/engine/reconcile.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff89673f7e4e66dd688a5ae68e5148c341dc038feff25947423e980b08f168d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChatHost.respond: MethodTooLong \u2014 respond 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/local/chat/mod.rs"},"region":{"startLine":7254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69669f4b9721749fedd6ab36bdfa46d0dbb2030f50ce0a499dab424edf2f787"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/TreeView.tsx: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 22 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/TreeView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"014fa559acacb1b714283bd4a2b9371a5362e1f447f6c881d68bbdb9345219c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::jobs::ssh::service::run: FunctionTooLong \u2014 openresearch_cli::jobs::ssh::service::run 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/jobs/ssh/service/mod.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"56669d1e058480e189a83a4098e99edc0c92062551bcabb0dd85ce2239aa5a0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: WorkspaceTools.WorkspaceTools: FunctionTooLong \u2014 WorkspaceTools runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/WorkspaceTools.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af95c8755ffc045de15e886fb4a7bb0788b2f4d283071353e87bd9f7cd3cd7a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Delegated.create: MethodTooLong \u2014 create 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/local/acp/delegated.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c15d8af554901102ef2a85749934ffbb47d91459144c0d4926de669ad828b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChatHost.run_shell_command: MethodTooLong \u2014 run_shell_command runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"278110525bc67b415e2fc0671008bae8cc6abf35506602d6153a77305f0f04c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClaudeCode.detect_at: MethodTooLong \u2014 detect_at 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/local/harness/claude.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e3c0f42ed1bbe8244707f640693ea5262898322abf5f424671e13d99dcded2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useLatexCompile.useLatexCompile: FunctionTooLong \u2014 useLatexCompile 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":"ui/src/useLatexCompile.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e911662f462727b76fb2c925f947a566cbff35d9a3a90ed07c5ac8a44aa23a94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/agent_profiles.rs: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 5 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":"src/local/agent_profiles.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9c42a1fd3c684e5f612b2173cb3038120df4c67d306c4a85f7f939e4e20c1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::commands::mcp::run: FunctionTooLong \u2014 openresearch_cli::commands::mcp::run 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/commands/mcp.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ab3cf687e10569983a4673aacd89fafb0b408b6db1a3ce93c7ee7509fc4ac8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openresearch_cli::local::harness::codex::apply_notification: FunctionTooLong \u2014 openresearch_cli::local::harness::codex::apply_notification 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/local/harness/codex.rs"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"666e697deccb925e0baf18b06e28d0ec8be939d7f6cd1f2972751a21cc574fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (80 shared lines): src/updates/linux_app.rs:104-230 | src/updates/macos_app.rs:106-207 \u2014 These two members are variants of one another: 80 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/updates/linux_app.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f569557b11c99ba897b803c6edc43f9663071f9bddde1877e7f7d84bcba9ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (40 shared lines): src/local/latex_templates.rs:131-193 | src/local/user_skills.rs:346-429 \u2014 These two members are variants of one another: 40 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/latex_templates.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"152f2756d51275ed6458c562471594e14e3f02de06877cc712bcca304995a31e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/jobs/mod.rs:162-172 | src/jobs/mod.rs:176-186 | src/jobs/mod.rs:190-200 | src/jobs/mod.rs:203-213 | src/jobs/mod.rs:217-227 \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/jobs/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a651f96de3a479beeffc55e709a9ddf61e9004d4c8981c618f737967f30818c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/commands/up.rs:5219-5233 | src/commands/up.rs:5239-5255 | src/commands/up.rs:5273-5291 | src/commands/up.rs:5298-5313 \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/commands/up.rs"},"region":{"startLine":5219}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd52fe1ae0b79fe4713c548d870ef58227409fef9d7c6188d541e7fcae112425"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src/jobs/modal.rs:326-374 | src/jobs/vercel.rs:885-922 \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":"src/jobs/modal.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc0213c91fd0aa4618b9049e64f7bdcd81d372d6418bffa4edd26ba5db4f5ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): src/commands/remote_host.rs:175-213 | src/store.rs:126-165 \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":"src/commands/remote_host.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"625093b7ccb447e6d7a17d18d9c3ca38f018951a375fe833dd5073533dc8b43c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/local/harness/acp/auth.rs:121-144 | src/local/harness/acp/auth.rs:146-173 \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/local/harness/acp/auth.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ee44d7ae0023a33841f1763e23feb611c99c1947fa2d92c8d024698826fe9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/local/harness/antigravity.rs:885-917 | src/local/harness/cursor.rs:1185-1219 \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/local/harness/antigravity.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"8745968f9218dd6f1d8fdc6b4160558cd1bb2d6522103e2f1569c4f10c802de8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/jobs/localbox/windows.rs:64-93 | src/local/codex.rs:1287-1317 \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":"src/jobs/localbox/windows.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0db3e0539158de274865a7a996d022485a66b493bcb17b3ab6fd06fbf14bd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/commands/up.rs:4384-4403 | src/commands/up.rs:4893-4923 \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/commands/up.rs"},"region":{"startLine":4384}}}],"partialFingerprints":{"codehealthFindingId/v1":"d691bcbdabc8b63b9866d48386b0650cf55c64c2231f485bb5e4313dc6833bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): src/store/costs.rs:83-120 | src/store/costs.rs:124-160 \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/store/costs.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49a16e8468f2b47a5c4a471995987a9d538f5186709300cd14f400530324760"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/jobs/modal.rs:450-479 | src/jobs/vercel.rs:994-1027 \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":"src/jobs/modal.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e8044b135b4f44154ea0809cdfac792fed6c3202a66f4275e3f1099d4bcff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/local/demo.rs:1574-1591 | src/local/demo.rs:1593-1618 \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/local/demo.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4216458804c669743c0522585144a135386f1032919e95198ded937288d0c74c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/local/latex_templates.rs:217-235 | src/local/user_skills.rs:431-449 \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/local/latex_templates.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46211899d910b5dc6f88c413d6a98cebedd4020f6182e7607701746590b5111"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/jobs/modal.rs:491-510 | src/jobs/vercel.rs:1048-1067 \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/jobs/modal.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afef7edb7ae57954f01ff6670e4cd5362cdb364d873e10673d61b1216225811"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/client.rs:1407-1443 | src/client.rs:1843-1872 \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":"src/client.rs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"82344f0a2b7b6bfd06a379f949d82a6f62efe43418f2e5dfa92b9820df15f3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/commands/up.rs:3402-3430 | src/commands/up.rs:3433-3459 \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/commands/up.rs"},"region":{"startLine":3402}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d406bec25675084d5345389f117d173b4c891023715b44b364ebee588f31a8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/commands/up.rs:449-475 | src/commands/up.rs:477-499 \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":"src/commands/up.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d46c80ecd16cfa3ee5d374790a0b0c2f4d22ddcca2a5c1e217eb2eb8862d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/local/harness/managed.rs:594-613 | src/local/portable_git.rs:105-134 \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/local/harness/managed.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef6fb7a65f9594b6f451da3ca74b1255a76e55935b83fd9f054e649d0a81078"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/store.rs:4995-5020 | src/store.rs:5045-5071 \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/store.rs"},"region":{"startLine":4995}}}],"partialFingerprints":{"codehealthFindingId/v1":"563d40c63b88a239a43d45d680beb9525b3a86b657e76aeda161e23248aec4e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/store.rs:3025-3046 | src/store.rs:3049-3074 \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/store.rs"},"region":{"startLine":3025}}}],"partialFingerprints":{"codehealthFindingId/v1":"7166e4bf2e33f75b70beca27b00301a9bd398b7658d2e8e0b2d00aa00e6c7971"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/local/harness/acp.rs:627-644 | src/local/harness/antigravity.rs:646-664 \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/local/harness/acp.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5b1cbf25bb063c75880587cb7d661f927ee40d0a6e158f171e0f40a9de84ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/engine/adapters/hf.rs:107-126 | src/engine/adapters/modal.rs:63-79 \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/engine/adapters/hf.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f43a3eae7209262dfed73ec724d1e8a24a8c7809278ee5e09a7a12cec42fca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/commands/up.rs:2265-2289 | src/commands/up.rs:2294-2313 \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/commands/up.rs"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba350e6f02e51a9bbbaa53b2af9494d8c615758044f9928150a1eba95818089b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): src/client.rs:1067-1087 | src/client.rs:1125-1148 | src/client.rs:1448-1471 \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":"src/client.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27d8c643a36bda5d649354e9abf5a07b1461d788991c5f507ee1a83f3290f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/engine/adapters/modal.rs:21-31 | src/engine/adapters/vercel.rs:36-46 \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/engine/adapters/modal.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d973588ba9bca297631d71fa0ac074e5bf95b6378b7d7805092a469dae169b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/local/model.rs:48-63 | src/local/model.rs:90-106 \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/local/model.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d696db50cbbfcfb16c6d6faab334aff6f9cfd36a1bc1e6494e4bc6cf172eab59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/commands/remote_host.rs:1069-1090 | src/local/storage.rs:45-64 \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/commands/remote_host.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb10558f78a8f5251578d93d2279a6cc06b70ed164e90908761e85ae29a00a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/updates.rs:257-283 | src/updates.rs:286-306 \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/updates.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"50960328a212fc4d2a240ee3b874b667310659a10decd3eb3b0177ecaf4547ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/local/local_models.rs:710-728 | src/local/local_models.rs:825-843 \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/local/local_models.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68ea1b49cc19763b5d8dfa7c39bf885121a711b13a610cab34d9c84330c0646"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/commands/library.rs:5-23 | src/commands/library.rs:25-43 \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/commands/library.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8749ebae12917127ebd9d46a8cd475efa4ef59f12b5eb1f2096ee92de2842e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 17\u002B corresponding lines): src/store.rs:2244-2262 | src/store.rs:2267-2297 | src/store.rs:3758-3825 | src/store.rs:4694-4710 | src/store.rs:4715-4732 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/store.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e38279c81b9fa78b49cb6d57dcb08438179c0f90949e1e7cc0d5fe2e324357"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/local/latex_templates.rs:293-304 | src/local/user_skills.rs:678-689 \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/local/latex_templates.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5740ee646b346d93f50bd9a8a1f7a607e2a4058b1525ca1575e07cc382bb00f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/local/native_chats.rs:266-281 | src/local/native_chats.rs:285-304 \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/local/native_chats.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be08a2de025faafa948e5c3f5e87b026acda6836b8b491272ad6ff6cd6cc2b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/engine/adapters/local.rs:606-623 | src/engine/adapters/ssh.rs:776-795 \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/engine/adapters/local.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a245a07201f17ef812650658daa842decbed0d611939cb75fb4e7b09c18b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/jobs/huggingface.rs:200-219 | src/jobs/ray.rs:216-233 \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/jobs/huggingface.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3fa01cb28fee5c85320d99a9dd01bba3f3c5e2b824a2404d863c2cfee7f413"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/main.rs:1349-1368 | windows/launcher/src/main.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":"src/main.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"938e4e45bcf7788a94135bd9b13e64e6247294f3c3107568f4e5f8af64685ad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/local/harness/managed.rs:767-785 | src/local/portable_git.rs:83-100 \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/local/harness/managed.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"7693132af0eb29f8fa8e7815d36934171108b6ffc5304979b174c815fe9fb0ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/commands/up/model_feed.rs:209-220 | src/updates.rs:388-398 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/model_feed.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50d96bcda430d3d208d75312fc00ce3d52382d2cdf31b1471e474b570389624"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/store.rs:5534-5547 | src/store/telemetry.rs:755-767 \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/store.rs"},"region":{"startLine":5534}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8130e7495e23ac1194f6dce3691f0b6bfdee92fcd8c33ad744eced8abf86d6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/local/native_store.rs:565-578 | src/store.rs:6388-6402 \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/local/native_store.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db624f9a1a976153adc450571136804a7abe94b3675e823698cb747e00d3ae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/local/git.rs:320-338 | src/local/git.rs:2015-2032 \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/local/git.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab37d6a4d6cff5ac72ec02c6cedcc1517b139144bd8b1e7289c1a7acfd0303ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/local/chat/mod.rs:8330-8339 | src/local/chat/mod.rs:8346-8355 \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/local/chat/mod.rs"},"region":{"startLine":8330}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d93cd1b825cb50fce367c45118ed631aae752763842aebe7d177e960ec4ef74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/jobs/localbox.rs:83-102 | src/updates/windows.rs:76-100 \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/jobs/localbox.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"feecdf3cfe1283092238c325f9be1cd299c9140821adb59507e8bd2bbbfb59f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/store.rs:3310-3319 | src/store.rs:5728-5740 \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/store.rs"},"region":{"startLine":3310}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed31513149531af280af98268c73128fb1e2d079cd8a42bb4e1279b526adae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/alphaxiv.rs:413-424 | src/jobs/managed_env.rs:267-284 \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/alphaxiv.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a45f7f58dfb1546aa6187a66a0eca1c5894b0dbb65dcfb90fdf0a05bd98bf8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): src/jobs/kubernetes.rs:87-100 | src/jobs/ray.rs:38-51 | src/jobs/slurm.rs:82-95 \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":"src/jobs/kubernetes.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d033fb5854afc9780bf18b494fbcd198c10bdf235ef6e6ee61d946eb3b77ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/store/acp.rs:42-59 | src/store/telemetry.rs:958-975 \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/store/acp.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efd4a3f34cf67e1acc24b5d4e0bb600f71071b2972ae23cd579c7b88d891f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/commands/up.rs:1647-1656 | src/commands/up.rs:1715-1722 \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/commands/up.rs"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa08c5740147069b15fab1f6897330b527b3918a8b6aebfeb45e4e3a2fe74b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/local/agent_profiles.rs:235-245 | src/local/local_models.rs:373-379 \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/local/agent_profiles.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"594828cfa4cda6ae57447bfb13766dd4afc85a91c516fbd36c179fc4a03f3d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/jobs/huggingface.rs:494-506 | src/jobs/huggingface.rs:509-526 \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/jobs/huggingface.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"72635f325a1505f864c67b2c4f65527ffd70595d7ccd897c2566f01d182c29d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/local/claude.rs:1026-1043 | src/local/codex.rs:1091-1105 \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/local/claude.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7d0616b5807164e8a436dc054ae81641f43817a3be7681958d3fa52257fc87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/commands/up.rs:8713-8723 | src/commands/up.rs:8759-8771 \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/commands/up.rs"},"region":{"startLine":8713}}}],"partialFingerprints":{"codehealthFindingId/v1":"9528e532ddc87e7df9b674fc749a79dd0489b6677e19b135006d51d4a5c9f220"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/local/opencode.rs:1010-1021 | src/local/opencode.rs:1024-1037 \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/local/opencode.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55f4e7e3bc2783f9b35d83d699938837a33ff5264f3de9b8da0bef9a45fbaf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/commands/up.rs:6498-6508 | src/commands/up.rs:6734-6743 \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/commands/up.rs"},"region":{"startLine":6498}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1af88c58fb2244a2688031e5a017bccbcba158238165da826af7b3389b3aa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/commands/up.rs:590-602 | src/commands/up.rs:604-627 \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/commands/up.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"4368bff1323f4c65f0840cab4d1080fd731cdc39faaf1be06f5dcea62da3e158"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/local/latex.rs:322-331 | src/local/overleaf.rs:518-527 \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/local/latex.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bf536bcb81aaecebb38d0b8d79f577e10ab67881d149fdbc271a785689e486"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): src/local/chat/mod.rs:968-986 | src/local/demo.rs:1387-1405 | src/local/harness/codex.rs:2437-2455 \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":"src/local/chat/mod.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b868e95c9a35153bf9068f7b2a72b754d2990ceaf0ac0cec015bae1898b8fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/commands/compute.rs:631-638 | src/local/git.rs:574-581 \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/commands/compute.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f4224bb471b54d0a2f02d5133355dab2af209010ac951d9d9288b2a046eb10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/jobs/localbox/windows.rs:141-156 | src/local/codex.rs:1358-1374 \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/jobs/localbox/windows.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10d3cc2117b6e651ebbba925a89d52a59483bb81505d5d89bfe40067f39c2a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/orx-host/src/server.rs:1257-1269 | src/compute.rs:171-185 | src/local/storage.rs:196-207 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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/orx-host/src/server.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b79b5c9de59cf2418f262c51e34b359d6915ad3d74bef5be7a9e31ecf90589"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/local/latex.rs:176-182 | src/local/starter.rs:749-755 \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/local/latex.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84ec7e80bf06a1cdd99b0bfe724ec07903e33ff59946b51f0634e67563abb97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/local/claude.rs:506-517 | src/local/codex.rs:398-409 \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/local/claude.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"855057f2ad2cac09e1a02a9349504cb82d602e5ccf5a6700826edd134f7f1aea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/local/harness/acp/auth/config_auth.rs:52-58 | src/local/harness/acp/auth/config_auth.rs:59-68 \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/local/harness/acp/auth/config_auth.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a75595c4d513b564247c8c42680a60b2b57d70a34ade2cb041b53b02ba0186"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/local/native_store.rs:534-540 | src/store.rs:6380-6386 \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/local/native_store.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"696719ad4614272d8a64ba9d51da0f562676c44a70a95640ae20148de0b6ad52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/engine/adapters/modal.rs:42-48 | src/engine/adapters/vercel.rs:55-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":"src/engine/adapters/modal.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c526535198b5b27dd1eaccbe2407effc729dc1703afda065c9584fdcb60a5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/jobs/kubernetes.rs:102-110 | src/jobs/ray.rs:53-61 | src/jobs/slurm.rs:97-105 \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":"src/jobs/kubernetes.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7ac974e98c9c9be1720ca17ea21c50633f7bb4cee030149ad2b318e22b2646"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/store.rs:2302-2326 | src/store.rs:3705-3721 \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/store.rs"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebd732e23212a147779f8f99b9b5fd689f6490ffd0adc8534576d0fd8eab1d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/telemetry.rs:1303-1314 | src/telemetry.rs:1323-1334 \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/telemetry.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"966b47e092cb10f4c1d05fd6da037f0418b9fcdc044b48c018da900625af7879"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/commands/up.rs:1671-1680 | src/commands/up.rs:1687-1695 \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/commands/up.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a6bfdfb0db069a2907f81bf3e15fca95f5de36211678699038deacf0a466c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/commands/up.rs:3271-3281 | src/commands/up.rs:3283-3290 \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/commands/up.rs"},"region":{"startLine":3271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87ccb527fe5bad2a35cb93ea87c197a51bc9500ad1e8c92948e00bed4e5dd3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/local/latex_templates.rs:310-322 | src/local/user_skills.rs:938-947 \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/local/latex_templates.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4312e7857ddc60882c7a5a7d07ec3863cc6b1b2807594bf275505781e1d66f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/updates/linux_app.rs:297-308 | src/updates/macos_app.rs:217-227 \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/updates/linux_app.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e41e3136909712808b43c6934e52331c496964923d8a4ea53c8b93c998083a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/local/claude.rs:1195-1207 | src/local/claude.rs:1209-1223 \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/local/claude.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3c24392be8743fc530fe722d32ca25974e5550c265de95c8c5ebfb137374f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/store.rs:2681-2691 | src/store.rs:3429-3450 \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/store.rs"},"region":{"startLine":2681}}}],"partialFingerprints":{"codehealthFindingId/v1":"803dd65dbcba35d7b7407bd873e28a5476472352563866a0802e704860fc6129"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): src/store.rs:5506-5518 | src/store.rs:5553-5564 | src/store/telemetry.rs:199-203 \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":"src/store.rs"},"region":{"startLine":5506}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce4b44ca9130323fbb4c242d0bfa0d8293ba3016d0920a76e4ad2d426270934"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/local/git.rs:57-68 | src/local/harness/mod.rs:692-705 \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/local/git.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b619ffaf2b9e53aa6425f5f83bd7bf0e8a3e901e4b9734a024c8e238032038a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/local/harness/acp.rs:157-165 | src/local/harness/antigravity.rs:154-162 \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/local/harness/acp.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ec0a284d55632e684ce85b4672435783d718a23a4318a55ffd45b9fcaf0595"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/local/harness/claude.rs:1965-1975 | src/local/harness/codex.rs:4613-4623 \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/local/harness/claude.rs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd5e469984cb1852c7c3b10ca8feeb436520c5bb435197c20950775d119d839"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 7\u002B corresponding lines): src/store.rs:2169-2176 | src/store.rs:3190-3197 | src/store.rs:3199-3205 | src/store.rs:3680-3688 | src/store.rs:3723-3729 | src/store.rs:5965-5973 | src/store.rs:6026-6034 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/store.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc03d0b9f46c8fe6ab28b442506d24102f8d9bfacabb20b49c523db338fb55f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/store.rs:2718-2724 | src/store.rs:3478-3484 \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/store.rs"},"region":{"startLine":2718}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7cea077f28cd72921f8f3c348c478ebdf20fe1008f5206b5bd94e5f6d2f5b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/commands/up.rs:9605-9613 | src/commands/up.rs:10186-10202 \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/commands/up.rs"},"region":{"startLine":9605}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0c43fb225b3544bed97d42c1cc7ca91d1480bfdf9debaf9204c4b6bb56dfea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/local/agent_profiles.rs:144-154 | src/local/local_models.rs:170-176 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/agent_profiles.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a2b1933dc081382bc0d157afd03f35eda414d8e2892141f21d724ad3285cde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/local/codex.rs:283-295 | src/local/codex.rs:313-328 \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/local/codex.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8580f45f8b17ebb722fb37a311f13ef9594874ad5acdde0600bb9b73e9d71a30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): src/store.rs:1952-1958 | src/store.rs:2058-2064 | src/store.rs:2066-2072 | src/store.rs:2074-2080 | src/store.rs:2082-2088 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/store.rs"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"75633360d12dd9d0ff84b2a60a6f19e9dcaa469057ae4132d3c90d2e2178eabc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/store.rs:3667-3674 | src/store.rs:3692-3699 \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/store.rs"},"region":{"startLine":3667}}}],"partialFingerprints":{"codehealthFindingId/v1":"798c155cf1f36a7c6dbc96be3ed3f1efbd48a021daa460f577d96796610eab4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/store.rs:4822-4835 | src/store.rs:4837-4856 \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/store.rs"},"region":{"startLine":4822}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb30b3ac11e42f7f1e59405593cdce81ff3de3121ea28dbb6e3d6c677f185d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/commands/delete.rs:183-189 | src/config.rs:489-495 \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/commands/delete.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bab96d9d12be4ecfb624dcce87c53e02c1b8e223f4d44b4e499fd3982cbd77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/jobs/modal.rs:566-571 | src/jobs/vercel.rs:1070-1075 \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/jobs/modal.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a8d87dd2960aabbf042adb011b75a21945dea96e4bf49ee239fcaf49690ccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/local/git.rs:270-279 | src/local/git.rs:305-313 \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/local/git.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"1675a236a9e2fbd40922e96577a8f5a0c96706c6d4f9ba9ffd27229754e6f997"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/store.rs:3928-3939 | src/store.rs:4041-4058 | src/store.rs:4979-4988 \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/store.rs"},"region":{"startLine":3928}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1983c5be081e3711e7327d80fb52567181ae3445f708cbe4283a6115044be80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/local/chat/mod.rs:8567-8584 | src/local/chat/mod.rs:8608-8623 \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/local/chat/mod.rs"},"region":{"startLine":8567}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd287124db28faa76fe5117b54c953465862efe5fd095f1fb911898b35bc56ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/orx-host/src/wrapper.rs:562-568 | crates/orx-host/src/wrapper.rs:570-576 | src/store.rs:2527-2533 \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/orx-host/src/wrapper.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"462fe92c307f5e715cb93bbabc39e8e3219fe112e36f5727cdf3a82dcdd41db0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/commands/paper.rs:101-112 | src/commands/paper.rs:114-127 \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/commands/paper.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5860f64f24423a91505aa7d7ebf2388667769ca21b781813d3da502b04653bfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/local/opencode.rs:736-745 | src/local/opencode.rs:747-758 \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/local/opencode.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69827f861677cf8bb153492d2174b370a043c5a85047d93f599326dc8df7d82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/client.rs:1323-1332 | src/jobs/huggingface.rs:123-131 | src/jobs/ray.rs:205-214 \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":"src/client.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea3eaed864b91f67f22f5ad0fc643135ab64d64b1917530aa888b70a53fe20e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/engine/mod.rs:44-55 | src/store.rs:496-506 \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/engine/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebed9fb81fdf22387ed416cca0a5e4e209575813f2ed396d4d361d4d89391b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/jobs/ssh/service/state.rs:173-179 | src/local/starter.rs:402-408 \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/jobs/ssh/service/state.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"beff2add3b2e03ecab134f5d6887eced7f4ff9524d0b981a948b6ef9bd97d764"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/local/files.rs:395-401 | src/local/native_chats.rs:453-459 \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/local/files.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4594213a50ee446255b2457e7af1b8e0a7d123ecdfe2954d143ea4c08f1de57b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/jobs/localbox/python.rs:72-77 | src/local/shell_env.rs:262-274 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/localbox/python.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09f3ddbba1c435df717adbddbb6daa4a37ddf5d76fff530089836113be16afe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/local/opencode_db.rs:422-430 | src/local/storage.rs:181-187 \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/local/opencode_db.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ef1cb2afc3b8825af5389b9ac4957ed628e8db9573b1b50836e1b27599de0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/store.rs:4568-4574 | src/store/costs.rs:163-171 \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/store.rs"},"region":{"startLine":4568}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4badcf3332603f7b0a761f0947c4bfbaa4680e2d9ac1135fd29fc66fe264c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/local/agent_profiles.rs:290-297 | src/local/local_models.rs:579-586 \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/local/agent_profiles.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e69c8f723d8f5362c9350ea55641327d7d40197deb5cd52f11c08fbe6e7b24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/commands/discover.rs:84-93 | src/commands/paper.rs:39-47 \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/commands/discover.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e84442ea607d6b5b92cbc085ac8251ad0055a9a61eddcfc7e5011891570c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/local/chat/mod.rs:1047-1052 | src/local/files.rs:61-66 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"3debd1a97e7623c4d00cc79c711c48d1b3dc41d0d73229d5b1525ea597a102d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/engine/mod.rs:57-67 | src/store.rs:482-491 \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/engine/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7450696deda23a1dfc956d6298071a2d4dccd8057512d37dc736671ee876fed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/engine/adapters/modal.rs:49-56 | src/engine/adapters/vercel.rs:65-72 \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/engine/adapters/modal.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50a6852132d838c3fb035e8a4bf22a749b91c066fc437ef2148c0388aefdfe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): src/client.rs:271-274 | src/telemetry.rs:690-693 | src/updates.rs:124-127 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/client.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1f5801bea42fbad50cece06ac597211654a61cb29dea89eae9a5aa0864b46d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/commands/up.rs:5865-5869 | src/commands/up/compute_settings.rs:1120-1124 \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":"src/commands/up.rs"},"region":{"startLine":5865}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc3c6d11f068c2fdca11faca410168fc825ae45b0ecd2cc811351263e3b1b03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/commands/up.rs:5940-5944 | src/commands/up/compute_settings.rs:1365-1369 \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":"src/commands/up.rs"},"region":{"startLine":5940}}}],"partialFingerprints":{"codehealthFindingId/v1":"68351d81c7e063fe23827de565e31f995991e96723cad3e486fcd72a0bcb2915"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/jobs/managed_env.rs:200-208 | src/local/harness/detect.rs:894-903 \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/jobs/managed_env.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cb857e00c47fd0bd203f9b036e6497452eb138cba5bbb621d56a6701f8124b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): src/local/harness/claude.rs:1353-1356 | src/local/harness/codex.rs:1762-1765 | src/local/harness/cursor.rs:191-194 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/claude.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"158f4315a571970a474b7fae87dd9fab441ee1b3949bfd6cd19c5bec5c6ab3c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/store.rs:1777-1783 | src/store/costs.rs:56-61 \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/store.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"7257e14f40756229a380b62140bc3212d8e5341f9acca220b2edd2765f6e1f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/updates/linux_app.rs:116-146 | src/updates/macos_app.rs:119-149 \u2014 before extracting anything, compare \u0060src/updates/linux_app.rs\u0060 and \u0060src/updates/macos_app.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 106 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/updates/linux_app.rs:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/updates/linux_app.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"072357639c1b554558068299aac4b8e3ff0ca0cf0e47d11d8c3d4b974bef6d34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): src/updates/linux_app.rs:147-172 | src/updates/macos_app.rs:152-179 \u2014 before extracting anything, compare \u0060src/updates/linux_app.rs\u0060 and \u0060src/updates/macos_app.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 106 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/updates/linux_app.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. 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/updates/linux_app.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d428b8ab5ecd5704351ebe5930910f435088e21bfc9dc53a7d6285af5ef3820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): src/jobs/localbox/windows.rs:66-90 | src/local/codex.rs:1289-1314 \u2014 before extracting anything, compare \u0060src/jobs/localbox/windows.rs\u0060 and \u0060src/local/codex.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/jobs/localbox/windows.rs:66\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/localbox/windows.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce784d44cb10d1367b6c720914e337a0ac694ac9057d2e2a5f4425766786ea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/updates/linux_app.rs:190-207 | src/updates/macos_app.rs:344-362 \u2014 before extracting anything, compare \u0060src/updates/linux_app.rs\u0060 and \u0060src/updates/macos_app.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 106 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":"src/updates/linux_app.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"825d34991ec9174a07ee7870a0d92de79555498b77544db244d080c53ee55e5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/local/chat/mod.rs:4604-4621 | src/local/chat/mod.rs:5159-5176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/local/chat/mod.rs:4604\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/local/chat/mod.rs"},"region":{"startLine":4604}}}],"partialFingerprints":{"codehealthFindingId/v1":"8527d3cf76f73c846b115695942edbb36c74524e22342f56b36fb499254ffbcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/commands/up.rs:10347-10363 | src/commands/up.rs:10375-10390 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/commands/up.rs:10347\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/commands/up.rs:10365\u0060 calls \u0060Some\u0060 and \u0060src/commands/up.rs:10391\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/commands/up.rs"},"region":{"startLine":10347}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e22a759111d763207b3c84acbf79afeae8ff740d5a1109798b3cefd7fe59c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/local/harness/claude.rs:1920-1936 | src/local/harness/codex.rs:4161-4177 \u2014 before extracting anything, compare \u0060src/local/harness/claude.rs\u0060 and \u0060src/local/harness/codex.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/claude.rs"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"37640f76e63941303e3762d96ab62e3c57de5be4de45e84254ba59098869791d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/local/latex_templates.rs:152-168 | src/local/user_skills.rs:369-385 \u2014 before extracting anything, compare \u0060src/local/latex_templates.rs\u0060 and \u0060src/local/user_skills.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 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/local/latex_templates.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/latex_templates.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"476b2edfab65557cb418332206d048a116256fe6f0ee349e53b7cb06f508a8fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201317 lines \u00D7 2): src/updates/linux_app.rs:211-227 | src/updates/macos_app.rs:195-204 \u2014 before extracting anything, compare \u0060src/updates/linux_app.rs\u0060 and \u0060src/updates/macos_app.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 106 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/updates/linux_app.rs:211\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/updates/linux_app.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"df685a209e80e136dc333111927b652eea4bdb7b8cdc9464b6d9d6479af41b9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/engine/adapters/k8s.rs:218-233 | src/engine/adapters/k8s.rs:250-265 \u2014 both copies are in the same file, so extract the block into one function there 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/engine/adapters/k8s.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20e6d63f6598805ec43178b8fb53aa293a3895fe47fff5f0d427d65f31fd6ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/jobs/modal.rs:495-510 | src/jobs/vercel.rs:1052-1067 \u2014 before extracting anything, compare \u0060src/jobs/modal.rs\u0060 and \u0060src/jobs/vercel.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 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/jobs/modal.rs:495\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/jobs/modal.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ed216a039459f11b88bfcf19fe7146a75bbdf51cbc4a3ca177bf0b80e00041"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/store.rs:1874-1889 | src/store.rs:2603-2618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/store.rs:1874\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/store.rs"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78642d80f01bfd6269e5dd0cdeebaa78bdb5ece4c619371b621b5d4fe81f717"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/orx-host/src/server.rs:995-1009 | crates/orx-host/src/server.rs:1087-1101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/orx-host/src/server.rs:995\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/server.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ab408c0fba73c196484c6865b8197801584801f48079f8316cc9ac95dd7fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/commands/up.rs:5199-5213 | src/commands/up.rs:5339-5352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/commands/up.rs:5199\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/commands/up.rs"},"region":{"startLine":5199}}}],"partialFingerprints":{"codehealthFindingId/v1":"045142d45aa54124aa3f21c056303e735ec07eee84e292b8065bd840056a152b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): src/local/chat/mod.rs:553-564 | src/local/chat/mod.rs:8938-8952 \u2014 both copies are in the same file, so extract the block 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/local/chat/mod.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"4966fae6982f9b5d21f53e9a10476f9fa342e87ecd3f8d6c5774fe4cca5b90ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): src/local/harness/codex.rs:1827-1840 | src/local/harness/cursor.rs:223-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 \u0060src/local/harness/codex.rs:1827\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/local/harness/codex.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3631987742e5843144b9a7424f3885a917fd0c06b8e9f1f99fccd135e44c348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/local/latex_templates.rs:137-150 | src/local/user_skills.rs:354-367 \u2014 before extracting anything, compare \u0060src/local/latex_templates.rs\u0060 and \u0060src/local/user_skills.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 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/local/latex_templates.rs:137\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/latex_templates.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef484858ef85bcab570fd17983d5f559494c0464d5258597852b456d2369807"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/jobs/modal.rs:343-353 | src/jobs/vercel.rs:899-911 \u2014 before extracting anything, compare \u0060src/jobs/modal.rs\u0060 and \u0060src/jobs/vercel.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 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/jobs/modal.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab54cbbffcbbd8ccc954f2f809c7711985890715d98abdd250d9cf527f6cf707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/local/claude.rs:1051-1063 | src/local/codex.rs:1110-1122 \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/local/claude.rs:1051\u0060 it does not close everything it opens, so those exact 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/local/claude.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe81ed6bf36a04281e53593285a653d4df13ab7b4d9246ba71315637783e2352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/orx-host/src/server.rs:692-703 | crates/orx-host/src/server.rs:761-772 \u2014 both copies are in the same file, so extract the block into one function there 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/orx-host/src/server.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc68c1355bf46c7bc549342d128b356b403ac8cf5435162414fc5015dc64b265"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/jobs/localbox/windows.rs:142-152 | src/local/codex.rs:1359-1370 \u2014 before extracting anything, compare \u0060src/jobs/localbox/windows.rs\u0060 and \u0060src/local/codex.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/jobs/localbox/windows.rs:142\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/jobs/localbox/windows.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7067c5acc34bd07493f0016f29d5f273be5f0319abb05d097bc3938b4e09ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): src/client.rs:1129-1139 | src/client.rs:1197-1204 | src/client.rs:1413-1423 \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/client.rs:1129\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/client.rs:1140\u0060 calls \u0060canonical_reason\u0060, \u0060unwrap_or\u0060 and \u0060src/client.rs:1205\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/client.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3b203f4e31f5dad79ef59251b5992965e4a74bbc15dcc57eba5e53f66ff390"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/local/acp.rs:363-373 | src/local/acp/host.rs:697-707 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/local/acp.rs:363\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/local/acp.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35ad3ff07a36b12d4b3f33e9870c6bf375bd19af536c941344e88974c01f444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/updates/linux_app.rs:105-114 | src/updates/macos_app.rs:107-117 \u2014 before extracting anything, compare \u0060src/updates/linux_app.rs\u0060 and \u0060src/updates/macos_app.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 106 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/updates/linux_app.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/updates/linux_app.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e694e667ad5b4bb6fe9848d5e3b2ea344fcc4316ba54a467db44637f8cc3f254"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/commands/up.rs:4000-4009 | src/commands/up.rs:4027-4036 \u2014 both copies are in the same file, so extract the block 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":"src/commands/up.rs"},"region":{"startLine":4000}}}],"partialFingerprints":{"codehealthFindingId/v1":"b749032f09103f8296960006c1ef0bf53b98b208a5d29ea34f63b9fed28c68f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/commands/up.rs:5112-5121 | src/commands/up.rs:5136-5145 \u2014 both copies are in the same file, so extract the block 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":"src/commands/up.rs"},"region":{"startLine":5112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed29ee061da9a96468afed5096316e07dc6e4c28262aec2c456e2f6115befb01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/commands/up.rs:7653-7662 | src/commands/up.rs:7982-7991 \u2014 both copies are in the same file, so extract the block into one function there 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/commands/up.rs"},"region":{"startLine":7653}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c936b22dd65d678005bd8a350ab6f04b6dd758898b310fd519e4ba27cd7296"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/local/chat/mod.rs:5688-5697 | src/local/chat/mod.rs:9660-9669 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/local/chat/mod.rs:5688\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/local/chat/mod.rs"},"region":{"startLine":5688}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5ae2e6f5e2e3a31bacfdc02a633b70314aba094d4d8443d469eab822df07a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/local/claude.rs:1377-1386 | src/local/claude.rs:1389-1398 \u2014 both copies are in the same file, so extract the block 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":"src/local/claude.rs"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"2018802628f157102dda79efb6845e3716ddefc579d6b4df56ce24d35ee21dd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/updates.rs:1845-1854 | src/updates.rs:1861-1870 \u2014 both copies are in the same file, so extract the block into one function there 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/updates.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"b093c6af1ed0d9eb4103ce25c0db8f190b05289cffb90a4b98777d0120357be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/commands/up.rs:5220-5228 | src/commands/up.rs:5241-5249 | src/commands/up.rs:5275-5283 | src/commands/up.rs:5300-5308 \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/commands/up.rs:5220\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/commands/up.rs"},"region":{"startLine":5220}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2e2acf55250117eb9d812b618617f9ae09a27470b3a9f7864640e5018eae10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/client.rs:1455-1463 | src/client.rs:1800-1808 | src/client.rs:1850-1858 \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/client.rs:1455\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/client.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8d444f2086ba8f9217c236011afd5a369e60d909acbafdd23d80f8db399574"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/commands/remote_host.rs:201-209 | src/store.rs:153-161 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/commands/remote_host.rs:201\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/commands/remote_host.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"96889f9842b16286400ad7cdc0c31039c291a50beac80c5d13bb67e4865f5456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/commands/up.rs:2356-2364 | src/commands/up.rs:2444-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up.rs"},"region":{"startLine":2356}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e699f36e18e11ae3f1979572a99d2a14c1b22c54484da8ad8e817ed75f0ecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/commands/up.rs:4032-4043 | src/commands/up.rs:5141-5152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/commands/up.rs:4032\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/commands/up.rs:4044\u0060 calls \u0060then\u0060, \u0060file_version\u0060, \u0060as_bytes\u0060 and \u0060src/commands/up.rs:5153\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/commands/up.rs"},"region":{"startLine":4032}}}],"partialFingerprints":{"codehealthFindingId/v1":"c942c99849b32493e72e25c4e07b81e7816ef077f29b7e68014d315a84cb12de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/engine/transport/mod.rs:901-909 | src/engine/transport/mod.rs:1058-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/transport/mod.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"275aa55926f02381b97d3ce41273b228bfa455c2a512df5721cec8933b72cbea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/jobs/modal.rs:366-374 | src/jobs/vercel.rs:914-922 \u2014 before extracting anything, compare \u0060src/jobs/modal.rs\u0060 and \u0060src/jobs/vercel.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 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/jobs/modal.rs:366\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/jobs/modal.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f9202f919250b5a04385945ccd1848ee66573855a84ecd42f06f458b868780"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/local/demo.rs:547-555 | src/local/demo.rs:600-608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/demo.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53b3e88329d9811556b644815461919e0b9a6e31820793fbc686c355a4174f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/local/harness/acp.rs:631-639 | src/local/harness/antigravity.rs:651-659 \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/local/harness/acp.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c15fa45c656c197ef4f9a3303a7aaef6d419084904a04db74d44f90c63e6382"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/local/harness/codex.rs:1632-1640 | src/local/harness/codex.rs:3584-3595 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/local/harness/codex.rs:3584\u0060 it does not close everything it opens, so those exact 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ctx\u0060 to \u0060\u0026CompactCtx\u0060 in one and \u0060\u0026mut TurnCtx\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/local/harness/codex.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c61c67ce224816411dd08baf8e892432ad163766fc6d51220a5c0b88256811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/local/harness/codex.rs:2344-2352 | src/local/harness/codex.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/codex.rs"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de7903e4d725a2d8769c3ac44fb7db23d63ca130147fe8abf3a6ec396bba8fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/local/latex_templates.rs:183-191 | src/local/user_skills.rs:418-426 \u2014 before extracting anything, compare \u0060src/local/latex_templates.rs\u0060 and \u0060src/local/user_skills.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 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/local/latex_templates.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/latex_templates.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3b3036aee1eb865b6ad30bcd4454ea6819dbbc5853e01e3bd971fa182a3c97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/store.rs:3030-3038 | src/store.rs:3054-3061 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/store.rs:3030\u0060 it does not close everything it opens, so those exact 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/store.rs"},"region":{"startLine":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ea299206a872d9f3c1be8d026bb2c7f9a3a8165b34debf92d02b8247a98c48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): src/commands/up.rs:2266-2272 | src/commands/up.rs:2295-2301 | src/commands/up.rs:2316-2323 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/commands/up.rs:2264\u0060 calls \u0060Json\u0060 and \u0060src/commands/up.rs:2293\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/commands/up.rs"},"region":{"startLine":2266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39411743940a8e5f5db6f566570adb3d07ee512b56ebe88338133ed939b22e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/commands/up.rs:3434-3441 | src/commands/up.rs:3464-3471 | src/commands/up.rs:3501-3508 \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/commands/up.rs:3434\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/commands/up.rs"},"region":{"startLine":3434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f10b8a0c821578d7cd932ac5b942172910236b7b5494d3add080f715335a31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/jobs/kubernetes.rs:103-110 | src/jobs/ray.rs:54-61 | src/jobs/slurm.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 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060settings\u0060 to \u0060\u0026K8sSettings\u0060 in one and \u0060\u0026RaySettings\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/jobs/kubernetes.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de4c3a4798afec1d5c722480834b7a2c805f48a8c59693f2b2b65bb67a444d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/commands/up/compute_settings.rs:854-862 | src/commands/up/compute_settings.rs:901-909 \u2014 both copies are in the same file, so extract the block into one function there 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/commands/up/compute_settings.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"437d62f8da507a64d8a27adcf5764e471bd6b3576799f19875e640e16eb84f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/engine/adapters/local.rs:399-405 | src/engine/adapters/local.rs:419-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/engine/adapters/local.rs:399\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/engine/adapters/local.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"922af602de6b98cc9831ee802427a37bb2827d7842742b65e320f42d6f0f226e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/local/chat/mod.rs:5580-5587 | src/local/chat/mod.rs:6292-6299 \u2014 both copies are in the same file, so extract the block into one function there 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/local/chat/mod.rs"},"region":{"startLine":5580}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6b1202d3cecd7654586c23d8941232a9087c65780cf83130d5e02402617af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/local/claude.rs:1096-1103 | src/local/claude.rs:1316-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/claude.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63bdc5cd038112937bfecea2e6faaa85efea03082a6d2c61981ee89382fbbe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/local/harness/codex.rs:3558-3565 | src/local/harness/codex.rs:4709-4716 \u2014 both copies are in the same file, so extract the block into one function there 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/local/harness/codex.rs"},"region":{"startLine":3558}}}],"partialFingerprints":{"codehealthFindingId/v1":"466768e2d6ca0f41e00d9906256f9fe4f84b8a2ca323e4697951870d40e44568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/local/harness/codex.rs:4858-4865 | src/local/harness/cursor.rs:768-775 \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, \u0060src/local/harness/cursor.rs:776\u0060 calls \u0060send_prompt\u0060 and \u0060src/local/harness/codex.rs:4866\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/local/harness/codex.rs"},"region":{"startLine":4858}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4ceb53edefc523e5d543fe14b67541b45e2129586586f276329b4763b4fb62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/local/latex_templates.rs:54-61 | src/local/mod.rs:84-91 \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/local/latex_templates.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"40435bf579e9c09c2a7560438e4d25f463ada5466a49044deb9ca7ac7ad810e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/local/latex_templates.rs:226-233 | src/local/user_skills.rs:440-447 \u2014 before extracting anything, compare \u0060src/local/latex_templates.rs\u0060 and \u0060src/local/user_skills.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 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/local/latex_templates.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fbc31264fd30290e86539445affc5f579649177d9cbcd9ab71c7956894474f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/orx-host/src/legacy.rs:113-119 | crates/orx-host/src/legacy.rs:125-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 \u0060crates/orx-host/src/legacy.rs:113\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/legacy.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"445512b4637cf170255b8b47326a5398f4a32d53e59df35c17ff7e27c4750850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/client.rs:1721-1727 | src/client.rs:2032-2038 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/client.rs:1721\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/client.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"e480270fa7066fd218f10fe695e6da3c3e17975bfadd485da54db0633f89f728"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/commands/up.rs:3652-3658 | src/commands/up.rs:10476-10482 \u2014 both copies are in the same file, so extract the block into one function there 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/commands/up.rs"},"region":{"startLine":3652}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a2c691fa42f71a53f6bb4484187221d654f853188799f3d52bc3d0b3b15d69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/commands/up.rs:10313-10319 | src/commands/up.rs:10476-10482 \u2014 both copies are in the same file, so extract the block into one function there 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/commands/up.rs"},"region":{"startLine":10313}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ff537460805cb5de1ae27569e9da201ac8023e8f389d4cb949fddad5fd8f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/jobs/huggingface.rs:201-207 | src/jobs/ray.rs:217-222 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/jobs/huggingface.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. 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/jobs/huggingface.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74d11fb26ceaf54a186094af265f2f99bd63a4ce665232df0548a158eddc5d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/jobs/kubernetes.rs:135-141 | src/jobs/vercel.rs:892-898 \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/jobs/kubernetes.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":"src/jobs/kubernetes.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d011489168e57a23ba900d02502d1a018592cf2d75d77de2bb2b6d96140d19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/jobs/managed_env.rs:269-275 | src/telemetry.rs:494-500 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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/jobs/managed_env.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee36cf5547831c59fa1eb63c43bb1c34bbc311870c2c80bd2186addec8b1024"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/local/chat/mod.rs:6942-6948 | src/local/chat/mod.rs:9779-9785 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/local/chat/mod.rs:6942\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/local/chat/mod.rs:9786\u0060 calls \u0060Some\u0060, \u0060clone\u0060 and \u0060src/local/chat/mod.rs:6949\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/local/chat/mod.rs"},"region":{"startLine":6942}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc637ee28594395cb0af12a8afd7031eafcd000513c927d40efc485bc9ec1ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/local/harness/acp/auth.rs:122-128 | src/local/harness/acp/auth.rs:147-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/acp/auth.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3981600adcf32e5b61c41362b229ac61a129d805b7ccae98411b2c1f381f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/local/native_store.rs:635-642 | src/local/native_store.rs:685-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/local/native_store.rs:635\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/local/native_store.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b9b8b4188bdf88370a6d888f2aaa594b7f511285f39f77ff5b7489afdf39e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/commands/up.rs:3702-3707 | src/commands/up.rs:7680-7685 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/commands/up.rs:3702\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/commands/up.rs"},"region":{"startLine":3702}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39d772611b92423cbe7e09a202d0216a1b704f291430900b4651e5be6b1453d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/commands/up.rs:4304-4311 | src/commands/up.rs:4907-4912 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/commands/up.rs:4304\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/commands/up.rs"},"region":{"startLine":4304}}}],"partialFingerprints":{"codehealthFindingId/v1":"383b44e0c0ebc2334c90d76f4cad8faf224c00a7153aafdd2a7fd5558ee4943f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/compute.rs:817-822 | src/local/k8s.rs:50-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":"src/compute.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df54449b944e94a0c421e63b76aa77aa8ce41df6b1793cf58770c33a9fdc9f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/local/codex.rs:884-889 | src/local/harness/codex.rs:4718-4723 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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/local/codex.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"625d2154ff8b34596c6a4709fd52c678f9cbff8de4895cb6d180ae93a4d8b98c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/local/harness/cursor.rs:454-459 | src/local/harness/cursor.rs:528-533 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/local/harness/cursor.rs:454\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/local/harness/cursor.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1eae552fe046e08bb6ec306e43a1e7462f7d62821922fc591f861f20ac8c73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/store.rs:2580-2595 | src/store.rs:3457-3462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/store.rs:2580\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/store.rs"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5e7ea06bab993b8d0d7018b3fb207e8bebc04dd56c605299d2dcac5c37956c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/store.rs:4705-4710 | src/store.rs:4727-4732 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/store.rs:4705\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/store.rs"},"region":{"startLine":4705}}}],"partialFingerprints":{"codehealthFindingId/v1":"27db557443ecf1ab60d4a73392457b5aab262a81ff4d1d6fb2ce57c80a332fe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/store.rs:5012-5017 | src/store.rs:5062-5067 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/store.rs:5012\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/store.rs"},"region":{"startLine":5012}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d9864a3e04ba50df58867769595878686d90a62f9f7e9737120ba79968ca44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/commands/up.rs:4256-4260 | src/commands/up.rs:4296-4300 \u2014 both copies are in the same file, so extract the block into one function there 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/commands/up.rs"},"region":{"startLine":4256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b1f22be874772b81e32a8e73cad7f153e4b2fb1278c404fdd45f730170005b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/commands/up.rs:5023-5030 | src/commands/up.rs:5190-5194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/commands/up.rs:5023\u0060 it does not close everything it opens, so those exact 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/commands/up.rs:5020\u0060 calls \u0060starts_with\u0060, \u0060Err\u0060, \u0060bad_request\u0060 and \u0060src/commands/up.rs:5189\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/commands/up.rs"},"region":{"startLine":5023}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b809423a7052d749d58e504c33bfe8112b9814e163bbd63e402b83c22b4c01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/local/agent_profiles.rs:500-504 | src/local/harness/antigravity.rs:764-768 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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/local/agent_profiles.rs:500\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/local/agent_profiles.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8051ab302ce7d2c27a6d307a8d1b570596b954e7f28138a228d8f00116c197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/local/browser_cookies.rs:357-361 | src/store.rs:6189-6193 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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/local/browser_cookies.rs:357\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/browser_cookies.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefb42a38c441667894393038354aa15a7726ff165c20639477330a39d7e8731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/local/harness/codex.rs:1627-1631 | src/local/harness/codex.rs:3570-3574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/local/harness/codex.rs:1627\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ctx\u0060 to \u0060\u0026CompactCtx\u0060 in one and \u0060\u0026mut TurnCtx\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/local/harness/codex.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b06e745a4ca9b8f7dffc7e6c1de1315d152cecf8f31b7e3194ec6393fd7115f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/local/harness/codex.rs:4365-4369 | src/local/harness/codex.rs:4417-4421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/local/harness/codex.rs:4365\u0060 it does not close everything it opens, so those exact 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/local/harness/codex.rs:4372\u0060 calls \u0060now_ms\u0060, \u0060as_millis\u0060 and \u0060src/local/harness/codex.rs:4424\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/local/harness/codex.rs"},"region":{"startLine":4365}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb29fed5d4974d5faec0c9be5c18187e25eb3013ac4227b30e0d07458547b1a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/commands/remote_host.rs:165-170 | src/store.rs:118-123 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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/commands/remote_host.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e193b7e66fec342d8f1315b925520bb6d02dc1b7528568c2e78863e7ec55c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/jobs/localbox/windows.rs:25-31 | src/local/codex.rs:1231-1237 \u2014 before extracting anything, compare \u0060src/jobs/localbox/windows.rs\u0060 and \u0060src/local/codex.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/local/codex.rs:1229\u0060 calls \u0060pub\u0060 and \u0060src/jobs/localbox/windows.rs:23\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/jobs/localbox/windows.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e6f5733216e4db4a068c5f1badab1c3ccd46714eb7ef2277c7123cb2d8254d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/local/harness/claude.rs:1346-1351 | src/local/harness/cursor.rs:184-189 | src/local/harness/opencode.rs:202-207 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/claude.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"7987cfa9b04120f9ab67804511941b07bc6a65d1a6ec22f218ff73c653bb1843"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/local/browser_cookies.rs:68-73 | src/store.rs:6367-6372 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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/local/browser_cookies.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1436800a0478959ea7defa1e1b2c74c8e18e7598dc13d44fd57e87c3c0cea58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/local/chat/mod.rs:601-610 | src/local/harness/codex.rs:2598-2607 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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/local/chat/mod.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a71a20c8296db42751d371299f3cff6aa4fc2617930b8b31fca87faaa87ba53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/store.rs:2558-2572 | src/store.rs:2684-2689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/store.rs:2558\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/store.rs"},"region":{"startLine":2558}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b7748cb1a5b3504dcacfe8e928cd8d4d6f3c455a1ece2d565edf53c2b2a5b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/local/harness/managed.rs:596-604 | src/local/portable_git.rs:107-119 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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/local/harness/managed.rs:596\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/local/harness/managed.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1d1ba8d7abd4fc9ca17cb1467286508b8f08501119db57fd6adc345db729ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/commands/remote_host.rs:353-364 | src/commands/remote_host.rs:402-413 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/commands/remote_host.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/remote_host.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33901999f65522aefcd1cb7300db7fa062e563895a3536c2124f1c71bd4b994"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/client.rs:1074-1085 | src/client.rs:1355-1366 | src/client.rs:1968-1979 \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/client.rs:1074\u0060 it begins part-way through the construct above it, so those exact 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/client.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"96183308b3327e2dad94bce2f4567023ba880fb9a1a4cc4c8adc1bbe60bc167c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/local/harness/claude.rs:2883-2893 | src/local/harness/codex.rs:3464-3475 \u2014 before extracting anything, compare \u0060src/local/harness/claude.rs\u0060 and \u0060src/local/harness/codex.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/local/harness/claude.rs:2883\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/local/harness/claude.rs"},"region":{"startLine":2883}}}],"partialFingerprints":{"codehealthFindingId/v1":"d664b4c51f15f4aa2fdb4c33ffdfa67a7a0a69450706bd72c58932da705e1e52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/store.rs:703-713 | src/store.rs:6184-6191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/store.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/store.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0397d373b00d932742eaa3a0cad8d07d1021e72f65cd069d57be22bcdef7f91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/client.rs:1420-1430 | src/client.rs:1749-1759 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/client.rs:1420\u0060 it begins part-way through the construct above it, so those exact 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/client.rs"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a485e3a6963ee71c17cad21b738500133d5a5205f6b5956e856440bf764d8b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main.rs:1358-1368 | windows/launcher/src/main.rs:62-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 \u0060src/main.rs:1358\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/main.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2f30c9e0ae5be3c84368393ad89996f01ab1eea978854a656276ed381a3c34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/local/chat/mod.rs:2516-2525 | src/local/chat/mod.rs:4168-4177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/local/chat/mod.rs:2516\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/local/chat/mod.rs"},"region":{"startLine":2516}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7fcf8a8f739a10f928ea1cf6111edde82b79e8cac9866eadb4242b512e5abb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/local/modal.rs:49-57 | src/local/vercel.rs:40-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/local/modal.rs:49\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/local/modal.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6ac6e2ac5fdd3802ec1113a0f6c6255d2ec7ef81253f7f25868020780c74b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/commands/remote_host.rs:1080-1088 | src/local/storage.rs:54-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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/commands/remote_host.rs:1080\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/commands/remote_host.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8b9c588d08e6c710ff004f113049bfa7bd741f86099da42861cbe7348aad8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/local/demo.rs:1714-1722 | src/local/git.rs:328-336 \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/local/demo.rs:1714\u0060 it begins part-way through the construct above it, so those exact 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/local/demo.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"1062b41dbf303eb80bda700197185f404fecc1564d4f79912274c5321cb2803b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/local/harness/codex.rs:4355-4362 | src/local/harness/codex.rs:4407-4414 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/local/harness/codex.rs:4355\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/local/harness/codex.rs"},"region":{"startLine":4355}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c1127e0b43dbe58ce222cea129927fcf13bff5f922ac8e83665b814cf22cef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/local/claude.rs:507-514 | src/local/codex.rs:399-406 \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/local/claude.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f03dced54a5c97059f69956700ea4140f98a929ed5e0b786e75afa8cc704a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/commands/up.rs:4008-4015 | src/commands/up.rs:4321-4328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/commands/up.rs:4008\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/commands/up.rs"},"region":{"startLine":4008}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e86ba2aa7cd3d3755f5896836a21f7bc198221d24b23e14c6d311e9edce5bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/local/harness/claude.rs:2867-2874 | src/local/harness/codex.rs:3443-3450 \u2014 before extracting anything, compare \u0060src/local/harness/claude.rs\u0060 and \u0060src/local/harness/codex.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/local/harness/claude.rs:2867\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/local/harness/claude.rs"},"region":{"startLine":2867}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49ca6a2abc4bec1e85868c4613ad3e90fb809920ebf55dda7b57f40899b57da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): src/jobs/mod.rs:164-172 | src/jobs/mod.rs:178-186 | src/jobs/mod.rs:192-200 | src/jobs/mod.rs:205-213 | src/jobs/mod.rs:219-227 \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 \u0060src/jobs/mod.rs:164\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/jobs/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e3f454f20b71f6c17c335f2c461521089e6d69b5f52901dbcead81680a2b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/store.rs:2171-2176 | src/store.rs:5967-5973 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/store.rs:2171\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/store.rs"},"region":{"startLine":2171}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e95465638f4a98bc1232a84d15fca06eb87b3c80d2e321517e078996ef9bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/local/git.rs:2379-2385 | src/local/git.rs:2390-2396 \u2014 both copies are in the same file, so extract the block into one function there 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/local/git.rs"},"region":{"startLine":2379}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63cf106a922330e5c9b4365d2941a1daa57ec26bfa6dea3ac8bad83f2e178d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/orx-host/src/wrapper.rs:563-568 | crates/orx-host/src/wrapper.rs:571-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. 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/orx-host/src/wrapper.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef37d635974a4358e3d29505ad3da89bb0061ce62c927de1366bdd5bec177bd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/store.rs:2059-2064 | src/store.rs:2067-2072 \u2014 both copies are in the same file, so extract the block 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":"src/store.rs"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c5967df262b957d51c1f4fcc883e4d5a08ccbca7062f7249bbaf5ffbe8f44a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/store.rs:2076-2080 | src/store.rs:2084-2088 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/store.rs:2076\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/store.rs"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf44623e664859917cb6b130037138da63250011a56e82099f74774a6046b189"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/commands/up.rs:4397-4401 | src/commands/up.rs:4914-4918 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/commands/up.rs:4397\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/commands/up.rs"},"region":{"startLine":4397}}}],"partialFingerprints":{"codehealthFindingId/v1":"1989497a840285a94c081d315c3b486b8aead9f4401c80e49fdc43a6f6d8daa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/commands/up.rs:3749-3753 | src/commands/up.rs:4989-4993 \u2014 both copies are in the same file, so extract the block into one function there 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/commands/up.rs"},"region":{"startLine":3749}}}],"partialFingerprints":{"codehealthFindingId/v1":"874c506065c1c4adfe408c63d52b35a46effe0d8c8805b440737f5829102b93e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/local/demo.rs:347-352 | src/local/demo.rs:1551-1556 \u2014 both copies are in the same file, so extract the block into one function there 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/local/demo.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ebd76b2ce2a429156841254ce8f6465c5158ee48af8c33cb4681b2fbd4479b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/local/harness/acp/auth.rs:133-139 | src/local/harness/acp/auth.rs:160-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/local/harness/acp/auth.rs:133\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/local/harness/acp/auth.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"556657d69dc7b054b817106c66f6763ede4e0d12c84cc8cc5887723a4e161032"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/local/harness/claude.rs:431-437 | src/local/harness/codex.rs:382-388 \u2014 before extracting anything, compare \u0060src/local/harness/claude.rs\u0060 and \u0060src/local/harness/codex.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/claude.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f99b5b5453157f58ac8991476f1564c612932dbe203767cc49d2d500d1f56a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/local/native_chats.rs:318-323 | src/local/native_chats.rs:340-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":"src/local/native_chats.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"878fc55f3ec5b62c848534b10378bc0348d1b30b3bc83e454fd986669fe7159a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/store.rs:2796-2800 | src/store/telemetry.rs:552-556 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/store.rs"},"region":{"startLine":2796}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74ecbb1832ba6c34c326efc7515206e39fd455ecb488fd0c320bc158d6e25b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/store.rs:5538-5542 | src/store/telemetry.rs:759-763 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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/store.rs:5538\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/store.rs"},"region":{"startLine":5538}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d537cfea1b090eb765945f4f0bec52c3f82dfc150561b696501144fd402e900"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (118 corresponding lines): demo/nanochat/base/scripts/chat_sft.py:181-298 | demo/nanochat/experiment/scripts/chat_sft.py:181-303 \u2014 These two members are one piece of code written twice and then edited apart: 118 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo/nanochat/experiment/scripts/chat_sft.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b8661854f422ed391efbd20adf2cddc61b0a2d56553b8701e4246682286783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2): demo/nanochat/base/scripts/chat_sft.py:209-261 | demo/nanochat/experiment/scripts/chat_sft.py:210-262 \u2014 before extracting anything, compare \u0060demo/nanochat/base/scripts/chat_sft.py\u0060 and \u0060demo/nanochat/experiment/scripts/chat_sft.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 123 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060demo/nanochat/experiment/scripts/chat_sft.py:264\u0060 calls \u0060any\u0060, \u0060print0\u0060 and \u0060demo/nanochat/base/scripts/chat_sft.py:264\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":"demo/nanochat/experiment/scripts/chat_sft.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"701e3bad27370ec138e7cba4686c6e72dd8f4bddb691828ff2c1d01f30ee5dcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): demo/nanochat/base/scripts/chat_sft.py:181-208 | demo/nanochat/experiment/scripts/chat_sft.py:181-208 \u2014 before extracting anything, compare \u0060demo/nanochat/base/scripts/chat_sft.py\u0060 and \u0060demo/nanochat/experiment/scripts/chat_sft.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 123 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":"demo/nanochat/experiment/scripts/chat_sft.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0520eaa0a0fa55c504507561edc61132f715b7d6913195004023f752dcb6b957"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): demo/nanochat/base/scripts/chat_sft.py:264-298 | demo/nanochat/experiment/scripts/chat_sft.py:269-303 \u2014 before extracting anything, compare \u0060demo/nanochat/base/scripts/chat_sft.py\u0060 and \u0060demo/nanochat/experiment/scripts/chat_sft.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060demo/nanochat/experiment/scripts/chat_sft.py:264\u0060 calls \u0060any\u0060, \u0060print0\u0060 and \u0060demo/nanochat/base/scripts/chat_sft.py:261\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":"demo/nanochat/experiment/scripts/chat_sft.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c375984da157f6c65e7baef330647fbca8c97aa6f468eb4dd94cfb03f12056f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): demo/nanochat/base/scripts/chat_sft.py:308-314 | demo/nanochat/experiment/scripts/chat_sft.py:313-319 \u2014 before extracting anything, compare \u0060demo/nanochat/base/scripts/chat_sft.py\u0060 and \u0060demo/nanochat/experiment/scripts/chat_sft.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 123 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":"demo/nanochat/experiment/scripts/chat_sft.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a871718de3f05551bb65ac3e4e9afde706213cb12b357de436aec3c91a0a60"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: orx-host-proto: orx-host-proto: 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":"bcb900df848dd28b9763dced00a35609067e235a15a176046f0de51d57a59905"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ApiClient (LCOM4 4): ApiClient\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plane/local_plane.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a37aa5a4268335e99c47871b7f510ba1d58ee27ee14aa8d80a3afb84984b24c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: aggregate accepts intentional skips and successful selected jobs: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci-changes.test.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"942a9cbe9a67f644f46a6f2ad91e823de62fafbbc04d580eb991bca7be9f843f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/ChatPanel.tsx: ui/src/components/ChatPanel.tsx changed 122 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 985 in ChatPanel.ChatPanel at line 5485. 29 of those changes were fix/bug commits, and the other 93 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/ChatPanel.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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":5485}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3520e1bc394d0bf692c8ba15df3ea78fc8a1a3892465783967325d447b7c424"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/App.tsx: ui/src/App.tsx changed 75 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 631 in App.App at line 254. 12 of those changes were fix/bug commits, and the other 63 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/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":"ui/src/App.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb090fca1da7446090c92d610bf0ff146957d16749f15a0c0607f4d00e6b6fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/SettingsPage.tsx: ui/src/components/SettingsPage.tsx changed 77 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 189 in SettingsPage.AgentList at line 419. 15 of those changes were fix/bug commits, and the other 62 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/SettingsPage.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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e966f3a020730742d706a1eef6201b8891b3e0cf5d73eba98c3df00f7808108"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/up.rs: src/commands/up.rs changed 180 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in openresearch_cli::commands::up::run at line 62. 36 of those changes were fix/bug commits, and the other 144 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/commands/up.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/commands/up.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fe5c437a3b6d0e2536c29f50f42b09c6be925b5b8f0d165fd15e92f7fcd590"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/chat/mod.rs: src/local/chat/mod.rs changed 84 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in ChatHost::send_message_showing at line 5988. 21 of those changes were fix/bug commits, and the other 63 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/chat/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":5988}}}],"partialFingerprints":{"codehealthFindingId/v1":"193f2a601e0dc08f6b7f6ffe093bf284ebe01beaf2ea9172fc2e4647f57528e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/ModelPicker.tsx: ui/src/components/ModelPicker.tsx changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 171 in ModelPicker.ModelPicker at line 300. 4 of those changes were fix/bug commits, and the other 35 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/ModelPicker.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":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"591748e6d0974787a83d4f252efe0445694d9f64bd8945fc2d7336bfab7c0b1a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/FileViewer.tsx: ui/src/components/FileViewer.tsx changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 248 in FileViewer.FileViewer at line 142. 4 of those changes were fix/bug commits, and the other 22 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/FileViewer.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":"ui/src/components/FileViewer.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1002b9c1ccb34bbca9b292e3eec96a34f376dd2dd6d6deb82990ff318316134"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/app.rs: src/commands/app.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in openresearch_cli::commands::app::imp::run_event_loop at line 1026. 13 of those changes were fix/bug commits, and the other 29 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/commands/app.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/app.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc1d44393871430345c6e057023cfc0b27ce40b96507f20e8c53bf846313c7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/NewProjectForm.tsx: ui/src/components/NewProjectForm.tsx changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 232 in NewProjectForm.NewProjectForm at line 63. 1 of those changes was a fix/bug commit, and the other 18 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/NewProjectForm.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":"ui/src/components/NewProjectForm.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65d71b82a21977762ae6615eeb456e2d80d303490a091bd2a0b6cbf53c2118c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/api.ts: ui/src/api.ts changed 136 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in api.createApi.json at line 2048. 26 of those changes were fix/bug commits, and the other 110 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/api.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":"ui/src/api.ts"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b41918d2925cd1d2da1b673d9b78b480332796542be036acdd6e033f4fc54d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/harness/claude.rs: src/local/harness/claude.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in openresearch_cli::local::harness::claude::apply_event at line 2169. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/harness/claude.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/claude.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48ee2be5f887230536a9a0d031779c81545168152621a32887e398af2a7def9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/Onboarding.tsx: ui/src/components/Onboarding.tsx changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 109 in Onboarding.Onboarding at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/Onboarding.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":"ui/src/components/Onboarding.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8708e1959f5439d00533c16f9aa9cfc60acf09f090b84faa72d53050061c423"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/harness/codex.rs: src/local/harness/codex.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in openresearch_cli::local::harness::codex::run_turn_app_server at line 3545. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/harness/codex.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/local/harness/codex.rs"},"region":{"startLine":3545}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e33cab964505678f3b469d2cc774215032a22c53115d41c69e15feeb8ac03ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main.rs: src/main.rs changed 62 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in openresearch_cli::dispatch at line 1494. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- 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":"src/main.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f4bd697ce412d5d6af59543f06e4a0481b7a56e4bd52631de4c8462fa4ed51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/store.rs: src/store.rs changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Store::cleanup_run_artifacts_locked at line 2844. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- 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":"src/store.rs"},"region":{"startLine":2844}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4fe5bf3e08b426e4fc247caafe081415f88f2dc95a10354d67c03d6de3d963"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/compute.rs: src/compute.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in openresearch_cli::compute::validate_run_args at line 652. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/compute.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/compute.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"de90b6360197feaed6c58de2f74bff71a6cf8ae0dddaa9726bf21ef97c0d4d92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/AddAgentDialog.tsx: ui/src/components/AddAgentDialog.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 297 in AddAgentDialog.AddAgentDialog at line 270. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/AddAgentDialog.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":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"251bbfa491d32b947eb08c40aefe8d8b524e1e263ad9f34a9a0f0f10d782c2ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/harness/opencode.rs: src/local/harness/opencode.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in openresearch_cli::local::harness::opencode::found_providers at line 453. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/harness/opencode.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/local/harness/opencode.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd077a146f6f78296b89a7eea7600e3953c20479e2be0dea4f03a92ecae703a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/HarnessSetupDialog.tsx: ui/src/components/HarnessSetupDialog.tsx changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in HarnessSetupDialog.HarnessSetup at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/HarnessSetupDialog.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":"ui/src/components/HarnessSetupDialog.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fc6ff07aee7c74c20cd21bfa83e0cf3d5d0c7047d07586cd50fa5431b195e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/up_remote.rs: src/commands/up_remote.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in openresearch_cli::commands::up_remote::connect_once 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/commands/up_remote.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up_remote.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8413581c84219fed88e56e299961953f18bbb1fa08276b2fda8ba7c71bce2fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/up/harness_setup.rs: src/commands/up/harness_setup.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in openresearch_cli::commands::up::harness_setup::run 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/commands/up/harness_setup.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/harness_setup.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95feab0b1f8aa6b421b798230297339f118db5b35983f0d22afe06d747f92b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/RemoteRuntime.tsx: ui/src/RemoteRuntime.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in RemoteRuntime.RemoteSetup at line 159. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/RemoteRuntime.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":"ui/src/RemoteRuntime.tsx"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"536103ad6409b23ae9c628b9fdc99f56c428342470a4add41569e896dfcbe4a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/compute.rs: src/commands/compute.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in ConfigureArgs::body at line 338. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/commands/compute.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/commands/compute.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"599e49bbf12b51d930522e383f27a5eeb09876b8dbe72946fb30049b241b41d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/claude.rs: src/local/claude.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in ClaudeHost::acquire_turn at line 1310. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/claude.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/claude.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"722f2283e02944051c56300148368a0e68ab4e675be7dd3c17e38584b5c18957"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/engine/transport/mod.rs: src/engine/transport/mod.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in Actor::run at line 768. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/engine/transport/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/transport/mod.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcdacff04e3f42accb2c78a0271dad882b91f3889e0d548eafd92a8e88ea262"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/ArtifactsTab.tsx: ui/src/components/ArtifactsTab.tsx changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in ArtifactsTab.ArtifactsTab at line 508. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/ArtifactsTab.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":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7e1d12f5fd8c90206d15456932a94bb8ddce900a39fe3d4be52381ef273279"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/Md.tsx: ui/src/components/Md.tsx changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Md.Md at line 457. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/Md.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":"ui/src/components/Md.tsx"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"0147db3ecad3380a3917e9cca858ee11d0dfd01a431ba045cefb59d28d37bbf0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/plane/local_plane.rs: src/plane/local_plane.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in LocalPlane::experiment_status at line 135. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/plane/local_plane.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/plane/local_plane.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7910010651b3c461c04a7093a425d3a5eedc3073002eda1db22ec87e935bd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/ExpHoverCard.tsx: ui/src/components/ExpHoverCard.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in ExpHoverCard.ExpHoverCard 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/ExpHoverCard.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":"ui/src/components/ExpHoverCard.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ec4ebaac04154e33a0e1a0db3fbf647cdb985333ed8872015c0b7bbc7b133c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/acp/host.rs: src/local/acp/host.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in openresearch_cli::local::acp::host::spawn at line 645. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/acp/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/local/acp/host.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae930f943f80ac22f79a414285f169555641b9faabc49f3709ad98eb747edf8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/WorkspaceTools.tsx: ui/src/components/WorkspaceTools.tsx changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in WorkspaceTools.SideChatPicker at line 146. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/WorkspaceTools.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":"ui/src/components/WorkspaceTools.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e769c715cb250becbf6aefeba3669a8e13e72d5b7fb7ce2443747d3dd5d4cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/harness/cursor.rs: src/local/harness/cursor.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in openresearch_cli::local::harness::cursor::run_turn at line 682. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/harness/cursor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/local/harness/cursor.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"768b9269415e9b5be749d2e066ddd45efa3a4654627ccc39766741aeaaf1412c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/chatRendering.ts: ui/src/chatRendering.ts changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in chatRendering.questionReplies at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/chatRendering.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":"ui/src/chatRendering.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2a3f3ffb8f777f2d1998761d4f3a0314029dae8585191b3b7c5b4b6f4c47bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/WorktreeTab.tsx: ui/src/components/WorktreeTab.tsx changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in WorktreeTab.WorktreeTab at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/WorktreeTab.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":"ui/src/components/WorktreeTab.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e57bd9b9bed2fcc29b46c6902f3aad0cf7e522ba3baeb5eeaaae76403c2efc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/events.ts: ui/src/events.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in events.createEvents.useOrxEventStream at line 282. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/events.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":"ui/src/events.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"121f0a81516ca18255ee6f879ea1a9779472003345cf127d30f128c85818180a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/DetailDrawer.tsx: ui/src/components/DetailDrawer.tsx changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in DetailDrawer.TerminalView at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/DetailDrawer.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":"ui/src/components/DetailDrawer.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb729744d5d84fd5ae92c51ac51ba08bab6dcd39cbc758041982a5a6f2de275e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/queries/invalidation.ts: ui/src/queries/invalidation.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in invalidation.createInvalidation.invalidateWrite 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/queries/invalidation.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":"ui/src/queries/invalidation.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd340a5999b5d6a357bc2b129e036581660f4d9a85ee78793a227c92440c7095"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/up/compute_settings.rs: src/commands/up/compute_settings.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in openresearch_cli::commands::up::compute_settings::check at line 1981. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/commands/up/compute_settings.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/compute_settings.rs"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"0972271c85a11283ed85665db731a06f163d4c948e34bf6503e9ab10b9b3013c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/TreeView.tsx: ui/src/components/TreeView.tsx changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in TreeView.TreeView at line 449. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/TreeView.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":"ui/src/components/TreeView.tsx"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bfadf5d8fde185d2c953e800fa1b76b2fc53304cedab131170b7c2c58c3425"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/WorkspaceConnection.tsx: ui/src/components/WorkspaceConnection.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in WorkspaceConnection.WorkspaceConnection at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/WorkspaceConnection.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":"ui/src/components/WorkspaceConnection.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3bb1ca82f5efce0ddbafaf7afb7f70074cf254f9727fad94d64ec4c423b6e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/Header.tsx: ui/src/components/Header.tsx changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Header.Brand at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/Header.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":"ui/src/components/Header.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a29b65b6083924a91c154fe87ad5ed6a238f086db9a55ea5a05968d8366126"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/SshConnectTerminal.tsx: ui/src/components/SshConnectTerminal.tsx changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in SshConnectTerminal.CommandTerminal 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/SshConnectTerminal.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":"ui/src/components/SshConnectTerminal.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6645d8331a3d0ef4036e74a1d6915a433c9959ae585cfbad00b36f472ba9a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/workspaceState.ts: ui/src/workspaceState.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in workspaceState.parsePane at line 54. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/workspaceState.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":"ui/src/workspaceState.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbcffe73420aed817c79fd05b9713cd6b35fc032d08c7fa0198e7051dd09082"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/jobs/kubernetes.rs: src/jobs/kubernetes.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in openresearch_cli::jobs::kubernetes::prepare_docs at line 630. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/jobs/kubernetes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/jobs/kubernetes.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc241fd47c28792c33045bc4c0ec89f7a20c735cd249338b581b7258ece92e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/AcpAuthDialog.tsx: ui/src/components/AcpAuthDialog.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in AcpAuthDialog.AcpAuth at line 32. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/AcpAuthDialog.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":"ui/src/components/AcpAuthDialog.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ff8755800842bce6d8ba25f15fa18fae328dcfc83685b05f6ffb0c11b4294c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/ExperimentsTable.tsx: ui/src/components/ExperimentsTable.tsx changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ExperimentsTable.ExperimentsTable 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/ExperimentsTable.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":"ui/src/components/ExperimentsTable.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6715f7313585318f3f35bf0be0ccd1215406295193ed0f365ff6dc84ead7dd25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/harness/opencode_v2.rs: src/local/harness/opencode_v2.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in openresearch_cli::local::harness::opencode_v2::prompts 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/harness/opencode_v2.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/local/harness/opencode_v2.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6004ddd653cf9cefc1ce9e6b168092c2704fcdedb44c3a2ef3e8f27baa58a02"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/harness/antigravity.rs: src/local/harness/antigravity.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in openresearch_cli::local::harness::antigravity::normalize_tool at line 824. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/harness/antigravity.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/local/harness/antigravity.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"556a6acf4ff9caad002f5a83558a5438e83f055744c405eb34f8efed87a50573"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/AcpHarnessDialog.tsx: ui/src/components/AcpHarnessDialog.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in AcpHarnessDialog.AcpHarnessDialog at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/AcpHarnessDialog.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":"ui/src/components/AcpHarnessDialog.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aece6a4f927794ba82777185bd144c9e3736eb686157efb7db1346d49eb2421"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/queries/Events.tsx: ui/src/queries/Events.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in Events.QueryEvents 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/queries/Events.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":"ui/src/queries/Events.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"04367056f948d716bbd89dbe167579b269cc5fc54a7c919761666fe464a48721"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/harness/acp.rs: src/local/harness/acp.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in openresearch_cli::local::harness::acp::apply_event 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/harness/acp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/local/harness/acp.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1325bba153eafff4b26967d853f12edd6a1ed128c4f87dde5acb5ef36c235fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/ExperimentOverview.tsx: ui/src/components/ExperimentOverview.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ExperimentOverview.ExperimentOverview at line 58. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/ExperimentOverview.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":"ui/src/components/ExperimentOverview.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e66e72f5c691e311567b4ab97a33bfbb33fc7d1ee068388167273cf7ac61cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/engine/adapters/openresearch.rs: src/engine/adapters/openresearch.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in OpenResearch::inspect at line 330. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/engine/adapters/openresearch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/adapters/openresearch.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a84ce34b126be2fcecf24011acfe20b0d658c00e824095cba7cb8ee42b9465"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/native_store.rs: src/local/native_store.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in openresearch_cli::local::native_store::reconcile_link at line 885. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/native_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":"src/local/native_store.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"6427d2470cce4cae3161cc15498c60b42997af7a497b4f29be014814e84975db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/codex.rs: src/local/codex.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in openresearch_cli::local::codex::read_loop at line 567. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/codex.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/local/codex.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c58fc59ecf5d651790dfc23472fa7c5e34b4b8bbc1f2975c43b4d3c1eb9174"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/useOverleafSync.ts: ui/src/useOverleafSync.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in useOverleafSync.useOverleafSync at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/useOverleafSync.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":"ui/src/useOverleafSync.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcb1af7e59629717a9b82df87dd440ec18fc015a57137ebccb4a9b2be591055"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/UpdateBanner.tsx: ui/src/components/UpdateBanner.tsx changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in UpdateBanner.useRestartApp.restart at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/UpdateBanner.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":"ui/src/components/UpdateBanner.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d912ec9950f5b009a07680a865a583ec4d82f4d6487fadf1ddfe918243a08be7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/git.rs: src/local/git.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in openresearch_cli::local::git::initialize at line 807. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/git.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/git.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"9941c30cd36fabb363b5645215b88570d947a84d2cc79c3a6510a4eeeedf4a95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/OverleafPanel.tsx: ui/src/components/OverleafPanel.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in OverleafPanel.OverleafPanel at line 239. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/OverleafPanel.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":"ui/src/components/OverleafPanel.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef053e0e8709a60f342694b7121a7aca2a18826cc6e94c5e6c3b64140d0d7050"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/AccountChip.tsx: ui/src/components/AccountChip.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in AccountChip.AccountChip 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/AccountChip.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":"ui/src/components/AccountChip.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bf58f96a54c84ac75d920e4de5098182ddd4c273d8bfff8f6304674e92f1f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/engine/runtime.rs: src/engine/runtime.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Runtime::tick at line 432. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/engine/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":"src/engine/runtime.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"34de983b348fd9455ad5a563696e12cd2b89aec618b4e32940d82015a652bf5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/slurm.rs: src/local/slurm.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in openresearch_cli::local::slurm::directives at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/slurm.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/local/slurm.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33135d51a0a07df7f68240740089a083caaab563e1e095f1a062a056a8c8cc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/ComposerEditor.tsx: ui/src/components/ComposerEditor.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in ComposerEditor.ComposerEditor at line 346. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/ComposerEditor.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":"ui/src/components/ComposerEditor.tsx"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b7c2ff8dffb57f0b7fa594af0dd6545a6c3f2e522456a189ce9db4bad62ee6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/orx-host/src/server.rs: crates/orx-host/src/server.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in Host::request at line 107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- crates/orx-host/src/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/orx-host/src/server.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8edae96b8751693a375dda6088bfafc8215f8c1ec9fb06d05df38d17f833d2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/jobs/huggingface.rs: src/jobs/huggingface.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in openresearch_cli::jobs::huggingface::stream_once at line 634. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/jobs/huggingface.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/jobs/huggingface.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adae6898c2f1db1a1cdb80a089fab36a01bf0ef65387ad2b2563362de3be48d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/SkillsTab.tsx: ui/src/components/SkillsTab.tsx changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SkillsTab.SkillsCard at line 341. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/SkillsTab.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":"ui/src/components/SkillsTab.tsx"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc0e903f3f028cca35cd95aa602614116cd93d069267445fdd018573cdea9ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/routePages.tsx: ui/src/routePages.tsx changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in routePages.ProjectsPage at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/routePages.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":"ui/src/routePages.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a078217918494a7a4d24ea628bed33ddeba1a80510b5ba2f66a97e4811af30c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/orxCommand.ts: ui/src/orxCommand.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in orxCommand.shellWords 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/orxCommand.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":"ui/src/orxCommand.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff77ebecaa2b5a08d708dddc048c73afb6a9669f98fd4409d83a9e4409faa476"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/ModelList.tsx: ui/src/components/ModelList.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in ModelList.ModelList at line 126. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/ModelList.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":"ui/src/components/ModelList.tsx"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0977d7db982046aa452d895f0937d1a17e87d243b095bcd4c5c21f86142e5159"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/user_skills.rs: src/local/user_skills.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in openresearch_cli::local::user_skills::instructions_selected_in at line 1091. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/user_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/local/user_skills.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1f5261b34640d9f7cc8eb9d8af0e7e39cf114856c5a807b72e10f0bc81c33d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/storage.rs: src/local/storage.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in openresearch_cli::local::storage::scan at line 283. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/storage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/local/storage.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5c21619481acaab4bd928db0db878419bcc95b4b8aca7508468103dc0e1f7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/orx-host/src/wrapper.rs: crates/orx-host/src/wrapper.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in orx_host::wrapper::wrap at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- crates/orx-host/src/wrapper.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/wrapper.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5658a7ef849a4903b8bde382542612a86519344c1a17ec336bc1f347a734e29c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/mcp.rs: src/commands/mcp.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in openresearch_cli::commands::mcp::run 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/commands/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/commands/mcp.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a4fd39bd5c8bdba8c9220e44fcfa908fd2612c885e13aefb83bc42ac241681"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/LogTerminal.tsx: ui/src/components/LogTerminal.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in LogTerminal.LogTerminal at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/LogTerminal.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":"ui/src/components/LogTerminal.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19d2fc2af201b8569e603793224c59bcc3504c1f80e0d4ba7d69ac0bbe02c12"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/update.rs: src/commands/update.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in openresearch_cli::commands::update::apply 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/commands/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":"src/commands/update.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b65268d7d4e33bdfa29f3d3c7694346c3be4e0ec42d742e7a86d605b7e5083"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/ui/Tooltip.tsx: ui/src/components/ui/Tooltip.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Tooltip.Tooltip at line 4. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/ui/Tooltip.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":"ui/src/components/ui/Tooltip.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecab8fc03a8e13626a491a4711b5837063c442b61ff69ba8e0f0cee297f9605d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/jobs/ssh/service/mod.rs: src/jobs/ssh/service/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in openresearch_cli::jobs::ssh::service::run at line 771. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/jobs/ssh/service/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/ssh/service/mod.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b859a9ee46421da58af3767099dcfbbc52f822d54206fa5d6566eb03966753"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/engine/reconcile.rs: src/engine/reconcile.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in Engine::commit at line 433. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/engine/reconcile.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/reconcile.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"57460d3666a172a8c912c6c8fd4b6d05e6b6974053d43bbc713e8f5f4c63ff2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/projects.rs: src/local/projects.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in openresearch_cli::local::projects::prepare_path 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/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/local/projects.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"37025537310d2252b45cf25aa54c6f2d5ca1debd85b863b4f871c8ce398ea699"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/SessionHoverCard.tsx: ui/src/components/SessionHoverCard.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in SessionHoverCard.SessionHoverCard at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/SessionHoverCard.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":"ui/src/components/SessionHoverCard.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea272653bf8adfa57982cb357f8064a079a8bab2d419780abaeca86dc6b5abcd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/up/agent_tools.rs: src/commands/up/agent_tools.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in openresearch_cli::commands::up::agent_tools::call at line 191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/commands/up/agent_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/commands/up/agent_tools.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d132962915c958397eb76e9fd858f81697a1cdbdf0a1e3ee278eda6c3af13fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/ShareProjectDialog.tsx: ui/src/components/ShareProjectDialog.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ShareProjectDialog.ShareProjectDialog at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/ShareProjectDialog.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":"ui/src/components/ShareProjectDialog.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d776627121d8050ee15a87df0e38c0ecf7e171e02a7bb599490ba706626d6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/LocalModelSetup.tsx: ui/src/components/LocalModelSetup.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LocalModelSetup.LocalModelGuide at line 231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/LocalModelSetup.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":"ui/src/components/LocalModelSetup.tsx"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cb7110b8844ffe601e0d48e135de02296a1c37d94955b2804076110e2494a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/HtmlPreview.tsx: ui/src/components/HtmlPreview.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in HtmlPreview.HtmlPreview 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/HtmlPreview.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":"ui/src/components/HtmlPreview.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d608a5b91eb0fa0dae90649c75d4b3ae3e18421fb9930da38cde86003ee4644"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/ResumeDialog.tsx: ui/src/components/ResumeDialog.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ResumeDialog.ResumeDialog at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/ResumeDialog.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":"ui/src/components/ResumeDialog.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c1125ffa25d29ba2bf5e97444fcee350cc78507b52161dbc3fe474d747b876"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/SshConfigDialog.tsx: ui/src/components/SshConfigDialog.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in SshConfigDialog.SshConfigDialog 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/SshConfigDialog.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":"ui/src/components/SshConfigDialog.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fa56082f4749faf97d66988a6c0e21a328234784d47a7c26d5e0719880a21f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/jobs/ssh/prepared.rs: src/jobs/ssh/prepared.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in openresearch_cli::jobs::ssh::prepared::resolve_with_agent 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/jobs/ssh/prepared.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/jobs/ssh/prepared.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"0953ad4c2bea1fc6ad77823d28737284dfeea439d80c8c4be2eba14fc8f99e6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/workspaceTabs.ts: ui/src/workspaceTabs.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in workspaceTabs.applyPane at line 305. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/workspaceTabs.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":"ui/src/workspaceTabs.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb13678084080b90a094340a662f43890266c7e756ef30ffe91b160bbfdcd58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/harness/managed.rs: src/local/harness/managed.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in openresearch_cli::local::harness::managed::unpack at line 654. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/harness/managed.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/local/harness/managed.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3db08de52858c396173e521efe140ff508fc17349fd71e31d457e928d56881"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/opencode_db.rs: src/local/opencode_db.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DatabaseLease::acquire at line 481. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/opencode_db.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/local/opencode_db.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b7f31388d938469668b31f289a13e408dac68d87dccd85ceacf2c43e33076f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/CodeTab.tsx: ui/src/components/CodeTab.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in CodeTab.CodeTab 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/CodeTab.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":"ui/src/components/CodeTab.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b378d5456dccc77322cb3eec3dac316100e5de83c53204945578fd162e48f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/ExperimentRunBanner.tsx: ui/src/components/ExperimentRunBanner.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ExperimentRunBanner.RunRow 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/ExperimentRunBanner.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":"ui/src/components/ExperimentRunBanner.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1233b2e3a2ea2fe253264ff0f2a605752d95d1067fe230ee24ad7653906702e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/ssh_identity.rs: src/local/ssh_identity.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in openresearch_cli::local::ssh_identity::local_keys at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/ssh_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":"src/local/ssh_identity.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3869ff98ebcd75a10122c34494bc4ebaed00e4745ea58707e862eba31e4129a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/Machines.tsx: ui/src/Machines.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Machines.MachineWorkspaces at line 142. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/Machines.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":"ui/src/Machines.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d951c512385b79e0cf3a427573d18690dfcfb14f38f71e8032bddd739deb63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/ci-changes.mjs: scripts/ci-changes.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ci-changes.classifyChanges 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- scripts/ci-changes.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/ci-changes.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"254b28c55e0cc1f259e1a3df76c161573309b0b8cc88a6fee06a1ef4e313cd40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/LibraryPicker.tsx: ui/src/components/LibraryPicker.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in LibraryPicker.SignedInLibraryPicker at line 32. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/LibraryPicker.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":"ui/src/components/LibraryPicker.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c197523ea4923673dc019e2e85ec8cbb323e550860caa90f77437dba5ea536bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/engine/legacy.rs: src/engine/legacy.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Engine::scan_legacy 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/engine/legacy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/legacy.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fdbf1a564553a730018ca81b3d79f59f6152694ec88dc02afe3c2b6f58b508"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/engine/transport/ssh.rs: src/engine/transport/ssh.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in openresearch_cli::engine::transport::ssh::failure at line 782. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/engine/transport/ssh.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/transport/ssh.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd515429e4008689317a13b569ee4f87999201a6a8acd3c6b9206856c63bd95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/RunContactNotice.tsx: ui/src/components/RunContactNotice.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in RunContactNotice.RunContactNotice at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/RunContactNotice.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":"ui/src/components/RunContactNotice.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18163a349db825adfad70b60e9a3cc4b13e421920a3526eb25fed810555fb2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/ModelSettings.tsx: ui/src/components/ModelSettings.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ModelSettings.ModelSettings at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/ModelSettings.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":"ui/src/components/ModelSettings.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d44dd26b118a4130b90f8d8636201f2d2ac8935e8b787a32246312ea0d94bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/engine/adapters/local.rs: src/engine/adapters/local.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Local::start at line 117. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/engine/adapters/local.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/adapters/local.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee92bf403df8e8e3bb504c86c2a749838054c8bc28676e697272476ff47cbdf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/RemoteStopDialog.tsx: ui/src/components/RemoteStopDialog.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in RemoteStopDialog.RemoteStopDialog 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/RemoteStopDialog.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":"ui/src/components/RemoteStopDialog.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b450b48d846bf8eb56943e04d33e0efe4e1cd0fba6fc1216064832248bdf4c00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/engine/adapters/ssh.rs: src/engine/adapters/ssh.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in openresearch_cli::engine::adapters::ssh::observations at line 474. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/engine/adapters/ssh.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/adapters/ssh.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb042a448be4e0b16a45273772e4d1a22b75c33785595ed45f80620702c4a655"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/TabStrip.tsx: ui/src/components/TabStrip.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in TabStrip.TabStrip at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/TabStrip.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":"ui/src/components/TabStrip.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1347021ce2a8e510b1703038faa2ad047854a456e93e6685c7cf5d5ab7ff9d2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/PdfPreview.tsx: ui/src/components/PdfPreview.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PdfPreview.PdfPreview at line 54. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/PdfPreview.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":"ui/src/components/PdfPreview.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a8c47c189d8f353c7141c6aaad0bc57f5de539bb9562247c690695e8678727"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/ReproducePage.tsx: ui/src/components/ReproducePage.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ReproducePage.ReproducePage at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/ReproducePage.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":"ui/src/components/ReproducePage.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7eaa083d03382705189dcb0971c2471ce7cf4e856ff304c495024728f1ff9d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/queries/chatState.ts: ui/src/queries/chatState.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in chatState.reducer at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/queries/chatState.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":"ui/src/queries/chatState.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43c0a3f3c2b6f6367549fbf8c31295e21e847793d30ea77aeeb0b742f2b1b18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/remarkFigures.ts: ui/src/remarkFigures.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in remarkFigures.remarkFigures.transform at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/remarkFigures.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":"ui/src/remarkFigures.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d300464e667cb47a1aea63da2b1b4b9122fcc5dd167b7501329398a2fe961b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/OpenSharedProject.tsx: ui/src/components/OpenSharedProject.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in OpenSharedProject.PickFolder 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/OpenSharedProject.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":"ui/src/components/OpenSharedProject.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c42e0f7593c0324948c7c723917ce0f2e3543689e19fd76edb6558b2f59a8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/components/CsvTable.tsx: ui/src/components/CsvTable.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in CsvTable.CsvTable at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/components/CsvTable.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":"ui/src/components/CsvTable.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7db097a6c2fa159119a1950afdfa42dab385c9d9643e74dfbc66b84420eea9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/runDisplay.ts: ui/src/runDisplay.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in runDisplay.runDisplay at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- ui/src/runDisplay.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":"ui/src/runDisplay.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbedf5bdcfb58b4cbb1db51e8aab6ce8428c1b9f1850b5071b30a6161f21da05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/local/chat/news.rs: src/local/chat/news.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in openresearch_cli::local::chat::news::deliver_news 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/chat/news.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/local/chat/news.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"7152d22bf884eb6781e6f96c4cdce359ed608000c0fc1a42fc4edd7a4dcc6e83"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/local/opencode_runtime.rs: src/local/opencode_runtime.rs changed 14 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is openresearch_cli::local::opencode_runtime::start_server at line 341), 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: group model tiers and fix provider sign-in (#1030)\u201D; \u201Cfix: terminate opencode process groups and stop active turns on shutdown (#1015)\u201D; \u201Cfix: set up OpenCode 2 without GitHub\u0027s rate limit (#1023)\u201D; \u201Cfix: keep tests out of the user\u0027s home (#977)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/opencode_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":"src/local/opencode_runtime.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a38419fd0f93aa0bb7ca004335e873621de0ca45c71d686076ca1804a4530c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/jobs/vercel.rs: src/jobs/vercel.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is openresearch_cli::jobs::vercel::plan_limit_hint at line 859), 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: stop cancels and launches from getting stuck (#1002)\u201D; \u201Cfix: keep waiting Kubernetes runs queued (#960)\u201D; \u201Cfix: make Modal and HF readiness match launches (#959)\u201D; \u201Cfix: CI flakes and a Windows agent-stop hang (#990)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/jobs/vercel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/jobs/vercel.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be36288478dbba0aa89967a24baa472f1f1e029c0ba87bbdfe7a16218a14b2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/local/acp/delegated.rs: src/local/acp/delegated.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is Delegated::create at line 191), 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: clean up Antigravity chats over ACP (#998)\u201D; \u201Cfix: CLI failures in sandboxes and closed pipes (#962)\u201D; \u201Cfix: CI flakes and a Windows agent-stop hang (#990)\u201D; \u201Cfix: spawn every binary the way a terminal would (#894)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/local/acp/delegated.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/local/acp/delegated.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45daadf122b9e41646adf225290894d627b8a2b9bc839608fab99e138d20e07"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/browser.rs: src/browser.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 5 (its worst body is openresearch_cli::browser::open_dashboard at line 16), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: spawn every binary the way a terminal would (#894)\u201D; \u201Cfix(desktop): open Linux remote workspaces with connection progress (#870)\u201D; \u201CFix OpenCode 2.0.6\u002B health probe and WSL browser launch (#409)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/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":"src/browser.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a18aa4a2694c0744b14674fd48629d8f1a989f4bfd5db8dab87e20d5359032"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/engine/adapters/hf.rs: src/engine/adapters/hf.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 5 (its worst body is HfAccount::recover at line 61), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: stop cancels and launches from getting stuck (#1002)\u201D; \u201Cfix: resume HF and Modal logs exactly (#958)\u201D; \u201Cfix: make Modal and HF readiness match launches (#959)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/engine/adapters/hf.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/adapters/hf.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b9a237d97d3fd4056e1e417fe752a481a7f85927d0bd941db1454acb8b507c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/engine/adapters/modal.rs: src/engine/adapters/modal.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is ModalAccount::inspect at line 42), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: stop cancels and launches from getting stuck (#1002)\u201D; \u201Cfix: resume HF and Modal logs exactly (#958)\u201D; \u201Cfix: make Modal and HF readiness match launches (#959)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/engine/adapters/modal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/adapters/modal.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3351e3885cfac95f6fb586c1d3a6974c4dd497f1562e42d8651b116c6bc20537"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/jobs/managed_env.rs: src/jobs/managed_env.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 8 (its worst body is ManagedEnv::ensure_in at line 97), 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: make Modal and HF readiness match launches (#959)\u201D; \u201Cfix: CI flakes and a Windows agent-stop hang (#990)\u201D; \u201Cfix: spawn every binary the way a terminal would (#894)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/jobs/managed_env.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/jobs/managed_env.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d02cda925025d1ced0703b859c9576472548664cecf99082310d4087f242517"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/folder_picker.rs: src/folder_picker.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 7 (its worst body is openresearch_cli::folder_picker::pick_folder at line 99), 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: spawn every binary the way a terminal would (#894)\u201D; \u201Cfix: use the standard folder picker on windows (#814)\u201D; \u201Cfix: bring Windows project folder picker to foreground (#401)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/folder_picker.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/folder_picker.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c984b96a753dad793dcbb46f22f56fafe509bd6bd3dc2e60b691700fa7f3a12c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/engine/adapters/vercel.rs: src/engine/adapters/vercel.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is openresearch_cli::engine::adapters::vercel::ids at line 9), 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: stop cancels and launches from getting stuck (#1002)\u201D; \u201Cfix: resume HF and Modal logs exactly (#958)\u201D; \u201Cfix: make Modal and HF readiness match launches (#959)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:27:21 -08:00\u0027 --until=\u00272026-11-16 19:27:21 -08:00\u0027 --full-history --no-merges -- src/engine/adapters/vercel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/adapters/vercel.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd1c399388aadaf79f61241697656ed9f985ec1a15f45d175f62d8be059b2ef"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 5 significant file(s) lose their only recent owner: ui/src/components/GitDiff.tsx, src/commands/instance.rs, src/jobs/tinker.rs, src/commands/invocation_gate.rs, ui/src/chatRecovery.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8ada192a5f7f29ba3ac1514cef48df88e5fe66c9553fb2c96d168d3bac434a43"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 4 significant file(s) lose their only recent owner: src/local/latex_templates.rs, src/jobs/localbox/python.rs, windows/launcher/src/main.rs, src/invocation.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ecbf3f33dd14f651adef8866e691ddf51fb30c8a89a542ce6e63161441c0489f"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060orx-host\u0060 is a binary crate (\u0060src/main.rs\u0060) and neither \u0060crates/orx-host/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2512e2b6fc26fd5a788231e552e87d10cc7a5d4a14221c74279562a2e07c806d"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060Cargo.toml\u0060 makes this repository a deployable product (line 17)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1f320edebd162aecb630322055fab9fa4bd5274ac8a03cd339206970700a5"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (205519 LoC, 672 module-visible types across 29 directories) overshoots its size bounds. 2 of 5 build unit(s) (Cargo, npm) overshoot their size bounds, lowering Project Cohesion to 2.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47e8df767bfc37da3227cdd4038c0a9e51cc4af34f700a3047c62f87429ba9d"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060ui\u0060 (53937 LoC, 521 module-visible types across 8 directories) overshoots its size bounds. 2 of 5 build unit(s) (Cargo, npm) overshoot their size bounds, lowering Project Cohesion to 2.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7883be23adc4cee948a2f70cda0ad7174840b03e7b0f61bc4228d1625d35fd"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06daafe2709e468287b505c00bf9feb366987173d1ade4b317a3c3dfe35f4e51"},"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":"7f9979ad231d2ebd7fc3a1b6e91e0a4cec9e0a5b2c3f5da8abd9afb71948b675"},"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":"fd34071f0a37397b22950926e6e7d533f19a1ab2e35c80a3ec230eef7195ce4c"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"664033cc8a8e61b3a12c33248a7d66c13d1a93fdb771806d49a43ff0f08d9a89"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6c9e8dccce39b8ff23247dd209c0b2a6024059174729e3c8549abe99778d756"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e8507656248c891297481cb5899dbd914644a37f70d3ad1be1d428a0d86d88d"},"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":"471d3765604eda9cbea2d5f24e0c95d3b4725810d04dd90aec8e862c02b73735"},"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":"a97051d4336fd9683d4537a40f3cccca323811360b978efeb452dfb5dec0a638"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-88","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72f03efa6ee7ca8758fadb37a5a8cc81f8338acdc63a29e3072b3f5c78b99cd5"},"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":"3d44ca90de1c428b40f381ce203959c386700d2443b82ac82928d1c95be376a0"},"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":"94c981699090cbff95999720da9c1b3ef1478469a4fb7204888acc9ab0b95928"},"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":"81b23f4ed64f43c84035a5390672f9c8af6976e3896731e1b0f32efaf83b8078"},"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":"ff0b77e4bd4dc4ca4c6c9185073aeaab6c016eb90aa5130bc4832dedbe8f3df6"},"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":"55818f38a7bcf633fa56726d4d03f0fbd72b2784f425cc041997b433b447821b"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"245dad286f7dc5ba3d7e2e64e51f2ed6cf4349bd14872b4538b91e180435161b"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"109b5be822c244bcaccee127de32276ec40b83a218108d91f3dafc64900b694a"},"taxa":[{"id":"CWE-502","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":"39209c38ef5b85a965ea5b24f902cdfa9316f67ee48c2fb4aa248cee950fc558"},"taxa":[{"id":"CWE-502","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":"d7fdd3ece08d04251205de524b581bd58de6f44949cab5968de209dca917a798"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02d1801e808e7cbfd8a4c29aeba8038b9e77c377908597c8d1aa879ec0fbd596"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"143412fe1a10a823f451acba8b77f389e1ba080eff1ccaa1c79d71b06c8e92fa"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f47b076f187325b88be9e4da7be6d019e0cf3e042799097282cbdbc73e361712"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2636dda61b03bb3128318206c942292c77d9d361f2c005c08cb1808f5691070c"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55d02cdc2a15feb3a0a2016143e8f474ef93df359f82ca9f6760dd05ebec2073"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"357e3778d40d822e95d9d76996fa7ae7ed1f63985a6d7f5b4302e5888bc6ecdb"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39c5b790520be9d1239246f6915dbcffa2cf8cef4ecc1ad59fa5793dd3251877"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a47ba020744365722236f83632594b4ac8d795ba622c14702cb47a79e61c3028"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b495e203f8b2d1db56adc4194e760aba824c387a1dad6bcf9c6b3be4c7aff5d2"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"92b289f484b9ebe7d373962cfba8dd3ac4c194e67bde921b0f0c02d1065017b6"},"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":"da0ff9e8981446482165b847320c48334db1907e47e8ecdf364db4d4b93d4ac6"},"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":"af19ce5308afae506b70b7698c3a54862cccf4df8534520618232bf5a717b120"},"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":"b1e4b023ccf85f45e7cabc74b98fd27b8c4530dd83d544ab89eba43e774d63ae"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af89029221b9b9185a1f6f81909c9b267b05a595077aaeb98c639a5bdf98d84b"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8be839ed91acf4da2c307d6a364f061853fb2363da3b6b088fa106cd6e5b2444"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"48bcffd4bc08691571130ddcf1fd8b28abf16870e99946dffdec9fa1381252eb"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a9d1da289b7410afb761010400066afe388c9aa041ea958aa00313d38279eba"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"576405f81aa984875a9dbbd35b1591ef50286a51ccda9d75860f92ecd0558c3b"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"4e313954ed9eaa6cc0f061ecde59c1300d7951d2c1308787496704c4f96d316f"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"213621e988fcbb7f118f580fafdbb91de9a9fd1c56e4dbce80e721577c6b99b7"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"877e48d2639b832d6921bb83e4a18ad5e248932be44fe7a0cd5f0b12694ff544"},"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":"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":"b5308f9ed219ff7d361ed2b01ab7b5fa7a33b0013fcd35575e7068ccda1d2997"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0185","RUSTSEC-2026-0338","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"severity":"high","fixedVersion":"0.11.15","relation":"transitive","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":"83068018658f1d4b854a3ba4691b93b88a0168be5c63cdb8401be06cd25e5d7b"},"properties":{"dependency":{"package":"browserslist","version":"4.28.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.28.7","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":"4810bf9cb1efa5fb7774925f0d38518de211fdda8d60224e0faea9fb96c7ae35"},"properties":{"dependency":{"package":"nanoid","version":"3.3.15","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.3.16","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":"5aeae647f9a585ec0b383eeb15ebc74de8205ea93ca021680f27fbfc48f8feec"},"properties":{"dependency":{"package":"postcss","version":"8.5.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.5.18","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":"047339963facfc0904aa73b4657fea9084774d614282fb4d935a6cb92ab2fc02"},"properties":{"dependency":{"package":"seroval","version":"1.6.4","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":"1.6.8","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":"cf0b5d3a7a30e4940012f3e7a6ad3f0343f5bb0b6b1df5d9db0a230444ba0076"},"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":"b09e95488b90d702a9d738fcba75f5914b1a1ee08a586807dd5a4699a8647880"},"properties":{"dependency":{"package":"vite","version":"6.4.3","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":"6.4.4","relation":"direct","declaredRange":"^6.3.5","reachability":{"kind":"production","file":"ui/tests/register.mjs","line":13}}}},{"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":"1490674a5b129586353fd6739fb7a11fabc9c5bd40d25de67d57609e93e5e7fe"},"properties":{"dependency":{"package":"zod","version":"4.5.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","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.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":"02807c2340c313bd085553cef2aa54725b58db377d04241d3195bea3a23b7783"},"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":"80b5c22beae306eb623d7a60ec13361ab89285e1cc30fcf5b8daa2e87ffb5c69"},"properties":{"dependency":{"package":"h2","version":"0.4.14","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.4.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":"7b3f5e73f54279d8a385f3ccb6ce6659725cab3121019062bfd36c6500f66d85"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.30.1","advisory":"RUSTSEC-2026-0459","aliases":["[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":"95686d8e64236c3c2c566e482859faf67a5bbd9dbeebb6f4df8aab56c3496281"},"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":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.14","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":"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":"d7481fb93c86b503a82a3e06a3172c7e27c5da26b8a178702a1e8028944c7596"},"properties":{"dependency":{"package":"rustls","version":"0.23.40","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"severity":"medium","fixedVersion":"0.23.45","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":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.13","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":"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":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.7","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"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":"221f759b91a87aa7a2aff6d23891a37bfc18bc55347fe576f9502c3576c8e699"},"properties":{"dependency":{"package":"baseline-browser-mapping","version":"2.10.42","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.11.0","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":"edaf47329e7c0a2a83da08a803897bed9c8efba8c4544ef67213167da38af1cf"},"properties":{"dependency":{"package":"katex","version":"0.16.47","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"0.18.2","relation":"direct","declaredRange":"^0.16.22","reachability":{"kind":"production","file":"ui/src/katexHealing.ts","line":5}}}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: up.rs \u2194 hf.rs: \u0060src/commands/up.rs\u0060 (context commands) and \u0060src/local/hf.rs\u0060 (context local) sit in DIFFERENT parts of the tree yet 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) \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 \u006063d7c9d3\u0060 OR-351 Configure Slurm cpus/mem defaults from the CLI and record them\u2026; \u00609077038f\u0060 OR-367 Record who requested each run cancel (#598); \u006035c68706\u0060 OR-304: Compute CLI, custom instructions, and Slurm recovery (#429) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccf358a82b7cbcc3dbbcce11fedf8a6bbb653411e62d582d36d64c768f57e06"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: up.rs \u2194 localrun.rs: \u0060src/commands/up.rs\u0060 (context commands) and \u0060src/local/localrun.rs\u0060 (context local) sit in DIFFERENT parts of the tree yet change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u006063d7c9d3\u0060 OR-351 Configure Slurm cpus/mem defaults from the CLI and record them\u2026; \u00609077038f\u0060 OR-367 Record who requested each run cancel (#598); \u0060d7fd6362\u0060 Fix uploaded skill provenance and local run boundaries (#458) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8aa3949a9221d577e34c18efa137f067ced2b19c2c2a29cb0d8ded75263978f"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mod.rs \u2194 localrun.rs: \u0060src/jobs/mod.rs\u0060 (context jobs) and \u0060src/local/localrun.rs\u0060 (context local) 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 \u006029dcdc04\u0060 Configurable remote storage root for SSH and Slurm (OR-510) (#754); \u006063d7c9d3\u0060 OR-351 Configure Slurm cpus/mem defaults from the CLI and record them\u2026; \u006035c68706\u0060 OR-304: Compute CLI, custom instructions, and Slurm recovery (#429) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc13baf1f3a337a10a1e5b56a02416e47e85ef127c2a87db570a9d1431a3cc44"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: up.rs \u2192 NewProjectForm.tsx, Onboarding.tsx, ProjectsHome.tsx, settings.ts: \u0060src/commands/up.rs\u0060 changes together with 4 other files \u2014 \u0060ui/src/components/NewProjectForm.tsx\u0060, \u0060ui/src/components/Onboarding.tsx\u0060, \u0060ui/src/components/ProjectsHome.tsx\u0060, \u0060ui/src/queries/settings.ts\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e2adde8c624eb03d400b5e6d2cbe4fe4778dab09e6646c4d87f3fd43ae291b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: ChatPanel.tsx \u2192 opencode.rs, ClosableTab.tsx, ExperimentsTable.tsx, ProjectsHome.tsx, events.ts, settings.ts: \u0060ui/src/components/ChatPanel.tsx\u0060 changes together with 6 other files \u2014 \u0060src/local/harness/opencode.rs\u0060, \u0060ui/src/components/ClosableTab.tsx\u0060, \u0060ui/src/components/ExperimentsTable.tsx\u0060, \u0060ui/src/components/ProjectsHome.tsx\u0060, \u0060ui/src/events.ts\u0060, \u0060ui/src/queries/settings.ts\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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da27a944f647f3c2187edce3a2e8177e31e5e055be6ec0e99c91771b3b1d23c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 api.ts: \u0060src/local/mod.rs\u0060 and \u0060ui/src/api.ts\u0060 change together 59% of the time (17 of the 29 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 17 shared commits counted here, the most recent 3 are \u00605538a61f\u0060 OR-423 Install Git and OpenCode reliably on Windows (#540); \u006014836988\u0060 OR-327 Add Agentic/Copilot autonomy control to the model picker (#488); \u00609291fb95\u0060 Let /resume adopt chats from the agents\u0027 own CLIs (#413) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"719fc20b19b15d7f6149e16570c69f26e0455f3550d5e45d65df3bd83a265112"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: experiments.rs \u2194 App.tsx: \u0060src/local/experiments.rs\u0060 and \u0060ui/src/App.tsx\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060fe36f742\u0060 Add permanent experiment delete (OR-564) (#759); \u0060169aad22\u0060 Add directional experiment archiving in CLI and dashboard (#451); \u0060cec874e4\u0060 Simplify project files as artifacts (#145) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/experiments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d35d4e40c56149024b33ab08c9f69300ad2c2f3946081b7fa4961f2b0ee381d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: App.tsx \u2194 events.ts: \u0060ui/src/App.tsx\u0060 and \u0060ui/src/events.ts\u0060 change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060abf810fb\u0060 fix: quiet redundant remote chat updates (#1013); \u0060aa65fe4a\u0060 Run agent setup commands from the composer\u0027s sign-in warning (#639); \u006095b2d961\u0060 OR-231: Safe live file refresh (#286) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3857fc554779377ba0332918b2c704fc6bd9d729a140c1f14543a169f9a6f2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: detect.rs \u2194 ModelPicker.tsx: \u0060src/local/harness/detect.rs\u0060 and \u0060ui/src/components/ModelPicker.tsx\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006047e4e6c0\u0060 chore: parse model names once, on the server (#987); \u00600242a201\u0060 feat: streamline harness setup and account display (#820); \u0060acda4073\u0060 Use CLI model catalogs without static fallbacks (#395) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/detect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36512aff663a66a6552e642552f49865d729467f41e77f2b3c6275bb7b2cd650"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ExperimentsTable.tsx \u2194 TreeView.tsx: \u0060ui/src/components/ExperimentsTable.tsx\u0060 and \u0060ui/src/components/TreeView.tsx\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060fe36f742\u0060 Add permanent experiment delete (OR-564) (#759); \u0060169aad22\u0060 Add directional experiment archiving in CLI and dashboard (#451); \u006008fa61f1\u0060 Implement VS Code-style preview tabs (#234) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ExperimentsTable.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"824ab73afcd46000d3b9a4fc02a56bb3e480e53258f430f3d91a0dc960a35773"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: hf.rs \u2194 opencode.rs: \u0060src/local/hf.rs\u0060 and \u0060src/local/opencode.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 \u006035c68706\u0060 OR-304: Compute CLI, custom instructions, and Slurm recovery (#429); \u006013049867\u0060 Fix trusted run supervision and post-cancel Codex turns (#243); \u006043852e42\u0060 Route run-completion notifications to the launching chat session (v0.\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/hf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d236de9556da2e6bbf1133f698aea68c9112f1951f09773208916cc3cbc595e2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: client.rs \u2194 create_experiment.rs: \u0060src/client.rs\u0060 and \u0060src/commands/create_experiment.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006078447189\u0060 skills (#55); \u00609cd79abf\u0060 Retire eager baseline: projects start with an empty experiment tree (\u2026; \u00603dcf5de4\u0060 cargo build \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e36c2f1c32376ce46d28854b696c721915c519e37465d7d377081eef22de7aa"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23242335439540a7f0752c9def5c038b557d1cb0f8e6f7b448b5f69adcab3c1d"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC1","level":"error","message":{"text":"\u003Csvg role=\u0022img\u0022\u003E without an accessible name: An svg presented as an image needs a name \u2014 add a \u003Ctitle\u003E child or an aria-label/aria-labelledby."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent-skills/orx-figures/assets/orx-chart.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c179a5bfd895bf61bcdc7c66365f8aa510e36c268d99a8ae55b78a1b34ec8fdf"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cvideo\u003E without a captions track: Video with no captions \u003Ctrack\u003E offers no captions. This player\u0027s source is set at runtime, so there is no caption file to author here: give the player a way to carry captions \u2014 accept a track/captions URL alongside the media and render a \u003Ctrack kind=\u0022captions\u0022\u003E when one is supplied \u2014 and capture that asset wherever the media enters the product (upload, import or generation)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/MediaPreview.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"10023a1bd61fa9060f52e7ac948fb2fc657f9f9611f5cca90049901d438d8c69"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/GitTokenForm.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"283d0456d9298fb618002423069bebef302da8b9239e702e5fd9be9bef15ab35"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2808}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a2491e1d38a3fb44eee1eca4066ee4b9001a2ebcf3c401a802266c901a1dae"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextarea\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/dialog.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9469195fa440a710803550408dfb1ff899f40e0edc4ec1b04d1f03891854cca"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022alertdialog\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":"ui/src/RemoteRuntime.tsx"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca3e4e3c6e248a27f2ebc07afc63b48983e21f811897793b657d1b61e32cdcf"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"083ccd76a13087f562c15a455d8bd3e5ad4d6168306e6f863e04491f9aa275e0"}},{"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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"18457e3b33c090d14c77f2153797d9addc8384b8d776c3487f93fe6f713bcc25"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a \u003Cspan\u003E nested inside \u003Cbutton\u003E: This \u003Cspan\u003E carries its own click handler, but it sits inside a \u003Cbutton\u003E that performs a different action. A keyboard user reaches the \u003Cbutton\u003E and activating it runs the \u003Cbutton\u003E\u0027s handler, never this one, so this action has no keyboard path at all. Role and tabindex cannot supply one: HTML forbids a \u003Cbutton\u003E from containing interactive content or any descendant with a tabindex, so the browser will not put this element in the tab order however it is marked up. Move it out of the \u003Cbutton\u003E and make it a sibling \u003Cbutton\u003E, so each action has its own control."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ClosableTab.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"683ae4db8e5fa99ac639725698aca689665fdfb2949c142741b24c6892c4ba95"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Cdiv\u003E: This \u003Cdiv\u003E binds mousedown, touchstart and double-click \u2014 pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabIndex={0}, so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native \u003Cbutton\u003E or \u003Ca href\u003E. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role \u002B tabIndex={0} \u002B a key handler alongside the double-click."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/CsvTable.tsx"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e51cea950871c3021ef1b938d2f1797bdf1007fe5ab28670c69c5c3f055cb2"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ExpHoverCard.tsx"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86015ec5f18127118c6edd1fa5a3a3c456a8851c8b1a66219c67112b293624f"}},{"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":"ui/src/components/OverleafPanel.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc232ab4c38df81d67e18cf98df711158b233756ef9d9e5ac6d4942aecd4c434"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SkillChips.tsx"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65540b74a0368258165826a303e8d4d2f544f6606bf11cf06a8e3865b3b1661"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SkillChips.tsx"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e165285db08cdd7ca1dbb57cb8c176845cdc47ac7163a61835859783e443058"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/TreeView.tsx"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"40386ea218fda4b9cb0d8a03cbad04cf7179dd425344224ecf8df32153d72d9f"}},{"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":"ui/src/components/WorkspaceTools.tsx"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"541af3e7fcbd6b1fa6be7b357f583c221b7a9b0ac67de187061efd993b5eb8c6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"9594156d14faa8088884c4a8587f1cd3b6ff83904ec4276f99d5ee6f859615f5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3722}}}],"partialFingerprints":{"codehealthFindingId/v1":"a434cbb3a3fef8befd8cc765516ff63adb8d5578b851b02462f2773041418f35"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cdiv\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4951}}}],"partialFingerprints":{"codehealthFindingId/v1":"210105be2722dacd5769c1a43a2ae41db5a790168b4b3bb58a102ce7a3005f4a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cdiv\u003E moves \u2014 its \u0060animate-[or-pulse_1.2s_infinite]\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":5233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4b6bffea4a93c9f632b000cfff6d2ddf1cc2f8826059738803df4fb362892e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatSearch.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6a5e1e02590cfd9b0fcbb1483be57e46f3c2031ef612bab11538c7003a82cc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/CodeEditor.tsx"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"682943c1b8e0b0571f3715570235f47bb0354a83c5aea51db90c2a158a5eaf82"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cdiv\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ComposerEditor.tsx"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36187067b4bea4bc3564aa68fdc12b4acd8aef4a8dd5d64b6d5a7083b635a97"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cdiv\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/CsvTable.tsx"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d439f836aa05b4c54078a786d98cd5b84a8b620f9499d6eda4c8f2fb39b101"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cdiv\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ImageCarousel.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5076295de040cf6f29a0679f75e43ab2760cdbe25c3c7d41f71dfc398b6be0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"4944e042b04dd8347e9491f40c4f29d35f10bc7e72022a89e5d732c5f93e9948"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b126774ede4054c5af2a14c2d8c4091ea3602457d09c84454b648b816a57e7b9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cspan\u003E moves \u2014 its \u0060animate-[or-pulse_1.2s_infinite]\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ProjectInfoCard.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"979fda085a5a4bae90805bf0eb99875228173e48056a74acabf726a9bd603dcc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cspan\u003E moves \u2014 its \u0060animate-[or-pulse_1.2s_ease-in-out_infinite]\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/TreeView.tsx"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c6bb2d8807ec08d35490973a23fc3a65ca0fdadac8cb111a05445d8bb6ba03"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ui/Input.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"88098464adc79f6b598e380ac44d7dcf973eff7d70a741c7a33735786ede75fe"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cspan\u003E moves \u2014 its \u0060animate-[spin_0.8s_linear_infinite]\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ui/Spinner.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3246c5becfdec671b183e3cf1992f0b6a682f8dc0fb27306a6e962dc9c2364"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cspan\u003E moves \u2014 its \u0060animate-[or-pulse_1.2s_ease-in-out_infinite]\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ui/StatusIndicator.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3ee0f3ebb3c96d4710a4ebc083850784669612a2a7cf41a888c8f4a6f3f2ad"}},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) \u2014 this is NOT a claim that endpoints are unprotected. What\u0027s missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can\u0027t be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b048fdf3fa524ac68c7874fdfcdb4c49d5f010013f2cb22a0bd84cb12ceb951f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: exec.run calls \u0060thread::sleep\u0060: \u0060exec.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/orx-host/src/exec.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"62866d402d5cfef109c244c3caf24961b429d3b41f174a48aed00efc1473ed2f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: legacy.inspect calls \u0060std::fs::read_to_string\u0060: \u0060legacy.inspect\u0060 runs on the async event loop (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/orx-host/src/legacy.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15ea13af84f03c676e1e23ecc6d3304d8aad98648a634f44c78fd85ec50f5f3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: legacy.inspect calls \u0060std::fs::read_to_string\u0060: \u0060legacy.inspect\u0060 runs on the async event loop (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/orx-host/src/legacy.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd531dca12cd8c1185f490e7d6a3d0e7996f33eb0953d2dd286da1ec58136a6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: src.nonce calls \u0060File::open\u0060: \u0060src.nonce\u0060 runs on the async 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/orx-host/src/lib.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"895acc0e70c11cb87678afcb06262eacc7c11e90a08786af0308a93e899b3a29"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: src.publish_bytes calls \u0060std::fs::rename\u0060: \u0060src.publish_bytes\u0060 runs on the async event loop (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/orx-host/src/lib.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c47b8ce5b0c6ad248d68579d8c561f7e8aa2bd2599511da59eb487c34b6e25d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: src.publish_bytes calls \u0060File::open\u0060: \u0060src.publish_bytes\u0060 runs on the async 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/orx-host/src/lib.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f11ab6e8a121436b4807281bb223b067bb19221e13102fd0018403a5925021"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: src.publish_bytes calls \u0060std::fs::remove_file\u0060: \u0060src.publish_bytes\u0060 runs on the async event loop (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/orx-host/src/lib.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3351014897f31410d2abd68b4d29c7c6563d7212dc51d9845564b13c0df40b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: log.open calls \u0060File::open\u0060: \u0060log.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 \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/orx-host/src/log.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80dbb9484eb1788c78cdac9d4ef810e2b88e24bc99e68d14e90ae4105fe87ec"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: log.open calls \u0060File::open\u0060: \u0060log.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 \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/orx-host/src/log.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17622569e028ab27657fb1b587bf744e07e22438869ad2173a0504dc5c92171"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ProcessTable.from_pids calls \u0060thread::sleep\u0060: \u0060ProcessTable.from_pids\u0060 runs on the async 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/orx-host/src/platform.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e130c4b535115be597d5c85c3d85dc980fa7b4bc49889897611e7993a183144"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: platform.signal calls \u0060std::fs::read\u0060: \u0060platform.signal\u0060 runs on the async event loop (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/orx-host/src/platform.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ed0aec63d63ca295db56c26369bf92d478dc8ea7a2b5b860f1085239d599b4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: platform.signal calls \u0060std::fs::remove_file\u0060: \u0060platform.signal\u0060 runs on the async event loop (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/orx-host/src/platform.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0633fef7ee322e85b4b6b8b9ac76aee8a519659dd8ac6439e563f25df3ca43fb"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: platform.boot_id calls \u0060std::fs::read_to_string\u0060: \u0060platform.boot_id\u0060 runs on the async event loop (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/orx-host/src/platform.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"6306116916d39cfddb4e0a62a56be98318665633ef59dcf6c50d4c8b5f83dec9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: platform.pids calls \u0060std::fs::read_dir\u0060: \u0060platform.pids\u0060 runs on the async event loop (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/orx-host/src/platform.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5891bd07bb1adabe53a0071899327212881dbb8e48aea6c69029796cea4b728"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: platform.process calls \u0060std::fs::read_to_string\u0060: \u0060platform.process\u0060 runs on the async event loop (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/orx-host/src/platform.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be8104b02065eff1000e7c9528b69955d863bc7f813fbcfd5dc7b156679cb9a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: platform.process_uid calls \u0060std::fs::read_to_string\u0060: \u0060platform.process_uid\u0060 runs on the async event loop (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/orx-host/src/platform.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"f543d9527c1030fda2f015064fba7c5e51d2b6ce97bf4374ce1524726d10ba83"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Host.new calls \u0060std::fs::create_dir_all\u0060: \u0060Host.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::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/orx-host/src/server.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"945e166999d93f6565c475c913578d1d23383d875923ff0ffededb6a762ad146"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Host.new calls \u0060std::fs::set_permissions\u0060: \u0060Host.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::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/orx-host/src/server.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e1108872b99d8a5e36a67cf144392e01236d50a214078d0e911266ea0f6c4b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: server.file_sha calls \u0060File::open\u0060: \u0060server.file_sha\u0060 runs on the async 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/orx-host/src/server.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"962b0efbdf888af1e36d861f019d406c87a51773a1f707981cfce72dacdc2c4c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: wrapper.start_gate calls \u0060thread::sleep\u0060: \u0060wrapper.start_gate\u0060 runs on the async 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/orx-host/src/wrapper.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec225c7159e08b689a3a8e84ac9ec10b3204774f76b7544484c835aeb908cd0"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: wrapper.cleanup calls \u0060std::fs::read_to_string\u0060: \u0060wrapper.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_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/orx-host/src/wrapper.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcba0eb7f5b90c8d456441f0b58bb276eb1c4865e9eabc6f64c229c0501ad24"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: wrapper.request calls \u0060File::open\u0060: \u0060wrapper.request\u0060 runs on the async 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/orx-host/src/wrapper.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5926ad3db70ef449f9a2e57372567fdcca432b6644402ed0e0487e6d75669a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: wrapper.started_at calls \u0060std::fs::metadata\u0060: \u0060wrapper.started_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::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/orx-host/src/wrapper.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de029d1716e40074511d4a7378793f4f05fe249cd32e819d873091286bb749f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: wrapper.state calls \u0060std::fs::read_to_string\u0060: \u0060wrapper.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::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/orx-host/src/wrapper.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e08f5943e47daecd4e4c129b86e81210b9c9a6827398ff57dc7aa5613a57d0"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: wrapper.state calls \u0060std::fs::metadata\u0060: \u0060wrapper.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::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/orx-host/src/wrapper.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc830c31b77103461968aee9ebcf062b8d32b47ca7b126460c374fc00355887d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: wrapper.cancel calls \u0060std::fs::read_to_string\u0060: \u0060wrapper.cancel\u0060 runs on the async event loop (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/orx-host/src/wrapper.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3595d3af012eb0e6587dc124fa2c6fe8df1af18892968d2f00ea41932bf97e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: alphaxiv.load calls \u0060std::fs::read_to_string\u0060: \u0060alphaxiv.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::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/alphaxiv.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8038fdc3f6c103b5b89cb5d5613703d431f12240f4661443acc9d24fbfae7c6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: alphaxiv.save calls \u0060std::fs::create_dir_all\u0060: \u0060alphaxiv.save\u0060 runs on the async event loop (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/alphaxiv.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"c491d2631df141547d272d936525aeee6b9d9e3a021ae35ec9705b3461c0952b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: alphaxiv.remove calls \u0060std::fs::remove_file\u0060: \u0060alphaxiv.remove\u0060 runs on the async event loop (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/alphaxiv.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fff56159a234de4039f0b2a55dd0e5e4bbc32ef165473587b28010ef5e44dca"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: alphaxiv.lock calls \u0060std::fs::create_dir_all\u0060: \u0060alphaxiv.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::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/alphaxiv.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"15faa830d8b09e99303151eb7ecf42f3b13f162c5899376a289af2af9619d943"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: alphaxiv.keep_forwarded calls \u0060std::fs::create_dir_all\u0060: \u0060alphaxiv.keep_forwarded\u0060 runs on the async event loop (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/alphaxiv.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"a573e97cfb980b054770975037f02927e96ac4dfb322dac4bdf69390daf7e5c9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: alphaxiv.access calls \u0060std::fs::read\u0060: \u0060alphaxiv.access\u0060 runs on the async event loop (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/alphaxiv.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1119d5aaed010819e6d02a0b9576c868a98adfde1565cc98a87704ce85627f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: alphaxiv.user_id_on_disk calls \u0060std::fs::read\u0060: \u0060alphaxiv.user_id_on_disk\u0060 runs on the async event loop (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/alphaxiv.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"1527e7d509b26648793a8cc995ba6c2a68fcd59a3b364376197f408a5a318bb0"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: browser.is_wsl calls \u0060std::fs::read_to_string\u0060: \u0060browser.is_wsl\u0060 runs on the async event loop (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/browser.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d033cab01eee354e1056c4eb0f2434cb5d671841383a02330256c83118cf233"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: app.write_if_changed calls \u0060std::fs::read\u0060: \u0060app.write_if_changed\u0060 runs on the async event loop (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/commands/app.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5bf1957712fe285963e6d8e71d200e3a942e0d96e4807f16c57703d5213812"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: app.write_if_changed calls \u0060std::fs::create_dir_all\u0060: \u0060app.write_if_changed\u0060 runs on the async event loop (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/commands/app.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"5259cec4b5765d7a6a0801c57cd3161d712bfc4b62d78a19c41f15fc3f3b4351"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: app.write_if_changed calls \u0060std::fs::write\u0060: \u0060app.write_if_changed\u0060 runs on the async event loop (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/commands/app.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d307d93dd1705b8f0eb1476e251d4a597d707a7cb05d4d5a5087bd3c3197ad7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: app.run calls \u0060TcpListener::bind\u0060: \u0060app.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 \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/commands/app.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a17c5a2d4cd56fcdfd120d75c1819969e15c85e52fc927bf22e07fd449bb718"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: app.run calls \u0060TcpListener::bind\u0060: \u0060app.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 \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/commands/app.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d4cdc17b342530ad6e52811c622c33594668a93c35703b59868e39c2259fd3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: compute.read_input calls \u0060std::fs::read_to_string\u0060: \u0060compute.read_input\u0060 runs on the async event loop (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/commands/compute.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e429544984fa116c82c12d78b0eb0cd5c10971390be178601d88897d0c9148"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: compute.instructions_init calls \u0060std::fs::create_dir_all\u0060: \u0060compute.instructions_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":"src/commands/compute.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"422dd2db44385a49c1002f15c0a859789108a02ca8dcf54537f8e05eb4c67ddf"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: compute.instructions_read calls \u0060std::fs::read_to_string\u0060: \u0060compute.instructions_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::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/commands/compute.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"9538fe724ec263ad749902e729cdf1dc47730bdee6dd58acb17863944e824301"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: delete.run calls \u0060std::fs::remove_file\u0060: \u0060delete.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 \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/commands/delete.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"418bc2bada92cbc0e37bfdaa0bd6640b8f8ba6c676005829b292d94976c59ee2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: delete.remove_if_exists calls \u0060std::fs::remove_file\u0060: \u0060delete.remove_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::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/commands/delete.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5092f6328c31f4efe78970f7cc41fa5382d3540b4796e67baa6d8ae6734b1f53"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: library.skills calls \u0060std::fs::read\u0060: \u0060library.skills\u0060 runs on the async event loop (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/commands/library.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6c2e1e7ac40652f1a5805f70450016e99b459a1110ff1bcb722b10f5d9e47e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: library.templates calls \u0060std::fs::read\u0060: \u0060library.templates\u0060 runs on the async event loop (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/commands/library.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f83e88329b425ae109a3279a8fa41b3aa752ca743e6ba6e75a4c92fb871cf1f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: logs.run calls \u0060File::open\u0060: \u0060logs.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 \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/commands/logs.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"181dacc77de46f5b40ae560f4c612a2ca35ed03c488794c8b2d63f73f301a643"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: mcp.background_stop calls \u0060std::fs::read_to_string\u0060: \u0060mcp.background_stop\u0060 runs on the async event loop (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/commands/mcp.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3f73a7bc83e4eaecabe823ca96880c94b06f88fdec393009afa07fcb409ddc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: mcp.save_stop_error calls \u0060std::fs::write\u0060: \u0060mcp.save_stop_error\u0060 runs on the async event loop (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/commands/mcp.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8b988f1551ebafa7e9d1f35c9adfbd288373133f096bdecb0674ae36b4df6a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: mcp.read_inbox calls \u0060std::fs::read_dir\u0060: \u0060mcp.read_inbox\u0060 runs on the async event loop (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/commands/mcp.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"79abd5a929ea4979a4b61bdcea8564f7c891e750dbb51b081d008806482ba7a5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: mcp.read_inbox calls \u0060std::fs::read\u0060: \u0060mcp.read_inbox\u0060 runs on the async event loop (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/commands/mcp.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e610ebed9e538f7853141027ae721c0f112c89024117ea65bbeb2c741f3f97b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: mcp.read_inbox calls \u0060std::fs::read\u0060: \u0060mcp.read_inbox\u0060 runs on the async event loop (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/commands/mcp.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f1139ee0f0504acb360a292545d608084edcdd905e869f6a8e623c35f9da36"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: mcp.invocation_key calls \u0060std::fs::read_to_string\u0060: \u0060mcp.invocation_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 \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/commands/mcp.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb7d558087b27d7f3d4c0dfb451e8253cd41f0bc9dab79ee7124da8f7be3b7c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: DashboardLock.acquire calls \u0060recv\u0060: \u0060DashboardLock.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 \u0060recv\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \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/commands/remote_host.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19a868579891c03ed6ab1c1905deedd1aecd25d9d641b9801abf503a105dedf"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ControlServer.shutdown calls \u0060std::fs::remove_file\u0060: \u0060ControlServer.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::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/commands/remote_host.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"04dfeb468785bc835c7ad04b52ee9da18359368c9ca9dd5d69ea27eb1d8bf7a2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ControlServer.shutdown calls \u0060std::fs::remove_file\u0060: \u0060ControlServer.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::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/commands/remote_host.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf169745057ab618c207e5996afdc69d778b42f6191e92ab42fcbd3627181c7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.start_control_server calls \u0060std::fs::symlink_metadata\u0060: \u0060remote_host.start_control_server\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"193e5a654bdcc1a016e02a48a250e2ab5f8cef90a496006225e62725312c32c3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.start_control_server calls \u0060std::fs::remove_file\u0060: \u0060remote_host.start_control_server\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ea918cd3f9020ff483988684a5a43ef3f11888836b04ca69380f4c01e05ab6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.open_lock calls \u0060std::fs::create_dir_all\u0060: \u0060remote_host.open_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::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/commands/remote_host.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da4f0945c0274b11ced2463818a3a7229f24d1f64b4d47c5458145b2cdf95c5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.runtime_path calls \u0060std::fs::create_dir_all\u0060: \u0060remote_host.runtime_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::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/commands/remote_host.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"addc095e4190c49873454734aaf86d557666fb88be86dd83a8b752439157f151"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.ensure_private_dir calls \u0060std::fs::symlink_metadata\u0060: \u0060remote_host.ensure_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":"src/commands/remote_host.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fef5599cf16ab1688bae6657259180c7d1a75629b965148b378d95c5073adbc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.read_descriptor calls \u0060std::fs::read\u0060: \u0060remote_host.read_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::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/commands/remote_host.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3976d7366c3789e6cc12d6b9243246dad3ce73927cf6f0371423e75d7bb3d26"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.set_mode calls \u0060std::fs::set_permissions\u0060: \u0060remote_host.set_mode\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"717838e4122be5388aa3c2f94a4beb1bfb7c4199b7ce4956e656a7d6d4556520"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ServerDescriptor.withdraw calls \u0060std::fs::remove_file\u0060: \u0060ServerDescriptor.withdraw\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"964960cd503246c25c32b49fb8ef0220de3016d3299acf73ea07c6653ae4c357"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ServerDescriptor.live calls \u0060std::fs::symlink_metadata\u0060: \u0060ServerDescriptor.live\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a58c4037c5c0c0eb75d5aa0535c83a247803b7b49b87b11e42f4138af9c6904"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.early_headless_exit_reports_the_child_status calls \u0060std::fs::create_dir_all\u0060: \u0060remote_host.early_headless_exit_reports_the_child_status\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad61096b394839fd141b46c8ef4420d204d8551a968ab36b6b33c07d4a352bc2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.early_headless_exit_reports_the_child_status calls \u0060std::fs::remove_dir_all\u0060: \u0060remote_host.early_headless_exit_reports_the_child_status\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c23cdccd4d614088b68e17e9cf9f4292ef4653f2085403fcf5fbfdeacae216"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.discovery_waits_for_a_live_owner_during_restart_without_spawning calls \u0060std::fs::create_dir_all\u0060: \u0060remote_host.discovery_waits_for_a_live_owner_during_restart_without_spawning\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":1790}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33abd1de57a396c0ef681478fefff0497e4b222778d812d376c307a4fb8e6ff"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.discovery_waits_for_a_live_owner_during_restart_without_spawning calls \u0060std::fs::remove_file\u0060: \u0060remote_host.discovery_waits_for_a_live_owner_during_restart_without_spawning\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e27c226314174f560c43539613e33b8839bb3f68ed32e4ea1f8f887707d7d9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.discovery_waits_for_a_live_owner_during_restart_without_spawning calls \u0060std::fs::remove_dir_all\u0060: \u0060remote_host.discovery_waits_for_a_live_owner_during_restart_without_spawning\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d511138ea1649ffe54f46d554d8c7c459af256d96e312584698768696303bf5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.discovery_succeeds_when_the_live_owner_becomes_ready_within_the_bound calls \u0060std::fs::create_dir_all\u0060: \u0060remote_host.discovery_succeeds_when_the_live_owner_becomes_ready_within_the_bound\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"945678908018b1814c1a7db7888add37ccaba6c13c2f6514df58cd053c407b2f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.discovery_succeeds_when_the_live_owner_becomes_ready_within_the_bound calls \u0060std::fs::remove_dir_all\u0060: \u0060remote_host.discovery_succeeds_when_the_live_owner_becomes_ready_within_the_bound\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ba6a0120ec371f6ede4e78f4a1c41bd81060da3b0b7d09ac65a2f6ad183a64"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.discovery_checks_process_identity_and_a_nonce_proof_without_sending_the_token calls \u0060std::fs::create_dir_all\u0060: \u0060remote_host.discovery_checks_process_identity_and_a_nonce_proof_without_sending_the_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::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/commands/remote_host.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e6c678eac203fb8cfac250491c94bda1b12670867e20538d3254197597fa6c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.discovery_checks_process_identity_and_a_nonce_proof_without_sending_the_token calls \u0060std::fs::rename\u0060: \u0060remote_host.discovery_checks_process_identity_and_a_nonce_proof_without_sending_the_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::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/commands/remote_host.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"d317dc6c47821711ebd12774d60ad53e9c0d8d55ab2d1a9a7a46c121864506d2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.discovery_checks_process_identity_and_a_nonce_proof_without_sending_the_token calls \u0060std::fs::remove_file\u0060: \u0060remote_host.discovery_checks_process_identity_and_a_nonce_proof_without_sending_the_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::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/commands/remote_host.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc3091c2ff59890bd1ac7481b29a97ff9a70c048f463f8c0fe45e31d1b10e27"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.discovery_checks_process_identity_and_a_nonce_proof_without_sending_the_token calls \u0060std::fs::remove_dir_all\u0060: \u0060remote_host.discovery_checks_process_identity_and_a_nonce_proof_without_sending_the_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::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/commands/remote_host.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6298998cfd53aad6cc4d229c1447e7584272b45f39732c259fba75c9c7182b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.concurrent_autostarts_recheck_the_descriptor_under_the_shared_start_lock calls \u0060std::fs::create_dir_all\u0060: \u0060remote_host.concurrent_autostarts_recheck_the_descriptor_under_the_shared_start_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::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/commands/remote_host.rs"},"region":{"startLine":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e7f3773f6be76c46f8416a4615dae99e365e15bc1048efc14a073b681d66a8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.concurrent_autostarts_recheck_the_descriptor_under_the_shared_start_lock calls \u0060std::fs::write\u0060: \u0060remote_host.concurrent_autostarts_recheck_the_descriptor_under_the_shared_start_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::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/commands/remote_host.rs"},"region":{"startLine":2018}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13a70b82e7cdfd3e44576ba7cafbdd2352ec70f1e53cd34c00c075089a2b128"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.concurrent_autostarts_recheck_the_descriptor_under_the_shared_start_lock calls \u0060std::fs::read_to_string\u0060: \u0060remote_host.concurrent_autostarts_recheck_the_descriptor_under_the_shared_start_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::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/commands/remote_host.rs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f419867a1c40da8b8c600cc9c925d6e6cf090342340b79616203f0424fcf017"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.concurrent_autostarts_recheck_the_descriptor_under_the_shared_start_lock calls \u0060std::fs::remove_file\u0060: \u0060remote_host.concurrent_autostarts_recheck_the_descriptor_under_the_shared_start_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":"src/commands/remote_host.rs"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d7b3a41fe9ae5c01216f13814c78f4260e9b89437a0825f576876558150a7e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.concurrent_autostarts_recheck_the_descriptor_under_the_shared_start_lock calls \u0060std::fs::remove_dir_all\u0060: \u0060remote_host.concurrent_autostarts_recheck_the_descriptor_under_the_shared_start_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_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/commands/remote_host.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfd0be4d14bf9528e9eec045335ccc3019ebac588a072b6427968d36e6887f6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.wrong_instance_echo_and_reused_port_refuse_discovery calls \u0060std::fs::create_dir_all\u0060: \u0060remote_host.wrong_instance_echo_and_reused_port_refuse_discovery\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3e2388c6aa17804431ca7c8c1ee7e87bff7041da805238628460c1b4f8c072"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.wrong_instance_echo_and_reused_port_refuse_discovery calls \u0060std::fs::remove_file\u0060: \u0060remote_host.wrong_instance_echo_and_reused_port_refuse_discovery\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d99a6ee411453a3e9102cf4f79dcb28581c5e983513cbbe11f52342fb5ab50e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: remote_host.wrong_instance_echo_and_reused_port_refuse_discovery calls \u0060std::fs::remove_dir_all\u0060: \u0060remote_host.wrong_instance_echo_and_reused_port_refuse_discovery\u0060 runs on the async event loop (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/commands/remote_host.rs"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86e21c4d437e4450579dcd6826603809f2f8d24c69f33858b8dbcdaf3e56aae"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: up.delete_project_inner calls \u0060std::fs::remove_dir\u0060: \u0060up.delete_project_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::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":"src/commands/up.rs"},"region":{"startLine":2968}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77db8ffdc0442c6ba47da4963ea82ca62a06008db20f031e659eb6931da17d8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: api_v2.kept_ranges calls \u0060std::fs::read\u0060: \u0060api_v2.kept_ranges\u0060 runs on the async event loop (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/commands/up/api_v2.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"c598abd24867fe692672ed9f1acfb3f66c2be518d2e5e711bccea0021549e8a8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: api_v2.keep_ranges calls \u0060std::fs::remove_file\u0060: \u0060api_v2.keep_ranges\u0060 runs on the async event loop (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/commands/up/api_v2.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7f5ee6937dc54356e9c6eedda556fb5134b7245b7c022cbe08e254eb66205e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: api_v2.read_log calls \u0060File::open\u0060: \u0060api_v2.read_log\u0060 runs on the async 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/commands/up/api_v2.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbeb8f1db0bb0c00c3f2ecb8f0e5ea1936bb4ef15c6c999d9d42d102f86b0d9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: model_feed.read_cache calls \u0060std::fs::read_to_string\u0060: \u0060model_feed.read_cache\u0060 runs on the async event loop (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/commands/up/model_feed.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4de49c4495763729431179d13c2915327f6b16866abd9821b4feb7d05e3b60"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: model_feed.spawn_refresh calls \u0060std::fs::read\u0060: \u0060model_feed.spawn_refresh\u0060 runs on the async event loop (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/commands/up/model_feed.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b45b9fd7a46885d6dc3961ef7827123d937584e9055c8b7d2d5220a31ef764"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: model_feed.spawn_refresh calls \u0060std::fs::read\u0060: \u0060model_feed.spawn_refresh\u0060 runs on the async event loop (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/commands/up/model_feed.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"f385337ba5c306902fcd93b671d5f6b59d72478fa26035187de40944ccaf2c63"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: model_feed.refresh calls \u0060std::fs::create_dir_all\u0060: \u0060model_feed.refresh\u0060 runs on the async event loop (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/commands/up/model_feed.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baff86ec571868df8c621b3f1e62d420925879377dfe711774be97ecf792710"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: up_remote.reserve_loopback_port calls \u0060TcpListener::bind\u0060: \u0060up_remote.reserve_loopback_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":"src/commands/up_remote.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd558b30448c333542641068ba5b4091d00b9fdafe17d9d212f10b1ba1a95f3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: update.apply calls \u0060std::fs::create_dir_all\u0060: \u0060update.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::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/commands/update.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"188148d7c1616f960242571496c89fcb6983e4b55f4b69cc9ff8c33f93ad12ee"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: update.run_installer calls \u0060std::fs::write\u0060: \u0060update.run_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::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/commands/update.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a12c9cc0a3ff94281dab42c8eeacb706a07040f26e60c7c7041aa0b864d6790"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: update.run_installer calls \u0060std::fs::remove_file\u0060: \u0060update.run_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::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/commands/update.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9903ae4de2c72cf33f71cc25b47054098fdcdb01c854cde0abe74279c099e839"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: SourceSnapshot.from_run calls \u0060std::fs::metadata\u0060: \u0060SourceSnapshot.from_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 \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/compute.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6c7eadd5c4830762218d920fe6819ef79e6d26e9fe11a792004ee91f948fb4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: compute.digest_file calls \u0060File::open\u0060: \u0060compute.digest_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/compute.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"802fe1029f71fab86ca0e2fa7c8f8946aabe75ee39dda42e84d31ac76e136a6d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: compute.remove_hf_staging calls \u0060std::fs::remove_dir_all\u0060: \u0060compute.remove_hf_staging\u0060 runs on the async event loop (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/compute.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8208168d9b4a9280659d624654a26e8029572b51b9347011ec5299f2dfba355b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: compute.submit calls \u0060std::fs::create_dir_all\u0060: \u0060compute.submit\u0060 runs on the async event loop (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/compute.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"b007f49e34470cc1829cd07d73985ab32ab1d11511439fc3d1a0b728ea1f0a5c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: config.overleaf_credentials calls \u0060std::fs::read_to_string\u0060: \u0060config.overleaf_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::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":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"5609e94b28c5ff44dce2b49e980165acf79c568bcdbe5c30bcb7fdaca925091e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: config.synced_env_var calls \u0060std::fs::read_to_string\u0060: \u0060config.synced_env_var\u0060 runs on the async event loop (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":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6362e722a0d7bf475b6cba8ef7eb5288ca165fbe606b4df140934624de8c54"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: config.list_synced_env calls \u0060std::fs::read_to_string\u0060: \u0060config.list_synced_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_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":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74dac30a19d293204ff9681dd51e2392c8f0ec24a0b791be1a2c693e9abb9e7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: config.remove_synced_env_var calls \u0060std::fs::read_to_string\u0060: \u0060config.remove_synced_env_var\u0060 runs on the async event loop (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":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"9937df26022077ada71515a20e6c373a90a7163fb710f2597e1a869c41bad1de"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: config.remove_synced_env_var calls \u0060std::fs::write\u0060: \u0060config.remove_synced_env_var\u0060 runs on the async event loop (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/config.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e3a4f0f58060ad58a561091657afd223fb75d932cdc3e51850731a3e3f50dd"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Local.start calls \u0060std::fs::create_dir_all\u0060: \u0060Local.start\u0060 runs on the async event loop (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/engine/adapters/local.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d0fe86189204c21bfec20ea177d884ca1f2f2b7a97e05aa63884d4fde9ead5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Local.start calls \u0060std::fs::set_permissions\u0060: \u0060Local.start\u0060 runs on the async event loop (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/engine/adapters/local.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72147595879b22eb71dd4177edaba87011628e873dc90f47768754154551bd9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Local.start calls \u0060std::fs::read_to_string\u0060: \u0060Local.start\u0060 runs on the async event loop (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/engine/adapters/local.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"369f0603ee3cec8f91eae97cadc7b615126eca5fc1dcb35cf8d64d57e016dfd2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Local.start calls \u0060File::create\u0060: \u0060Local.start\u0060 runs on the async 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::create\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \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/engine/adapters/local.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c370cd3660edbe61b3e9a528b1341034599c86bbee42dad07eb2177472453ac0"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Local.start calls \u0060std::fs::hard_link\u0060: \u0060Local.start\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::hard_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":"src/engine/adapters/local.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a219def2d36f587664a1fe3ad1893c9b657ee13b049294f71c94994bc441a9c5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Local.start calls \u0060std::fs::remove_file\u0060: \u0060Local.start\u0060 runs on the async event loop (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/engine/adapters/local.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d301448dd7f83c05235b28e810b7659334a48041e614156a78739d55cce7ef"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Local.start calls \u0060std::fs::read\u0060: \u0060Local.start\u0060 runs on the async event loop (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/engine/adapters/local.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c96cfb45181dbbed520e094aa33a82759d953a6bbf1fc2b434ba6814729b2bd"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Local.start calls \u0060std::fs::write\u0060: \u0060Local.start\u0060 runs on the async event loop (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/engine/adapters/local.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"914ad1ceb3e7ef475ee44a1058306cec3ae7f103f514cf9ccdf2e6c10301224a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Local.start calls \u0060std::fs::write\u0060: \u0060Local.start\u0060 runs on the async event loop (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/engine/adapters/local.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"715a0188906853b35f846eb87ed3703935bf9e1e21099438dd32e04d909ab23b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Local.start calls \u0060std::fs::write\u0060: \u0060Local.start\u0060 runs on the async event loop (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/engine/adapters/local.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87a81e924afb191233124eb74f4864fd2d65e894c6ff728ee6212f989e77927"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Local.start calls \u0060std::fs::write\u0060: \u0060Local.start\u0060 runs on the async event loop (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/engine/adapters/local.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0faa811e5e5d9e5f91346637c32233e914c30cc48ccbe0da5c9b0e4640729908"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Local.recover_with_cancel calls \u0060std::fs::read_to_string\u0060: \u0060Local.recover_with_cancel\u0060 runs on the async event loop (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/engine/adapters/local.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b730b89bcdae7ce0e6aca02bdc49a808976e3b59b7fd5e166939674bf34eddf9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Local.observe calls \u0060std::fs::metadata\u0060: \u0060Local.observe\u0060 runs on the async event loop (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/engine/adapters/local.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d3f2aaa540313e3486d52d34bf8235809a75fb51eb3a8217819c65ba9dba37"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Local.observe calls \u0060std::fs::metadata\u0060: \u0060Local.observe\u0060 runs on the async event loop (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/engine/adapters/local.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f2983e90520fc55020d98684b507892678a772bb5a88e1d812e6c8b51d0775"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.kept_page calls \u0060std::fs::read\u0060: \u0060openresearch.kept_page\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a321abde104b074787740d0a56a4d1a2d1747b60fe49625cd467bc0902bd45ec"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.kept_page calls \u0060std::fs::metadata\u0060: \u0060openresearch.kept_page\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ce9b8f36eded0a5fe37b2b3348ef267d4e332acabb03e049442720842991b2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.kept_page calls \u0060std::fs::metadata\u0060: \u0060openresearch.kept_page\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c383a730a705a96c9b19e94347bc494f68cdda36712cc923bdb406ba103ce8c7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.kept_page calls \u0060std::fs::rename\u0060: \u0060openresearch.kept_page\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca46e35046aee02698f478d5da5d6409e6d6076ba2fec83bdee38b6781c5e6c3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.kept_page calls \u0060std::fs::remove_file\u0060: \u0060openresearch.kept_page\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c20ee14a8c07dcf3afac52fae64c7140c3e16309f0cf199116325d22ba66499"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.kept_page calls \u0060std::fs::create_dir_all\u0060: \u0060openresearch.kept_page\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"07758746703c0d7a5e6c32714149282a68d1c7cdd26c995247cfc50ba74813af"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.kept_page calls \u0060File::open\u0060: \u0060openresearch.kept_page\u0060 runs on the async 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/engine/adapters/openresearch.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc2cd1065b447be27c2ce46218e61316f028b3898108fdc27cba837b0315e4e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.a_box_keeps_the_price_it_launched_at_even_if_released_before_its_first_look calls \u0060std::fs::remove_dir_all\u0060: \u0060openresearch.a_box_keeps_the_price_it_launched_at_even_if_released_before_its_first_look\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1208b2808be2bae4caea1712fa5be0e38a88bf8c1fef3a8f0360734a228adeb8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.released_rental_preserves_completed_head_after_tail_failure calls \u0060std::fs::create_dir_all\u0060: \u0060openresearch.released_rental_preserves_completed_head_after_tail_failure\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af5fdf14ec78e8b320fe1ae5fd8c8755fdc7fff14b2ea7a2ec685c415bd28ed"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.released_rental_preserves_completed_head_after_tail_failure calls \u0060std::fs::write\u0060: \u0060openresearch.released_rental_preserves_completed_head_after_tail_failure\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"876d6eeb32e091c37c4d426e582e7c03ba7841bfef3cf1b5900205ce6d3bddbd"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.released_rental_preserves_completed_head_after_tail_failure calls \u0060std::fs::write\u0060: \u0060openresearch.released_rental_preserves_completed_head_after_tail_failure\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"1409e837b006563cc5089e700f0da06d4d9ce0632928c610c26b20d157dc19a2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.released_rental_preserves_completed_head_after_tail_failure calls \u0060std::fs::write\u0060: \u0060openresearch.released_rental_preserves_completed_head_after_tail_failure\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"803fa35131e8c5823068fbaaea2da9e5713fe6da115def5b6fdc515cf509e33e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.released_rental_preserves_completed_head_after_tail_failure calls \u0060std::fs::read\u0060: \u0060openresearch.released_rental_preserves_completed_head_after_tail_failure\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e214752ece1404e3672d8eaa6970afd9a812ae11601905f6a307bd375ae9d421"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.released_rental_preserves_completed_head_after_tail_failure calls \u0060std::fs::remove_dir_all\u0060: \u0060openresearch.released_rental_preserves_completed_head_after_tail_failure\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"53309cfc695181bb4dbdf349c2467610599518da4d54b41545441bfececcfca6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.round_two_rotated_log_discards_obsolete_tail_partial calls \u0060std::fs::create_dir_all\u0060: \u0060openresearch.round_two_rotated_log_discards_obsolete_tail_partial\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"05228a3a7a9e254707ad7c9c02248e7777952e8f2f5692439abcabb05901d447"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.round_two_rotated_log_discards_obsolete_tail_partial calls \u0060std::fs::write\u0060: \u0060openresearch.round_two_rotated_log_discards_obsolete_tail_partial\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d481c541cde16ffaed0d5d5c0370d7f18aff1c13cbc5d69f5a854149544cb4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.round_two_rotated_log_discards_obsolete_tail_partial calls \u0060std::fs::write\u0060: \u0060openresearch.round_two_rotated_log_discards_obsolete_tail_partial\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed6f0bdaaae267ce77f4dd7a9ec375d1d149c335eacdd61e94810748d2cab99"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.round_two_rotated_log_discards_obsolete_tail_partial calls \u0060std::fs::read\u0060: \u0060openresearch.round_two_rotated_log_discards_obsolete_tail_partial\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"906f94e354602c2ce122ea1f8b32d5084ae0dbfb6da732bc6b63eb72b71775a7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: openresearch.round_two_rotated_log_discards_obsolete_tail_partial calls \u0060std::fs::remove_dir_all\u0060: \u0060openresearch.round_two_rotated_log_discards_obsolete_tail_partial\u0060 runs on the async event loop (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/engine/adapters/openresearch.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dab8ae5ac8524e3a7106bd7a9b9bd96e845a54d3bd2cde13f316f69831906f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: process.start_stamp calls \u0060std::fs::read_to_string\u0060: \u0060process.start_stamp\u0060 runs on the async event loop (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/engine/process.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"248c60334de5dc76493327563e2bc3f5129d0e22b065bfb91ba0cade42f185f7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Runtime.collect_log calls \u0060std::fs::read\u0060: \u0060Runtime.collect_log\u0060 runs on the async event loop (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/engine/runtime.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cffaf6a30349535733ddbb26eccf10474618d9684fa3fa3edb85d2efe5f96a5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Runtime.collect_log calls \u0060std::fs::remove_file\u0060: \u0060Runtime.collect_log\u0060 runs on the async event loop (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/engine/runtime.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5013d604d1aac74fd7b52a5d9f21ada7f9cd14c61fd64cf7b5a2b9af5fa3dc2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Runtime.collect_log calls \u0060std::fs::create_dir_all\u0060: \u0060Runtime.collect_log\u0060 runs on the async event loop (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/engine/runtime.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"0692013b4b0a8cf7d39053dfb3cab63508cbb0603011d48f495784d40c1e4150"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Runtime.collect_log calls \u0060std::fs::read\u0060: \u0060Runtime.collect_log\u0060 runs on the async event loop (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/engine/runtime.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cb37c4068d2023ab14aa0b33191452c8a6439cdc4719b0fddd9936ec0f1aea"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Runtime.collect_log calls \u0060std::fs::rename\u0060: \u0060Runtime.collect_log\u0060 runs on the async event loop (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/engine/runtime.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b273046c9ad4c4a293f5ae7e584fce1c57ba664d2b947e8055ebd0b4f39eb2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Runtime.collect_log calls \u0060std::fs::remove_file\u0060: \u0060Runtime.collect_log\u0060 runs on the async event loop (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/engine/runtime.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"431aa090c0fe23017b1c7fc1b0eeb218de4a02a9de4324fba245bc01902046cc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ssh.socket calls \u0060std::fs::create_dir_all\u0060: \u0060ssh.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::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/engine/transport/ssh.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"acaa955ac1208d443155103bf895bec876ec0efeea61586747053ad0ba3751ba"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ssh.socket calls \u0060std::fs::symlink_metadata\u0060: \u0060ssh.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":"src/engine/transport/ssh.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bab451c0ff326ce13e7655f160cc625edc2161d7864083633f853e6d494ca2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ssh.socket calls \u0060std::fs::set_permissions\u0060: \u0060ssh.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::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/engine/transport/ssh.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea5e23886525abb9a8f3c1b5cd9ca68302997a63e66309e9dbd2741f935d20c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ssh.master calls \u0060std::fs::remove_file\u0060: \u0060ssh.master\u0060 runs on the async event loop (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/engine/transport/ssh.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"916674ef3b234507f65e54343ebef1ffbbc3ef1e9583903102396c46a16c3854"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ssh.stop_master calls \u0060std::fs::remove_file\u0060: \u0060ssh.stop_master\u0060 runs on the async event loop (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/engine/transport/ssh.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4780da334302b8c62f39ab2fdbcf4f9e7563c9a5247b5a4228c7f46574b510"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ssh.binary calls \u0060std::fs::metadata\u0060: \u0060ssh.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":"src/engine/transport/ssh.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c6c791ed7f09123fee8be055b710fac7a629fe34bbbb698fa8b6a976c4c142"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ssh.binary calls \u0060std::fs::read\u0060: \u0060ssh.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::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/engine/transport/ssh.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd714ea769428327f3977625062544ccb9e428f526597a2144ba2db2e6d1a88"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: huggingface.resolve_token_with_source calls \u0060std::fs::read_to_string\u0060: \u0060huggingface.resolve_token_with_source\u0060 runs on the async event loop (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/jobs/huggingface.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1e32734e897759af0cc21baa3ee1203d785e3076f36f027215ebbc5eb6845c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: huggingface.run_job_with_source calls \u0060std::fs::create_dir_all\u0060: \u0060huggingface.run_job_with_source\u0060 runs on the async event loop (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/jobs/huggingface.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06c352012886f1e91246a888cf35be5a4cfa66c7eea5add3139ca696cb0996b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: huggingface.run_job_with_source calls \u0060std::fs::hard_link\u0060: \u0060huggingface.run_job_with_source\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::hard_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":"src/jobs/huggingface.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51efb06166ee49619d3723c9e9216ca6bdfc4627a354d1b0a9c46e4b7f0878e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: huggingface.run_job_with_source calls \u0060std::fs::copy\u0060: \u0060huggingface.run_job_with_source\u0060 runs on the async event loop (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":"src/jobs/huggingface.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4cbbb54b1e551a7099c34db628325c8613afe104f50c18e7c648f6fc42f7ea"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: kubernetes.load_settings calls \u0060std::fs::read_to_string\u0060: \u0060kubernetes.load_settings\u0060 runs on the async event loop (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/jobs/kubernetes.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4300354865276f710f62f720818efc4594f94e490513227a10fa2c292b4426"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: localbox.run_alive_via calls \u0060std::fs::read_to_string\u0060: \u0060localbox.run_alive_via\u0060 runs on the async event loop (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/jobs/localbox.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1a87a561094fd8e40bc2c111179393d570cad7a3dfbad650768a740bd5cc59"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: localbox.exit_code_state calls \u0060std::fs::read_to_string\u0060: \u0060localbox.exit_code_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::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/jobs/localbox.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33f260f7b92fba82eafca24cec02d2fb0d3adaabbba1403509d9327bfcb0dce"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: localbox.inspect_job calls \u0060std::fs::read_to_string\u0060: \u0060localbox.inspect_job\u0060 runs on the async event loop (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/jobs/localbox.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc1304a5bb4edf30fa12cb1c18be4e61867f7d8fbe41f4c54ae0f028baf29ba"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: localbox.inspect_job calls \u0060thread::sleep\u0060: \u0060localbox.inspect_job\u0060 runs on the async 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":"src/jobs/localbox.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4adc4ccaf4701bc5b298a094c95caa3f90bbc3cad56d1c4b7dfe5af6d360d7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: localbox.inspect_job calls \u0060std::fs::metadata\u0060: \u0060localbox.inspect_job\u0060 runs on the async event loop (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/jobs/localbox.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6011fe6e8392c460c7d355a793967973737d8b82311ba6a40a78d3475c5780e0"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: localbox.process_group_alive calls \u0060std::fs::read_to_string\u0060: \u0060localbox.process_group_alive\u0060 runs on the async event loop (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/jobs/localbox.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa94bc9a0aef3b83a8aa79ae438c0fe6501db11bb04e3dd14c7d2f5d17c1c2c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: localbox.cancel_job calls \u0060std::fs::read_to_string\u0060: \u0060localbox.cancel_job\u0060 runs on the async event loop (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/jobs/localbox.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61f4fbc478f96d701e5ac17ff492fd1ecba5894c961c29697d54965424cf1d7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: python.prelude calls \u0060std::fs::create_dir_all\u0060: \u0060python.prelude\u0060 runs on the async event loop (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/jobs/localbox/python.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"88504218e706475f05a0425f584c285fc1a3e7c75db5e3045bf92321954862ac"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: python.prelude calls \u0060std::fs::write\u0060: \u0060python.prelude\u0060 runs on the async event loop (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/jobs/localbox/python.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d0551fe214b87401cccbcb3633b83993c69018387f8d39eb6785af20846b52"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: python.exists calls \u0060std::fs::symlink_metadata\u0060: \u0060python.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":"src/jobs/localbox/python.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b7fe15cbd23938261fec116c3799db73f0ee5a6130c25f5bc924150f562f25"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: windows.spawn calls \u0060std::fs::write\u0060: \u0060windows.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::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/jobs/localbox/windows.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"435d0e9661b708caf265560d0ff32085fe8cb6bf7941bc9cacd821d02efa065d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: windows.spawn calls \u0060std::fs::write\u0060: \u0060windows.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::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/jobs/localbox/windows.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fd2e4d9929da623c8feca0bac51e9e7916ab389255ecb1e4486f565ffa8f60"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: windows.open_job calls \u0060std::fs::read_to_string\u0060: \u0060windows.open_job\u0060 runs on the async event loop (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/jobs/localbox/windows.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c47e434c8efb86c973a18205cc6a3b3a146e8e29f7ff51bdc0879e87a3d3f26"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: windows.cancel calls \u0060std::fs::read_to_string\u0060: \u0060windows.cancel\u0060 runs on the async event loop (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/jobs/localbox/windows.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d144cac099f20b316a111dd899204b8ad511855657874d972967dbbba9fe665"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: windows.cancel calls \u0060std::fs::write\u0060: \u0060windows.cancel\u0060 runs on the async event loop (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/jobs/localbox/windows.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a496a4f4a6c49694a91af3f4ba8d2de19817bcfa1eb8b88538a465a2c35131"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: windows.cancel calls \u0060thread::sleep\u0060: \u0060windows.cancel\u0060 runs on the async 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":"src/jobs/localbox/windows.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de0a863b59f7e91ba6ea8e63e4c7876503c3ff4c1333b907f4dad65e98e6929"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ManagedEnv.ensure_in calls \u0060std::fs::remove_dir_all\u0060: \u0060ManagedEnv.ensure_in\u0060 runs on the async event loop (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/jobs/managed_env.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5b516bd34dd38a5f209caf341e2e4be0b88d28a7b524272479bd89d527f2c5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ManagedEnv.ensure_in calls \u0060std::fs::create_dir_all\u0060: \u0060ManagedEnv.ensure_in\u0060 runs on the async event loop (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/jobs/managed_env.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d12f338329a16ed64f602a331314d919f29733f418c6351cc4ad906a1d92ec6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ManagedEnv.create_venv calls \u0060std::fs::remove_dir_all\u0060: \u0060ManagedEnv.create_venv\u0060 runs on the async event loop (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/jobs/managed_env.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a91d424c4ccfbc98923e9b379ad768776ba4ac73c9eba87448e3e456e67fce2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: managed_env.lock_env calls \u0060std::fs::create_dir_all\u0060: \u0060managed_env.lock_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::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/jobs/managed_env.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41ebad6400404d4502827ba648b05fe202caaed2c9c1f57fb1fdae6825454b6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: modal.resolve_token calls \u0060std::fs::read_to_string\u0060: \u0060modal.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":"src/jobs/modal.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb0a18f20571d0996e20a1eb97a7c075e757b14d2faca1208ced47829924078"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ray.load_settings calls \u0060std::fs::read_to_string\u0060: \u0060ray.load_settings\u0060 runs on the async event loop (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/jobs/ray.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"075c6d7ac8c2e2d555f94d67bba532b271e055d7ff1081f8a788728624772277"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: slurm.load_settings calls \u0060std::fs::read_to_string\u0060: \u0060slurm.load_settings\u0060 runs on the async event loop (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/jobs/slurm.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"72388aad6930d163b2c39ee9046f189e583a8e2ce1e9ee9c45b40da706aef122"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ssh.prepare_control_dir calls \u0060std::fs::create_dir_all\u0060: \u0060ssh.prepare_control_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/jobs/ssh.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe1505826638920ddefda3b606349cc7d1a3c9fb6dcc6b04ee24feebf18e178"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ssh.prepare_control_dir calls \u0060std::fs::symlink_metadata\u0060: \u0060ssh.prepare_control_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":"src/jobs/ssh.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5b7afd0e3374a1f52e05fc3a476516f5e741d552e112bbed4b8774a2ac3518"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ssh.prepare_control_dir calls \u0060std::fs::set_permissions\u0060: \u0060ssh.prepare_control_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/jobs/ssh.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8349d8935146bcacdf12ec10a063bf0cec0e9b9feda6c9cace2ea07a49e8d5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ssh.prepare_interactive_connection calls \u0060std::fs::remove_file\u0060: \u0060ssh.prepare_interactive_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_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/jobs/ssh.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc93293b28dc6ae1ada95e469585bb61884c29fb7f81167382ad94d22c3e483"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: hosts.config_file calls \u0060std::fs::read\u0060: \u0060hosts.config_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/jobs/ssh/hosts.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"884c773266410d3f19a6fd35df99a36adf2dc08a4494bbf1ee86b38073fab8aa"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: hosts.config_file calls \u0060std::fs::create_dir_all\u0060: \u0060hosts.config_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":"src/jobs/ssh/hosts.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0609c225f636327a11c368ad078d65bc6a26b9e52a03b7258eb59a4782cf3d83"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: hosts.read calls \u0060std::fs::read_to_string\u0060: \u0060hosts.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::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/jobs/ssh/hosts.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"577705e2b3a76f8a9caa1a2530ffcf010ec3e3ec474daded3cdd913f52047549"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: hosts.add calls \u0060std::fs::remove_file\u0060: \u0060hosts.add\u0060 runs on the async event loop (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/jobs/ssh/hosts.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5c669eeee3abda931214027a8b2b6d468caa34634d21688a2bb5508881b196"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: hosts.add calls \u0060std::fs::read_to_string\u0060: \u0060hosts.add\u0060 runs on the async event loop (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/jobs/ssh/hosts.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32101ddcbeeefa70c3b975a659428c46dfd550c8811abd544b35edbd8f52512"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: hosts.lock calls \u0060std::fs::create_dir_all\u0060: \u0060hosts.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::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/jobs/ssh/hosts.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef100a9130f442aa3c41f994e14f684df5a629ce8bc58cc38a04111d5fe6133"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: logs.load calls \u0060std::fs::read\u0060: \u0060logs.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::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/jobs/ssh/service/logs.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4457be3a1b7043e9efe7e6e0f3ef45b4dcec411bd0e63332c01a6da6f677f12e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: logs.save calls \u0060File::open\u0060: \u0060logs.save\u0060 runs on the async 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/jobs/ssh/service/logs.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f976551b6dad1f1fa21eb7f5453f9e2e20fdc21f330f1bbb907c26056a21f94c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: logs.persist calls \u0060std::fs::create_dir_all\u0060: \u0060logs.persist\u0060 runs on the async event loop (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/jobs/ssh/service/logs.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22eb4bfe677f836fced29081b7bdb80cbb7617ae8123cd80ff977ee23b477eb"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: logs.persist calls \u0060std::fs::remove_file\u0060: \u0060logs.persist\u0060 runs on the async event loop (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/jobs/ssh/service/logs.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e1cb1b83978bfcfb703489a39617c5922dd414676c2b289a7682e2a08bd9ee"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: logs.persist calls \u0060std::fs::remove_file\u0060: \u0060logs.persist\u0060 runs on the async event loop (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/jobs/ssh/service/logs.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"587e28c9031da8fefbc363956cfe39ceeb2fdd83d36fead7ad319cd9fea07fb7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: logs.read_at calls \u0060std::fs::metadata\u0060: \u0060logs.read_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::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/jobs/ssh/service/logs.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"37882016cc8686f4f787a11a122b5a7cdf06327830d7be53a62bd4f933c1a07c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: logs.read_at calls \u0060File::open\u0060: \u0060logs.read_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 \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/jobs/ssh/service/logs.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3773392859e4f2b0bb43a13fbf9ff6b709a2e02073329303184bd8c812720b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: logs.open_current calls \u0060std::fs::read\u0060: \u0060logs.open_current\u0060 runs on the async event loop (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/jobs/ssh/service/logs.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"0811780d6b707f1a4e7103ae60f26e4ed3276a2a11a5abedbd833f42dc1e51be"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: logs.open_current calls \u0060std::fs::metadata\u0060: \u0060logs.open_current\u0060 runs on the async event loop (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/jobs/ssh/service/logs.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8340a03da8091c455cb80e5c6277629f939f9aa393abf08f85dd32a44406b7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: logs.open_current calls \u0060File::open\u0060: \u0060logs.open_current\u0060 runs on the async 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/jobs/ssh/service/logs.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"919989315028bc3907c1313d5e63aadbd396f8e970ab1f4dbc0bd86866707ad9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.private_directory calls \u0060std::fs::create_dir_all\u0060: \u0060service.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":"src/jobs/ssh/service/mod.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f0477d7276e96ea60d7f0895a53bf5e119d95163be526b975bf925e08f1f83"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.private_directory calls \u0060std::fs::symlink_metadata\u0060: \u0060service.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":"src/jobs/ssh/service/mod.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b82ddc7b79af585ecea8f608c660ad158842c47682da91768e81315641cf0d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.private_directory calls \u0060std::fs::set_permissions\u0060: \u0060service.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":"src/jobs/ssh/service/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c206477c68688dd3a104d659c17a76a9f8a4d0d595bfe09d3455f25eb6e1fa6d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.endpoint calls \u0060std::fs::read\u0060: \u0060service.endpoint\u0060 runs on the async event loop (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/jobs/ssh/service/mod.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f259cc62454c81c8a4a4454792e20647ccb73c576890317e9f00bc35f539bce"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: service.askpass calls \u0060std::fs::read\u0060: \u0060service.askpass\u0060 runs on the async event loop (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/jobs/ssh/service/mod.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0176c08bf3e58b591b4c7bc438fe13ea529643a0d624b611fdeaec1ca01e61"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: sharing.update calls \u0060thread::sleep\u0060: \u0060sharing.update\u0060 runs on the async 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":"src/jobs/ssh/sharing.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"507a45fbe466beaed45ea9ab0c50372993c6327334c21005bd757e93ad2a4b91"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: sharing.update calls \u0060std::fs::symlink_metadata\u0060: \u0060sharing.update\u0060 runs on the async event loop (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/jobs/ssh/sharing.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08be420f88710a06cac3d31a63e27184bfd68b8a2de6f39b4948633dc54c88f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: sharing.update calls \u0060std::fs::read\u0060: \u0060sharing.update\u0060 runs on the async event loop (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/jobs/ssh/sharing.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbc070f3c095c232444b35fa39d0caa761d4132c064c79fc4b2c2cf0d4c2a1f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: sharing.update calls \u0060std::fs::read\u0060: \u0060sharing.update\u0060 runs on the async event loop (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/jobs/ssh/sharing.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee344d7c14730e77a65ddd4367b004d6dda64f687e603ce5244d4a88952715c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: sharing.included calls \u0060std::fs::read\u0060: \u0060sharing.included\u0060 runs on the async event loop (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/jobs/ssh/sharing.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c569cffc5e1e55c4640563ed93391ccea6523e3b67578b29b170e352a2cea9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Directory.create calls \u0060std::fs::create_dir\u0060: \u0060Directory.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::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":"src/local/acp.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"c414c3e37afaa8ec3a3d8bbc475da97f92dd58daf539cb5a0224718ad506d4c4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Directory.remove calls \u0060std::fs::remove_dir_all\u0060: \u0060Directory.remove\u0060 runs on the async event loop (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/local/acp.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77c0f57545b53ebe242ff81b1c7f9d0d9a1b0de806c3c492d168ef414148ff2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Directory.remove calls \u0060std::fs::remove_dir_all\u0060: \u0060Directory.remove\u0060 runs on the async event loop (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/local/acp.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aa532c31f1e13d7b1931d4db38ce33c032f3cf50e68debb45c3c61da9891ec"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: agent_profiles.read calls \u0060std::fs::read\u0060: \u0060agent_profiles.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::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/local/agent_profiles.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b98bc1c8de3fa6a94e6cbda19a2cd6b9d68440904c561b21bd808e9c78039f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: agent_profiles.labels calls \u0060std::fs::read\u0060: \u0060agent_profiles.labels\u0060 runs on the async event loop (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/local/agent_profiles.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e8af9bc9ae9a3f75440cdecf87fc741afa79d0fabbc2b102ed255244cf8879"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: agent_profiles.save_labels calls \u0060std::fs::create_dir_all\u0060: \u0060agent_profiles.save_labels\u0060 runs on the async event loop (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/local/agent_profiles.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"787d9011888f6415453ad9561414ef960dd5fc9661899aa1518a9ea8aa084467"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: agent_profiles.create calls \u0060std::fs::remove_dir_all\u0060: \u0060agent_profiles.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/local/agent_profiles.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"1647d2aebac45ac1c0c206d2f0781ef2ebd5a7c8721d511bb998d7b321ae45dd"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: agent_profiles.create calls \u0060std::fs::remove_dir_all\u0060: \u0060agent_profiles.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/local/agent_profiles.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"400446edd8f0f754bdef5986aa05a26264c94945018377db4d0ab4a326ca99af"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: agent_profiles.private_file calls \u0060std::fs::symlink_metadata\u0060: \u0060agent_profiles.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":"src/local/agent_profiles.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"188ebe66af9ebf7e2c0130eb009eac1eb887f7ca55a0d3c053dcc0b394179ad2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: agent_profiles.private_file calls \u0060File::open\u0060: \u0060agent_profiles.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 \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/local/agent_profiles.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c358e5dd04104ccc415b99f0f9a4e3797f0d7c1fada02025df244078de8a6f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: agent_profiles.prepare_home_in calls \u0060std::fs::create_dir_all\u0060: \u0060agent_profiles.prepare_home_in\u0060 runs on the async event loop (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/local/agent_profiles.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bddd5c04d1e1b45d11e13697686a2430501291445e3a917787dc9abae9ea1f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: agent_profiles.prepare_home_in calls \u0060std::fs::set_permissions\u0060: \u0060agent_profiles.prepare_home_in\u0060 runs on the async event loop (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/local/agent_profiles.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"a100c57ec372d7b55022d9a35571719d3e83ba009dc5dec4ae28af32cf5035f3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: agent_profiles.prepare_home_in calls \u0060std::fs::read\u0060: \u0060agent_profiles.prepare_home_in\u0060 runs on the async event loop (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/local/agent_profiles.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e662b6aa7a31fceee548d399784f0e75ab3098d5d39ca37de3bf879b3bfe38"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: agent_profiles.prepare_home_in calls \u0060std::fs::read\u0060: \u0060agent_profiles.prepare_home_in\u0060 runs on the async event loop (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/local/agent_profiles.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"984be80889074cfbfa2d62d4ce049e99c0863a1a9e1afe3456395cc3d53d6643"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: agent_profiles.prepare_home_in calls \u0060std::fs::create_dir_all\u0060: \u0060agent_profiles.prepare_home_in\u0060 runs on the async event loop (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/local/agent_profiles.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f4ebfd5ed6644c47d279d87ff66c3d532141231bbfe0cba848441c78b430b7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.target_event_start calls \u0060std::fs::remove_file\u0060: \u0060chat.target_event_start\u0060 runs on the async event loop (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/local/chat/mod.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e73bbe88da6aac74190cf0786180eb8d39a7faabdf1245121f2453d07b32518"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.target_event_start calls \u0060std::fs::create_dir_all\u0060: \u0060chat.target_event_start\u0060 runs on the async event loop (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/local/chat/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca00095f2a66623a0644e0b0143b3e434310fcb747bf76ff3a1342f284101cee"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.target_event_start calls \u0060File::create\u0060: \u0060chat.target_event_start\u0060 runs on the async 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::create\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \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/local/chat/mod.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b361a127d5d06fd7f364d951676c6282298f318f4e9d67266da7ba2fbfc6f7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.target_event_start calls \u0060std::fs::write\u0060: \u0060chat.target_event_start\u0060 runs on the async event loop (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/local/chat/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e52dad6393f5e18657383120e711e83b77d8e711c9ec0d42274239c63f02a2e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.record_chat_target calls \u0060std::fs::create_dir_all\u0060: \u0060chat.record_chat_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::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/local/chat/mod.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"034acf9d03f73975424d6ba9059f48837ad32d9a8f036093a812e34c8aeb8cfb"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.reconcile_target_file calls \u0060File::open\u0060: \u0060chat.reconcile_target_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/local/chat/mod.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d41967fefeb4ee83417415f8fcb88212f94815ffd5557eb6aab04f99fea1ab"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.reconcile_target_file calls \u0060std::fs::remove_file\u0060: \u0060chat.reconcile_target_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/local/chat/mod.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e60eaa7c93d3085a082923e6e99cc90efb021be448a1ae42c9802470f4b8e4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.remove_target_pointer_if_matches calls \u0060std::fs::read_to_string\u0060: \u0060chat.remove_target_pointer_if_matches\u0060 runs on the async event loop (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/local/chat/mod.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"0915104fd2d33aba304e38f8ab8e671668bb03713db8786af49ed868d935b0de"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.remove_target_pointer_if_matches calls \u0060std::fs::remove_file\u0060: \u0060chat.remove_target_pointer_if_matches\u0060 runs on the async event loop (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/local/chat/mod.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"9340deb1ce67b51ae98e0b2a9d8a8bf4bd5bf4ed7bb2aa461fa0f52cd8e3b9d3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.cleanup_session_transcript_artifacts calls \u0060std::fs::read_dir\u0060: \u0060chat.cleanup_session_transcript_artifacts\u0060 runs on the async event loop (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/local/chat/mod.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"626a170af808d1102676322c0aff933b48da6e1d6e4c491ac764b467ecf9f25a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.cleanup_session_transcript_artifacts calls \u0060std::fs::remove_file\u0060: \u0060chat.cleanup_session_transcript_artifacts\u0060 runs on the async event loop (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/local/chat/mod.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33ee517970a39fd694f39b0d75f615f2d2472ffa945b29d5556edab6fea517e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.cleanup_session_transcript_artifacts calls \u0060std::fs::remove_file\u0060: \u0060chat.cleanup_session_transcript_artifacts\u0060 runs on the async event loop (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/local/chat/mod.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"9532c0dbf5a20f0707782244f2f86c6a3813067d3dbd14458154fc10b3d1a09d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.cleanup_session_transcript_artifacts calls \u0060std::fs::remove_dir_all\u0060: \u0060chat.cleanup_session_transcript_artifacts\u0060 runs on the async event loop (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/local/chat/mod.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a47b2785998c2a6c2f4682d19864ceaf95ab2120b9ec2a949bf06016a8cdcfd"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.attachments_dir calls \u0060std::fs::create_dir_all\u0060: \u0060chat.attachments_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/local/chat/mod.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"662f16366e59b03014b8b9237dcb950a55395c395fafba00631c95ba25a43489"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ChatHost.launch_turn_ctx_locked calls \u0060std::fs::remove_file\u0060: \u0060ChatHost.launch_turn_ctx_locked\u0060 runs on the async event loop (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/local/chat/mod.rs"},"region":{"startLine":6831}}}],"partialFingerprints":{"codehealthFindingId/v1":"496365be16196143e64ea340fe448846160e5e2b017711cf35da02ef7c8ceb38"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ChatHost.stop_turn calls \u0060std::fs::remove_file\u0060: \u0060ChatHost.stop_turn\u0060 runs on the async event loop (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/local/chat/mod.rs"},"region":{"startLine":7141}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c565ba8abca0392533816c2d875faf2c2db02240c745bd53ee42a80ee16b90"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.set_chat_session_env calls \u0060std::fs::create_dir_all\u0060: \u0060chat.set_chat_session_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::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/local/chat/mod.rs"},"region":{"startLine":10196}}}],"partialFingerprints":{"codehealthFindingId/v1":"208b8ef7777461696dcd3ff09c0aa54aad821005ce7f94529e7e86b90943336a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.set_chat_session_env calls \u0060std::fs::write\u0060: \u0060chat.set_chat_session_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/local/chat/mod.rs"},"region":{"startLine":10215}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3fa894914160b9f0d1363d151d90c8bd91170aebbcf62f4dfa3808a7aa71c4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.set_chat_session_env calls \u0060std::fs::write\u0060: \u0060chat.set_chat_session_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/local/chat/mod.rs"},"region":{"startLine":10224}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf0a40a35c9697b8ab9bf17084f4569b64ad493901efa87d1feb224de24d507"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: chat.harness_log calls \u0060std::fs::create_dir_all\u0060: \u0060chat.harness_log\u0060 runs on the async event loop (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/local/chat/mod.rs"},"region":{"startLine":10281}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f5bd17aaa9302da422b4dfc7210c71ca2c4b3451657847b53bf65e56c2a0c3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: subagent.antigravity calls \u0060File::open\u0060: \u0060subagent.antigravity\u0060 runs on the async 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/local/chat/subagent.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"38346397f6db58568c12c6f678f6448b259094d3ecb86d334475a1379892a309"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: files.files_root calls \u0060std::fs::rename\u0060: \u0060files.files_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::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/local/files.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2af131f2394243fa787ba68cecd509bd0b2bde2789d1289ed344b376c03a426"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: files.plan_artifact_cleanup_at calls \u0060std::fs::symlink_metadata\u0060: \u0060files.plan_artifact_cleanup_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::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/local/files.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1b71d0f811ce9172d06709309bd124f9e312fedadc84392696d7522bceaefc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: files.followed_metadata calls \u0060std::fs::metadata\u0060: \u0060files.followed_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::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/local/files.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"242c5ccabc82701cd7632e3ee13cb9b703d33577dfaaf6f111e1470732985a9b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: files.hash_dir calls \u0060std::fs::read_dir\u0060: \u0060files.hash_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::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/local/files.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"11936cb7a4edeb866364827683de1f9456095df3b34165cb4501293ff8e9a941"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.migrate_legacy_project_worktrees calls \u0060std::fs::create_dir_all\u0060: \u0060git.migrate_legacy_project_worktrees\u0060 runs on the async event loop (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/local/git.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e5dd14bf45890f776c83fff531ebbcdff71f21f8277b27fb811fd187e8ad12"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: TemporaryDirectory.new calls \u0060std::fs::create_dir\u0060: \u0060TemporaryDirectory.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::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":"src/local/git.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f1c0dc237f01e0da7573ef29cfe4fd8ad0b7518259a11739f9a5a97bd5ecde"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.initial_snapshot calls \u0060std::fs::symlink_metadata\u0060: \u0060git.initial_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::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/local/git.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"049849f625b5360377d4900ddf76f50fa40d8f1998d5b567ac3601b88cdf7a32"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.initial_snapshot calls \u0060std::fs::read_link\u0060: \u0060git.initial_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_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":"src/local/git.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02c3098e6a33df8e51c985d21ed53edf8d26e0875b0f6d521a5be9c96cbbf9d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.file_backup calls \u0060std::fs::read\u0060: \u0060git.file_backup\u0060 runs on the async event loop (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/local/git.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9704d9eb94f3775ba9350bdec6b1be19ace0d1a30a27b138c32c3c80005483"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.atomic_write_with_mode calls \u0060std::fs::metadata\u0060: \u0060git.atomic_write_with_mode\u0060 runs on the async event loop (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/local/git.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"959d20041797ae886720be15ad44d1cf81d4001e8e1e81b71087270dfe371612"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.atomic_write_with_mode calls \u0060std::fs::set_permissions\u0060: \u0060git.atomic_write_with_mode\u0060 runs on the async event loop (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/local/git.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"af66aa3168b06867ff619ffe9813b18a7794e700c9900bcdcf1cc8995004d785"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.atomic_write_with_mode calls \u0060std::fs::symlink_metadata\u0060: \u0060git.atomic_write_with_mode\u0060 runs on the async event loop (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/local/git.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"3695f0f82317488702cb51ae2ca666627cedab77f6ade3250a7646bfdfdace74"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.atomic_write_with_mode calls \u0060std::fs::rename\u0060: \u0060git.atomic_write_with_mode\u0060 runs on the async event loop (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/local/git.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"202984690d896e8ce66e2695535466cfe69631b20113d752b1675d5aa58350de"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.atomic_write_with_mode calls \u0060std::fs::remove_file\u0060: \u0060git.atomic_write_with_mode\u0060 runs on the async event loop (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/local/git.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aee8a1a7e60b584550424711cd70a9512cacca01e8f485dbd5c4a9063879a6d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.restore_file calls \u0060std::fs::symlink_metadata\u0060: \u0060git.restore_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":"src/local/git.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d1ecbdc89b001a928248fc53956200aab8170f726e92506f7748dce2cd2987"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.restore_file calls \u0060std::fs::remove_file\u0060: \u0060git.restore_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/local/git.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"5718fc289d3cb61cb33352cc43554f01bdc0a421bc07473cdb37466d5baf0e51"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.replace_managed_ignore_file calls \u0060std::fs::read\u0060: \u0060git.replace_managed_ignore_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/local/git.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea560c5eb1c197b00d5babfa9f22fde8c4a3efb78f6ab43c0a7080cf2b80c54"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.prepare_initial_snapshot calls \u0060std::fs::symlink_metadata\u0060: \u0060git.prepare_initial_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::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/local/git.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55aba8aab2c32a6fd61ef99e6d3ba09523efc1f10b59f48debd1d1318244f1f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.create_initial_commit calls \u0060std::fs::create_dir\u0060: \u0060git.create_initial_commit\u0060 runs on the async event loop (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":"src/local/git.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fdfe2a36d93fe32cf81e18b4e5d334b438a746b2f0ec8a4c766c759f850fa7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.initialize calls \u0060std::fs::create_dir\u0060: \u0060git.initialize\u0060 runs on the async event loop (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":"src/local/git.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9964fa44f4b606f7793601c2a714832d7816e982def3a723e024e4c628fd323"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.initialize calls \u0060std::fs::remove_dir_all\u0060: \u0060git.initialize\u0060 runs on the async event loop (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/local/git.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aeaf2a6b00c519c7524902621c8cc1aae23c16f2672473f3cb74f8a55e0ee17"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.clone_public calls \u0060std::fs::remove_file\u0060: \u0060git.clone_public\u0060 runs on the async event loop (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/local/git.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"e527864804b4fda5447e003095e3c5b8b043129465584f3764c6fed52cc89ba8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.empty_config_file calls \u0060std::fs::create_dir_all\u0060: \u0060git.empty_config_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":"src/local/git.rs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b64184403d7e2fd7198dc63109b5818ab67bd0d500aae6420d57e811ac25a2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: git.authenticated_git calls \u0060thread::sleep\u0060: \u0060git.authenticated_git\u0060 runs on the async 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":"src/local/git.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e476fd44b7964f017ce8f7551ff30459a63050ebef962de3f8722bc5436434"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: auth.kimi_keyring calls \u0060std::fs::read_to_string\u0060: \u0060auth.kimi_keyring\u0060 runs on the async event loop (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/local/harness/acp/auth.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9a6382adadfd1f9c6af60d6914a712899e74ddf05e97cb341fd8eacb436181"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: config_auth.json calls \u0060std::fs::read_to_string\u0060: \u0060config_auth.json\u0060 runs on the async event loop (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/local/harness/acp/auth/config_auth.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43765eb24e11b7f41bd33f75e36dbad8ec246dea607d9ba2e3d1acc8c836a0e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: config_auth.toml calls \u0060std::fs::read_to_string\u0060: \u0060config_auth.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/local/harness/acp/auth/config_auth.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f338c0b3472a1c05901dd4cdfbd5508d8cfbf95e0d58aab1f22e4d4c9afb2e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: config_auth.has_login_file calls \u0060std::fs::read_dir\u0060: \u0060config_auth.has_login_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_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/local/harness/acp/auth/config_auth.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"69062509dc7e7d49546c28ffaaa29bbfc5c59f4f2d30b2c3b44b5f4c039f4a4f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: antigravity.take_stop_error calls \u0060std::fs::read\u0060: \u0060antigravity.take_stop_error\u0060 runs on the async event loop (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/local/harness/antigravity.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"f056e2688d3732601731776640aac3b6e59ef10c308ca7ad9806fdfc796800b6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: antigravity.take_stop_error calls \u0060std::fs::remove_file\u0060: \u0060antigravity.take_stop_error\u0060 runs on the async event loop (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/local/harness/antigravity.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e94dedde4ac8d9d60279943bbcb44d0bc22116f566223161c6de7b52e06523"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: antigravity.prepare calls \u0060std::fs::remove_file\u0060: \u0060antigravity.prepare\u0060 runs on the async event loop (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/local/harness/antigravity.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3db6205163d51b0ff6d5365d1763d853cdab2591fc296da04ba79c667c30ee"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: antigravity.prepare calls \u0060std::fs::write\u0060: \u0060antigravity.prepare\u0060 runs on the async event loop (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/local/harness/antigravity.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e2a11a48c5f085615517449d6bceba632f4b48d932ac48f625f45458bef506"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: antigravity.run_turn calls \u0060std::fs::remove_file\u0060: \u0060antigravity.run_turn\u0060 runs on the async event loop (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/local/harness/antigravity.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"160c4bb3662661c1c93a6cbb0e9cb4633844fd4d25081fc4af20176c2366fb18"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: antigravity.run_turn calls \u0060std::fs::metadata\u0060: \u0060antigravity.run_turn\u0060 runs on the async event loop (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/local/harness/antigravity.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b85f5127a0fe3c22d166aa4d4ee78648b06ae471d0ce450f40c99dafa9ea9ff"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: antigravity.turn calls \u0060std::fs::remove_file\u0060: \u0060antigravity.turn\u0060 runs on the async event loop (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/local/harness/antigravity.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b65474122871702a4372dbb0ed638ba8921c31fc00b8d2789b4ebb0d0b65211"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: antigravity.logged_network_failure calls \u0060File::open\u0060: \u0060antigravity.logged_network_failure\u0060 runs on the async 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/local/harness/antigravity.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"b370d3e79061cb919d06beeac14d2ee9cc527b292a0a82a3d14d4c98a9ea302e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: antigravity.compact calls \u0060std::fs::metadata\u0060: \u0060antigravity.compact\u0060 runs on the async event loop (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/local/harness/antigravity.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"475724519eafe4b2cef18024915a139ee286c16dba590f39d039908f64d05d91"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: antigravity.compact calls \u0060std::fs::remove_file\u0060: \u0060antigravity.compact\u0060 runs on the async event loop (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/local/harness/antigravity.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1f753d2157fae91a521f193624c65860f264015ce45a187fba585fa55b6dea"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: antigravity.write_hooks calls \u0060std::fs::create_dir_all\u0060: \u0060antigravity.write_hooks\u0060 runs on the async event loop (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/local/harness/antigravity.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b5bb3602bec424ddb656c2cb5f10c698b655ec2e1d73d70b1865afebee8c62"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: antigravity.write_hooks calls \u0060std::fs::read_to_string\u0060: \u0060antigravity.write_hooks\u0060 runs on the async event loop (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/local/harness/antigravity.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"83acfd7cdecdb0f93e42c703ba9bbed3e9d75c32604b2d2cffb586d8823ec1cf"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: antigravity.write_hooks calls \u0060std::fs::create_dir_all\u0060: \u0060antigravity.write_hooks\u0060 runs on the async event loop (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/local/harness/antigravity.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f5c13fd89ce9ab512383e8da49b14be60c6635c254528f85a23fc2f7d99323"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: antigravity.write_hooks calls \u0060std::fs::write\u0060: \u0060antigravity.write_hooks\u0060 runs on the async event loop (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/local/harness/antigravity.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad89457078aece59bcec046a0951f4e64ebc83c1e12a8720658d38c601eccdd4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: claude.installed_plugin_skills_dirs calls \u0060std::fs::read_to_string\u0060: \u0060claude.installed_plugin_skills_dirs\u0060 runs on the async event loop (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/local/harness/claude.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"da46fc12fdb24a92130949427cf9b9fa755a032d49daec6b9a4364f485964a39"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: claude.plugin_skill_roots calls \u0060std::fs::read_to_string\u0060: \u0060claude.plugin_skill_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/local/harness/claude.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d79dc91ae1c67fdefd77c14d75daf3a6c880449baa285f1f63f454763c2cc8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: claude.write_mcp_config calls \u0060std::fs::create_dir_all\u0060: \u0060claude.write_mcp_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::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/local/harness/claude.rs"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe93dd5181986f6ef179f2261fa84c139f2a45d42cab50d3741f7aca9424c8c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: claude.run_attempt calls \u0060recv\u0060: \u0060claude.run_attempt\u0060 runs on the async 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\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \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/local/harness/claude.rs"},"region":{"startLine":2940}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8d39c852422294f36068c46c5f604e22277be62ec4961ea38007aa88da4e19"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: codex.rollout_turn_model calls \u0060std::fs::read_to_string\u0060: \u0060codex.rollout_turn_model\u0060 runs on the async event loop (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/local/harness/codex.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6f4beca952bffa78f752f34498c249f3aaae6da831fdcbf6e2ebcc5a8e89a9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: codex.profile_auth calls \u0060std::fs::read_to_string\u0060: \u0060codex.profile_auth\u0060 runs on the async event loop (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/local/harness/codex.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e263bf367fc3868bc61ae9304c2622a94e90a4d88a1fbf9caa457687b8116620"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Codex.detect_at calls \u0060std::fs::read_to_string\u0060: \u0060Codex.detect_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::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/local/harness/codex.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e746c768d34892df36a286a0ae753dbcf059d5a5609a3c00bde24689350fdad0"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: codex.codex_playbook calls \u0060std::fs::read_to_string\u0060: \u0060codex.codex_playbook\u0060 runs on the async event loop (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/local/harness/codex.rs"},"region":{"startLine":3489}}}],"partialFingerprints":{"codehealthFindingId/v1":"596df7684c982aadb52fdc98681b99ec99f378e786317ccda413d8a519ad15f2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: codex.ensure_orx_data_dir calls \u0060std::fs::create_dir_all\u0060: \u0060codex.ensure_orx_data_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/local/harness/codex.rs"},"region":{"startLine":4580}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ac7316a397d6d9d6ac8b43094533f9fafc999f6f55534971a27175caebb8ec"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: codex.run_turn_exec calls \u0060std::fs::read_to_string\u0060: \u0060codex.run_turn_exec\u0060 runs on the async event loop (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/local/harness/codex.rs"},"region":{"startLine":4821}}}],"partialFingerprints":{"codehealthFindingId/v1":"5229a46535b5a2561586d1fd2c60f0c323b441466fcb795b7117d5675ae7f61c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: codex.run_turn_exec calls \u0060std::fs::read_to_string\u0060: \u0060codex.run_turn_exec\u0060 runs on the async event loop (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/local/harness/codex.rs"},"region":{"startLine":4840}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e6b67b5cabc810f806f16155d498d3fc0bd2e660f24df22dd5271c1a2a9bfc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: cursor.bundled_launch calls \u0060std::fs::read_dir\u0060: \u0060cursor.bundled_launch\u0060 runs on the async event loop (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/local/harness/cursor.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b73b4396fdb7128189dcdc4758a428f2eb2ccf9008e7f218dd9ee325ff01f6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: cursor.read_log_tail calls \u0060File::open\u0060: \u0060cursor.read_log_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 \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/local/harness/cursor.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f975ac9572d5922dde3607a4b0ff1689eeed4a9607d9f759e4967c7832d0a60a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: cursor.run_turn calls \u0060std::fs::remove_file\u0060: \u0060cursor.run_turn\u0060 runs on the async event loop (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/local/harness/cursor.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceef57b222495d20dfbf35aeb22ff14decacde46e067547fc7f1b92944117c5d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: detect.read_json calls \u0060std::fs::read_to_string\u0060: \u0060detect.read_json\u0060 runs on the async event loop (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/local/harness/detect.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea518449ab52c0979d88647005df2b08c7e8695405bcd3d5e3b32a8f9e61b58"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: managed.try_lock_installations calls \u0060std::fs::create_dir_all\u0060: \u0060managed.try_lock_installations\u0060 runs on the async event loop (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/local/harness/managed.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0d30c526ab4cc9d90bd916b5f5db4121c53b627bf0a72603248893e48f708b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: managed.installed calls \u0060std::fs::read_dir\u0060: \u0060managed.installed\u0060 runs on the async event loop (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/local/harness/managed.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3173a02b536baeb524121426fc92eb8a9ad2188426b59d98a91b164def09d26"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: managed.claude_release calls \u0060std::fs::read\u0060: \u0060managed.claude_release\u0060 runs on the async event loop (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/local/harness/managed.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ab6483513366d7b53850fed566935ba57b71ae1fcd656bb351d7e74c1d3947"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: managed.uninstall_at calls \u0060std::fs::symlink_metadata\u0060: \u0060managed.uninstall_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::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/local/harness/managed.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ec21262ed6197305eca2873dfee5ceef6f08fdde02953419db695a6c20a77b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: managed.uninstall_at calls \u0060std::fs::symlink_metadata\u0060: \u0060managed.uninstall_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::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/local/harness/managed.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd19ca4d27a77ecf8af6e84f75a0559d870550f7a29cdcc6c3b52c7f6d035134"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: catalog.executable calls \u0060std::fs::read\u0060: \u0060catalog.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::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/local/harness/managed/catalog.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"105694b41d95c0706c92277321edddbb446f4f92ddd33241456350ecd1fb69d5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode.user_configs calls \u0060std::fs::read_to_string\u0060: \u0060opencode.user_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::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/local/harness/opencode.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c385ff6136772a07f7c18f0e1bfebef3badad5c680067040f6409d6fd03bcd"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode.snapshot_config calls \u0060std::fs::read_to_string\u0060: \u0060opencode.snapshot_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":"src/local/harness/opencode.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"390f0b516398f408f1aa193964cdb66fce630b352c4080559d3fbbeafb1c035a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode.snapshot_config calls \u0060std::fs::read_to_string\u0060: \u0060opencode.snapshot_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":"src/local/harness/opencode.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9a0b303d28022d338a057309bd93463074e9c8d31aef9361619d56c8326c7a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: latex.run_with_timeout calls \u0060thread::sleep\u0060: \u0060latex.run_with_timeout\u0060 runs on the async 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":"src/local/latex.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef68ad57f65394d82a6659ce90b5053ee32ddff6d948cd2a3a3a20f6162a5db"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: latex.run_with_timeout calls \u0060recv_timeout\u0060: \u0060latex.run_with_timeout\u0060 runs on the async 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":"src/local/latex.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e98dccf850d6ba458b7abd8af11af028b86379eba28f8bc895a1d037e45a8af"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: latex_templates.write_template calls \u0060std::fs::remove_dir_all\u0060: \u0060latex_templates.write_template\u0060 runs on the async event loop (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/local/latex_templates.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5884ad44446c9a6eeb75f21afcd88848157c1c65135079acfda22b79c2b534c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: latex_templates.write_template calls \u0060std::fs::create_dir_all\u0060: \u0060latex_templates.write_template\u0060 runs on the async event loop (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/local/latex_templates.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e39394fb24183f7363dfd6789352b71ac74ea7815073cda0678795e7eb2fbd7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: latex_templates.write_template calls \u0060std::fs::write\u0060: \u0060latex_templates.write_template\u0060 runs on the async event loop (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/local/latex_templates.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"145137445c946067e11315e769c04563de295126896b4979764aaba08ee7b1f2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: latex_templates.collect calls \u0060std::fs::read_dir\u0060: \u0060latex_templates.collect\u0060 runs on the async event loop (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/local/latex_templates.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"31929b742fe9c84366ec0b024641e7eb8bb186499b724cc0bd3daecf26b235f4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: latex_templates.collect calls \u0060std::fs::read\u0060: \u0060latex_templates.collect\u0060 runs on the async event loop (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/local/latex_templates.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"00781d630371e25cb4831c2b288801284c00bf3455969b04b1d50e2555a45239"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: latex_templates.list_in calls \u0060std::fs::read_dir\u0060: \u0060latex_templates.list_in\u0060 runs on the async event loop (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/local/latex_templates.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"daff48a177cfc16a59288a5634f92fbed02f9399179cc7f40847239fbc1c3fd1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: latex_templates.delete_in calls \u0060std::fs::remove_dir_all\u0060: \u0060latex_templates.delete_in\u0060 runs on the async event loop (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/local/latex_templates.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"512ff2f4a05a8fd495fdaea866160d16acde161fe95235bdadf5c3943940e50a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: local_models.read_providers calls \u0060std::fs::read\u0060: \u0060local_models.read_providers\u0060 runs on the async event loop (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/local/local_models.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee7baf0e6b94357eedc3bfef82ca10e9701d9eac6e427b6efa5ffe64cfc705c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: local_models.write_providers calls \u0060std::fs::create_dir_all\u0060: \u0060local_models.write_providers\u0060 runs on the async event loop (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/local/local_models.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ab6205b4e3e6d46928b3a8e0ddd8edc234a349552170f9554ed3409bfd5dfc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: local_models.read calls \u0060std::fs::read\u0060: \u0060local_models.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::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/local/local_models.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"34df39a8306dc70b102bd1092207c4881f5e5d4bdba9b4965bd822469f3b14f5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: local_models.save calls \u0060std::fs::create_dir_all\u0060: \u0060local_models.save\u0060 runs on the async event loop (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/local/local_models.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"82df3d27ede1afaab1e01f9fc52a0c857592c2e4e858fb4561f4c9b73b76569a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_chats.selection_model calls \u0060File::open\u0060: \u0060native_chats.selection_model\u0060 runs on the async 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/local/native_chats.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00a0e61e670a3230ffec668a87c7c1054d8f4a65c45df13706c2a075b88d419"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.child_paths calls \u0060std::fs::read_dir\u0060: \u0060native_store.child_paths\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e35a0f82eb1eb1fbc7aa59164cd57ef247a8e1ead97d3222a2d206ed65af544"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.tree_session_path calls \u0060std::fs::read_dir\u0060: \u0060native_store.tree_session_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_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/local/native_store.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf4760907a59b1e13ad8b1f892e4a8251acb17e89615a378f64fa3622f50b26"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.prepare_opencode calls \u0060std::fs::create_dir_all\u0060: \u0060native_store.prepare_opencode\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c62a5623921353b2bec6563d6288a319017b76cb20c689a790351c0be0f8aa"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.prepare_claude calls \u0060std::fs::create_dir_all\u0060: \u0060native_store.prepare_claude\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d0feaf252c338b277a0df325fe5b61e8168d8f298e64f114a9fc836a8b4c6c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.prepare_codex calls \u0060std::fs::create_dir_all\u0060: \u0060native_store.prepare_codex\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b85b2012f4d45a7c75c1954cfbed077f4f543453db7fbd8e2dabfda1e2e047"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.prepare_codex_links calls \u0060std::fs::create_dir_all\u0060: \u0060native_store.prepare_codex_links\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23eb2c8403558966ad5d830a41027a265cdf386e61410bfb17b376393a29415"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.prepare_codex_links calls \u0060std::fs::symlink_metadata\u0060: \u0060native_store.prepare_codex_links\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"07506537134c42eb8267dfe7e837ac30c543e1f54c272d785fb36dc7de92e6ee"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.prepare_links calls \u0060std::fs::create_dir_all\u0060: \u0060native_store.prepare_links\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"0460edf56f4ede7e68f6ca6670968b7cb4c27180d917fa975f5881aa2b9bf5e3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.prepare_links calls \u0060std::fs::create_dir_all\u0060: \u0060native_store.prepare_links\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63da6ed65cd451c67a2d0a77492088a30c74c4f82e1709b6a7cca149a77b4ba"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.reconcile_link calls \u0060std::fs::symlink_metadata\u0060: \u0060native_store.reconcile_link\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a1028768024b7471a56ade4101fd81f52762a27ce94b3d6893d13a82328500"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.reconcile_link calls \u0060std::fs::symlink_metadata\u0060: \u0060native_store.reconcile_link\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55c07b44bde2f667b842bd03250665f259cc65b57bb9cb3b315e381389d1dbc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.reconcile_link calls \u0060std::fs::read_link\u0060: \u0060native_store.reconcile_link\u0060 runs on the async event loop (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":"src/local/native_store.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ece6df7d9736aee67433ec42e7a33f3cbde1773b5175631841f12a2e79fde1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.reconcile_link calls \u0060std::fs::read_to_string\u0060: \u0060native_store.reconcile_link\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d04dceb394b900b246ca4aaa16c414f2b2b681a607ffa6df9021ed32e677858"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.reconcile_link calls \u0060std::fs::remove_file\u0060: \u0060native_store.reconcile_link\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"9546b5a924ef6bcca0184a645bca1dff9a6482482551e7d8fa79f2f7ff6506b3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.reconcile_link calls \u0060std::fs::remove_file\u0060: \u0060native_store.reconcile_link\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"036f7a6d3854fe51f709fea3e65557288d015b882ed73b730fcd6d9527a26316"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.reconcile_link calls \u0060std::fs::symlink_metadata\u0060: \u0060native_store.reconcile_link\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bd7a09ef5ef17402d6dc8931fb67b91a9ccb70050e9ff804958dab754af331"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.reconcile_link calls \u0060std::fs::read_link\u0060: \u0060native_store.reconcile_link\u0060 runs on the async event loop (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":"src/local/native_store.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"911d099c115c3a89c10933dc037d7e0ac5d2ff4a2b37b19000641f9a32de31a7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.reconcile_link calls \u0060std::fs::read_to_string\u0060: \u0060native_store.reconcile_link\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75ec7e5c75111f0d348a5f78ed621fafc2b580bb0376f53c64d32e6b41c2388"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.reconcile_link calls \u0060std::fs::remove_file\u0060: \u0060native_store.reconcile_link\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb68032cfb2def878d902d49b68637820ca399cfb898a7f8da7d30e5d0edef7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.reconcile_link calls \u0060std::fs::hard_link\u0060: \u0060native_store.reconcile_link\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::hard_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":"src/local/native_store.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"be46dea2ffec461b78cb3dbdd6169fb30879b03a5d77bbb8e17db1695546452d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.reconcile_link calls \u0060std::fs::copy\u0060: \u0060native_store.reconcile_link\u0060 runs on the async event loop (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":"src/local/native_store.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f0da24dc4dd327ca16b7275862627a22e1e8d76362edf626f52d1ff4fec40f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.adopt_managed_file calls \u0060std::fs::copy\u0060: \u0060native_store.adopt_managed_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::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":"src/local/native_store.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1d0d9d4554c581255bca8f89f8eb2f69c0f577ce3eece3eb510c0193a296ce"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.adopt_managed_file calls \u0060std::fs::remove_file\u0060: \u0060native_store.adopt_managed_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/local/native_store.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ef0beba7b6d6634fd39f2a464b600e667a7e24a3ac755290a2a56ab833b098"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.adopt_managed_file calls \u0060std::fs::rename\u0060: \u0060native_store.adopt_managed_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/local/native_store.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"f125cb9e23ea641d4444b317d21f5fc2fdb0df0b49d20d64177e920ae35491f9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.adopt_managed_file calls \u0060std::fs::rename\u0060: \u0060native_store.adopt_managed_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/local/native_store.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a6ab264101680721897beea09122a38bf1b351a684cc9819252df485912504"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.adopt_managed_file calls \u0060std::fs::rename\u0060: \u0060native_store.adopt_managed_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/local/native_store.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da0355ab337e52956f6c2ca0888329ae5720f278f152b5578996a2028cab28e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.adopt_managed_file calls \u0060std::fs::remove_file\u0060: \u0060native_store.adopt_managed_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/local/native_store.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c978ef26243bcb6cb92223531bde5edd68350d99e0870f971a3a9b6d73e9348"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.preserve_conflict calls \u0060std::fs::rename\u0060: \u0060native_store.preserve_conflict\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4bd3362e3219552b8768557a84511d9344560c1a9c97b658e97dc4bf1f651d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.file_hash calls \u0060std::fs::read\u0060: \u0060native_store.file_hash\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"23acdb214a821e44d2d6f2838aaddc99a7b5afd41582896c726b617c30e2ab85"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.write_marker calls \u0060std::fs::write\u0060: \u0060native_store.write_marker\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e72711d06f5bf909d5a13c03f156ed552fa5f189a83b3302349021a87c7b05"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.untrusted_link calls \u0060std::fs::metadata\u0060: \u0060native_store.untrusted_link\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43b308c0e246999d32fc81a37aec19118ee46cbbe861107ce56b48ee696e682"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.copy_tree calls \u0060std::fs::create_dir_all\u0060: \u0060native_store.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::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/local/native_store.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c66fb9ebdca207dca659196e36e6f788d10b47ba6ac025d4d5e9fc92f18f334"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.copy_tree calls \u0060std::fs::read_dir\u0060: \u0060native_store.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":"src/local/native_store.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf791a18ddf703be73a8af264626632890860d6812b28983a8139e3b8ef75829"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.copy_tree calls \u0060std::fs::metadata\u0060: \u0060native_store.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::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/local/native_store.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"008b492f08b2e31a6f1c803b7c8b7e81b286e97094b31f4305ef0beabdef9431"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.copy_tree calls \u0060std::fs::metadata\u0060: \u0060native_store.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::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/local/native_store.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adc9cc9c56fe03888646fb9188d10f5763a7aaff86fc47ba40072adcbf825a3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.copy_tree calls \u0060std::fs::copy\u0060: \u0060native_store.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::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":"src/local/native_store.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52d5afc821199d1bbffe967fb8e17d92abda3a302870aaabe933ec40f6c8c5f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.copy_tree calls \u0060std::fs::copy\u0060: \u0060native_store.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::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":"src/local/native_store.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea60fcd6fc62df53bb0bf947b59e2c68d9cdec2cefe96fd02a92fbfd999f015"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.remove_link calls \u0060std::fs::remove_file\u0060: \u0060native_store.remove_link\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"14364a9c1d78fbdbeb8d471a9af0cd59bdec878645bc5deb4c3c4acf0d541afd"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.remove_link calls \u0060std::fs::symlink_metadata\u0060: \u0060native_store.remove_link\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"8606babb45a713dfe5283b2db364cc7cb06957cb8fe4ddbfcefbc1f90d63b921"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.remove_link calls \u0060std::fs::remove_dir\u0060: \u0060native_store.remove_link\u0060 runs on the async event loop (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":"src/local/native_store.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9366d4dffc8b3f8635319032e685d4a53d40abe5bc5e83b4c6f7c65e0254b1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.remove_link calls \u0060std::fs::remove_file\u0060: \u0060native_store.remove_link\u0060 runs on the async event loop (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/local/native_store.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"78189e82753c67f600728fe06877be80a1cf9305fb192cbf6b98d2d50bb63912"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: native_store.create_symlink calls \u0060std::fs::hard_link\u0060: \u0060native_store.create_symlink\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::hard_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":"src/local/native_store.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"330a45bb5c05ef2c019f5c9ca5b1c10d398f444ea2eebbe7f32ce2bb1da49c10"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode.free_port calls \u0060TcpListener::bind\u0060: \u0060opencode.free_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":"src/local/opencode.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd279664c566019f6b6eb16f74a8a0789b1a4e33ed83b27cd629f75af6e2c14"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode_db.inspect_file calls \u0060std::fs::metadata\u0060: \u0060opencode_db.inspect_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/local/opencode_db.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a81bef943ce582654b1c31ab5b757ec6270dc76f28bc0a436d7d2ccea341963"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode_db.read_journal calls \u0060std::fs::read\u0060: \u0060opencode_db.read_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::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/local/opencode_db.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d464dd26ca518a5f0c61754198194cf8f67c960d2602cbac378e500f0ec3be"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode_db.sync_parent calls \u0060File::open\u0060: \u0060opencode_db.sync_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 \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/local/opencode_db.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e80376fc115dffd4a78f3a14052f5f8422f0cfd79644383ef560c2d5cf2d056"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode_db.normalize_path calls \u0060std::fs::create_dir_all\u0060: \u0060opencode_db.normalize_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::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/local/opencode_db.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9818094622f588b134d61133938e87829deca523f0614cd2c30f39f9ee9a25a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode_db.cleanup_backup calls \u0060std::fs::remove_file\u0060: \u0060opencode_db.cleanup_backup\u0060 runs on the async event loop (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/local/opencode_db.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a37bf5361eb09ec527ebc0a36a110d0012cf7b8efcfb1d0b7863a2d6449c3cb"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode_runtime.resolve_binary_at calls \u0060std::fs::metadata\u0060: \u0060opencode_runtime.resolve_binary_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::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/local/opencode_runtime.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f455f1459c531c61b6073f218e09ad017b96088fe30deb732d5c2b1c4ccebe"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode_runtime.resolve_binary_from_pin calls \u0060std::fs::metadata\u0060: \u0060opencode_runtime.resolve_binary_from_pin\u0060 runs on the async event loop (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/local/opencode_runtime.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5996435ba12b5de06ce45905c9e3d53f10770a12ff47082b1a75134ad324f4a9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode_runtime.resolve_binary_from_pin calls \u0060std::fs::metadata\u0060: \u0060opencode_runtime.resolve_binary_from_pin\u0060 runs on the async event loop (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/local/opencode_runtime.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa53b766ca003f587d1cabf2bd15d0a7e84048c7480fe5002f4150a6aefdd720"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode_runtime.resolve_binary_from_pin calls \u0060std::fs::read\u0060: \u0060opencode_runtime.resolve_binary_from_pin\u0060 runs on the async event loop (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/local/opencode_runtime.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5613d8efc6ad6d6fc998b9bc1e0ab7aeb164dc91cf95da8169f864a8890c8ec8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode_runtime.start_server calls \u0060std::fs::create_dir_all\u0060: \u0060opencode_runtime.start_server\u0060 runs on the async event loop (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/local/opencode_runtime.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"848b462d5ce64a711c0e5cfc8ab019d4cf1bd3589a1b777ea8f3c1680e27f98a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: opencode_signin.code_signin_writes_record_and_releases_child_and_lease calls \u0060std::fs::read\u0060: \u0060opencode_signin.code_signin_writes_record_and_releases_child_and_lease\u0060 runs on the async event loop (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/local/opencode_signin.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"61934b1efaed75f9d20b8f1a47f61b8dbb53ddd0c1d54edd641fd23e41f326c1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: overleaf_live.synced calls \u0060std::fs::read\u0060: \u0060overleaf_live.synced\u0060 runs on the async event loop (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/local/overleaf_live.rs"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc59c9424f9a69a500dc458a68119ff463a11aa204251eb4ce8e6b7fbe87d6d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: prices.current calls \u0060std::fs::metadata\u0060: \u0060prices.current\u0060 runs on the async event loop (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/local/prices.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d4c36ff104c044f51dffae5a81c75248d9a2f9c255b3718c1bd71b249979e7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: prices.current calls \u0060std::fs::read\u0060: \u0060prices.current\u0060 runs on the async event loop (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/local/prices.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"93eda72e1b7637e1faacf832260d516c1c63cf406fcd8ba98875abb78e385fe3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: prices.fetch calls \u0060std::fs::create_dir_all\u0060: \u0060prices.fetch\u0060 runs on the async event loop (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/local/prices.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafcaabe26697c5305b242547b4242e6d3ffcac3bcda48f4e97a10435a287043"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: prices.stale calls \u0060std::fs::metadata\u0060: \u0060prices.stale\u0060 runs on the async event loop (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/local/prices.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d26f99eb533173cf39d29f77abc7795cae22aa4015cae03f2cd97854c9b6092"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: projects.prepare_path calls \u0060std::fs::read_dir\u0060: \u0060projects.prepare_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_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/local/projects.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2323ca41e50f50d3ab1ddadb7f52e3ed479b2e7ac0543fea8a1a9a7f3ffae730"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: projects.prepare_path calls \u0060std::fs::create_dir_all\u0060: \u0060projects.prepare_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::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/local/projects.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8266b90a2bb2c2d38e1a3c43b0aafd5fd74979ca3f94bbe3306d8c41c702b500"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: projects.prepare_path calls \u0060std::fs::create_dir_all\u0060: \u0060projects.prepare_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::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/local/projects.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2877d3e69023fb1c1412bf6a88d9b2168a2f7ee352c779da563f3bd4d73c0168"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: projects.prepare_path calls \u0060std::fs::read_dir\u0060: \u0060projects.prepare_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_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/local/projects.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd22d29aa3156384e317ed5e8718d23a7f6a3b366865a865edddb8837d492537"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: projects.prepare_path calls \u0060std::fs::write\u0060: \u0060projects.prepare_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::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/local/projects.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"423fec870e7eca95cf09b6340d1b2061094af5f8932fdec2dbb7a698cd22334a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.write_zip calls \u0060std::fs::create_dir_all\u0060: \u0060share.write_zip\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"363a02449d16760bf487b10298b5ba07d4e7d4689b659397c31dfa9305c8d246"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.write_zip calls \u0060File::create\u0060: \u0060share.write_zip\u0060 runs on the async 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::create\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \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/local/share.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfe8bc3d293b8b9822cdff5c7c8924bda224e50b84c5d23aabac65446600195"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.write_zip calls \u0060File::open\u0060: \u0060share.write_zip\u0060 runs on the async 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/local/share.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae350122ff24f3b0f031f1d0e5f955b326b8ff814e42a5a3174aebfe45b837f7"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.write_zip calls \u0060std::fs::rename\u0060: \u0060share.write_zip\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff501544095b32bb158a10411bd7638c2c782fbda8dc340277d947f69d24d458"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.write_zip calls \u0060std::fs::remove_file\u0060: \u0060share.write_zip\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"908bd45c1a074828bd2033225d7bce12362209fb6130a579298dded89c1463a4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.move_into calls \u0060std::fs::create_dir_all\u0060: \u0060share.move_into\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"696aafe627e7e76a02209cdc6bf360d5a210df38ec19461b2e3abd061454d908"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.move_into calls \u0060std::fs::rename\u0060: \u0060share.move_into\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"658008c33cc1e90472e5ba624b097db352997c5297dee0df43ebc4efe145d3bd"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.move_into calls \u0060std::fs::copy\u0060: \u0060share.move_into\u0060 runs on the async event loop (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":"src/local/share.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31dc6ed998d9661d45bcb0893f1b4e18a66134e5b816ebc431a658a60d1143b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.files_under calls \u0060std::fs::read_dir\u0060: \u0060share.files_under\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a19054e358ccff5abc613e81e8e8e29c3ad931bc2e904d5aeca4c6f5cedb0f9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.scan_secrets calls \u0060std::fs::read\u0060: \u0060share.scan_secrets\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d28b943fb48261f3bca338e887ebe11072c9e4630ab62e21f1d2db6fccf1b5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.import_into calls \u0060std::fs::read_dir\u0060: \u0060share.import_into\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"9139f7cf220fefcfdb4b96cf9db5f2e8425d66a2d0f43dc3515b759f79487cdc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.import_into calls \u0060std::fs::remove_dir_all\u0060: \u0060share.import_into\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a207c4b1d2f0ac10eacb7682fc8a95b67f77bdd61b0876309dfbc4284257ded"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.import_into calls \u0060std::fs::create_dir_all\u0060: \u0060share.import_into\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a673ee806742a0f311f205645e64f5dcb8014c6e7fa21700a3ac412863f1bb"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.extract calls \u0060File::open\u0060: \u0060share.extract\u0060 runs on the async 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/local/share.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"4825701457297815d2e083a17ff5f29c66842db226c5000a2835cdab323863e2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.extract calls \u0060std::fs::create_dir_all\u0060: \u0060share.extract\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4711cff387c5cb078aba7922c05655e645dd5a351ef4e30be74a656b7076fd"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.extract calls \u0060File::create\u0060: \u0060share.extract\u0060 runs on the async 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::create\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \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/local/share.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"8685bd8b9a22fcad8d1266e31588d491e361c8b9e7f924bd1b0edecb617b0276"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.import_staged calls \u0060std::fs::read\u0060: \u0060share.import_staged\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"291f901acf9c5ff9a242157e3a52414bf5b1610c2ef7e44c32d47462fec81056"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.import_staged calls \u0060std::fs::remove_file\u0060: \u0060share.import_staged\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e38110767272091270053a2fb90cdf5488f6afcea8d98336eee92bb364d0c2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.import_staged calls \u0060std::fs::remove_dir_all\u0060: \u0060share.import_staged\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c77dacb7b75ede0a4e8b0702a19c3513d38b14126fad5e632936e2450752ba2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: share.shared_session calls \u0060std::fs::read\u0060: \u0060share.shared_session\u0060 runs on the async event loop (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/local/share.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e7d4f2f075a3d6a8cb3ade2024302a5bf86eabc84f0dcabb2d0e6e848b53f1"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: shell_env.npx_bins calls \u0060std::fs::read_dir\u0060: \u0060shell_env.npx_bins\u0060 runs on the async event loop (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/local/shell_env.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"06800977f9609e6c0fc59664a12b659066176ce193446720481369d620487d16"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: trackio.used_locally calls \u0060std::fs::read_dir\u0060: \u0060trackio.used_locally\u0060 runs on the async event loop (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/local/trackio.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede7d8c68f5bc7dc9d3a1c6d0058d8e34c641682b5135d2b516057cdc521f23d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.migrate_project_scoped calls \u0060std::fs::read_dir\u0060: \u0060user_skills.migrate_project_scoped\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe2478370734ef83d9517ac9d3b276fcf7a4fcad9cfbabdadc9dff5a6882bca"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.migrate_project_scoped calls \u0060std::fs::remove_file\u0060: \u0060user_skills.migrate_project_scoped\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d234994c729373ed3e93eddbf9111ebb7642b95f51e87d2d0c845d3747835864"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.migrate_project_scoped calls \u0060std::fs::read_dir\u0060: \u0060user_skills.migrate_project_scoped\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a23e7f2ad2b308e50eb22804b646a3a0dc1db0f4cf9672344a758c270f8a9d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.migrate_project_scoped calls \u0060std::fs::remove_file\u0060: \u0060user_skills.migrate_project_scoped\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"308c85cf51bd33c82f12656f68a6e5bb818fba00279bf8f30c7306adae25564e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.migrate_project_scoped calls \u0060std::fs::create_dir_all\u0060: \u0060user_skills.migrate_project_scoped\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2994c18ff1259b4ed34fd5c4afddd7790cfbf1f1241e1dfc9860ee7117297d85"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.migrate_project_scoped calls \u0060std::fs::rename\u0060: \u0060user_skills.migrate_project_scoped\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4574308cb266ebb873a6e5838d600c1fcc9dc825ee4d028832a2ec19e6a735c4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.migrate_project_scoped calls \u0060std::fs::remove_dir\u0060: \u0060user_skills.migrate_project_scoped\u0060 runs on the async event loop (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":"src/local/user_skills.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad95add4298998510e3f17d6998ad6949a7a4405703cdcfd44a2218ffa5cb5e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.migrate_project_scoped calls \u0060std::fs::remove_dir\u0060: \u0060user_skills.migrate_project_scoped\u0060 runs on the async event loop (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":"src/local/user_skills.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d303d770b88374211d4209455d521ea6980bf8a0a94978fff1ff128f2d5d34"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.write_skill calls \u0060std::fs::remove_dir_all\u0060: \u0060user_skills.write_skill\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5319a12e80c4028620c976df76d3ee40bb47610322628b3407cb3e8e266b23"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.write_skill calls \u0060std::fs::create_dir_all\u0060: \u0060user_skills.write_skill\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff90e2fc821be62a8b068d42f37f1d0f33a61feb4eac3b7b01c0fdf336b2c16"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.write_skill calls \u0060std::fs::write\u0060: \u0060user_skills.write_skill\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bd0b908137f61cf2d0abd91665362c4172974d8236ea25e5dc2b667f636f0a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.collect_mirrored calls \u0060std::fs::read_dir\u0060: \u0060user_skills.collect_mirrored\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fa4141d13745d9a4a6b541d4c26251d11bd1f62cca27df714f742f25daa96c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.collect_mirrored calls \u0060std::fs::read_to_string\u0060: \u0060user_skills.collect_mirrored\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d04d6b0609017af7ee9e6d628b6d6fb7481d947b24921a639ce5e1aedd8094b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.read_uploaded_at calls \u0060std::fs::read_to_string\u0060: \u0060user_skills.read_uploaded_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::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/local/user_skills.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2b671a2469bd89c5474f50b2f29572e90512dbc0be9cb71f5e76feb29ef9e6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.list_uploaded_in calls \u0060std::fs::read_dir\u0060: \u0060user_skills.list_uploaded_in\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d515820b589d050690635e168b56a2a7d5edfa51543135de69f061999c5b49"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.previously_managed calls \u0060std::fs::read_to_string\u0060: \u0060user_skills.previously_managed\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"18121648581d8d0b70d54a9e82ee1522bdca0d06fb9fd38bc297a1fceaabcc44"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.dest_matches_source calls \u0060std::fs::read_dir\u0060: \u0060user_skills.dest_matches_source\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c980178566533dfa23c91c6256015b498157592606e04a67b3974e3e5d3edd4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.dest_matches_source calls \u0060std::fs::read\u0060: \u0060user_skills.dest_matches_source\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cfc8dafe2fabd45185cc1ba60138164529bd0239d19c47f4cf7b52f04a1deb"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.instructions_selected_in calls \u0060std::fs::read\u0060: \u0060user_skills.instructions_selected_in\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb45a2a07470e71dca55e64dc4a918d25797b31aa746872a5bb472a47dbd7f4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.instructions_selected_in calls \u0060std::fs::read\u0060: \u0060user_skills.instructions_selected_in\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"058c5eafe45efd7ba0fd78eb167617e9eb8e6bdd32e42cbafde9c602f009aacb"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.tally calls \u0060std::fs::read_dir\u0060: \u0060user_skills.tally\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"2478ebe9f0ccbd2c86334324c8851ab2e5a4f4d8e0ba399807c7ad50d25edf83"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user_skills.mtime_ms calls \u0060std::fs::metadata\u0060: \u0060user_skills.mtime_ms\u0060 runs on the async event loop (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/local/user_skills.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f7ef74ac38ff19bed795abfeb7969ab088bf35a353197011e5583d13290cba"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: paths.canonicalize calls \u0060std::fs::canonicalize\u0060: \u0060paths.canonicalize\u0060 runs on the async event loop (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/paths.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f6e2c1993e3f2be6a0a1f83ac68262e7c04ea92a2b595e6805da8714b74309"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: paths.create_dir_all calls \u0060std::fs::create_dir_all\u0060: \u0060paths.create_dir_all\u0060 runs on the async event loop (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/paths.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4eb22e700db8badfb7c87d3e775027c20ffc402ad73e7fdbaaaccac12f59501"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: process.wait_with_timeout calls \u0060thread::sleep\u0060: \u0060process.wait_with_timeout\u0060 runs on the async 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":"src/process.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c1fffd92107b16ee13a3ff7d70dbe90b69ce293b837fa0072acde6574a186f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: store.open_lifecycle_lock_in calls \u0060std::fs::create_dir_all\u0060: \u0060store.open_lifecycle_lock_in\u0060 runs on the async event loop (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/store.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1573e04ebf5c7a7ad4cb7b895aad8c129cd72f3492ebfa3bf90407f2e0408c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: store.open_lifecycle_lock_in calls \u0060std::fs::hard_link\u0060: \u0060store.open_lifecycle_lock_in\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::hard_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":"src/store.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13eb785440b3b15d8389d27f038cd051daa88f2737175c67fcaadc8c5234072"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: store.acquire_data_dir_lock calls \u0060recv\u0060: \u0060store.acquire_data_dir_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 \u0060recv\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \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/store.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72596a50dbfe6a9e84a7f8e939b7ac61196f8ae1b57edd458323cfd7bea1983"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Store.open_at_with_move_lock calls \u0060std::fs::set_permissions\u0060: \u0060Store.open_at_with_move_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::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/store.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"673cf20df4e23b0202f9ef008834bc7c7d4d74ce4ae598531f531aff7762bdad"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Store.open_at_with_move_lock calls \u0060thread::sleep\u0060: \u0060Store.open_at_with_move_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 \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":"src/store.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"633bf4443450541168bd1fce0e92b28c9ff4b05d84cdf1aa9ac701d687f53b0f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.ssh_settings calls \u0060std::fs::read_to_string\u0060: \u0060telemetry.ssh_settings\u0060 runs on the async event loop (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/telemetry.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ecf8f183d5def8e661cf9b6679d3b33ada4e0941f61ab5a3832b54211bea63"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.read_settings_state calls \u0060std::fs::read_to_string\u0060: \u0060telemetry.read_settings_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::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/telemetry.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c886ed9ae5ebac5bd197ec3ed5c8ebf072eea291b6304a9332f371efa337c86"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.write_settings calls \u0060std::fs::create_dir_all\u0060: \u0060telemetry.write_settings\u0060 runs on the async event loop (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/telemetry.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"0407baf6f5a7e71c4ceb6d2e0b446a7934af28caba5f234a58c9d7b78929aa8e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.write_settings calls \u0060std::fs::write\u0060: \u0060telemetry.write_settings\u0060 runs on the async event loop (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/telemetry.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"6334c54818aea6c0cfd9874f70110ecb9897e7eb1f03c0a7dea279d1ba8f2a34"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.write_settings calls \u0060std::fs::remove_file\u0060: \u0060telemetry.write_settings\u0060 runs on the async event loop (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/telemetry.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5da7005c4ac3637584857cffeaa7eaaf5f22ea9cf6f7cd338632c00deb1944"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.write_settings calls \u0060std::fs::rename\u0060: \u0060telemetry.write_settings\u0060 runs on the async event loop (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/telemetry.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e307e2e3a5121957e1a45dae8bd916a2df07515ab289f8ce80613aa53f4b167"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.write_settings calls \u0060std::fs::remove_file\u0060: \u0060telemetry.write_settings\u0060 runs on the async event loop (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/telemetry.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da7c633920b49eb76c1cec67af1f9f6b6b711529a40d4d96f564098f8ee209e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.lock_settings_file calls \u0060std::fs::create_dir_all\u0060: \u0060telemetry.lock_settings_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":"src/telemetry.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e5311d051f158d081e058983dc7e063bbe8d285cfeeed3931ef24a1691bf1a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.persist_payload calls \u0060std::fs::create_dir_all\u0060: \u0060telemetry.persist_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::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/telemetry.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62783f9fbfc103e3a027e024b3d0191f1d1136c69f2e95fd3a25a7dc453f320"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.persist_payload calls \u0060File::open\u0060: \u0060telemetry.persist_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 \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/telemetry.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d94b44eccbd00c86a7b56bbfcca2eb566a6eb70d3623f3a77dba5666e4aeda"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.deliver_queued_payload calls \u0060std::fs::remove_file\u0060: \u0060telemetry.deliver_queued_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::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/telemetry.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f0445c95d1f835e757244fdb2cd332d2822b43b9dda0fcf76393d83b38e740"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.remove_queued_product_events calls \u0060std::fs::read_dir\u0060: \u0060telemetry.remove_queued_product_events\u0060 runs on the async event loop (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/telemetry.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"276e898885e2444e6cbea0156159673cf08191bb5ebce1003cacbb0a51dd4d85"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.remove_queued_product_events calls \u0060std::fs::read\u0060: \u0060telemetry.remove_queued_product_events\u0060 runs on the async event loop (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/telemetry.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"b203036cfd0e2d0e82255a447471c941586ea167ad749a7c5b8f60b4eceb16cb"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.remove_queued_product_events calls \u0060std::fs::remove_file\u0060: \u0060telemetry.remove_queued_product_events\u0060 runs on the async event loop (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/telemetry.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f1b0a714204e2cd347ab9695f881ed2f223c805bca637834b48e20655a9fa6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.retry_outbox calls \u0060std::fs::read_dir\u0060: \u0060telemetry.retry_outbox\u0060 runs on the async event loop (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/telemetry.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"971b619be281a4c906ac0b57fe06d7f88baf55da64d51e331f3ac8d5c7a19b9f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.retry_outbox calls \u0060std::fs::metadata\u0060: \u0060telemetry.retry_outbox\u0060 runs on the async event loop (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/telemetry.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd27432a7e19dc4396d0982f3c413e6cae6d6b12cbd8aac777618ea662bc82d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.retry_outbox calls \u0060std::fs::read\u0060: \u0060telemetry.retry_outbox\u0060 runs on the async event loop (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/telemetry.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea58ce8bfa576de30ea9c896297a6affc6a88ce42f534c33e6cf10a3d0923034"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: telemetry.retry_outbox calls \u0060std::fs::remove_file\u0060: \u0060telemetry.retry_outbox\u0060 runs on the async event loop (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/telemetry.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03a09a7d738eb4314f2a6f51a68718a75de27940627fef80e4777ba026998e6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.load_receipt calls \u0060std::fs::read_to_string\u0060: \u0060updates.load_receipt\u0060 runs on the async event loop (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/updates.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c9cd8f6a9843e5b07296cfc660c82ef4766605f266b3a6777b2ef8007d4e39"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.remove_retired_exes calls \u0060std::fs::read_dir\u0060: \u0060updates.remove_retired_exes\u0060 runs on the async event loop (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/updates.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34be5fcf91d246972817ed8d5efee9aec2a6179d73862cf4d571578aa8c0a55"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.remove_retired_exes calls \u0060std::fs::remove_file\u0060: \u0060updates.remove_retired_exes\u0060 runs on the async event loop (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/updates.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37c31bec81bb3a4300f01716f9814c9b110d3cf778c2a56aa75a26ee74ecd5c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.rewrite_receipt_version calls \u0060std::fs::read_to_string\u0060: \u0060updates.rewrite_receipt_version\u0060 runs on the async event loop (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/updates.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f2d7fa5f49108d73bda2c3e03e6e19d424038da8536a5c49191d642b730ffa"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.rewrite_receipt_version calls \u0060std::fs::write\u0060: \u0060updates.rewrite_receipt_version\u0060 runs on the async event loop (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/updates.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5dc1efd5cc020a9415d271ddf2f94c7be249b70671443125f647f030acfd50"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.rewrite_receipt_version calls \u0060std::fs::rename\u0060: \u0060updates.rewrite_receipt_version\u0060 runs on the async event loop (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/updates.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3564ea02b68828c657b961158e05f09a36c256098f0fdf3a92bec826cf92ea0"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.rewrite_receipt_version calls \u0060std::fs::remove_file\u0060: \u0060updates.rewrite_receipt_version\u0060 runs on the async event loop (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/updates.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"94348f0a496620d502be128a432340f36070187893593fc0352c535f14a22068"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.probe_writable calls \u0060File::create\u0060: \u0060updates.probe_writable\u0060 runs on the async 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::create\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \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/updates.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"17aad554a70d47c29fdb71c046903dd9efd44923e0ff9b2568b466a42f70dc9c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.probe_writable calls \u0060std::fs::remove_file\u0060: \u0060updates.probe_writable\u0060 runs on the async event loop (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/updates.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"261b457fbf1d5f05c68282f30ec4cbe604882081ecce6916c55c5fdfb6892e6d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.read_cache_from calls \u0060std::fs::read_to_string\u0060: \u0060updates.read_cache_from\u0060 runs on the async event loop (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/updates.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c816ff519a7bd7b5d1bca7546a1996fc30e8b4f643a3e89113eb93737addd4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.read_cache_from calls \u0060std::fs::read_to_string\u0060: \u0060updates.read_cache_from\u0060 runs on the async event loop (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/updates.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"927fda038961bfdc303291728ffc924f95106aa08a28166b2ae9993e852c4136"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.updater_running calls \u0060File::open\u0060: \u0060updates.updater_running\u0060 runs on the async 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/updates.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"03947f4e209fff3bbddafe4e64876d06664c240f81c7545780e8e3bdbf644317"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.staged_release_in calls \u0060std::fs::read_to_string\u0060: \u0060updates.staged_release_in\u0060 runs on the async event loop (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/updates.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8877d3d0990ad16cd5986445e1af9a047f7d452d57359d932d105e9bcce4ba"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.mutate_cache_at calls \u0060std::fs::create_dir_all\u0060: \u0060updates.mutate_cache_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::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/updates.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f67204b722035640f9076b415792ea4d988f7bded6a5cd2e35484d6555be90c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.mutate_cache_at calls \u0060std::fs::write\u0060: \u0060updates.mutate_cache_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::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/updates.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ae08493eed574c8e100b657b9d2a96e716469046df0bd88d282e82f8a50742"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.mutate_cache_at calls \u0060std::fs::remove_file\u0060: \u0060updates.mutate_cache_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_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/updates.rs"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f29d95076fc3d3302ee0442e70a1cc0b39ce1c1d0c8f6ba93f9f4b98372db9d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.mutate_cache_at calls \u0060std::fs::rename\u0060: \u0060updates.mutate_cache_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/updates.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"61552fde4338ec08909f1240fc141028b5204e175fbf856e93c835fac1cdd6fa"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.mutate_cache_at calls \u0060std::fs::remove_file\u0060: \u0060updates.mutate_cache_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_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/updates.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63f12bbf966a7d54cb01b7e99738d9c59b27d6d7b9cb3fefd9261c01434ec0c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.mutate_cache_at calls \u0060std::fs::remove_file\u0060: \u0060updates.mutate_cache_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_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/updates.rs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39cb1e51f508860ee8b0f43bbcaade48120a1b83416c982218349624c71e794"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: updates.file_identity calls \u0060std::fs::metadata\u0060: \u0060updates.file_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::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/updates.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"523a859a07bd79aed604038add1e83084696bf4ffb696481d2bab859364780d4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: macos_app.stage_release calls \u0060std::fs::create_dir_all\u0060: \u0060macos_app.stage_release\u0060 runs on the async event loop (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/updates/macos_app.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"174895dd57be51274962229e9b2d6818ad8052ba83504ec27d840145802c1c06"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: macos_app.stage_release calls \u0060std::fs::remove_dir_all\u0060: \u0060macos_app.stage_release\u0060 runs on the async event loop (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/updates/macos_app.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"923440fac6b2047ef682b7a3e542b4cdb721c530925e812ca4dc50b0b3a21c37"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: macos_app.stage_release calls \u0060std::fs::rename\u0060: \u0060macos_app.stage_release\u0060 runs on the async event loop (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/updates/macos_app.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"92460523432cae30418d71502fcc53bd2879a9ec81c37fa5501a3310f92efdcc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: macos_app.stage_release calls \u0060std::fs::remove_dir_all\u0060: \u0060macos_app.stage_release\u0060 runs on the async event loop (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/updates/macos_app.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"da129a34d353fa707d1fd491750455ffc112d0cb81c2b7e4ab0ac06b60bf769e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: macos_app.stage_verified_app calls \u0060std::fs::write\u0060: \u0060macos_app.stage_verified_app\u0060 runs on the async event loop (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/updates/macos_app.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d073e9a055b7af2cc449df594abde99324c0c9cf33a83c878c405395f65aef63"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: macos_app.stage_verified_app calls \u0060std::fs::remove_file\u0060: \u0060macos_app.stage_verified_app\u0060 runs on the async event loop (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/updates/macos_app.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a0163e9e317d1fd25f66c1dbeda922783b543d6e3f5b31c7900b3535244f02"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: macos_app.sweep_leftovers calls \u0060std::fs::read_dir\u0060: \u0060macos_app.sweep_leftovers\u0060 runs on the async event loop (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/updates/macos_app.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1713fdf0dec9a229f0eef76e4dd4fe4850ec125b3e3478d6b4277347a216079"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: macos_app.sweep_leftovers calls \u0060std::fs::remove_dir_all\u0060: \u0060macos_app.sweep_leftovers\u0060 runs on the async event loop (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/updates/macos_app.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"56938ad491ae116af8d689dd901021d03f571319048307709269b6064786eacf"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: macos_app.sweep_leftovers calls \u0060std::fs::remove_file\u0060: \u0060macos_app.sweep_leftovers\u0060 runs on the async event loop (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/updates/macos_app.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be3e1075ba86813af76c1bc58aae6dab627be89a14cc685bc7bae060acad78b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: windows.install_staged calls \u0060std::fs::remove_dir_all\u0060: \u0060windows.install_staged\u0060 runs on the async event loop (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/updates/windows.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"89102bac682edc7b29b8d84a5188ca408fc05b9f78b02407fef6122004564582"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: windows.swap_staged calls \u0060std::fs::rename\u0060: \u0060windows.swap_staged\u0060 runs on the async event loop (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/updates/windows.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"124061c2c15233eaab885c6d101a591dcdb46607dca9058aeebf88e482d42ed6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: windows.swap_staged calls \u0060std::fs::rename\u0060: \u0060windows.swap_staged\u0060 runs on the async event loop (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/updates/windows.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fd3a61513c4edb37ca0b34222dc53b9c39c68497d7ca34a65f6bfab7ff4bb8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: windows.swap_staged calls \u0060std::fs::rename\u0060: \u0060windows.swap_staged\u0060 runs on the async event loop (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/updates/windows.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e57fd3157aff14e532815aee27f45017add21c5a2daaf8751ffc131c6c5b3c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060wake\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/wrapper.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8792011285836215f70cd5571138dc94718a794c515cd70503f2a8617ffbcc"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060revoke\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/alphaxiv.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29aafc17de3d95438f5b4ba17ee78cdf34920707ca5647ca3254a28b220a6b8"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060open_in_page\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/app.rs"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"84eeb4c556d40e8a4648dabde2a988930230718b6e1d815396fa4c86c7bc0816"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060print_descriptor\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/remote_host.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e960ecc4b0a4f4666c65eb87ba7d43395c08a4ac3a5efa94dbc98817751c62"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_up_port\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/acp/host.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2676eb8b51db837579faf93f7f28cbb48a54ad4b5ab14559f8fa7e4e00fb036"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060emit\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":4273}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f1b8545e119cbb046e02867edff459dd26cce307282ea7fffb1a7c11672789"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060mark_delivery\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":8674}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf64022c45fdfa0eadf4f7ede8945635399630b0c4249251aeb0e0b1f431e38"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_up_auth_token\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":10028}}}],"partialFingerprints":{"codehealthFindingId/v1":"9380498efc3836878900413a35623b823069c2f2eed8563c6c500f500f60049e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_up_port\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/codex.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2401e35dde8f6ef6be7d27ecda6ce63f473645bdf6b615214e6e7c82459e0a2"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_up_port\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/opencode.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac11e8169740a4de7a3baa853f4cda762ba044e7d23789d11b356a59b928ff9"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_event_sink\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/overleaf_live.rs"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4bdbdfdf85703f897c9b3411b4043e4e6a78b614aa8252d0ac3777831f0d4f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_flag\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/telemetry.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"948ed383ee3471d715d206c80c534c2a332fb5869bc32aaf42de2476167fe670"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060detach\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/updates/macos_app.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47e6bc34c0e81ba408c72b87e384a9a70e31d5d7d2c97bd1bbc3c578e349a10"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: demo/nanochat/base/README.md links to \u0060dev/LEADERBOARD.md\u0060, but \u0060demo/nanochat/base/dev/LEADERBOARD.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo/nanochat/base/README.md"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"62281bc5913496238c7f8a0f6856fa6f5022012cde9cab72c0f5ea8a87cadb12"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 2/5 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060.\u0060, \u0060windows/launcher\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060e2e/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":"e2e/package.json"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3589188d4c0d819578020bb458bdcd1b264e4ba87b8b4169441f4c7fd2abd43"}},{"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":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::builder(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/net.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c716ebf8fcb1e9ae2a65773727e13416659ea8c23cff6ee3f8c4d94db23b0c"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::builder(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/net.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e20de217ce88c15c93d4d99868a4c24484c775aaff47e2bb56f3c94798ce079"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060copyState\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":"dev.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"692a6a5caf13bbe84858f9c90518c4e45b8d4a6d553914fc6d7673ec5088baf9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060lstatSync\u0060 in \u0060copyState\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":"dev.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b8cd1beb834c97830eb30a2fab05b8ea64a33cdcbd1f17913a74a306340159"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060cpSync\u0060 in \u0060copyState\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":"dev.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d36f11a9b9104c5ccd4f69b663b0b9a7cd0d6b628155c56649741a363343b7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060copyFileSync\u0060 in \u0060copyState\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":"dev.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a7271584573887f168eaf7b725a47f1e10cfbe4b60ad9537c385861c4a00f3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060linkSync\u0060 in \u0060copyState\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":"dev.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a5a7541d1b656fb9c46b66f15e20c285e9241cf35739d088d9fbdc6901c25c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d197b772bc52316a7b11f2fc8e3fcdad653888514d1f535192e3dc3554ec70"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d8705ab07c733f185c1fe67fb04923d71ef9d5c44819ac115e67a399607183"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"e662e153856f017cd55f6b6ca8f2e08d49d87d43019987a3299bfbcdc0c41ed6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3b62871f4c5b3b204d6e9985a1e82c91da2f306a3421420d4b039b5aa3c16d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fc63c747d28b7805bca6561f319e3a2fd4085dffb022ecabb5a91eb36751b7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"853c651fe646f15f3af0e7ca31b195d88e77162109e99f7cec5849227d988a82"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b72f1dda31714e475e40cce5fb0655357d82b625565e857fffd328cfd05e69"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41e291c3bd57d7194062482e31075007d4c6ead1571050963fbc930716e0670"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e6c954a4539727d5a43d20cb274919439eded3aacd0945f7fa3f649bda60fb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7047d4876086170ab07abb5cd11f83b448aef98f6fe0f6ed1a1791042ee5dca"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8a334998b26ee9b9190f83d97bf103bfda5800326f2e3dc59ac83ceee0e69c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de539b78545690aeeb0ff2ab74f4932c90caa48f36381dcbc71b0953347bd37"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb032e79b400ed8b15e95f550d2129747f4c88257f823109f9f1884200066d7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b319e09692d808185abe899b832da81ee87272903a19754c248ed644c1bb79"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac3bd6d63ff18d6ef29f689f37c32da09c44465ca323a2922ba78808848b76b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060replaceLive\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":"dev.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2eaf1c14cb1862ad157c68b86d6862b2a0c8d5e3be642bd41f800d82755cf54"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060build\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":"dev.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2605a519a016283c2a1c5ab1c6e7cdefe2b46a0c868cae3f305fdfe3a36ef7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060build\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":"dev.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8da490e6e4768762128f16212ea489f38ccba91f2d662905cb4b0bdfa82793"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060build\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":"dev.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b9996040c77c6b763ac12cee8cddac083663e7a83872a4ff46176a62a22076"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060build\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":"dev.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee22b2f730b39d4ed92448064480427232189f09edb2d70d3662dfd0ca987d40"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060build\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":"dev.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"796d6cdaaecb746359707c4cc5d16ce340624535f949e5786335824288277374"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060build\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":"dev.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c2196cb7cb779b9701ba6e19182a009a12b8a7dadc6527b58b228a99c39e9c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060build\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":"dev.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"420545adb2b7d94fe6862b1f7c5e5a55c8ac008c257de65045c30d8c1c33a888"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060copyFileSync\u0060 in \u0060build\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":"dev.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a962f6102fe53da8d7a9cdf8e82d63c109c5469f8ed973db36ee9b06c3b28b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060build\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":"dev.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"723d07ec6f1b407dadd46cef54fee664504ed6df6c56e60b8fc00d24b7d6387d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060copyFileSync\u0060 in \u0060build\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":"dev.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a601064422f8b7ccf86f5b3378917d632beb90f30602845728b777241e27735"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060startUi\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":"dev.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27b1d4d6319abc3f34d8ef5b409c4c60a527411ff98601ddedcb99ce02e0811"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060callback to some\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":"dev.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"5001f68c2a9aaf43ca20ef66a9881c3129b6d140abc5f8fed2a26649864c2bb4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060startUi\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":"dev.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"131d796a7966fbd82a8b19dbe498bd48819cd657743996a5dfaa3fc1dc066cbf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060startup\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":"dev.ts"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddffba9ffd9c2b3c8fdeba34dbbee9bc4abeb36df1f6be4033bffc563e245f1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060startup\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":"dev.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"229827d0e07fc6a3bb6d0c8353a1c15327c5530e95102e1c0747e77e9ddb4ff2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060load\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":"dev.ts"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3697263d0300f586c16e60ca17c13e775da31f5655d5e34a5af68bc4744fa0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060shutdown\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":"dev.ts"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"281ab47252b229b6d0c37abcf8cbb69934922cc0f190f0cf8aa0f2d615c51292"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060serve\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":"dev.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a10028165628d810766c3484ae9cb0781b79a8ce83e662551602c5a746571f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060serve\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":"dev.ts"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"256d009cd7a36ebdca4e2dbcea6f0d96a7e6af439ffcd8d9338c5865d19f3dd5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060serve\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":"dev.ts"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d031b43fec0ccb0085ba80fa015e9c54a239536b16125752961dadb386d7e7c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060serve\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":"dev.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"876f2f0e58d7ffff87668d622ee4b5d95b2709139736c2468ec4624058696689"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060spawnServer\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":"dev.ts"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"be330c658f49eac8b11909940a281c1676a160cce934ff12141cc079ea77db88"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060openSync\u0060 in \u0060spawnServer\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":"dev.ts"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de7e0216d08d15697a125c58eb25f896101417567fd4eb625c186f71155bb39"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060closeSync\u0060 in \u0060spawnServer\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":"dev.ts"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9aef1c07d50d5236fd6a74505ca532652c0d5176703ca48e3f5a17b0a99e300"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060spawnServer\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":"dev.ts"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a9bab9545f5b90fc68299b430c1bc1c231dbcac987d61cc35351a266e20a0f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dev.ts"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7c00e39154e81f2631dc51bce2d6b0fd61ad9b9302d4157c5ef3ff98266978"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dev.ts"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"040a99b68abc3dfcc1e8ff8412a0237ee5e990386f3a28afeb2a8d31ca6ef7cd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060launch\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":"src/local/acp/zcode-runtime.cjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7f9dbd9d7793e145ead786546e9f83bb2f16c92b9694469a0e4a66ad00f732"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060launch\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":"src/local/acp/zcode-runtime.cjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f076f16a61ec4a7efd63cb22b8c61547fd0f25e44a55794faa537141250bd293"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 250 typed \u00B7 145 plain JS \u2014 the untyped files are scripts/build-host.mjs, scripts/build-host.test.mjs, scripts/build-linux-appimage.test.mjs, scripts/canary-manifest.mjs, scripts/canary-tag.mjs, scripts/canary-tag.test.mjs (\u002B139 more). 1 production file(s) opt out entirely with @ts-nocheck \u00B7 0 @ts-ignore suppression(s); the opted-out files are ui/src/routeTree.gen.ts."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (53 matched lines \u00D7 2 locations): scripts/generate-dmg-background.mjs:15 \u00B7 scripts/generate-icon.mjs:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 540 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/generate-dmg-background.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfd37487b520b437fc03cfa62b8f99490de7f8e007283df8af626dc585d2bc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (51 matched lines \u00D7 2 locations): ui/src/queries/chat.ts:321 \u00B7 ui/src/queries/projects.ts:172 \u2014 the two spans are one implementation copied and then locally edited \u2014 508 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":"ui/src/queries/chat.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fbfdb453efad1c313cd7407d3b2762ce8c524bf1505294cf3e4279df8c9a17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): ui/src/components/SettingsPage.tsx:1272 \u00B7 ui/src/components/SettingsPage.tsx:3302 \u2014 the two spans are one implementation copied and then locally edited \u2014 309 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d3a89028920f614d30ec08483c20a3a8190719af30ee660d8852f49d993a29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (41 matched lines \u00D7 2 locations): ui/src/components/ProjectTerminal.tsx:34 \u00B7 ui/src/components/SshConnectTerminal.tsx:220 \u2014 the two spans are one implementation copied and then locally edited \u2014 305 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":"ui/src/components/ProjectTerminal.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"80149d119e8cf7ca998d165b59dfa41ae8ff8fca928a4b79e5a5a136df680bb4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:2391 \u00B7 ui/src/components/ChatPanel.tsx:2431 \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2391}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be1b336903b7cead70ddb803ac81a160fa33e4299c65d4904aca922b195ce18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): ui/src/components/SkillsTab.tsx:375 \u00B7 ui/src/components/SkillsTab.tsx: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SkillsTab.tsx"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f5aecc16cd79541240be5cff78b5d4609e2bf8afe431edf1114bcbba53b8ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): ui/src/components/SkillsTab.tsx:412 \u00B7 ui/src/components/SkillsTab.tsx:504 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SkillsTab.tsx"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b35f30e009afb40e63e6dd38369097b6939ea243c4afc1fd5199e989ffec38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): ui/src/components/SettingsPage.tsx:4344 \u00B7 ui/src/components/SettingsPage.tsx:4374 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4344}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fec58bd14e3138b110e065423f77393accbe6e1f3991d11e2d746dc2cfee811"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): ui/src/components/SettingsPage.tsx:3208 \u00B7 ui/src/components/SettingsPage.tsx:3323 \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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3208}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb9a60ce4ec289bf554e0965d4933291d2cb87582f51598e5f0f013d995e50f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): ui/src/App.tsx:2224 \u00B7 ui/src/components/ArtifactsTab.tsx:685 \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":"ui/src/App.tsx"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ce969e672962824eef4187c02e49ed172b78e6faabbcd0113df6e043945188"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:1025 \u00B7 ui/src/components/ChatPanel.tsx:1249 \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb4cb71745d5f41aa141b484050da47f58971945621dc7266cf195431f330f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:8761 \u00B7 ui/src/components/ChatPanel.tsx:8780 \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":8761}}}],"partialFingerprints":{"codehealthFindingId/v1":"556ac223384a401978ca18f42c957e4f88cb5ef703fa44c6e2f79c3ab896daef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:7190 \u00B7 ui/src/components/ChatPanel.tsx:7298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7190}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a91982776668834e40d4abd39ee4c72b452b1a89e16b1c4bfb2669d1113911"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): ui/src/components/ModelPicker.tsx:1125 \u00B7 ui/src/components/WorkspaceTools.tsx:204 \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":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"62311e4e431fac93422e3ce5bd72c38541cb17097af58a48d93d30c3dff8009c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): ui/src/components/ModelPicker.tsx:765 \u00B7 ui/src/components/ModelPicker.tsx:923 \u2014 the two spans are one implementation copied and then locally edited \u2014 170 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":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0612f1b32f3669b1dfd44b8007666f4313995fa1be1aebdd126e1b3ff1a250e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): ui/src/components/SettingsPage.tsx:1469 \u00B7 ui/src/components/SettingsPage.tsx:3244 \u2014 the two spans are one implementation copied and then locally edited \u2014 164 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75f4ae7cd3ad13d9b53bdde35fd90c77ad88aed32c96b68702791b0957d316b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): ui/src/components/Onboarding.tsx:344 \u00B7 ui/src/components/Onboarding.tsx:373 \u2014 the two spans are one implementation copied and then locally edited \u2014 100 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/Onboarding.tsx"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b54389cb13399249acc6826513c27d571cae80d701f48efe312fc0c16b0f018"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ui/src/components/SettingsPage.tsx:4849 \u00B7 ui/src/components/SettingsPage.tsx:4899 \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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4849}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d21a442da19c3d190e3674c5a459d0fdc1f315f27a4600e2633f10e78151bdc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ui/src/components/ArtifactsTab.tsx:652 \u00B7 ui/src/components/WorktreeTab.tsx:203 \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":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac94d687da5dde2b797e3fbf61f8974bdc7d642b1d976c461d3b3714b688c29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): ui/src/components/SettingsPage.tsx:1428 \u00B7 ui/src/components/SettingsPage.tsx:3202 \u00B7 ui/src/components/SettingsPage.tsx:3317 \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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bd8be8fb11a46501cea3e4ebcddbf6d1f9979b646fb3d32527b2325b851d32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): ui/src/components/tourGeometry.ts:115 \u00B7 ui/src/components/tourGeometry.ts:129 \u2014 the two spans are one implementation copied and then locally edited \u2014 79 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":"ui/src/components/tourGeometry.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63b8bbb718305061050b17abf5b9556428a155484df338dfcec19445b3d1022"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ui/src/queries/overleaf.ts:25 \u00B7 ui/src/queries/overleaf.ts:59 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/queries/overleaf.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6103a840c78751e3cb5dfec3e8c74ccf3650d36c57f2f1970757b19ed78582ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:2904 \u00B7 ui/src/components/ChatPanel.tsx:2944 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2904}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cdd2d659c5016d446233e837542c320ac042a8c76997da7554d816ec629714"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:7207 \u00B7 ui/src/components/ChatPanel.tsx:7324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7207}}}],"partialFingerprints":{"codehealthFindingId/v1":"808d39edf1edb6828ea6628242ef2b1aaf12d5e13034d3b5c46490210fac50d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ui/src/components/MediaPreview.tsx:66 \u00B7 ui/src/components/MediaPreview.tsx:79 \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":"ui/src/components/MediaPreview.tsx"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d4f6457bf054ab0aad22ac7496c19b15caad4e4abb942ea338ad7f77ba6706"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:1477 \u00B7 ui/src/components/ChatPanel.tsx:1517 \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa85d26c87ce0524f85f5278c0b63a032cfefb32d078ace9abeabf58657faf60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ui/src/components/NewProjectForm.tsx:500 \u00B7 ui/src/components/NewProjectForm.tsx:555 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/NewProjectForm.tsx"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a31be2ba8966ea2bd3f5e83995bd90d03f255ba91463d99bf1c8cf43247f15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ui/src/components/SkillsTab.tsx:270 \u00B7 ui/src/components/SkillsTab.tsx:313 \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":"ui/src/components/SkillsTab.tsx"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e0e503a83b2ed0dc3973d7f743f26cdbdb230a0d4ef78cc8dce0d19c2688ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ui/src/queries/chat.ts:383 \u00B7 ui/src/queries/chat.ts:397 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/queries/chat.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb573fe00ca4ce3807a35a4f44e0be66c18c0620561672c569627d1ae68a8975"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/src/api.ts:2369 \u00B7 ui/src/api.ts:2384 \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":"ui/src/api.ts"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d69f7a6d6720ab5a33ef424a1800cb6c56ca0b93ef67c87837ea4ab921ab80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/src/api.ts:2449 \u00B7 ui/src/api.ts:2499 \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":"ui/src/api.ts"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"5314ff8914cb37168e498f16c3b347a2d3644d0040ac113641cd0f7ba1a0b090"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/src/components/ArtifactsTab.tsx:320 \u00B7 ui/src/components/ArtifactsTab.tsx:404 \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":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7e4f8452c555099e1d303a003a687fee29d91e7669cde6120798269a0f85c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:3543 \u00B7 ui/src/components/ChatPanel.tsx:3555 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3543}}}],"partialFingerprints":{"codehealthFindingId/v1":"446af6f6e6f83844df3afa344d451e8bba82e037760aba07c1cfed71ebe8b73d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:6402 \u00B7 ui/src/components/ChatPanel.tsx:7079 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":6402}}}],"partialFingerprints":{"codehealthFindingId/v1":"876bd146856dd2d02b332c7687cf99cbbfdd710de3f4117330406fc722bc4fda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/src/components/ComposerEditor.tsx:136 \u00B7 ui/src/components/MentionMenu.tsx:29 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ComposerEditor.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49e9a6c7b88840c242132d3ec40acbcd16591c698635efe95c0a709e0fb2fd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): ui/src/components/MentionMenu.tsx:57 \u00B7 ui/src/components/SkillMenu.tsx:15 \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":"ui/src/components/MentionMenu.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb7089c8d0890d8026e3e0744ae117bf29633262199252fbc2a1f90393dd1dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/src/components/PdfPreview.tsx:186 \u00B7 ui/src/components/PdfPreview.tsx: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/PdfPreview.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f464d7364fc9478773179452b84bb415d24dd86580a3849c2e4ccedfc8bb737"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/src/components/RemoteStopDialog.tsx:28 \u00B7 ui/src/components/RemoteStopDialog.tsx:41 \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":"ui/src/components/RemoteStopDialog.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8785939cd2e70da4f2899d744619b2835b99b6220d7870d48e29e7d4e9607df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/src/components/SettingsPage.tsx:2144 \u00B7 ui/src/components/SettingsPage.tsx:2426 \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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2144}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d0830b4781ea99d7c41767b10a8c034f7006f9b6f61fe91874cebdea3f344b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/src/components/SkillsTab.tsx:153 \u00B7 ui/src/components/SshConfigDialog.tsx:62 \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":"ui/src/components/SkillsTab.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee460b47b1429aa7ff2184a3f859488761f81ae4fc5f3e2961eef2f51a49fb9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/src/queries/chatState.ts:99 \u00B7 ui/src/queries/chatState.ts:171 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/queries/chatState.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"633fb7a9557836e66a0cb2d4ad42c5b466119a6849d7eb07909d63f3f36bfb41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ui/src/App.tsx:1296 \u00B7 ui/src/App.tsx:1322 \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":"ui/src/App.tsx"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc1f8bd72a4d062f4c343eb6228fad7f312e70cdbd9996263c46e440d0e8ab3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ui/src/components/ArtifactsTab.tsx:287 \u00B7 ui/src/components/FileViewer.tsx:685 \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":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b331bf84c3e2a7ae5e5e4f9477f81baa411dbf41dd732d9f5b929b610d18663"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ui/src/components/BackendLogos.tsx:73 \u00B7 ui/src/components/BackendLogos.tsx: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/BackendLogos.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df7ba47fdb9691180e2d08812bcd5e339c9aa80d6459eb5d064f7005afd4932"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): ui/src/components/ChatPanel.tsx:1683 \u00B7 ui/src/components/ChatPanel.tsx:1693 \u00B7 ui/src/components/ChatPanel.tsx:1703 \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdbace0d2d081c129ccba15157992d09f8b2215eb5218d096e1b2fa6646465b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:1734 \u00B7 ui/src/components/ChatPanel.tsx:1753 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c66c5748ad39e642fdef5beb54c833acc30112c915e1c46fd3b47c923411d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:2646 \u00B7 ui/src/components/ChatPanel.tsx:6708 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a56cb5dccf99c0c27b210ae208d87dd5d5d3ebbea27395fee0f64e937f9ba0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:3572 \u00B7 ui/src/components/ChatPanel.tsx:3861 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3572}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e4bf0bfa9d7e56358e0a1af4c213322ac680cdcd683d60a293892ef6559bdc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ui/src/components/CodeTab.tsx:66 \u00B7 ui/src/components/WorktreeTab.tsx:105 \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":"ui/src/components/CodeTab.tsx"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e350a406235bc7d9cc040cd131462f7b963ae4fa3a5195620d9192dcddb641b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): ui/src/components/ModelPicker.tsx:1065 \u00B7 ui/src/components/SkillChips.tsx:113 \u00B7 ui/src/components/WorkspaceTools.tsx:171 \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":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e6a3254151c1c2e5a97966c4cb90b871a357f3e474734d29fb0dadd7c05a8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): ui/src/components/ReproducePage.tsx:23 \u00B7 ui/src/routePages.tsx:69 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ReproducePage.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0471a2428f155b68650dbd8472ccae16af15cdbcfbc17aa582918546df8bba5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ui/src/components/SettingsPage.tsx:1200 \u00B7 ui/src/components/SettingsPage.tsx:4242 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef89ede6bc2910f450002fd4a4cb0bb39be7af14b8cad3c7a3b85204bc2d249"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): ui/src/logWindow.ts:196 \u00B7 ui/src/logWindow.ts:224 \u2014 the two spans are one implementation copied and then locally edited \u2014 86 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":"ui/src/logWindow.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ed1311e834db0696185586a845d25b1b9df8396e22ca3c00b00e9e216e87b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 16 locations): ui/src/queries/chat.ts:37 \u00B7 ui/src/queries/files.ts:75 \u00B7 ui/src/queries/projects.ts:15 \u00B7 ui/src/queries/projects.ts:45 \u00B7 \u002B12 more site(s) not listed \u2014 the 16 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/queries/chat.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f483e7c414c76078f2ee70f6a38b8d1b99f8ea4f86b11d73b4baf2251ca78b8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): ui/src/App.tsx:1933 \u00B7 ui/src/App.tsx:1948 \u00B7 ui/src/App.tsx:1965 \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":"ui/src/App.tsx"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56c853f3292ae8c1d4c7ba3b2228660d83b2428a1920169ae12103d38838eb1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:2755 \u00B7 ui/src/components/ChatPanel.tsx:4410 \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2755}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7ae4c0daff5f31cbf15f4b729ae935b72dc30716bd4fbdc97bbf6074044e97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:3729 \u00B7 ui/src/components/PlanStrip.tsx:106 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3729}}}],"partialFingerprints":{"codehealthFindingId/v1":"48633bd21452b74307764d80adaa5c978ba1e2e3515e45eb59222a1b2f2ee119"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:5201 \u00B7 ui/src/components/OverleafPanel.tsx:60 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":5201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c233617856dee1bc65789f49348ca64f7b4d3e4163ed5d7625b5022523fdaad9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/src/components/NewProjectForm.tsx:387 \u00B7 ui/src/components/NewProjectForm.tsx:396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/NewProjectForm.tsx"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb37cfdad146caec201bafce9236b0cd5dabda8505664ac04e4bba2d6ca34dae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/src/components/SettingsPage.tsx:3278 \u00B7 ui/src/components/SettingsPage.tsx:3287 \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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3278}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6cf84a33160f0b71b3ddd4729329278cf4c87060e7dbe09fb3832ba94a04c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): ui/src/fileMentions.ts:101 \u00B7 ui/src/fileMentions.ts:114 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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":"ui/src/fileMentions.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"339c477be64c885aa9783c89c9b6fd448b607c0576bb7db7aa6d14bbf3c13157"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 12 locations): ui/src/queries/files.ts:80 \u00B7 ui/src/queries/projects.ts:20 \u00B7 ui/src/queries/projects.ts:50 \u00B7 ui/src/queries/settings.ts:23 \u00B7 \u002B8 more site(s) not listed \u2014 the 12 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":"ui/src/queries/files.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd6655bf674b8e9d75489244cc0dc75fb36c556cd002e916aedfe9b2d92fc8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): ui/src/queries/projects.ts:24 \u00B7 ui/src/queries/projects.ts:54 \u00B7 ui/src/queries/settings.ts:177 \u00B7 ui/src/queries/settings.ts:240 \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":"ui/src/queries/projects.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f28489eea17f690648f90183b7a9c76ba7f07aa4f271f068d0e5ab9e0f6aed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7 locations): ui/src/queries/settings.ts:441 \u00B7 ui/src/queries/settings.ts:452 \u00B7 ui/src/queries/settings.ts:463 \u00B7 ui/src/queries/settings.ts:474 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 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":"ui/src/queries/settings.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"932e5777ae5e5281b95371230915d1395ae9361d97ba4934511e47c70e7f9af9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/src/App.tsx:1080 \u00B7 ui/src/App.tsx:1103 \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":"ui/src/App.tsx"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"1334ab4b94aa463a7b0d296dfb39b172d3f8e776eaedfd4c3e29335ef1c54442"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): ui/src/App.tsx:1124 \u00B7 ui/src/App.tsx:1302 \u00B7 ui/src/App.tsx:1328 \u00B7 ui/src/App.tsx:1608 \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":"ui/src/App.tsx"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b77132c1630079e1aab8d6a72c71e66b43f8e2f0817bd8ebb4c8c56dd16b9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/src/App.tsx:1143 \u00B7 ui/src/App.tsx:1291 \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":"ui/src/App.tsx"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd2f0174d2b24939e7f9a53bb5b1d4e356d2baf08c5fd31f278223333820f77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/src/App.tsx:1708 \u00B7 ui/src/App.tsx:1752 \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":"ui/src/App.tsx"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"7250bf064a20b7ed3af6191b125269d81e6f24daa75d3bb321f3a8fc5065fbe3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/src/App.tsx:1721 \u00B7 ui/src/App.tsx:1763 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabe5f3a6bdea7afe12ddcbd63aa4fb7f1ee90497f3c203af63a8d8d5b6cbeba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): ui/src/App.tsx:1903 \u00B7 ui/src/App.tsx:1947 \u00B7 ui/src/App.tsx:1964 \u00B7 ui/src/App.tsx:1980 \u00B7 \u002B1 more site(s) not listed \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":"ui/src/App.tsx"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32ee7d6b97dc64e033a6dca068be1b64010174207a7573f6b767ea7206ae7e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): ui/src/components/AcpHarnessDialog.tsx:108 \u00B7 ui/src/components/SettingsPage.tsx:3402 \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":"ui/src/components/AcpHarnessDialog.tsx"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6660a5113530ed63d08807f8af0fb3cbd3084f18612ade2feafd98fc9d9886ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): ui/src/components/BackendLogos.tsx:50 \u00B7 ui/src/components/BackendLogos.tsx:95 \u00B7 ui/src/components/BackendLogos.tsx:155 \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":"ui/src/components/BackendLogos.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"455398c7ef5c6b05ba3b458f4c8c298438958824f7f2c16786fd8f33bdee42a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:4548 \u00B7 ui/src/components/ChatPanel.tsx:4559 \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4548}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b81ac313876d7ad1e7012ce9ed1069319300e400873cffbaf2d70f6aba21a2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:5300 \u00B7 ui/src/components/FileTreeActions.tsx:62 \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":5300}}}],"partialFingerprints":{"codehealthFindingId/v1":"643b1ae21b1c4cb35a6950c59eae57aa18983990c639d7fad9de38561baf7209"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:8782 \u00B7 ui/src/components/ChatPanel.tsx:8801 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":8782}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9681cc3dcc2a99de277defbf28b2df88db70a503b3d515152ed57cadff9485"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/src/components/FileViewer.tsx:717 \u00B7 ui/src/components/FileViewer.tsx:728 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/FileViewer.tsx"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"94dc75a1b0b17ad493c2b6add2be49c45be0f2117712ce3d0debccf05f245b16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/src/components/TreeView.tsx:593 \u00B7 ui/src/components/TreeView.tsx:603 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/TreeView.tsx"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77c74bb7441d97ac01fd5df6d477ad3c31fcbaaf7acd9df50436abf658d485d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/src/components/ui/Button.tsx:34 \u00B7 ui/src/components/ui/Button.tsx:46 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ui/Button.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a0866ba88a51ef0d0f7f512e5885e662cce8d85f6f0026b871ffd4d80bc128"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/src/App.tsx:2208 \u00B7 ui/src/App.tsx:2402 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a61634b937dbc63eec1bfebbfe1d3f52469a05ad976ebb7f24b8389eedefc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/src/components/AddAgentDialog.tsx:304 \u00B7 ui/src/components/Onboarding.tsx:102 \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":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70a458f1913c3fc9bc8b25e186e0827b8e42b2575e6909f1bba8eb7507aee7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): ui/src/components/AddAgentDialog.tsx:978 \u00B7 ui/src/components/AddAgentDialog.tsx:1024 \u00B7 ui/src/components/AddAgentDialog.tsx:1251 \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":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"e135503a037953dec9f3b50a2281cd04c961e2772c11d90cbbfb7b2ff29d7883"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/src/components/AgentIcon.tsx:199 \u00B7 ui/src/components/AgentIcon.tsx:260 \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":"ui/src/components/AgentIcon.tsx"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b61cd0e03b246d8d5325e0cdc23238d3cf37f1d4b8d07c7cc674551b11ea62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:7181 \u00B7 ui/src/components/ChatPanel.tsx:7286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0edeacb61ffec7f7b8604d30e9e70b1d5cae0f8abec7dc0b851cdbe1b02745a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/src/components/ExperimentsTable.tsx:72 \u00B7 ui/src/components/TreeView.tsx:494 \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":"ui/src/components/ExperimentsTable.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5253d8fd9bae5bd3745bb5e0d447c6b89cc3ac9388501ea418e733f0f4a5fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/src/components/SettingsPage.tsx:3780 \u00B7 ui/src/components/SettingsPage.tsx:3927 \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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3780}}}],"partialFingerprints":{"codehealthFindingId/v1":"759a64a2b25ca310cfd572bf4c6381432ba5df7824b78db002f8ace3b6783910"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/src/composerCommands.ts:80 \u00B7 ui/src/fileMentions.ts:23 \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":"ui/src/composerCommands.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"83847bd1e0564872b5d0a1a295d3ce955567e991c755851b6216f4d0f986c647"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): ui/src/dialog.tsx:339 \u00B7 ui/src/dialog.tsx:348 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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":"ui/src/dialog.tsx"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"b628c761d7edaa8037797b0caf821e94a39222d8eb1683457d28bc6a5f062de3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/src/keyboardNavigation.ts:38 \u00B7 ui/src/keyboardNavigation.ts:57 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/keyboardNavigation.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"51242571971283012c678192328a0d48a17aa0fcb8c6642cc7a2770c70312736"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/src/queries/settings.ts:92 \u00B7 ui/src/queries/settings.ts:102 \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":"ui/src/queries/settings.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38c3a13e7d824dad4a38a4aab8270e53f5772ce492fc4bf2a4125da4dc9849a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ui/src/api.ts:2103 \u00B7 ui/src/api.ts:2109 \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":"ui/src/api.ts"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ff51dcaa36f43e8c8ddf92022f1720a840d2beed524b82d5af1e75690c6641"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): ui/src/api.ts:2627 \u00B7 ui/src/api.ts:2638 \u00B7 ui/src/api.ts:2998 \u00B7 ui/src/api.ts:3011 \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":"ui/src/api.ts"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7dc94198d8c98a5c733ec6baf1aa56d686c7c58b855a09ffc329639aa85fbef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:2975 \u00B7 ui/src/components/ChatPanel.tsx:4026 \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2975}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d13f3992165621afec289351604391522f771331a6496d3fa3d35250aff0f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:5749 \u00B7 ui/src/components/LocalModelSetup.tsx:112 \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":5749}}}],"partialFingerprints":{"codehealthFindingId/v1":"963fc88a25c8c9dbbe77dc5d765073ff1c4fe2550493b7d77d2b0d73a69bc3dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:648 \u00B7 ui/src/components/ChatSearch.tsx:144 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9549765425e63a0d66c62c6017b3cf1f108645bb1b994d79a0e270e0d3ae5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): ui/src/components/ExperimentsTable.tsx:72 \u00B7 ui/src/components/TreeView.tsx:494 \u00B7 ui/src/components/experimentLineageModel.ts:80 \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":"ui/src/components/ExperimentsTable.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f0a0293d8e021c8043cc0757e2a313022ef21a25580f30bbe346d5353787a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ui/src/components/ProjectInfoCard.tsx:79 \u00B7 ui/src/components/ProjectInfoCard.tsx:88 \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":"ui/src/components/ProjectInfoCard.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cd18ce9eff7e0631873502e9116fca74543c4f21a0e5b68cfa8c31059cff27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ui/src/components/RunContactNotice.tsx:130 \u00B7 ui/src/components/RunContactNotice.tsx:140 \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":"ui/src/components/RunContactNotice.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"265904e8082a6f6c35ca3cfdeff26e875b8bf51a91ed9ae224b5ab667aade986"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ui/src/components/SettingsPage.tsx:2037 \u00B7 ui/src/components/SettingsPage.tsx:2375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8c5cdcd8276cfe141c4467f66817982d113b1841159d107c80444b57af1d59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): ui/src/components/SettingsPage.tsx:2377 \u00B7 ui/src/components/SettingsPage.tsx:3307 \u00B7 ui/src/components/SettingsPage.tsx:4600 \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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a9f86acbf8a7f2b3f2a821f33c84cdec8c345cb20f6a7c091fce2bbabaa922"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): ui/src/markdownNormalization.ts:55 \u00B7 ui/src/markdownNormalization.ts:67 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/markdownNormalization.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b34a6a1c99fcb9fa4b6625d9ea726056fdb989c03b7e9f7b0c11cd24f5c6fdc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ui/src/queries/settings.ts:700 \u00B7 ui/src/queries/settings.ts:712 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/queries/settings.ts"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27298f814bd9c876ce3a74e0837101bec47b659b2d28bc1eeee6403220a650b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/local/acp/zcode-runtime.cjs:73 \u00B7 src/local/harness/acp/zcode-auth.cjs:14 \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":"src/local/acp/zcode-runtime.cjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9a5488329718b4ead34f3bf243671b7954564a5c7b41d90ffffc7dd3341449"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): ui/src/components/AcpAuthDialog.tsx:37 \u00B7 ui/src/components/SettingsPage.tsx:2379 \u00B7 ui/src/components/SettingsPage.tsx:4602 \u00B7 ui/src/useOverleafSync.ts:112 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AcpAuthDialog.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"252ff8ea761294d96605970c5c3265110678108fc5c01789eca3b18164ada993"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): ui/src/components/AddAgentDialog.tsx:296 \u00B7 ui/src/components/LocalModelSetup.tsx:115 \u00B7 ui/src/components/Onboarding.tsx:103 \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":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"189520d704fd30bb362d52fe15d68b9d94e56f35605506b482dbd043cde0c924"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): ui/src/components/AddAgentDialog.tsx:800 \u00B7 ui/src/components/SettingsPage.tsx:1049 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"0833419cd297c538f79c81da6b2c971fa03a295fa770967c28a5f8731cbfc433"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/src/components/AddAgentDialog.tsx:311 \u00B7 ui/src/components/HarnessSetupDialog.tsx:290 \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":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0a6ff2e785c07ea42db8f1572f0c56411a8aee5884024ea9af4cceea25a4f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/src/components/ArchiveMenu.tsx:87 \u00B7 ui/src/components/TreeView.tsx:378 \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":"ui/src/components/ArchiveMenu.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9b3622a928a2525b78b70ed45ec0804fcdc6b009c00f675f503192eaf4d923"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:1117 \u00B7 ui/src/orxCommand.ts:127 \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbb4ecbaf62f2eb429657496753f2c439dc8d54e403fb68fb5d08b015ea82e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:1189 \u00B7 ui/src/markdownTarget.ts:39 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e77aedfa1dc13b576496d0fe830f7b4dd02b2f0bc3ee3156214a3a6f7f5642"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:4028 \u00B7 ui/src/components/ResearchCards.tsx:265 \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4028}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7a20754bbeeb4b5c5f1bf1490cccf850dee469e6c03a1a2af7b0a3aa926b53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/src/components/ChatPanel.tsx:5664 \u00B7 ui/src/components/ChatPanel.tsx:5670 \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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":5664}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5f87239438bb5c4426d9ec922c399ee37ae27207d16c54d27380a1757f5694"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/src/components/LibraryPicker.tsx:91 \u00B7 ui/src/components/StatusStrip.tsx:115 \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":"ui/src/components/LibraryPicker.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dfde81b407a727a9537a12614cebc77e2f64ab912655be176982c81fa837d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): ui/src/components/OverleafPanel.tsx:140 \u00B7 ui/src/components/SettingsPage.tsx:1281 \u00B7 ui/src/components/SettingsPage.tsx:3310 \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":"ui/src/components/OverleafPanel.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8d7e9d621dc165c00f257393d37ec113abc2c6d5425ec57975451df2387c9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): ui/src/components/ResearchCards.tsx:83 \u00B7 ui/src/components/ResearchCards.tsx:119 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ResearchCards.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f68d66f382d7a8a8c39fc233b59afae87bd7520a79ad2785afe12799371aa02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/src/components/annotationMarkdown.ts:6 \u00B7 ui/src/components/annotationMarkdown.ts:13 \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":"ui/src/components/annotationMarkdown.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e712cbe542e200dd862bbd4450e7d70e50f0245c69df9b8aaf55b8db8bc2dc45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/src/components/tourGeometry.ts:57 \u00B7 ui/src/components/tourGeometry.ts:66 \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":"ui/src/components/tourGeometry.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafa6d45aad48021eae6a30b2dac55919f89405febe2ced52b0c3ef95d4eec1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/src/katexHealing.ts:66 \u00B7 ui/src/markdownNormalization.ts:13 \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":"ui/src/katexHealing.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f1cbc0db56c4422141fbc2fe2ddc6ccb5099e00e0802d5d17bea46d75cd41e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/src/queries/projects.ts:88 \u00B7 ui/src/queries/projects.ts:94 \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":"ui/src/queries/projects.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94f9ec0a61a48d72c7249175ab805b4e2900c4b4bbc52349f01ea09d9b1ce36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/src/queries/settings.ts:597 \u00B7 ui/src/queries/settings.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/queries/settings.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d3cdb029478bfd42459dda5fef5a50479e671a73a334fa37ca4ec20819881a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ChatPanel (cyclomatic 326, cognitive 275): ChatPanel has cyclomatic complexity 326 and cognitive complexity 275; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":5485}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de0c76e4555ae4d59e9701b4104a38f87b90efbd512dbf4ac6a7670d779ceb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function App (cyclomatic 253, cognitive 226): App has cyclomatic complexity 253 and cognitive complexity 226; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86db80ddfde86650be2724d8b5d2e414219e969d7b426e3fba55c1d0fa6e86f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function NewProjectForm (cyclomatic 202, cognitive 147): NewProjectForm has cyclomatic complexity 202 and cognitive complexity 147; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/NewProjectForm.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"45adf2284d374b2ce78bbf9b476292a98599786f5da92de5befb53a5433c70c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FileViewer (cyclomatic 183, cognitive 136): FileViewer has cyclomatic complexity 183 and cognitive complexity 136; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/FileViewer.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a6ec12f4f710e19986eada333d31793be254c89f11e3d9c3d44b3f0619b5c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeToolActivity (cyclomatic 176, cognitive 272): computeToolActivity has cyclomatic complexity 176 and cognitive complexity 272; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee1b173f532af26ee94e83af6a6f9b5d0ebe9e2ddf161c62afef1d3b59c1e29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AddAgentDialog (cyclomatic 164, cognitive 165): AddAgentDialog has cyclomatic complexity 164 and cognitive complexity 165; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b3b68e063e1d2fd66d0b87ec2f7e53ff1e921703073105b40d2bec4e1dce4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function send (cyclomatic 129, cognitive 173): send has cyclomatic complexity 129 and cognitive complexity 173; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":6975}}}],"partialFingerprints":{"codehealthFindingId/v1":"924e8ed1caff5c4a2a6609e258613bd88c00c48300c17933a0a49cf7d4ff31ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ModelPicker (cyclomatic 104, cognitive 87): ModelPicker has cyclomatic complexity 104 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6500c1bc72f17b6e22779c23af994d3a6e456141d0450f588167d70248159a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function harnessRow (cyclomatic 81, cognitive 67): harnessRow has cyclomatic complexity 81 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c72f8d0833fa1cc301b7c818eeec7a9a73d4a15a693500189dce7239653e96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Onboarding (cyclomatic 73, cognitive 66): Onboarding has cyclomatic complexity 73 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/Onboarding.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a7688d6d6cefd676ec2ee1d34bc3174c4ff2e6d424728510592d687f7d21a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OpenResearchSection (cyclomatic 73, cognitive 53): OpenResearchSection has cyclomatic complexity 73 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f967997b258136ba223f4929967158ff37bcdf621e72f1742e1b2d88ca361ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteSetup (cyclomatic 61, cognitive 54): RemoteSetup has cyclomatic complexity 61 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/RemoteRuntime.tsx"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd02d71ea8cb1be1b3df6ca138508ea56b14b9b8c65c2a321b59db991656c824"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ChatSearch (cyclomatic 56, cognitive 45): ChatSearch has cyclomatic complexity 56 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatSearch.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b99b5d7f411abf90f3ff95c73d1021657cd4cfdf8e65c43de82a38b16a988cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ExpHoverCard (cyclomatic 55, cognitive 53): ExpHoverCard has cyclomatic complexity 55 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ExpHoverCard.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe579c602231955e89c1c3e2ea2b672ce02d40c1af1065e600ffffb73baa14f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UsageMenu (cyclomatic 55, cognitive 51): UsageMenu has cyclomatic complexity 55 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/UsageMenu.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"300643acc4585def4b8e2e343728544bf9ec2c821c03bbe932a8c85efb889902"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GitTab (cyclomatic 55, cognitive 44): GitTab has cyclomatic complexity 55 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4414}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cddd2b86995e92c92eb6e7c5a3cd1fec2309ec77f32e747718ab2d7e0bdf28f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePane (cyclomatic 53, cognitive 50): parsePane has cyclomatic complexity 53 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/workspaceState.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e379bc5a4150758e147b6575132605c72b6445549084bc1646d17c6c3d64192d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PromptCard (cyclomatic 52, cognitive 70): PromptCard has cyclomatic complexity 52 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95a6390ffc5e674a0dcb28f3532954c7ddddb371c672cdc2b4dd85c0bfc63d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 52, cognitive 46): (anonymous) has cyclomatic complexity 52 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f90b70f684facee2c3f573d414ca05bf0b033ddbd430e7ae1e0a4e050e28449"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function VercelSection (cyclomatic 52, cognitive 41): VercelSection has cyclomatic complexity 52 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c7f146e660a9a89014bbde2300c7690401c193798f44ed11f53bb675611e53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WorktreeTab (cyclomatic 45, cognitive 44): WorktreeTab has cyclomatic complexity 45 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/WorktreeTab.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0d36d412b9ecb465a7e303376c848180b90aa354379d8cf1f47eec7c3a75a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function HarnessSetup (cyclomatic 42, cognitive 33): HarnessSetup has cyclomatic complexity 42 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":"ui/src/components/HarnessSetupDialog.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8cd67e41f0e00c0e15198143d8e3f40ba79a3b252ff07f09a0809001494db6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enter (cyclomatic 41, cognitive 75): enter has cyclomatic complexity 41 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":"ui/src/markdownLivePreview.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8bd8a81d81c7aee364203806b17128fa3cb4895b91b509d898c887688ffa65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function alphaxivActivity (cyclomatic 41, cognitive 42): alphaxivActivity has cyclomatic complexity 41 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9dcdbafa3c64484743c49fc047f0b6f503b71a11c2470b22fb719c28d5760b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AcpHarnessDialog (cyclomatic 39, cognitive 34): AcpHarnessDialog has cyclomatic complexity 39 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AcpHarnessDialog.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"422092e30feb3dd3130ae3c41a46b7fdf48808388c7dccac8497734ec722b396"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OptionPicker (cyclomatic 37, cognitive 31): OptionPicker has cyclomatic complexity 37 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":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87c92bf442b973c32cfe341ec86990d31ec3ec29de85e664b11d1967055c2a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Brand (cyclomatic 36, cognitive 33): Brand has cyclomatic complexity 36 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":"ui/src/components/Header.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28e8215873c5cf0df33eb46ff73fe50fde8960511324520b382c97f4f0a4600"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RunContactNotice (cyclomatic 35, cognitive 28): RunContactNotice has cyclomatic complexity 35 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":"ui/src/components/RunContactNotice.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df94b092d66e26ce8cce3bffa27436ef8b9952f49d5d6040c7e5b29613d27bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function navigateKeyboardList (cyclomatic 34, cognitive 37): navigateKeyboardList has cyclomatic complexity 34 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/keyboardNavigation.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcb12e3afbf7323b5d3824673be72fec54606973a5e29535441e8d4b85d435e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WorkspaceConnection (cyclomatic 34, cognitive 31): WorkspaceConnection has cyclomatic complexity 34 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/WorkspaceConnection.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce20a7b5d711edf3a221ae94a6a3bbfc3fffce22741b3d3c1b0486de969aa77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AgentList (cyclomatic 34, cognitive 27): AgentList has cyclomatic complexity 34 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7f49efd885486c3dbb05ea6e5977e521038010589a7fef8825100e7c7a53cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shellWords (cyclomatic 33, cognitive 55): shellWords has cyclomatic complexity 33 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/orxCommand.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"705b17ff05468b4c8330c5234a776bcd5e319ee26a51df2a5554962b414bc9ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function questionReplies (cyclomatic 33, cognitive 39): questionReplies has cyclomatic complexity 33 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/chatRendering.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ece9980fa72c305f42484b53b9a96e4dcbdc3d27c39c258b26e38f0d44dd3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 33, cognitive 37): visit has cyclomatic complexity 33 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/lint.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5ddb3a174bae700544156f5ecc4e909c63200c265ea3886d0eaa5a31de8ffe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OverleafPanel (cyclomatic 32, cognitive 38): OverleafPanel 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":"ui/src/components/OverleafPanel.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b97965942c6a32ff759a2903ac89f03539d4f0ac3af9b76f56f1534298aa441"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ToolGroup (cyclomatic 32, cognitive 35): ToolGroup has cyclomatic complexity 32 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2816}}}],"partialFingerprints":{"codehealthFindingId/v1":"995b88f106acf1500a660356975c3c6036ceec13dd856bddf01fcda7bd0f0a7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TerminalView (cyclomatic 32, cognitive 28): TerminalView has cyclomatic complexity 32 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/DetailDrawer.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0030de26b70b49d02c5944d33cb7fd3df37a8d66ab97b757d3ffcea2d9bc7822"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resize (cyclomatic 31, cognitive 28): resize has cyclomatic complexity 31 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":"ui/src/components/HtmlPreview.tsx"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2665a22cbe1f897ea152514411b69f5bdab63c6fc79fbd9912f0fc75dde98cb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function HfSection (cyclomatic 31, cognitive 24): HfSection has cyclomatic complexity 31 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3302}}}],"partialFingerprints":{"codehealthFindingId/v1":"286cce21d07649b9a7341e94713d9f21a2ee9d122e52c062e2788d3cbeec9b7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commandRunIds (cyclomatic 30, cognitive 58): commandRunIds has cyclomatic complexity 30 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6f2b8dc5973f86353ac3f44c1de15da0d397546a545cd438787bc75ef5f46d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function json (cyclomatic 30, cognitive 44): json has cyclomatic complexity 30 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/api.ts"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"f165c83ec77adac8333962e67b3bb2557d232666a1bb696b770deebee2d78000"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectModel (cyclomatic 30, cognitive 29): selectModel has cyclomatic complexity 30 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":6227}}}],"partialFingerprints":{"codehealthFindingId/v1":"63de2009f743cd89a95f700cca6dcae95e6d254c9c65c12be946d62c4dfe7801"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UpdatesTab (cyclomatic 30, cognitive 28): UpdatesTab has cyclomatic complexity 30 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3859}}}],"partialFingerprints":{"codehealthFindingId/v1":"340e1bb36a0b5b2532b8ac97cf76e0ec53cb681037d91b35f855ed41d590f723"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AcpAuth (cyclomatic 30, cognitive 27): AcpAuth has cyclomatic complexity 30 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AcpAuthDialog.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"735de653643ca590522b4e31f8c56360008b000ec3defd30db7ab10e9a2466ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function StorageTab (cyclomatic 30, cognitive 23): StorageTab has cyclomatic complexity 30 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4592}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33ec2129f187c0f297a6467f09b9c35b66a138cd43c0df1669d88baaef21ab0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeCurrencyDollars (cyclomatic 29, cognitive 43): normalizeCurrencyDollars has cyclomatic complexity 29 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":"ui/src/markdownNormalization.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2979de2aca3baba3d0776f54baabb4c9b1ae8ad45a41b7a0c2afe6e2b48c50e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draw (cyclomatic 29, cognitive 40): draw has cyclomatic complexity 29 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac803eb7aee85f73e4d03983931d324ee276bed10415c9285f121b272ad27e8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reducer (cyclomatic 29, cognitive 29): reducer has cyclomatic complexity 29 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":"ui/src/queries/chatState.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9361905e5061dde8e54b554c6d95938ff20585707da967370c0f77b787a3e64e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ShareProjectDialog (cyclomatic 29, cognitive 25): ShareProjectDialog has cyclomatic complexity 29 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ShareProjectDialog.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"624013bf9d3d9552af82876a464564593e0e58c2c3dcfabbac1c7ec555567f58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SlurmSection (cyclomatic 29, cognitive 24): SlurmSection has cyclomatic complexity 29 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba1e91005b3a1136ffb1ab488937b22397bf8d4f28009dd681f8a0210f4925c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function K8sSection (cyclomatic 29, cognitive 23): K8sSection has cyclomatic complexity 29 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"670fa31b40f73a2c34410a734a0a058de1266810cccb9b361d31e4e6bddc3456"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runNotice (cyclomatic 28, cognitive 46): runNotice has cyclomatic complexity 28 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/runDisplay.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a996b7b7d94008b8b061e3c1528d3fd21cebfeeb19e85439e46b85f6446bf9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ExperimentOverview (cyclomatic 28, cognitive 24): ExperimentOverview has cyclomatic complexity 28 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ExperimentOverview.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fef304039636ce55d051880f45df6c610f74974a0a29cfb6779696620bc088"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LogTerminal (cyclomatic 28, cognitive 24): LogTerminal has cyclomatic complexity 28 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/LogTerminal.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc2b90a6f905440be6899e652403acdbcf0baa711e1027c28eab2ea17726716"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 39): (anonymous) has cyclomatic complexity 27 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca963100d82e1b402e376d65e9fd020fea56413fef766c64762cda2cb375992"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markdownFromSelectionNode (cyclomatic 27, cognitive 29): markdownFromSelectionNode has cyclomatic complexity 27 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"63145aa3b676dbdb67805b36f9434d975c53310ec91a15e8c9fc27f258365b59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PreviewPane (cyclomatic 27, cognitive 27): PreviewPane has cyclomatic complexity 27 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c6ef96f4d7aec203d8a11579546cd7dcfcbb6470a8672cb860c7352eeea56c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SessionHoverCard (cyclomatic 27, cognitive 26): SessionHoverCard has cyclomatic complexity 27 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SessionHoverCard.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97a6d6eb94643e9a6f79b8b1786bd0e7a4148078e6f35e5b9f68d0b9a298388"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AccountChip (cyclomatic 27, cognitive 24): AccountChip has cyclomatic complexity 27 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AccountChip.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d783dfe36b636d400b1e06344ac98d7c6f869a9383cdec284a515795d4b329"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SignedInLibraryPicker (cyclomatic 27, cognitive 24): SignedInLibraryPicker has cyclomatic complexity 27 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/LibraryPicker.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7adef9b133587c8781945655a5717cc5d1e98e38973864cf95a2022d8cea0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 23): (anonymous) has cyclomatic complexity 27 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7901}}}],"partialFingerprints":{"codehealthFindingId/v1":"738254ea8961b73fa79bd54d2a56bbbe7166fb5f61b2682d123d0ae248319947"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SessionRow (cyclomatic 27, cognitive 20): SessionRow has cyclomatic complexity 27 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":5117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2383a39270998e66b01f444979f5c02593973b16148a141aacc9d0b3a2b1658"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function foundProviderLook (cyclomatic 27, cognitive 17): foundProviderLook 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":"ui/src/components/providerIdentity.tsx"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddf0fb3b5b7ae4a5690ccc1adf2d9c7f26c4f5b2dc37dbe0260a02df2598c11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreWorkspace (cyclomatic 26, cognitive 41): restoreWorkspace has cyclomatic complexity 26 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":"ui/src/workspaceTabs.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc042052d6fca868d9c61a6dfb7e2be19d85e97fefdbd7d077df5d8d6380cfd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 23): (anonymous) has cyclomatic complexity 26 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/FileViewer.tsx"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"b002fd55e4a11e7971da241be2d55001f93c1d9eb90dd1b4775a06c867e15a76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copy (cyclomatic 26, cognitive 15): copy has cyclomatic complexity 26 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":"ui/src/components/RunContactNotice.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9e257e9b6c9b160d116c60827ce55fff92e45566d4a75e8cb089eb3190806e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 25, cognitive 38): parseArgs has cyclomatic complexity 25 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":"dev.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5819b9cdf4e532eb494b1d523001fba46380f8c8b4148ac8039597623cc6fa4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 25, cognitive 31): main has cyclomatic complexity 25 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":"dev.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2e27be5a1e69c0e608eac8837a5fe0f0aa89ff45a32dc33564b7ee2e278183"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyChanges (cyclomatic 25, cognitive 26): classifyChanges has cyclomatic complexity 25 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/ci-changes.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"381d7b2351663c5aa2f56ad130da41955bf6c3d3873e72ac362a6708f979f1a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TinkerSection (cyclomatic 25, cognitive 22): TinkerSection has cyclomatic complexity 25 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f755160475acbfb18af52707b9545bb0ba549a1faead0ad6527c3e3966b80e22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function providerRow (cyclomatic 25, cognitive 17): providerRow has cyclomatic complexity 25 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0946865dc2a8dd7e40c49a7cdfdbfb3bc515759979f59c4d1acde566d0e7b06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ToolActivityLabel (cyclomatic 24, cognitive 26): ToolActivityLabel has cyclomatic complexity 24 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"5897565db088d750968a2d32c37a13cdebb2debb46b1c39c9facb5b4d5196852"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function invalidateWrite (cyclomatic 24, cognitive 25): invalidateWrite has cyclomatic complexity 24 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/queries/invalidation.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d82de232167ce1af8750c57efb13928131a7ab2dc0af4c15b0c3ced0cbb9c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chatSearchRanges (cyclomatic 23, cognitive 35): chatSearchRanges has cyclomatic complexity 23 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":"ui/src/chatSearch.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d173c11d12fbae0d2db1a244f5767cba3d264c2987c591f76e8a414fbe3d7c7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 23, cognitive 33): visit has cyclomatic complexity 23 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/remarkFigures.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9aac5f17cf2d9850c215eda599af0fa86aa8643f49bb680e8acd3d3187fdc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 23, cognitive 31): run has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AcpHarnessDialog.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a153d22df1ea3b5124d84bc914213f3e091b480be7b9332804acece9454db4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFilePath (cyclomatic 23, cognitive 28): parseFilePath 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":"ui/src/App.tsx"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7529d25c063945e4db84616ed80ce9ca273df56a54fd155f619352787c00cc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOrxLit (cyclomatic 23, cognitive 25): parseOrxLit has cyclomatic complexity 23 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/orxCommand.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d95c860f3944f173fa4550f0d5a4c5989a2358535179d4adc05a1096b1f6273"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderContentTab (cyclomatic 23, cognitive 24): renderContentTab 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":"ui/src/App.tsx"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cfb35f1353d9492beb800aebb3a251e707c281280eec5c8e8b90949b9c61e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 24): (anonymous) 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":"ui/src/components/HarnessSetupDialog.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"252bd4be6504814507b0d3865175d6aaa2cb7b57847d5a954583b9415912483b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RuntimeRoot (cyclomatic 23, cognitive 23): RuntimeRoot has cyclomatic complexity 23 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/RemoteRuntime.tsx"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff46f8444209bc3432fd990fb132d18ee67f3c3afb69a49b6e9f26358cee9a50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SetupRun (cyclomatic 23, cognitive 15): SetupRun 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":"ui/src/components/HarnessSetupDialog.tsx"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cefc6c9169671807f0772f33025f9a1ef74257fa6f9156434caa513e13d48c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commandExperimentIds (cyclomatic 22, cognitive 41): commandExperimentIds has cyclomatic complexity 22 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e7dc9038b5b98ddddaf69ab344eb9e981f5170756860466ee2f89db01c9a56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shellCommandSegments (cyclomatic 22, cognitive 30): shellCommandSegments has cyclomatic complexity 22 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b5f9ad9d4bb540fd8547da9265b6a33348e13791fb063b82fc46dd10fe0a5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 23): (anonymous) has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"93114e723fdb5bd097f5c2892b9b92f7fb5404a20f88ece3f4009770bc25b006"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ModalSection (cyclomatic 22, cognitive 17): ModalSection has cyclomatic complexity 22 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74bf8373e6bbeb1b613f6f5905b98fc37187b322a11c470c3d01572cc71a0d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function heredocMarker (cyclomatic 21, cognitive 36): heredocMarker has cyclomatic complexity 21 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"568ff4cb0d7fd84f7674f8487c593205c1afcc5f2c358177dd22693d994dbde3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Message (cyclomatic 21, cognitive 22): Message has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3595}}}],"partialFingerprints":{"codehealthFindingId/v1":"053bd681f1999d940222628527655eefd72baed4b3a74529e0004346c71784c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function harnessStatus (cyclomatic 21, cognitive 22): harnessStatus has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf175a0f9c85056aeed5dc0caeb5e43b7655a53646fce2550aacd67f8194fe2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RunCard (cyclomatic 21, cognitive 19): RunCard has cyclomatic complexity 21 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":"ui/src/components/ResearchCards.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33027bc53b06392ad58bcf1259808d82641b2eabc13693a0b49fc824d096849"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function foundRow (cyclomatic 21, cognitive 19): foundRow has cyclomatic complexity 21 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb3a1feb72b22df494fb826b4bb943abae1d8b8b930927ce343d62b332b8711"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ExpNode (cyclomatic 21, cognitive 19): ExpNode has cyclomatic complexity 21 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":"ui/src/components/TreeView.tsx"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af2200c502d162fe17d9be27c1f78823fed3abdd053f23fe7c7a720e9c2775f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AssistantTurn (cyclomatic 21, cognitive 18): AssistantTurn has cyclomatic complexity 21 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3964}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd2225664eb18c9a1a43ac9e9d3372298de3189614ab2043159f9cc90036d03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function navigate (cyclomatic 21, cognitive 18): navigate has cyclomatic complexity 21 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatSearch.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e51b772923097e4f8b7f35eedc983f271767cc9d1d212b9aca5495f4f5d4477"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ProjectsPage (cyclomatic 21, cognitive 18): ProjectsPage has cyclomatic complexity 21 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/routePages.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4d07e493147efbb07dd2900ce385026859d6e54186ad3f10938273022ecfa1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runDisplay (cyclomatic 20, cognitive 21): runDisplay has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/runDisplay.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c679bb3b08232e9fd2a1f4814c10db6327e22939be700fc5d8ae5f10e80584b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runComposerCommand (cyclomatic 20, cognitive 20): runComposerCommand has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":6417}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7973c44f92bce50e2c96a1f06cc986f303d1ca5f556e0c42bcfcf8b0f24dd50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TargetTile (cyclomatic 20, cognitive 19): TargetTile has cyclomatic complexity 20 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2879}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ca0152eb6b9b5d029da7352ded4268af0b1b87cbe6ee7c9344c14fdae823db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 19): (anonymous) has cyclomatic complexity 20 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":"ui/src/queries/Events.tsx"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd1b70e9938e280fb957c9d9170cd18e54aafd860a70544f285540617593d49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TurnStatusRow (cyclomatic 20, cognitive 17): TurnStatusRow has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74b676356e9fd39f0dc8619712ff6ac9fea239f8e444779d09536b7aab96a09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DefaultDestinationEditor (cyclomatic 20, cognitive 17): DefaultDestinationEditor has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3e2d572312b8e4b5ac3dabca882d301d7b97fe06c2288e23e395cc31ea900e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDestination (cyclomatic 20, cognitive 17): parseDestination has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/workspaceState.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9053b9c53d7fd6f5f7bb023af92ad2a09dc923b4a3925a58047398c29d941d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 16): (anonymous) has cyclomatic complexity 20 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4935}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4fb61a44af4471eab124144466e8c82f2387ac70691bd224cdfcd823540c27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveFocus (cyclomatic 20, cognitive 16): moveFocus has cyclomatic complexity 20 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":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c0f3901d8a82c4e6284f095bc52c442191162c8ecfd61e9543576d80d9bb85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 30): (anonymous) has cyclomatic complexity 19 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":8579}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f31b28ba7a67a7d33e2fb7c3b9a2fe4c06d6dacf606973874d6c8188a21cd1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceMentions (cyclomatic 19, cognitive 30): replaceMentions has cyclomatic complexity 19 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/Md.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df9e96b30a6234e98945f91ce086852eeaef307ca29736b2dabca319de17119"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreComposer (cyclomatic 19, cognitive 20): restoreComposer has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7055}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ad96c064c1ab60ad2e8623cacbe254a10b3667014de383956f657a6168297c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RecordRow (cyclomatic 19, cognitive 19): RecordRow has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d3ffb997ca88e168e1b088f6bd2ba3312582207b6a771e391d41c1e865a606"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 18): (anonymous) has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7935}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5fce72fca98ac7b6c06d4788c6d91179aaec88bd5729222e5716b004a0e125"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FileReference (cyclomatic 19, cognitive 18): FileReference has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/FileReference.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba5429f8865eb28a56a269f37a1f2318de1266dfaf659476bbde53cbb7c3665"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentTranscriptSelection (cyclomatic 19, cognitive 13): currentTranscriptSelection has cyclomatic complexity 19 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"590914cb200e4d89567477a0da7d85592b2ad7c940fa3033e474318837e9531a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EnvRow (cyclomatic 19, cognitive 13): EnvRow has cyclomatic complexity 19 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3446}}}],"partialFingerprints":{"codehealthFindingId/v1":"17da19c95ac5a878bae628dbe24d424d3e4411054fb5c5307cf1af07a3b6af95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inlineAssets (cyclomatic 18, cognitive 28): inlineAssets has cyclomatic complexity 18 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":"ui/src/components/HtmlPreview.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"408cd86d60e8c78cefeb3a2fec8f2d4fd70084a82dd4e5e1d48e0769a64c425c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 18, cognitive 27): check has cyclomatic complexity 18 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/acp/zcode-auth.cjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bb0181a25577affc227e5682859f64422d3b8ca53909673d18bb7916cc7157"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyPane (cyclomatic 18, cognitive 26): applyPane has cyclomatic complexity 18 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":"ui/src/workspaceTabs.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0494fdfb09f687610fda7a21d6dc74ebc13c07bcead5f2e600a724b5c97960"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveMarkdownTarget (cyclomatic 18, cognitive 21): resolveMarkdownTarget has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/markdownTarget.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3e1e26fba0ba9e87bcc7811e0c95dda321ba8d9b129e26633fd6880950ef11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 18, cognitive 18): check has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/acp/deepseek-auth.cjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ccc6579f21eda5844d585cef6ae99609a67bd2c30bd18a68d4477b4a05ab11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesSaved (cyclomatic 18, cognitive 17): matchesSaved has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2094}}}],"partialFingerprints":{"codehealthFindingId/v1":"5047dc55408d82d4e676c90d228cecdceecba7d6e24fd65a0518ee6e87a62b77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ComputeTab (cyclomatic 18, cognitive 17): ComputeTab has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"94636315d3f9ddb395625d1963977acfcd7266e5b9eb2b1c051c00b05550ce54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PlanRows (cyclomatic 18, cognitive 16): PlanRows 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":"ui/src/components/Usage.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cff6517de3814352fb366941ac74b354c6e593b22d22928caf9d58b4dabc75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OverleafCard (cyclomatic 18, cognitive 15): OverleafCard 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8c580b0a5562868a29b8d430f82016126971907b993fc9506b4f2bc642ed3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 18, cognitive 14): save 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":"ui/src/useProjectWorkspace.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b397d8e2882448172a19ae8fdc05328a996357c0b75079b87f7cf047fcc1b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OAuthPanel (cyclomatic 18, cognitive 13): OAuthPanel 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":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"07afce1a0be387b488c6bb8ac5e5bafa9d89aa51e0ba26e8b8ee00003ab8e86c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commandReadTarget (cyclomatic 17, cognitive 26): commandReadTarget has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe1db1583c5abc7d35f884f37c0971bae1383f5116d02492745ee95ef4d2d62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findChips (cyclomatic 17, cognitive 26): findChips has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ComposerEditor.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e064089241bbf9f2a2caeb03e40d81652b9f0d51237a9c1941ae578447b74635"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prompt (cyclomatic 17, cognitive 22): prompt 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":"e2e/src/fake-agent.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f76960ee9b9d26c561bc362f53820324a9fefc42188345ebd12c038a0af0b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 22): (anonymous) 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":"ui/src/useProjectWorkspace.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f9ab86c179ba4c1d452c33ba4f0dfd2a5011cd833effbc52201cef92021da7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderParts (cyclomatic 17, cognitive 21): renderParts has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d9b4d10c3abb01ccf9c14eaf295ac6fd1fe819e96e04f3e4f193cb4b6b6ade"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteStopDialog (cyclomatic 17, cognitive 21): RemoteStopDialog has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/RemoteStopDialog.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69a0ae8e192d09f822039beac8c244e220ccb999dadc72b10d307b6189aad02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 16): (anonymous) has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b26ed97f001287300fb355a89f743e5b538320cb7e76fc8f12e5a13b8304e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OverleafButton (cyclomatic 17, cognitive 16): OverleafButton has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/OverleafPanel.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d70b6cf9adf4d59ad3b8343b73fae750b6f97166ebb9c5f99720f6027d33e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SentCard (cyclomatic 17, cognitive 15): SentCard 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":"ui/src/components/AgentMessageCard.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e620bfaca23c2d9c011fdd85b0dd83838f4897203649d0ef9b07e14944b1a823"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CodeTab (cyclomatic 17, cognitive 15): CodeTab 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":"ui/src/components/CodeTab.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"13938716d8366588048b1a617f29f1c41105d450a8d369495bf0ab3f7c49bf57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useLocalModelForm (cyclomatic 17, cognitive 15): useLocalModelForm 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":"ui/src/components/LocalModelSetup.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e8bc9c6a150e90dbc98d72a124932ba531309cb4b095f957ea756d21bc0265"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WorkspaceTools (cyclomatic 17, cognitive 13): WorkspaceTools 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":"ui/src/components/WorkspaceTools.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a991972d1f1aaff9c0199b3ee5dc0ddc2d845bedfb674d860d28934823d2ac11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 12): (anonymous) has cyclomatic complexity 17 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":8550}}}],"partialFingerprints":{"codehealthFindingId/v1":"160ae123b9cd3b08329cf72f5fb38ee67410d3853e608dc4ccf95c08214e5373"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findMathTokens (cyclomatic 16, cognitive 30): findMathTokens has cyclomatic complexity 16 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/markdownLivePreview.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2676371dac2041ad47498f8eb4489dfe63bfbb3f3a5f997e4844e9a958a299b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runShell (cyclomatic 16, cognitive 23): runShell has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7382}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c566d7a3c578a7353ae6d38748518841884ec7c10eca02bd60c552786d34a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function turnReceipt (cyclomatic 16, cognitive 22): turnReceipt has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3887}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95718caee27bc170431f7f56205eac444d13a0f723efe6d7560f126c5d3c19c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 21): (anonymous) has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/UpdateBanner.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c284d0965886efa496efb537fc535048387211f58016309fb1b67193406146ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePosixPath (cyclomatic 16, cognitive 19): resolvePosixPath has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50e481e1d29272303abfaca28f9b6b47fe4c4335e29d3db2741455c2e25376e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layout (cyclomatic 16, cognitive 19): layout has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/TreeView.tsx"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"2309abd3c789e6b86743c26f1b048077465ad0b5940affe5da2a6175286da931"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 16, cognitive 18): verify 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":"ui/src/components/AcpAuthDialog.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d933cba4d1a9106abaff7bc2973062261f1f569b54b7a1f4d4f2d70819d1023d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function move (cyclomatic 16, cognitive 18): move 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":"ui/src/components/ChatSearch.tsx"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a608d8b6973f4c5b2b2b7a53e5c62f5cf2bc109bbeb2d6597c5cffe7e8431a75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submit (cyclomatic 16, cognitive 17): submit has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/NewProjectForm.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e17493fb59eeca0718c5622bd867b62679089ff8221ab72aa86da8536a76b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ExperimentRow (cyclomatic 16, cognitive 15): ExperimentRow 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":"ui/src/components/SessionHoverCard.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"46df4c2bb21bc881d9ec7a14874662eb6b0a88caa138d3ea90912f27d0a8e1d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GithubSettings (cyclomatic 16, cognitive 15): GithubSettings 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ef53441e9ecf8852f6b69dab964bf8fa6a930186cd8bd9491957c738abc04e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UpdateBanner (cyclomatic 16, cognitive 15): UpdateBanner 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":"ui/src/components/UpdateBanner.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8b088b8fe824c66103ed7b7bcece23731772af2a06fe8ca8a5e0abf8e47cfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestAuth (cyclomatic 16, cognitive 14): requestAuth 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":"src/local/acp/zcode-runtime.cjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccaa68c0b252ec699a558bf05335b4583dfb5dc7d5c3d23a9b250257c0ccd44a"}},{"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":"ui/src/App.tsx"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8e7995d0a738050e6c402d89ccf60f13f91da82854c22137f0919fa4bbedcf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RunRow (cyclomatic 16, cognitive 14): RunRow 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":"ui/src/components/ExperimentRunBanner.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e12287a90021a07cfdd40c3d484c20e4aef80fbf15c5e9a44dd9fd5e530df1"}},{"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":"ui/src/components/ExperimentsTable.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"002101bac978a76b9b66289e55e40ec6524feb6ff2041e728e6d82bdcab832d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RaySection (cyclomatic 16, cognitive 14): RaySection 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"7657ac2a85f119ed5d5890fe2bc8d9b9613079870373a0137a69a3e03ca40b27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SubagentTranscript (cyclomatic 16, cognitive 13): SubagentTranscript 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce614f7a415413aa2a47aab116a33810d31207753bcf667d9a03a4d182b715c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 13): (anonymous) has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4918}}}],"partialFingerprints":{"codehealthFindingId/v1":"0763a4d117a37deb0a584d91ccc976b5f5cd925fe601066b9a915dba8e575e2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PaperCard (cyclomatic 16, cognitive 13): PaperCard 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":"ui/src/components/ResearchCards.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc144742133ecca99259d1e63b3f1f99f336f200ae619f43c26653072d6cc7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 12): (anonymous) 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":"src/commands/desktop_zoom.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"79219586b6d840c1136e9791f1f0492ebda1d99d81f9911f7fb9909f5b9348cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 12): (anonymous) 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":"ui/src/App.tsx"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf684e3180e717f940bee421b2671e597236fd6aade181321114592106d3140"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AgentSignIn (cyclomatic 16, cognitive 12): AgentSignIn 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":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fd7732c03dc7134df1511a9b06811fa68612a9b81ed4231a50f3d97298efa2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canConfigureHarness (cyclomatic 16, cognitive 9): canConfigureHarness has cyclomatic complexity 16 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e87782d56b4a9b92fbdc7d5f63b911cb2dff208fef19bf662ec16713d24f1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 9): (anonymous) has cyclomatic complexity 16 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/TreeView.tsx"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be9d1355c4285208e1eafbc20c3b9025c10b8988e77dd5f5da7d5a957eca0dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 15, cognitive 22): read has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/logWindow.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"008d824863697a10d74c5d4fb94aa6ce5c46d594b077c66fadd7affec5dedbaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 20): (anonymous) has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/FileViewer.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dc3e634f0a207978d5890c75bfe4441b4bdd651c81b54ca6cb3a20285b5117"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GitDiffExplorer (cyclomatic 15, cognitive 15): GitDiffExplorer has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/GitDiff.tsx"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ab896f23dd7a3370366a889d49b532bc73ead50c77ee6fc9a07ec6092f2a12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ModelList (cyclomatic 15, cognitive 14): ModelList 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":"ui/src/components/ModelList.tsx"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f287d59ae3a807a4e032ffe5d2200385f6b9b3f8951a0477928696649983b299"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function safeLocation (cyclomatic 15, cognitive 14): safeLocation 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":"ui/src/workspaceState.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8617865556c78a54a113d4c45bb3e4e665a4b7e6fd49952b995fdbc316ce264b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ArtifactsTab (cyclomatic 15, cognitive 13): ArtifactsTab has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fd8ea4422facac8379a0e25076121d21a1247f4779a815ce2593f1e924d297"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ToolRow (cyclomatic 15, cognitive 13): ToolRow has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bfbffff50b640a71f379cb200d7c9e36e853bf860ede89d8c341e7231d99e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runApiProvider (cyclomatic 15, cognitive 13): runApiProvider has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/runDisplay.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"15af37f8363f6c97256ec26ddb11b2851d565ce2f043db8fc361ee11974c908f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function navigateKeyboardRow (cyclomatic 15, cognitive 11): navigateKeyboardRow 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":"ui/src/keyboardNavigation.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a63539ed8971644ac0294bbf7e95d61bb4551208a6748841fef0367ddacc51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function subagentLine (cyclomatic 15, cognitive 10): subagentLine has cyclomatic complexity 15 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd73e18809f2b8954e682d516e3552972ff8ed839e34e07d8ea9478d03c38edc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EndpointRow (cyclomatic 15, cognitive 10): EndpointRow has cyclomatic complexity 15 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42a05b60f6ae7852ebf50e02199a89172cb907e31d7abb9934efbb27cab7df5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assembleDocument (cyclomatic 14, cognitive 26): assembleDocument has cyclomatic complexity 14 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":"ui/src/components/HtmlPreview.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e373f5607d9174ab7b93b42ca6142c8e129aaa8fcaca044430a110bae25416"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codeSummary (cyclomatic 14, cognitive 23): codeSummary has cyclomatic complexity 14 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae249e3ebfe929085415e5253fe3ed9781d71dbf1eabd78942fa9accba78b5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCsv (cyclomatic 14, cognitive 20): parseCsv has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/csv.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f403045decd7240de2a064a5cc680b84c44d60dbdd22a25b27a6ab05cff792"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sync (cyclomatic 14, cognitive 18): sync has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/logWindow.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"495ac457ab616a81c9a9808d65794af4ab9ac72a0bfbc389d6b7e8040cca81ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function a (cyclomatic 14, cognitive 17): a 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":"ui/src/components/Md.tsx"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b50d42ff54dd4775ad5286b8127cb879cd5cf10c3bf430b7f2a2b0f6153296"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onRun (cyclomatic 14, cognitive 15): onRun has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"917a1b35155e1ea717db445d93b89961fd975be29da87234fb97fdf172686a88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeMarkdownPath (cyclomatic 14, cognitive 15): nativeMarkdownPath has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/markdownTarget.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"55014caac0dc04c6b42fb73cc8a6d57024a7a336278e44aeb3d47320ea27fc0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retryStatusLabel (cyclomatic 14, cognitive 13): retryStatusLabel 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":"ui/src/chatRecovery.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bfb37a77e3f711e7bab114642ab138fa4b0cc64343f5de3ff6d1ccadd7bc9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AgentIconPicker (cyclomatic 14, cognitive 13): AgentIconPicker 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":"ui/src/components/AgentIcon.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f19271198aa1d0aa327c3e1722871180c140b7f8248d6de5ebe3cf236cf272"}},{"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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4514}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc558614075ca622d17b33434f860a717306a6e50f89951484913683760791ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LocalModelGuide (cyclomatic 14, cognitive 13): LocalModelGuide 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":"ui/src/components/LocalModelSetup.tsx"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"62188cb7e41feb14f7a389727d30228a2c231a122cadc53ca5e9127daeb2e465"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onLog (cyclomatic 14, cognitive 13): onLog 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":"ui/src/logWindow.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4c9329b3f06beb8d5b9338100fb887dd43a442f431746c26eb42fe7ac979b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchChat (cyclomatic 14, cognitive 13): dispatchChat 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":"ui/src/queries/chatStore.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02b85e81109f37fa0c52ff21b5e02e636a1d9e2f995b97e0ed1392cad875ea0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SubagentBlock (cyclomatic 14, cognitive 12): SubagentBlock 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4394}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c4bfbf40651660ab6adc62f8e72825a0cedf829d038fa0be50ca06de669f70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PickFolder (cyclomatic 14, cognitive 12): PickFolder 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":"ui/src/components/OpenSharedProject.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdebc648426d94f59b5fe7433c30b0e0cebe3128a5138d74c3dcde9afbdf48c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UsagePanel (cyclomatic 14, cognitive 12): UsagePanel 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":"ui/src/components/StatusStrip.tsx"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff41921f9b9e8f37e527d50643acf979254bc2824be0bb5ef6eb421c7810511"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function StatusStrip (cyclomatic 14, cognitive 11): StatusStrip 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":"ui/src/components/StatusStrip.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf3b4b145341b471e736824e4b3b96a62da58b907f40e5834a3c0af4bdc5d5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 10): (anonymous) 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7565}}}],"partialFingerprints":{"codehealthFindingId/v1":"6893716459de46482600520321b8f7f7423931e8c140e4d464554a53a4ac43ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 10): (anonymous) 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":"ui/src/components/ResumeDialog.tsx"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bf4fef6cb64b4d09f6d81e45f04fb361e43306d2a75bf77bf58d2cedac5cc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchFileMentions (cyclomatic 13, cognitive 23): matchFileMentions has cyclomatic complexity 13 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":"ui/src/fileMentions.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccf7843b48a75e715541211675417059a592c3dbdab51e145b7f639b0512968"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceLive (cyclomatic 13, cognitive 21): replaceLive has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dev.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5c37eac6001e105dfc2c7f21364653cb257bf9390c80ebce2f6140d55ae76d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setGoal (cyclomatic 13, cognitive 19): setGoal 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":6504}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7b206290d72ddba05c24caeb18cf60a92869a015efe7b20ea03254902db0c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchLogPage (cyclomatic 13, cognitive 16): fetchLogPage has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/api.ts"},"region":{"startLine":2307}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d3358ffb1f0b8eb54136ef8c5b7e754f26555a58d492ba25243133287c0d98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"f845c8d657c288c7b9d47830ea5b6ab114ff27880c9a140019f6c10aedece4be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/SessionHoverCard.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45ef79130759e22b847bf7ddb78edf3e46a2b95b2b4ca8b29401700c4137eb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fencedRegionEnd (cyclomatic 13, cognitive 14): fencedRegionEnd has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/markdownNormalization.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2634b3c8a00f90037b6e10440028b06d487f610a9be970847a7bdb322c594be8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function backendDetail (cyclomatic 13, cognitive 13): backendDetail 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":"ui/src/api.ts"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d047d59f5bbc94778cf7d19d2dada7b3c3d9ec08ae9c977cdac34ec494f772e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7711}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e44f62ee27cd5bded4a8a60b3d4c037cdbd814eb79f7deb1e0cd2efd6aa8407"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ModelRow (cyclomatic 13, cognitive 11): ModelRow 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":"ui/src/components/ModelList.tsx"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60e96684d7755183c88c52db94f0cf7023b17712f4e024767a264010a34e877"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TrackioCheck (cyclomatic 13, cognitive 11): TrackioCheck 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":3690}}}],"partialFingerprints":{"codehealthFindingId/v1":"832c857193022f3d1e7589641408d56ce25cf37b59eee79ba02c99053213bfea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ComputeActivity (cyclomatic 13, cognitive 11): ComputeActivity 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4853}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52b672dcb7fd97c686d35d158937275553bf3feca314b91442678d3003c98d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function archiveActionsByExperiment (cyclomatic 12, cognitive 19): archiveActionsByExperiment has cyclomatic complexity 12 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":"ui/src/components/ArchiveMenu.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9efd5211db83d51adb977f36795965af39e0792f12b7584c88b8676716458b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 19): (anonymous) has cyclomatic complexity 12 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa5588140fab11086b18803769c8c718dbb4870b8fbf7f5c2e657eb492a45a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMentionHtml (cyclomatic 12, cognitive 16): parseMentionHtml has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/Md.tsx"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e34b63998e749fc84e20e6cfbf6de8a9bf74c22de998f5c6fb7480e6076be73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function agentTranscript (cyclomatic 12, cognitive 14): agentTranscript 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":"ui/src/chatRendering.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8577f8e94e69d02f40327e666b159f6a670d7867f86e24d690c0313befae280e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editChange (cyclomatic 12, cognitive 14): editChange 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b1191131ba1680bdd19212ab2edab0010d167a1a59bf67f1bfb7c6c85caaa7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function orxArgvFromTokens (cyclomatic 12, cognitive 14): orxArgvFromTokens 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":"ui/src/orxCommand.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1521c3a9f01f9b99e133797bb5efe92662fbae504b6345d0f1c95c08692b57d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function linkedPaper (cyclomatic 12, cognitive 14): linkedPaper 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":"ui/src/researchActivity.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e84620b36dbf10366fd04a8b1fcc9fce5a41b6b48b315cf3c219a1c5aaef2d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shellInvocation (cyclomatic 12, cognitive 13): shellInvocation 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acc49656cf8f7e15cba8994a9f19fb7a91e27f590693ee164edfa88de5e668a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stepIntoBlockMath (cyclomatic 12, cognitive 13): stepIntoBlockMath 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":"ui/src/markdownLivePreview.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a014895d4cccfb1ba8a531ea75387fb50ad80a7e5548bf42df6c69a262256c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RunCard (cyclomatic 12, cognitive 11): RunCard 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":"ui/src/components/AgentMessageCard.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3cc74deec4fe5d8df6350fd497494126cc639ac88398dbd161b030a204b7ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ArchiveMenu (cyclomatic 12, cognitive 11): ArchiveMenu 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":"ui/src/components/ArchiveMenu.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca26120beff54ffd5cf66a4a4a56a3d65880be71242469d5e68a59b0ab785989"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AnnotationsPopover (cyclomatic 12, cognitive 11): AnnotationsPopover 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"282c0858f32ec785b29b73b12f690cee6d77f4c0c848d0d513e902f00196488b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SettingsView (cyclomatic 12, cognitive 11): SettingsView 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":4973}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3df4bd27f15394920fd98466cf31817bd698a962a35242741fdefc600e6efd5"}},{"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":"ui/src/queries/files.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fbbbdd2573118a34d0a73dca3cf991c28bc2f82fe29db6f7fb7aa933e445f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1feca516583e049c9fb5ca962b64d9bf9ae6b28e2713e6523e757bd0960b6fb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LiveSection (cyclomatic 12, cognitive 10): LiveSection 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":"ui/src/components/OverleafPanel.tsx"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29e6a227f378909482e17abd23107581e5a4917328b5b7d97ff765448005bdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function HostTestCell (cyclomatic 12, cognitive 10): HostTestCell 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe26ac8086f28cd213537aedc87396424d24c74fcf1dc1c06c06b22dcffc852b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SshConfigDialog (cyclomatic 12, cognitive 10): SshConfigDialog 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":"ui/src/components/SshConfigDialog.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94d6fe8ed8afebcfb6ad82571d5b892bbf82ac7ed034d3b4cdf75fea710ae3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 20): (anonymous) has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"1572f82fbed6f59f35108db49b4599633d7f8551a5b8522e880e4332acfbe415"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function longestValidPrefix (cyclomatic 11, cognitive 18): longestValidPrefix has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/katexHealing.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b36d5eb4968738664f13ad2944ce8683dcc5d60d4543331ce0938adbe6af3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function partIsVisible (cyclomatic 11, cognitive 16): partIsVisible 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":"ui/src/chatRendering.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fd4f4827e9b318a7f77e3a8b9cc7de543dfd71b06ab1af99f85ebcb1088b49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chooseLocalFolder (cyclomatic 11, cognitive 14): chooseLocalFolder 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":"ui/src/components/NewProjectForm.tsx"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"629bb8a524c9c64cceb79b557a07a09f349eb8c0ad424e67084292a31f54b909"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 11, cognitive 14): visit 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":"ui/src/markdownTarget.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5167706a680c2c423eb786d1f7d93d21326f15d82929fd78ed948be8d185a74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f8c6714b2a7278c2a9f37b949d948fe0b99847b6f895f0b3d2ad8063012a1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ChipContent (cyclomatic 11, cognitive 12): ChipContent 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":"ui/src/components/ComposerEditor.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cc4ab2d45c0b3d208d3ac8573a9a5c0e26b29ecab51923d614b2c105738887"}},{"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":"ui/tests/usage.test.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"566555fcb3cbbbb89dc3574f2bf7f041267bac420df4f14d700a5561c1814ab8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"0771ee84549078f67170f7ce8bdd5608724a372be0d1a75b5f31df8c62b09e6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 11, cognitive 11): onmessage has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/Onboarding.tsx"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"948339adf08814a85e514da7435c0d260ec6990d912520060e5c354f508ec901"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"26efbf84cc75420a6ff974c535ebe5090eefa3097b2faf4803d86480cdfbc985"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function squashableToolPartKey (cyclomatic 11, cognitive 10): squashableToolPartKey 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de58ba7b021ff3b3ceb410b2eb2d0c4c1f259d9d32049a64814c2387a19afd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ShellExchangeCard (cyclomatic 11, cognitive 10): ShellExchangeCard 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":4067}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4884c07ba1bdb9291deadba18848f04e03e48bf92cbe6efa2d92f17c779c10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openNewSession (cyclomatic 11, cognitive 10): openNewSession 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d825ec66f4d6e8bb68f5febc1b982ef91c5ff03e07d374a7a71aaa171ce7c1e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ComposerEditor.tsx"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"440e064c92121309d7d2fdc143b81d6601e8329e97b98fe924322d5de7556e71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ImageModal (cyclomatic 11, cognitive 10): ImageModal 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":"ui/src/components/Md.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"251d1aabbfa3bd744d7b80fc7249e992e26b0b3557b1c30527d48429e3f42708"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function harnessSetupPath (cyclomatic 11, cognitive 10): harnessSetupPath 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f1ad51b3321bd6dba5669715638c40737094a4933762779fef5d94fd0fd3f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectPaperSource (cyclomatic 11, cognitive 10): detectPaperSource 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":"ui/src/orxCommand.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdc5771951d739d6e1ecd3dd20de1b1ec06df1ac7626c57488857892f49982c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a752913a183423e976fe484d690a5864ef31e7e3f382713a0a57cf4fd669be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onComposerPaste (cyclomatic 11, cognitive 9): onComposerPaste 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":6033}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f293ec7b35f36c4e552594d0ec9998ccc037bff9a612c4b95f6265ec22d596"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":7859}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ddd735d83bc0e8c3da479753f224c7df97e862d4f9639dc4ea9808a838e9f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DelegateCard (cyclomatic 11, cognitive 9): DelegateCard 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":"ui/src/components/DelegateCard.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a907046e36288599caef99481d5ae65742477a266dad354e54546fb9df697137"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LocalGitCard (cyclomatic 11, cognitive 9): LocalGitCard 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":"ui/src/components/Onboarding.tsx"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d08f31514f6528059c6d094115e6958983abf507e877a051f9da10ad98b1be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SideChatPicker (cyclomatic 11, cognitive 9): SideChatPicker 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":"ui/src/components/WorkspaceTools.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54e222f6b2c34b053171ca0822cba517ab42d17200abe46f31d73cc7a85c61c"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/ChatPanel.tsx: 8585 lines of code: ui/src/components/ChatPanel.tsx has 8585 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":"ui/src/components/ChatPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e38c76812e9cf63a1f540131634b675f7244b0f9ad25962e51632b070341e7"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/SettingsPage.tsx: 4782 lines of code: ui/src/components/SettingsPage.tsx has 4782 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":"ui/src/components/SettingsPage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc69478b6fe3ddc0d6b309203d962732aba77cf6378752c1d110bc558be1dc1"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/api.ts: 3045 lines of code: ui/src/api.ts has 3045 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":"ui/src/api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"858eba8f0e1763d84486b877f585b952085692c5b54b35c035795a7d3f8389ad"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/App.tsx: 2621 lines of code: ui/src/App.tsx has 2621 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":"ui/src/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6991b1d59dae514f3c9257dd2fa9eca39a98f4b539d0c97894e49d492fcdc895"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/ModelPicker.tsx: 1268 lines of code: ui/src/components/ModelPicker.tsx has 1268 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":"ui/src/components/ModelPicker.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf351096fff3ba427b06c3e3e64a655f0ff64ee52e25b999a02fda5c4039df7"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/AddAgentDialog.tsx: 1203 lines of code: ui/src/components/AddAgentDialog.tsx has 1203 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":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a707efa75599b10f486614b1126e58e04e087ef75fd056d3644e38e82261f8"}},{"ruleId":"R3","level":"warning","message":{"text":"dev.ts: 973 lines of code: dev.ts has 973 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":"dev.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf459ff5babc157064054eddfefb9d81ae57196c714e76e30e9e25162f47b9d8"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/FileViewer.tsx: 947 lines of code: ui/src/components/FileViewer.tsx has 947 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":"ui/src/components/FileViewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9509dba1d1dd3f30360579f2642137a34d8861ae419eb64f0e443b8e705b141d"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/queries/settings.ts: 891 lines of code: ui/src/queries/settings.ts has 891 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":"ui/src/queries/settings.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2524c7e44bdfeba746f38bb5ac015535dd4ffb2d86c1bdf5f15e8660b1b57fc"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/ArtifactsTab.tsx: 765 lines of code: ui/src/components/ArtifactsTab.tsx has 765 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":"ui/src/components/ArtifactsTab.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8bc53c354fac4dd0597209e5199b0ef47203d976ba1aaa5efe7e5de09dc51e"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/ComposerEditor.tsx: 667 lines of code: ui/src/components/ComposerEditor.tsx has 667 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":"ui/src/components/ComposerEditor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c718ae62437d98753ae929e6d7d83f7c91f4afd92d37e178fb8d60166d525e7c"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/NewProjectForm.tsx: 639 lines of code: ui/src/components/NewProjectForm.tsx has 639 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":"ui/src/components/NewProjectForm.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e054109375f099fa33628949b5115b27a7395fdb41b56fed34a2354e1144abe"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/TreeView.tsx: 617 lines of code: ui/src/components/TreeView.tsx has 617 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":"ui/src/components/TreeView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3220579488db9aac77c2f94abf56e7bd499e8501c03eb9e15d86d04e98295783"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/markdownLivePreview.ts: 575 lines of code: ui/src/markdownLivePreview.ts has 575 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":"ui/src/markdownLivePreview.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2665bf06fae426439fc6a13716d07aadd19c81a7d46493a2aa9a27836b9077a"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/RemoteRuntime.tsx: 532 lines of code: ui/src/RemoteRuntime.tsx has 532 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":"ui/src/RemoteRuntime.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb590776d397810d54a7161255031ccd13659cbe61d88fb6ac1444c43c46fc0"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/Md.tsx: 525 lines of code: ui/src/components/Md.tsx has 525 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":"ui/src/components/Md.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43b2205f4f4c965aee67ca49fe058278b7415077cc27e851787ff9c04ae590f"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/SkillsTab.tsx: 523 lines of code: ui/src/components/SkillsTab.tsx has 523 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":"ui/src/components/SkillsTab.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cf3c58b61679efa4a0e3b18e688f7c30e7c3c12d53b7518c73fddd0033bba1"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/Onboarding.tsx: 502 lines of code: ui/src/components/Onboarding.tsx has 502 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/Onboarding.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e758c358364f5195600eb15eacf4db7d4e081a52b8d88b1ebc117859d697742"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/ModelList.tsx: 486 lines of code: ui/src/components/ModelList.tsx has 486 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/ModelList.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"228daf629afa9e4b6101646f4488ef60b57d8bb587a34c8b3783e10e63488e80"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/HarnessLogo.tsx: 461 lines of code: ui/src/components/HarnessLogo.tsx has 461 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":"ui/src/components/HarnessLogo.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7af633c6223440b5e1978efa3d7f80ca1fd3fb91ed2d0ca6a9b55d430b1ca1"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/events.ts: 458 lines of code: ui/src/events.ts has 458 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/events.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7fc403b7ee1cd3dec9939fc559068b7af0a552295109ebc677dd0cfa757aba"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/abandonRun.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/abandonRun.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"388eb28d8ab02461ca70196683d90218b6fc63cd70c247e60b49f6b38e5a8c68"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/accountChip.test.mjs:6 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/accountChip.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa43a5f101cee96f20251848c6910d088d95fd949027688b466ce56da559561"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/acp.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/acp.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d08dbfd5dc2cfa78d8dc14fbc016af5a3c7b986e6286c20ec197df5932e472"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/acpOnboarding.test.mjs:4 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/acpOnboarding.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b070c0303ff7009e168d6b909072f107a5374e097a2d4f11dbae487aff44d97f"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/acpPermission.test.mjs:6 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/acpPermission.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c49551efbeb3c2cd7e83d75b39d80d239ab82d9c71b27ebd9e9f2a00252be1"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/addAgentDialog.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/addAgentDialog.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"494f3a89dff18d58339933770d7c0f5f00b6d3caf99c928ce0a7c0d3565610b4"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/agentSwitches.test.mjs:105 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/agentSwitches.test.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"12682deb89092b06b7f766f95ee195a7fa260733750773ee38d11053bc39ae3e"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/alphaxivToolRows.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/alphaxivToolRows.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d03f3e978f371d412bbec82af8eb55be324608d71a95c698e3c9f9a524e2e4"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/artifactsFilter.test.mjs:4 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/artifactsFilter.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"662ab263c4ac7aa8c6bcd9d8b53179c4fd929bf0ee41096a796eeb7a62706098"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/autoReviewer.test.mjs:4 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/autoReviewer.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4612a9d08d8713e7629ec09282a0e686e2709f5b99d1ab743a70380ffcdc6e36"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/chat.mjs:6 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/chat.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5668503766f69a5638049b440ca9c66f6a0af75b55f00708b6d22c8e97007575"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/chatApiError.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/chatApiError.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"344da6d95e6234428b41d0bfe312c9aa2bc4167c766cfdd3b7649d670bf4b7e9"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/chatSearchKeyboard.test.mjs:4 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/chatSearchKeyboard.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"508adb4e175ad65aba3f0c5497136a1335d8d638df4f4b4ac741d398f303171a"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/closeDialog.test.mjs:4 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/closeDialog.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1b05b38d92210ec40107888a9416c86e16e49ff08b28309a9467b0456dba53"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/composerFocus.test.mjs:7 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/composerFocus.test.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e430d998c74b4accc312ccaf6494d08a8609f23b65cd09cdfd9afd7d285fc7"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/composerIme.test.mjs:6 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/composerIme.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"360bc63a346689f5678daa0e21c450033b51147845b95ecc9e5ab1fba68eb4a7"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/createdChatNavigation.test.mjs:4 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/createdChatNavigation.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1274214d63fcd1105b8fbb101604714b976ef0bf4d213a2e236c4b400ed422"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/detailDrawer.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/detailDrawer.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2d0a452bb754458099af287d8153fb5ed3b40c6fb116ffe21902d09df590d6"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/experimentLineageView.test.mjs:7 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/experimentLineageView.test.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8c70e8166078b7671786f9c966fdb3cbec648cb2b6fbef07c462c71f128a95"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/failedComposerRecovery.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/failedComposerRecovery.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f38989e5b4fba70e050d73eee475326d3a0e5e0aafbf3588365c11028cb0aa"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/githubSyncSettings.test.mjs:4 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/githubSyncSettings.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb962edc0d212f4bebc7f8d5cd5668f4005e6caa56538485c5af7f4ac84c5ed"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/i18nCatalog.test.mjs:13 imports \u0027../project.inlang\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/i18nCatalog.test.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f866d9af27e93d0e5cc4428d63dc3436ba271fbc98e40c0d79ac8348c193de5"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/inlineHtmlFigure.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/inlineHtmlFigure.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"185215fbfa6a69a0cfb97117ce661aa72140f29d6abbd2a9d3f2b16d50f5ec24"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/modelFeed.test.mjs:4 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/modelFeed.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bbcec39216931228a38fb412af56eb21d8221e8ad3d6187cd8b9d928c9727b"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/modelPickerKeyboard.test.mjs:4 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/modelPickerKeyboard.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c1843327e3ddf7b0a3ab3138620c8f8e103232ea85286f51f427e2d0ffed29"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/onboarding.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/onboarding.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"112d7a112dcd3c0c749176aa33107b9e108a92990eaa61008dda46246a39bc99"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/openResearchSshKey.test.mjs:6 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/openResearchSshKey.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e8ec84e0aa4cccee969422d86ecb2166ced1ed4a18408a19c182d910b88482"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/overlayActions.test.mjs:8 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/overlayActions.test.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2740b6794e0b59ec2927f6bc7bbfb325b018b62232a3ea6679afd89d5bc8e63a"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/pendingPlan.test.mjs:4 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/pendingPlan.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4adf4fc6778d2f27f1323111fb75a8f0f0af3e18aed20e758ed39f162597ea4"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/projectDelete.test.mjs:6 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/projectDelete.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca28ef03322c9d765b9c46d239145a797c84129f96d2281e461ee25984443bf"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/queryConsumers.test.mjs:6 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/queryConsumers.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"44756739326b576cd4290553a96cdd8c0e5adc4438e2f854393c13de64c7a320"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/quickSetupDialog.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/quickSetupDialog.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbf1d147fbd18e6d1f27320d343d10dea58cc5894ba984e6ec83946070b9c98"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/remoteAgentSetup.test.mjs:6 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/remoteAgentSetup.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb82ebd3b12159edf70f0a24ef7c67cb18452403c8bf08aad35e83780335315"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/remoteRepair.test.mjs:4 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/remoteRepair.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"180e2734d8d3994fb031771e365dec049c17caa3d7976a3b4f3d0c0cb67aa71e"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/runContactNotice.test.mjs:6 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/runContactNotice.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6bcf4013b3625ccacf5c527aa72dd0a7aedb528dc832bdc784ddfb29bca51d"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/runLabels.test.mjs:12 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/runLabels.test.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d435ed56a1d2946bb6a52b9edff40e94c039a9bcbbe08a3f1674e4febcf2e98"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/sharedProjects.test.mjs:6 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/sharedProjects.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8c258e77f6c6a522c9407a4c2eb21df9d391caab761c143f4c075e549c24a2"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/sideChatDraft.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/sideChatDraft.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bd12385f61ac5cc3e8265d5e583f2efa3c8e59d0e53ceca0a46ff1becf1a5c"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/sidebar-focus.test.mjs:4 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/sidebar-focus.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e55c1078b4d29ce3a690dbd3baa82f20353066473a3dc582903060cca42809e"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/slurmSettings.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/slurmSettings.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba262a3d040fc816f361274905e25cd5de0f2145663b988162fe9b93d274ef53"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/sshHosts.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/sshHosts.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db297adac2680fe29f2476bca8faa4d57362720e341022454f04e23cb1e35d9"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/startHarness.test.mjs:4 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/startHarness.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a349c3d01db11192edb9093f82db6be9a4bb908c9d8cced205f84905eb704a"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/starterSelection.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/starterSelection.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53c904d5e86c5be624a9a967f77e1de44d1cc0f2959711dde9fced09fa5dc0a"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/transcriptVirtualization.test.mjs:5 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/transcriptVirtualization.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"820e0f3da14b6ac382f18784088ce136e7d4783eee45f92eedd837ab7efa182f"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/updateChannel.test.mjs:4 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/updateChannel.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d399bc9fbe0c7fa63d0c1a1fcbfab49709e94391dc01ce5601b1f18269091f5"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/usage.test.mjs:8 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/usage.test.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0cb0617a56986e83882f6807c5cc7dbb48c860f93ba98dd954947410e08389"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/workspace.test.mjs:9 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/workspace.test.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa68fd6861b37e64a299a46dc32f8bcf3f3dc11465d9fce652b3edd6899e24d"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: ui/tests/workspaceConnection.test.mjs:6 imports \u0027../src/paraglide/messages.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/workspaceConnection.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbaf0f127806c0bb7795a34ef7576bdf47715bd09dfeeab232e234cde0d988d"}},{"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":"ui/scripts/check-i18n.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98a56d02a1278c2ae1a6d9e7875e2059381d931e998ef85766bf1fb0c9774b1"}},{"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":"src/local/harness/acp/deepseek-auth.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e3741ba4f2f574a41baa6d1f3026ebc3ec12484909e2f04e1b74ea51a13f73"}},{"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":"src/local/harness/acp/zcode-auth.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5793f9bad6f71816af668051ce96ef0a29a193d00fee27b87496d164795360ab"}},{"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":"ui/scripts/link-skills.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1227e5f5497d0a22387597c05a380f45075c1a1f7a33a17af91da2560b012261"}},{"ruleId":"R6","level":"warning","message":{"text":"The declared test suite includes a file that cannot be loaded: This repository declares test tooling, and the \u2713 above records that declaration \u2014 but ui/tests/abandonRun.test.mjs and 47 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) \u2014 each one is reported with its failing import under Test Coverage \u2014 then the declared script exercises what it claims to."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/tests/abandonRun.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e341558a934d2aa9b4b6fa42d28a68da183263e09bd575c80715bcafc807ad"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~104 LoC): no import path from any entry point (22 application, 14 tooling, 143 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/generate-demo-evidence.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c7b5d9619b424a0cd86c7526e1d4a6377d26562c6c1b0e7372cf9965e96244"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (22 application, 14 tooling, 143 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/canary-manifest.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5379a51c46a636d73597b644a4f053b4c617c5dea7232b6eed34b8ded85a55fc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (22 application, 14 tooling, 143 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/canary-tag.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca94a52d64f667bc1debea7ac293f0417b645435d4d72b4837ef31fa74a10f7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isImageFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/FileTypeIcon.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d697a17e32dbe5c86d03ff52d721e73f92e6ca2857bafa584707238a995a2b0f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027GitDiff\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/GitDiff.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c5baceee2b74190e1b07471054786b2a58a8e45539089e91431671ea34baeb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useTourBounds\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/tourGeometry.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"072b962661ac0b24dd05a20537557f0fabca1bada6e0be72326f3dca1984e50d"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@tanstack/router-cli\u0027: Declared in ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/package.json"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6423acd90effa9f11594ab828dc8e7fcc2a9fe651da7aa5312a4645c23478e9e"}},{"ruleId":"R8","level":"note","message":{"text":"Type-only dependency \u0027@lezer/common\u0027 in production deps: Every import is type-only \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/markdownLivePreview.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"683793634459ee3a952e72fb79b90f8855f062a9f60f7dd6a7244c4b1af67a21"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (4 files): ui/src/components/AddAgentDialog.tsx \u2192 ui/src/components/LocalModelSetup.tsx \u2192 ui/src/components/ModelPicker.tsx \u2192 ui/src/components/pickerAgents.tsx \u2192 ui/src/components/AddAgentDialog.tsx (one verified cycle inside a mutually-dependent group of 5 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/AddAgentDialog.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0a35ab342dc10c014bb2956386ec9eed6e6feee39cf3eaea9787051726f0da"}},{"ruleId":"S1","level":"note","message":{"text":"Security headers incomplete: Set: Content-Security-Policy, Cross-Origin-Opener-Policy, Referrer-Policy, X-Content-Type-Options, X-Frame-Options. Missing: Strict-Transport-Security \u2014 the four headers that carry the points of this card\u0027s security-headers term (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options), 0.5 each.(\u22120.5 on this card.) The server: \u0060axum::serve(\u0060 (src/plane/local_plane.rs:627)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e9931804dbad8b1657857c9b88c05b8faeff182b6e2bb88641bd59bac687876e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isRecord(value) || value.type !== \u0022complete\u0022\u0060 appears character-identically in 2 files \u2014 ui/src/components/HarnessSetupDialog.tsx, ui/src/components/SshConnectTerminal.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":"ui/src/components/HarnessSetupDialog.tsx"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f6ba1cebbf44e73cb5cc275c4aa363a2aabb8d16edf264649aae39dca573d2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.createdAt - b.createdAt || a.id.localeCompare(b.id)\u0060 appears character-identically in 2 files \u2014 ui/src/components/experimentLineageModel.ts, ui/src/delegates.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":"ui/src/components/experimentLineageModel.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a5948b8b214ad65035579559ea7bef25b45a0138bc8afb734a0049622b695c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060end \u003C text.length \u0026\u0026 !/\\s/.test(text[end])\u0060 appears character-identically in 2 files \u2014 ui/src/composerCommands.ts, ui/src/fileMentions.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":"ui/src/composerCommands.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9114cf40033bd9ba8c596062ea0f7dc232ffe2ea317a116585a68678f4bd64a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.key === \u0022ArrowDown\u0022 || event.key === \u0022ArrowUp\u0022\u0060 appears character-identically in 2 files \u2014 ui/src/components/ChatSearch.tsx, ui/src/components/ResumeDialog.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":"ui/src/components/ChatSearch.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b6992b712539f30d07eee5fb31dde5d88bba11182a87cc8f69f05245c0bb86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.type === \u0022busy\u0022 || event.type === \u0022usage\u0022\u0060 appears character-identically in 2 files \u2014 ui/src/queries/Events.tsx, ui/src/queries/chat.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":"ui/src/queries/Events.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e62b8d5ee1f32eff96f5b1228002d710462fb4e75f828c71ba6e2bacfbc0bf8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003E 0 \u0026\u0026 \u0022border-t border-border-variant\u0022\u0060 appears character-identically in 2 files \u2014 ui/src/components/StatusStrip.tsx, ui/src/components/UsageMenu.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":"ui/src/components/StatusStrip.tsx"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e08943cffa691ef421e76eb0a3aca736c14ca52f5116b03d9747e887df082d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isRecord(value) \u0026\u0026 value.type === \u0022complete\u0022\u0060 appears character-identically in 2 files \u2014 ui/src/components/HarnessSetupDialog.tsx, ui/src/components/SshConnectTerminal.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":"ui/src/components/HarnessSetupDialog.tsx"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d12b7d03dfaf6cdd83cc10cf7e9c8ecb95efe4941ae709afdf68371897c82cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start \u003E 0 \u0026\u0026 !/\\s/.test(text[start - 1])\u0060 appears character-identically in 2 files \u2014 ui/src/composerCommands.ts, ui/src/fileMentions.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":"ui/src/composerCommands.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59f9710cb7a5b0076c631b4a3f680c66528de7f3639a2cb8ea1881c2948560f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status === \u0022asking\u0022 || status === \u0022approval\u0022\u0060 appears character-identically in 2 files \u2014 ui/src/components/DelegateCard.tsx, ui/src/components/WorkspaceTools.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":"ui/src/components/DelegateCard.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cd329e90754d464235b83964ff451c1d32c1668268c1c68c2615a98a5e364e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof document !== \u0022undefined\u0022 \u0026\u0026 document.documentElement.dir === \u0022rtl\u0022\u0060 appears character-identically in 6 files \u2014 ui/src/components/ArchiveMenu.tsx, ui/src/components/ComposerProjectPicker.tsx, ui/src/components/FileTreeActions.tsx, ui/src/components/ProjectInfoCard.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":"ui/src/components/ArchiveMenu.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e697f0fd392fb5fc71edd464dd7228f511360c9b720a97a4382dd4ccdab8f7a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022object\u0022 \u0026\u0026 value !== null \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 ui/src/acp.ts, ui/src/workspaceState.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":"ui/src/acp.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9716c9ae44edf2ed4887737c606b38d4263bc4fc5afe33641f9c752d4a1c0098"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.native_session_id.is_some() \u0026\u0026 native_session.is_none()\u0060 appears character-identically in 2 files \u2014 src/local/harness/codex.rs, src/local/harness/opencode.rs. It is one line, so the duplication detector\u0027s token 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/local/harness/codex.rs"},"region":{"startLine":4834}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a92640e5b5897c2a616629dd8efb592baedcfa84eff5445c5389171d105930"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.native_session_id.is_some() \u0026\u0026 resume.is_none()\u0060 appears character-identically in 2 files \u2014 src/local/harness/claude.rs, src/local/harness/cursor.rs. It is one line, so the duplication detector\u0027s token 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/local/harness/claude.rs"},"region":{"startLine":3201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4616181a1a247da01d771528d0846819947b254e0365556ffc114e466c943d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error.kind() == std::io::ErrorKind::WouldBlock \u0026\u0026 std::time::Instant::now() \u003C deadline\u0060 appears character-identically in 2 files \u2014 src/compute.rs, src/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":"src/compute.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa47f54cd7ad1f0ff0d65f170b52901142ada75e165cdb3b037e2dca4fb029bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060handle.is_null() || handle == INVALID_HANDLE_VALUE\u0060 appears character-identically in 2 files \u2014 src/jobs/localbox/windows.rs, src/local/codex.rs. It is one line, so the duplication detector\u0027s token 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/jobs/localbox/windows.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"621a2cfad9b062a03f62003af37ae30b1baefa95d83dda8dd48cad65582a9ba3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060phase != Phase::Submitting \u0026\u0026 !tombstone\u0060 appears character-identically in 2 files \u2014 src/engine/reconcile.rs, src/engine/submit.rs. It is one line, so the duplication detector\u0027s token 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/engine/reconcile.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"804a3d94bf0e0b0bce6c0db9ace5cfc8750a2960c5ccc12333e7ca4a96a8e25e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.starttime == identity.starttime \u0026\u0026 process.live()\u0060 appears character-identically in 2 files \u2014 crates/orx-host/src/platform.rs, crates/orx-host/src/wrapper.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/platform.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b44f4ceac189d31aa51bff7bc7ab3eaae45471c71f4283ef492ef13e9edd39b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060range.end \u003C range.start || range.end - range.start \u003E MAX_PAGE_LEN\u0060 appears character-identically in 2 files \u2014 src/engine/adapters/ssh.rs, src/engine/fake.rs. It is one line, so the duplication detector\u0027s token 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/engine/adapters/ssh.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a2e5b5c134e3fe703930ebe6bf7bb47d7dda7020f1f43a1952c7af2992f153"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.code == Some(0) \u0026\u0026 !result.timed_out\u0060 appears character-identically in 3 files \u2014 crates/orx-host/src/legacy.rs, crates/orx-host/src/server.rs, crates/orx-host/src/wrapper.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/legacy.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5b554d47e42febad7f520383eced5d137d18d9ce135e411b396e188ee52521"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.code == Some(0) \u0026\u0026 !result.timed_out \u0026\u0026 !result.stdout_truncated\u0060 appears character-identically in 2 files \u2014 crates/orx-host/src/server.rs, src/engine/adapters/openresearch.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/orx-host/src/server.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"68acdb8ce70c1e31211660d70de42df66066b7b2dcad44fd206aeed37b0e32c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060std::env::var_os(\u0022NO_COLOR\u0022).is_none() \u0026\u0026 std::io::stderr().is_terminal()\u0060 appears character-identically in 2 files \u2014 src/remote.rs, src/updates.rs. It is one line, so the duplication detector\u0027s token 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/remote.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c136add10a2f931fd7a6ef8dc70d8d5179ecfd845492de133363aca8f1c1c173"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060std::fs::set_permissions(path, std::fs::Permissions::from_mode(0o700)) ?;\u0060 follows \u0060{ return Err(anyhow !(\u0022Source snapshot directory {} is not owned by the curre\u2026\u0060 (line 160) in the same block, and control never passes that statement \u2014 it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns \u0060unreachable_code\u0060 on it. Delete it, or move it before the statement that leaves if it was meant to run."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compute.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaef1beb522c5e1768606e72834cb12b7b5c07ecb9a5041dcf0336f24761424"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060std::fs::set_permissions(path, std::fs::Permissions::from_mode(0o700)) ?;\u0060 follows \u0060{ return Err(anyhow !(\u0022SSH service directory has a different owner\u0022)); }\u0060 (line 123) in the same block, and control never passes that statement \u2014 it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns \u0060unreachable_code\u0060 on it. Delete it, or move it before the statement that leaves if it was meant to run."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jobs/ssh/service/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"222d3edd35f4c557cd8345f1e740217ab778d001433377957f9159275e256101"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060nativeOptions\u0060 is exported, takes a document from its caller (line 42) and hands it to \u0060choices\u0060, which calls itself at line 36 (\u0060choices\u0060) with a piece of \u0060values\u0060 \u2014 and nowhere in \u0060choices\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060choices\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/acp.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f14e1caf41331f8af6b829151611f6c14aa8ab6b48d1dd0c3b7efff56cda14"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060subtreeOf\u0060 is exported and takes \u0060node: HistoryNode\u0060 from its caller, and it calls itself at line 125 (\u0060subtreeOf\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060subtreeOf\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060subtreeOf\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/experimentLineageModel.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"611ce6aa7b9c52aebcf86ad44c8edf6c54c89dc6f98a532daa7a49e7b48b0597"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060acquire_turn\u0060 is public, takes a document from its caller (line 1310) and hands it to \u0060stop_reason\u0060, which calls itself at line 543 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060stop_reason\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/claude.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e73fe63fd6354db025782a14e04fdcfe7b787e5641eeed6a28cee5bd57fa8b8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060advertised_models\u0060 is public, takes a document from its caller (line 234) and hands it to \u0060choices\u0060, which calls itself at line 238 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060choices\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/acp.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3136546963c42e3749e2d55131bd38158be5540cfc5579696643ce6acd2ab60e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060find_part_mut\u0060 is public and takes \u0060parts: \u0026\u0027a mut[WirePart]\u0060 from its caller, and it calls itself at line 647 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060find_part_mut\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"3268d031e1f72f0f72e1953cce42e7817749c70af71825cd71acea498e6676cd"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060resume_persisted_queues\u0060 is public and takes a \u0060ChatHost\u0060 as its receiver from its caller, and it recurses at line 4617 through \u0060drain_queue\u0060 and back with a piece of the document (and at line 5058, line 5069, line 5172) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060resume_persisted_queues\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":4617}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2b42d1fdd40b6541690edd987565243debd258f6cab48b57f66760911ff193"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_up_port\u0060 is public and takes a \u0060ChatHost\u0060 as its receiver from its caller, and it calls itself at line 3958 with a piece of the document (and at line 3959, line 3960) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_up_port\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":3958}}}],"partialFingerprints":{"codehealthFindingId/v1":"b865a7cc9720667e834e6fac30346291ef7309c42701f200091f540f1a084574"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060subscribe\u0060 is public and takes a \u0060ChatHost\u0060 as its receiver from its caller, and it calls itself at line 4270 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060subscribe\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":4270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b28d1e9dd8e90ff179ff84c86d6ba2f111f9e1e8a91f573b090d2a3438f3abf"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060interrupt\u0060 is public and takes a \u0060ChatHost\u0060 as its receiver from its caller, and it recurses at line 7023 through \u0060stop_delegates\u0060, \u0060stop_delegates_of_stopped\u0060, \u0060stop_turn\u0060 and back with a piece of the document (and at line 7099, line 7150, line 7167, line 7191) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060interrupt\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":7023}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd6ac5d191bc3080d0db592f60c5b1b3ef6980d857146836e53e61d0678a895"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060cancel\u0060 is public and takes a \u0060Runtime\u0060 as its receiver from its caller, and it calls itself at line 1132 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060cancel\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/runtime.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"406743338af62a7d20006a8acde429ba9c3cd86b6487c8139aa81bdce581e6ab"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060cleanup\u0060 is public and takes a \u0060Runtime\u0060 as its receiver from its caller, and it calls itself at line 1152 with a piece of the document (and at line 1162) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060cleanup\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/runtime.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6c476b806c2f2815bd2e823f8ff5ee36bc66f7739a7622b2e5adef91d0c7aa"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060request\u0060 is public and takes a \u0060Ssh\u0060 as its receiver from its caller, and it calls itself at line 117 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060request\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/adapters/ssh.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa2cc817261a4b0f04e526d3310bc421d4a91ce0d3efe535c01a68f54da91dd"}},{"ruleId":"X18","level":"warning","message":{"text":"Lock guard kept alive across a wait: \u0060_guard\u0060 (line 861) is a synchronous lock guard, and it is still alive at the \u0060.await\u0060 on line 887: the lock stays held while this task is suspended, so every other task or thread that needs it blocks \u2014 and a task that needs it on the same executor thread deadlocks. Release it before the wait \u2014 \u0060drop(_guard);\u0060, or confine it to an inner block that ends first \u2014 or, if it really must span the wait, use an async mutex (\u0060tokio::sync::Mutex\u0060) built to be held across \u0060.await\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compute.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab24b9f1b88f96784002a50902baa8b0373632f3ce5035c1fccb5cef8fb18153"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060snapshot\u0060 (line 189) is a transaction this function owns and never releases: no \u0060commit()\u0060 (or a deliberate \u0060rollback()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a transaction that is dropped rolls back, so every write made through it is silently undone. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/store/search.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"5649d567d759136838b556074d82b6521d86d3d45c0370c2d76712a8f0db449b"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060tx\u0060 (line 355) is a transaction released by \u0060commit()\u0060 (or a deliberate \u0060rollback()\u0060) only on the path that reaches line 412; the \u0060return\u0060 on line 361 leaves before that with a success value, and on that path a transaction that is dropped rolls back, so every write made through it is silently undone. Release it before that \u0060return\u0060 too (or return an error there, if the early exit is a failure)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/store/telemetry.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bb40c5c98ae24b931928d6c371e880b73ee1335a08a630ca6dfb2ee4ef2113"}},{"ruleId":"X18","level":"warning","message":{"text":"Owned value\u0027s release suppressed and never restored: \u0060std::mem::forget(lock)\u0060 (line 786) takes \u0060lock\u0060 out of Rust\u0027s ownership: its \u0060Drop\u0060 never runs, so whatever it holds \u2014 a descriptor, a socket, a buffer, a lock \u2014 is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with \u0060into_raw\u0060/\u0060into_raw_fd\u0060 and reclaim it with the matching \u0060from_raw\u0060 when the owner is done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/app.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b62ba2cd7e02f3ec260b73c2f080ea3cd9d66e6b9909cf15ed45cbeed528fb"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 7/9 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: finishOnboarding: \u0060finishOnboarding\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dev.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb58dd91f126aeaa7be499a48fb474daf8c084eb0fc5c36beb13d668e50c448"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: post: \u0060post\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dev.ts"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25b55a9fc322bc64e4bd68a9e6cc4d356a8c9ff877bc1d570a0f45dd8331d6a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is only ever logged: \u0060Sandbox.machine_type\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but the only production code that touches it writes it to a log or the terminal. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/client.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8933740d8d33d4e049a765921cd5d00070a838a75675e3939a495a2f195858ca"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Sandbox.created_by\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/client.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c11a4a0aa531a4630eb3395b91851ca8bfb22a3a9202e69467411a3309d6690"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Sandbox.failed_at\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/client.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b12ec79ee983dbbbeea3487ec29c71349fd4ac527f922e383aad56d1359ba8"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Sandbox.provider_instance_id\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/client.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4b56edec9baba81a5466e80b23e17a2863479f2693f5ba8df7cc441db68bf9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is only ever logged: \u0060SshKeyEnvelope.ssh_key\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but the only production code that touches it writes it to a log or the terminal. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/client.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2b125943aba53d9a122db012d932c130822178f1177fbed2c0b2fdf9eea3a9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Paper.first_publication_date\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Its value is copied into \u0060published_at\u0060, and nothing reads that either. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/client.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc1dd9d46bd0bdffcaa966b5d75f84c499d4e0e67e31d14d10818d56c08a232"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060AgentsCommand::Label.emoji\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/agents.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f045162e950135bc2b36b4b435bd185a9fa207a9271c78959cd6184bf85034"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060AgentsCommand::Label.color\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/agents.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e471b80b0b1fb9ebb04709cb10d0923511530fd9b37c72887d56cdc8224ca2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060AgentsCommand::Label.clear_name\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/agents.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05f7ec1207b676abf059a5a1905559a6f86db7a78a265308da4775ba00b0b3f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060AgentsCommand::Label.clear_logo\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/agents.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc687d41f653160f7934f4b361630693fe16f423629ff58c7ba68f1fc4a253b6"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060AgentsCommand::AddEndpoint.key_env\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/agents.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c82995ef736fa40464dc738f9e8a1a8aca5af6cc574433d6adffc7c18f95ec"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ModelFeed.featured\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/model_feed.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6847421fba163279604a6d907e7c42f7d5facd85be02692aad1a6bdbd2bb5d9c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Lookup.ip\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/network.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d934fa5aebcb2e25d398cb32a573883837edcbd4153339a420ecbb734664c34"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Lookup.is_hosting\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Its value is copied into \u0060is_datacenter\u0060, and nothing reads that either. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up/network.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1b29093d994de654de6a484948d39f52882e2fc2862e59cfbed5daccdda3cc"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RemoteUiPreferences.theme\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/up_remote.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0702708d24f588b66afcea6a65f5baca391dd0123507f9377c44bc1da526efd6"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060WirePrompt.synthesized\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/chat/mod.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"180d3e2bcf4574554de57ebf6ba8a707063e97dc42025f473b7b8df3620df3ff"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RateLimitWindow.window_duration_mins\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Its value is copied into \u0060minutes\u0060, and nothing reads that either. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/codex.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"1920abe5fc992a5d2d2f880681d9bf4c76155bd8afc3c2136802aa56cbea2b20"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Credits.balance\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/codex.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"d178d35fc5f64c3e76193a000dfe805711255d3c95ff27ba115b59352b1a19fc"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ModelInfo.service_tiers\u0060 is offered as a builder setter option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/detect.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7aec6377810563c23c5331f2b90d503355f0a1aef3ac59313c9424e2228a5b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ModelInfo.image_input\u0060 is offered as a builder setter option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/detect.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea720f704d767f3f0364a6a2299be6d6175cf7559c5d36ddff0e0a7a1e55ce1"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060HarnessOptions.default_reasoning_level\u0060 is offered as a builder setter option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/options.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"21279ed001aae6a3f8ab9f05f8ebf7cccde8e506ebac4093f0e1684334929940"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060UpArgs.no_agent\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd45249a043cf60d23f7333271632ce0d2e539144b5348484f5a12b658fea420"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060FeedbackArgs.details\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"9534af2f523369af0a212433f262619eef40de083ea891da2186148f3d8ab2b7"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Settings.orx_binary_path\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/telemetry.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9a15ee32d7fb760f64438f3fd711e9eee7ab9a60f28d86af03e15bad28dd46"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\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.unwrap()\u0060 in \u0060embed_windows_icon\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f821d7a294590fc2ec3a75d025e9a210c230c64e97cc78cd1596630a3a6a42"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022OUT_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 \u0060embed_windows_icon\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2582b03ef56acf4ed2fd1ade4d565995693c7358f8450064533cc200bd372d6b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(\u0026rc,format!(\u00221 ICON \\\u0022{escaped}\\\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.unwrap()\u0060 in \u0060embed_windows_icon\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea04ada042b37c84df10212bb13650110602d8016c47ba90df9d2def31ae4a36"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060embed_resource::compile(\u0026rc,embed_resource::NONE).manifest_required()\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 \u0060embed_windows_icon\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e86fc29e71b1deaad0a4eb8b061c4dc20bb1f7f991145af68c650bb949f5ca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::path::absolute(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 \u0060embed_host_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":"build.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"569bec921861ce3fc82076811ee861c1d4358237b946863b5b74f69d609bf43c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var_os(\u0022OUT_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 \u0060embed_host_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":"build.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7219792f7bbb71e9cb7c0afb44e18c9f1e485e0ba418c4d3c357002e2d2d1bd2"}},{"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.unwrap()\u0060 in \u0060embed_host_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":"build.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a66b0e46a5185b939e35a287ec519c8b015a57bf77cfcb520a85b87398ceef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(\u0026snapshot,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 \u0060embed_host_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":"build.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd461bf4f76e7bd758c4ca51205535ab622179d3456904df590524c4ffa814f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(generated,\u0022({host_os:?}, {arch:?}, {sha:?}, include_bytes!({snapshot:?}).as_slice()),\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 \u0060embed_host_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":"build.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3d27cb1e0c876e222d47183f2580b6d70c0675659483dd34cd6a7207492036"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var_os(\u0022OUT_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 \u0060embed_host_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":"build.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"092b48cdbbb3ea4a2b8fc0c5cd8852032c0ce3c10c6a9ecc756fc5f2e02567d4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(PathBuf::from(std::env::var_os(\u0022OUT_DIR\u0022).unwrap()).join(\u0022host_binaries.rs\u0022),generated,)\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 \u0060embed_host_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":"build.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"befaeeefc3f57331c585a2930836373bd345adb15a8eeb1575ad91bb41dad945"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\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.unwrap()\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":"windows/launcher/build.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d202ec89567f0a6010d9fc59b0f3fd57dcff13d8fd532709d4041474df884ed2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022OUT_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 \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":"windows/launcher/build.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bc0ab4f86569eccd61128500701025cbf3444736fce47de469e08b9f78c659"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(\u0026rc,format!(\u00221 ICON \\\u0022{escaped}\\\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.unwrap()\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":"windows/launcher/build.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fdd154dd488db1b1eb163201803cc4f7b3d14b5cf507dc3bfea0d768fc447d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060embed_resource::compile(\u0026rc,embed_resource::NONE).manifest_required()\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 \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":"windows/launcher/build.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79d12c15b7fc31837b1cfef5a59e24cca095ac617562b5167a67a7f78ed3342"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::net::remote_client().build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060http\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29ce035c308b711638313692d47039f169109e8303b3bf71779445bf296e2fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::net::remote_client().connect_timeout(std::time::Duration::from_secs(20)).read_timeout(std::time::Duration::from_secs(30)).build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060paper_pdf_http\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"4740c1984dc2d0abc4145461f709606aa39f853193657c0e79530b8c689ab9ad"}},{"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 \u0060open_lifecycle_lock_in\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/store.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbb59ac37ed2382c45eaaf9bcf0f97b0b78d6aa261aafc268bfffd53a9c0e06"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.engine_host(\u0026alias,\u0026root)?\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 \u0060engine_hosts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/store.rs"},"region":{"startLine":5543}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3ec551e6814fb6d537b281ddfd8a9d466a57e0dcd0a590c63846f4f4d13d3e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::net::remote_client().build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060http\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/telemetry.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc10af1484d64a05fe3a6df087a61037c7b2788311f1dfbb75480ff6752364da"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Version::parse(env!(\u0022CARGO_PKG_VERSION\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 \u0060current_version\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/updates.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebdbc47864fe0bdfb21222c1c96e10d5aeb36633ff3de9fb997624d0ba7c789"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::net::remote_client().build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060http\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/updates.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c96fec787d8766c6106d16282f695dda24f5da35182e46ec5f3905e246d760"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent_exp.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 \u0060create_experiment\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/plane/local_plane.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1abd772b824287e504c71d9bd958a291a91207a37b7835b5747d85d0fd2d75b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060events.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 \u0060logs_to\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/plane/local_plane.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"401b625ed3d5480537d8953fc7255391c3c07eed1d7798c0b0fc7f818735bd32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060process.child.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 \u0060test_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":"src/local/acp.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c5d7f54e7d438edca86eeecf67a8e75c322babf5c537f461f5121adf073d78"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060process.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 \u0060test_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":"src/local/acp.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b82175e4419c50cf72d056525d0cd7ccf3f81b6e5668f23d1674ac6157f4441"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060labels.entry(id.to_string()).or_insert_with(||json!({})).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 \u0060label\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/agent_profiles.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"762270eb80408f7c9dfa0d1f8799b24d54015a7705fc05b1b8e87971aecbf26e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root.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 \u0060prepare_home_in\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/agent_profiles.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"054bb77bb31f7a4de8c0857217e60496b1457a5b7cbfe21cb4ea1619dd492e2f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root.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 \u0060remove\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/agent_profiles.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb16b89f5ee7086ff5f38878a2575255208006b907b08095f37ce50b05c9357"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry.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 \u0060reconcile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/agent_profiles.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dce6bc3901a7ce45fc1ff819119331e109899d509b6099c5283d2d58f2072c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060found.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 \u0060reconcile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/agent_profiles.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"254bd5e07431e1bd921a16adcfd88846a46d6e4f302b5b7f0dd9c62b30363b60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry.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 \u0060profile_entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/agent_profiles.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ecd3f16967415e04e802a4c901eb634cfe1f4d1bfeb260b973c24838db2755"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::local::harness::resolve_entry(\u0026mut entry,configured.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 \u0060profile_entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/agent_profiles.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"150614a1803e04b4aa4fb8b1d51e37a1868e05d3832b5f25560d08e07877f917"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060text\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 \u0060rendered\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/agent_text.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"522f50e3e4262458e381e653fd81d1e3638dec499195dfbddeff549b5ea38dbc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060line.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 \u0060command_variants\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/agent_text.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2513f98dd9d8188bcf0ac5d1a0d720c76536aad16bdd23854dc04cadcf84198e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060line.split(\u0022 \u003E\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 \u0060command_variants\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/agent_text.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e61184a55f9e751417b69ee29abdb70dcb36ff88164187a92340078753ab6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060v[open..].find([\u0027]\u0027,\u0027)\u0027])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060command_variants\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/agent_text.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"051a47a4dfaac33c30983fea6ef2bb48e8f96681eb9dcceeb8e1e0330c3a12dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(\u0026base)\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 \u0060scratch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/files.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"1147957d3f9effd812923ebdad3a1ff7284cd153e927e5510ade814b91cffe8f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(\u0026outside)\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 \u0060scratch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/files.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fec2f113ef520ecdd45aacdfc5043e1726b673802dd3451df29ec40e7e54d8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(outside.join(\u0022secret.txt\u0022),\u0022secret\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 \u0060scratch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/files.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd098879aec36b329eb9fb2b473b327a281716367434731c7bad401e5cd3df4f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.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 \u0060file_bytes_at_capped\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/git.rs"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"068c9da1d729fffbf48d592638ad91b23f99751e68f62141cf0950ec41433519"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060words.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 \u0060token_words\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/model_routes.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafa5bd5956258c4c68c838b56e2d81ba91ad144e3a3fa424be5e6be1cb7d5d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060reading.keys.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 \u0060read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/model_routes.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1474999d83b45a9800fad3eac03479386ba78bbbdf80a61ba6500d15146ec13"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parts.last()\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 \u0060id_variant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/model_routes.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"48126a5e5a16d0d19f5d7fe6e6e7828054c08022da29bad30237f331b361e170"}},{"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.unwrap()\u0060 in \u0060prepare_codex_links\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/native_store.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"517dad8c3aea1767ea9edca3d4d6c8f6e3b02c9308031aacc107346d2bfb704f"}},{"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 \u0060write_aged\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/native_store.rs"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a6c38719fec870479a94e7da97016f85d6876f8bcff326b9821e8a857ff50b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(path.parent().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 \u0060write_aged\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/native_store.rs"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec307a6ec59bc47650e07a5c6285b4a2b02f502b78ac34917b293633e009322"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(path,\u0022private transcript\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 \u0060write_aged\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/native_store.rs"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"26323e68dfcd701451e0387ffaa3c34934f6d8060fb6529be499041524de4784"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::File::options().write(true).open(path)\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 \u0060write_aged\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/native_store.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4541712c88f4c0c730154b3b41b688bf7f5926079419f7d2565e37ef2534cac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::File::options().write(true).open(path).unwrap().set_modified(std::time::SystemTime::now()-age)\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 \u0060write_aged\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/native_store.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf91425d03bb65e7955a4cf95d04441ea56916712c0aed01f2bf53d1b14929c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060orx_test_support::write_executable(\u0026path,\u0022#!/bin/sh\\necho 2.0.1\\n\u0022,0o700)\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 \u0060serve_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":"src/local/opencode.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24bafef21b0ca2bbb3504cb083e47f336e3939cf790060a259ac47b41fe1b00"}},{"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.unwrap()\u0060 in \u0060serve_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":"src/local/opencode.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d9f6d1ff940b0805874696f54196fb2c114b02a866fd6823dd391d1c8d3587"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060native_store::opencode_database::DatabaseLease::acquire(\u0026root.join(\u0022opencode.db\u0022),2)\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 \u0060serve_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":"src/local/opencode.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0bea64d3fe8484579e014b22491eea9681342ab644e35ee1921c3c65ed500f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::process::tokio_command(\u0022sleep\u0022).arg(\u002260\u0022).kill_on_drop(true).spawn()\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 \u0060serve_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":"src/local/opencode.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ce94f5796e85f54def8e004cfac1b995bf1197bae054ecc4d6d9c6bbbb0ac6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::net::loopback_client().build()\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 \u0060serve_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":"src/local/opencode.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf09e68b5e4f585369abf110fc82400dbc0b380efc34d874c6ca505714ad8a6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060reqwest::Url::parse(\u0026self.endpoint.base_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 \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/local/opencode_signin.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e26bb98f4ba8bc9cb3eff7b0c4c0fe2a4099ca1e9a7c1b56d22ea5ad36c216f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060url.path_segments_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 \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/local/opencode_signin.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a839ed2df7465a5ca24340bb95c513ebe5134bb69f0c1a59c14095e1171bd55"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.database.path().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 \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/local/opencode_signin.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"523eb85751d5b7ac6473f32bbdf65c2009678994ad5b9da402db9cc1df68e77b"}},{"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.unwrap()\u0060 in \u0060fixture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/opencode_signin.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc987b3572339a281a00450c7f30c63041f874490c124f270dc60e701e8dcb3"}},{"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.unwrap()\u0060 in \u0060fixture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/opencode_signin.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"6237d5ce47cc0c2514f1578c323aa6c5411acc8a5204d4fd3e559c7ef4ce6859"}},{"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.unwrap()\u0060 in \u0060fixture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/opencode_signin.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae76860d4255d29f87050305bc8f36d68504ff3bf2fc4d2ee251d5d1566c3e16"}},{"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.unwrap()\u0060 in \u0060fixture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/opencode_signin.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffad5ae50fc66b2a5c0907884a6c76a51f60a2a6b70aa7fcf5c789c54db0c0f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060DatabaseLease::acquire(\u0026root.join(\u0022opencode.db\u0022),2)\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 \u0060fixture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/opencode_signin.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"359d413ca90973ed1ebe3a8c32cbfc031ccbfadfbf6fd6d82d67bae04ac273e3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::net::loopback_client().build()\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 \u0060fixture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/opencode_signin.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5b7a76f29be77ef5634ff63a1fa93221d519e4b0fcbdb9d6e1731b19b20bb5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060manager.status(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 \u0060terminal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/opencode_signin.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2f62205d2e8268a5c2ffc90f80e1584e927ffc66d65377fe84380e8454b0a1"}},{"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.unwrap()\u0060 in \u0060terminal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/opencode_signin.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3731fc353b2344cc79fd87345253f29116abbc066c49c4d15c8aa170b46fc47"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pid.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 \u0060assert_stopped\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/opencode_signin.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ac99f00081de809c3700e416740955b1fc8bcd4b72e05b892b43ed34e1faac"}},{"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 \u0060write_hooks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/harness/antigravity.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f89a6ea7d5fbe647faa92be1f8213b91df363719a93135d53eb64ec4c1c5504"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec_pretty(\u0026settings)\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 \u0060write_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/harness/claude.rs"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dc3049cae5440fb7f76257dfd1f79f973a35c377e14b88c01aeffd6f0deee5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec_pretty(\u0026config)\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 \u0060write_mcp_config\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/harness/claude.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c620d5d8cce037c844ad82e6e65469a7c5de1c81f42aeccd75695ecbd36762a"}},{"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 \u0060detect_spawn_permit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/harness/detect.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"49caf9eb0d52ed9c20a684cb7c93ffc0bd9d584dfc17b206eedec982f15c89f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bin.file_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 \u0060unpack\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/harness/managed.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"863b96e3ee9ef8336796235ec38c2c2e2899ddb0be3e4ad8a0fbc03d7867f081"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry.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 \u0060resolve_entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/harness/selection.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bd46982d35b7779a02bd99574c45d77a83742c39a9a232a611e75603eb9421"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.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 \u0060npm_install\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/harness/managed/catalog.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec73f02603b56b794902bf819cee0c58e4072e567e45fbc9b4084c128db95bd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.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 \u0060npm_install\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/harness/managed/catalog.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cc30a6a83fe182fae8088e2459f53f9228b12482ada7020bca0df8c8741af8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.parent().unwrap().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 \u0060npm_install\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/harness/managed/catalog.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"466ca682e2a91f852418afc2fadc363ca35a85acbb2f7423da6152f9177cf711"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.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 \u0060npm_install\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/harness/managed/catalog.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c40a07872cc89a9ee63371613783e2830d9b271fb01e0958ec53c447e6ecaa2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060package(harness)\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 \u0060npm_install\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/harness/managed/catalog.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"970ad938cf30bc1243dc7d93c791320305bec767f6395a6b41132d6bc770649f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060digest[..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.expect()\u0060 in \u0060request_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":"src/local/chat/delegation.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f87b7c23c02889597c8c3f24b4ecfa68e5bcf3901051d790c3243880a9ffb8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060part.state.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 \u0060set_agent\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/chat/mod.rs"},"region":{"startLine":2082}}}],"partialFingerprints":{"codehealthFindingId/v1":"997d30116a3a0293aca045e37953a1c9609e9f269476418a230345c8133be251"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::net::loopback_client().build()\u0060 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/local/chat/mod.rs"},"region":{"startLine":3927}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b08707da1d4eacd242e446504a030ebf4d5a43035502d7b70c93c40d022186"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dispatch_cleanup\u0060 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_queue\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/chat/mod.rs"},"region":{"startLine":4993}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf839f48313b5de619e07bad3f8dfdb24b60cda384a45aadf133e00fdd1b163"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060process.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 \u0060create\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/acp/delegated.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b86b2d4e93cca0169adac8af689564f62add3ded1f56c1b108ad97aab3eeaa4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060process.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 \u0060create\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/acp/delegated.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a62f0a78e8a77ba845b8d2f239e6809a2cfb5a269c8041b350fc3bc4cfd9fe0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060permissions.remove(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 \u0060approve_pending\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/acp/host.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"543ec3f3ec1900bc871aade20bfbd129e4487024183461509efa94792b883983"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060permissions.remove(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 \u0060answer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/acp/host.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d9a8883a0a6183ca06f4a4eeaa280ec8cbd63db6304a2e2a480e215dee326c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060process.child.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 \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/acp/host.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65353b17cc6d09989470444ffe6f7bec4ad065c1228456d7aca5ac99f51b302"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060process.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 \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/acp/host.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"7052d3ecff0f4b4c2b9cc56ba9db4c1f1b32f3966996731456afcb2b685015a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(initialized)\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/local/acp/host.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"901d881a863d9c6a70f09c37aa147a3cdcab47b85f562bdae13c623cb9f1a147"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::net::remote_client().connect_timeout(Duration::from_secs(15)).build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060http\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/jobs/huggingface.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"af78f2d89028572b086214d8f987aea13973f283ba5d15f5d4a052d7cf7143a8"}},{"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 \u0060run_job_with_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/jobs/huggingface.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cbcf55d9a0ded6f3af1d4ecde2588a652fb2c6f55f1ebdaa7628d8619ccacc"}},{"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 \u0060kubectl_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":"src/jobs/kubernetes.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d5d66a87b73decd96335b14c647c81f89f15dd712b85ebb1fe7878a7feed19"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.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 \u0060stream_logs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/jobs/kubernetes.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6860e7c76b0626348a3838d79338fbcab99cfe0c5c29308d4ae0607e857d3a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::process::command(\u0022sleep\u0022).arg(\u002230\u0022).process_group(0).spawn()\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 \u0060spawn_lingering_group\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/jobs/localbox.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"860d9acaf6da2e90b45c0316d666d8e0dc03a1f4fb6dd09d713bb6031548f396"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(leader.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 \u0060spawn_lingering_group\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/jobs/localbox.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51059b4dc9d2cff6743731ebf4bc1617c32659af5eb31453d4a67ecb321e5ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::process::command(\u0022sleep\u0022).arg(\u002230\u0022).process_group(i32::try_from(leader.id()).unwrap()).spawn()\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 \u0060spawn_lingering_group\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/jobs/localbox.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"0114bf5209f21bdc4dd080d21ad615f81534e2bcf4521b1de49ac18ff1219954"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060leader.kill()\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 \u0060spawn_lingering_group\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/jobs/localbox.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce9a8f43fe22d3baa7436873fd068267643437f68ae1ca91fa3df1142a280ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060leader.wait()\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 \u0060spawn_lingering_group\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/jobs/localbox.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecedf0a97a71f418fbb255f4eb23eef498811b1eeeeafe6d601a2e3b5fbdf14"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(dir.join(\u0022pid\u0022),leader.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.unwrap()\u0060 in \u0060spawn_lingering_group\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/jobs/localbox.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fbc070c97c4317c7e2997c591d8f63109dfdc718fcf9f7e6797ba9cb23c4c3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.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 \u0060stream_logs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/jobs/modal.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e82d123ec5eeb37aee2aa4bcf320c70e94de9e2bb2f879aa5a0de76f11db2e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.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 \u0060stream_logs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/jobs/modal.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da98e8a8bd462eb5816fb3a9527bffdb79b9bf871b4ca8e72e2dab164a87db3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::net::remote_client().connect_timeout(Duration::from_secs(10)).timeout(Duration::from_secs(120)).build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060http\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/jobs/ray.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5133638b78d21b010685442c1aaa22b7eb273b44bd85a41639486adef56183e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.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 \u0060stream_logs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/jobs/vercel.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92f8c09b75f8c6b5bf2424803a9eb33be80f781824b392231acc6dbebf046c3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(entry)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060entry_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/jobs/ssh/sharing.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4caf9ad7469db16a1df10f0a733cf7f08441594524245e73c8fb004466c569a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060frame[..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 \u0060read_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":"src/jobs/ssh/service/hold.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0e29051d66319a4e09c6d1b034370bb419d5ddb64aae09481281398ca2dc2c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060attempts.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.unwrap()\u0060 in \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/jobs/ssh/service/mod.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc861f86eaad3c731354861fb426ec129b22673506ddd1c8342c0e8d8a255c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fence.record_submitter(pid)\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 \u0060launch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/fake.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fae22afbebc1e5087a58c5553c3bd1ced943977b85e2653155e287aadb49e96"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(\u0026run.handle)\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 \u0060cancel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/fake.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9d637f1e0862f16a3ab8657bc816241c33db208c4757f8baf59191beb87777"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060handle[\u0022type\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 \u0060cancel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/fake.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0793d40571dd7e334256b6f139df77ab414115785447814c26166affac4469fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060reported\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 \u0060deliver_notify\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/notify.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1143afeeaea816a6dc7dfd0bf6041d6b3192f1b2bf1f3c1b84d3260cc8b47fa0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.cause.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 \u0060start_shared\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/transport/mod.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"694948f54d2b8078f188acc14f45ccfb0467d49bd419d42a8c32204a38b2c525"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.state.cause.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 \u0060failed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/transport/mod.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"519d5cd05b646e932aa2e52cba4334c29e27d0b530f7c8206d4b9171eb6d7132"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060uuid::Uuid::new_v4().as_bytes()[..2].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 \u0060failed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/transport/mod.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3531d7607894d81f1c6df45e6df707c947c40010a2bd773ff582016a55535ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060connected.output.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 \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":"src/engine/transport/mod.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"5030a628bc561dfa001d319ada2afaa4c466401b4a91487b693745554be605e7"}},{"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.unwrap()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/transport/ssh.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"6517f0fc9ed2950fb713e2252039907ecda306c4dc9860d4d37c171b7794ad2d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.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 \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/transport/ssh.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c57bf352f601f61248e11e37b8072b67fec22df2eb3fc65befe28704928ee2d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.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 \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/transport/ssh.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25ef5eb6d4deeaf09cccbc7d6beb967d9552cde1eb346f70a813093a7cb39f6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.output.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 \u0060handshake\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/transport/ssh.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"19549d2b61135150a5ff4b56333412e904acaa4e270e6df2df56e661fded8f29"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.output.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 \u0060bootstrap\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/transport/ssh.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7dbfc2f8623b01294b7c9d77115a42cc83fbe3311cbbb418f65978d32a55bd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.output.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 \u0060bootstrap\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/transport/ssh.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"0debd0a2c99913aa687779612cddfb340c8524a66c678b388a3bcbf41ef7fa51"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.output.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 \u0060hello\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/transport/ssh.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"96cc74aec6dada2ae60d3a706682bbc90cd01882cd43af9bbe0450119556dbf4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lines.last()\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 \u0060failure\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/transport/ssh.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"afda8fba825c14bd636fde038f85f3de5d1ac3133b52360ffb7c6da412f919ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::process::tokio_command(\u0022python3\u0022).args([\u0022-c\u0022,\u0022import os,sys; os.write(1,bytes.fromhex(sys.argv[1])); os.close(1); sys.stdin.buffer.read()\u0022,\u0026hex]).stdin(Stdio::piped()).stdout(Stdio::piped()).stderr(Stdio::null()).kill_on_drop(true).spawn()\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 \u0060stub\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/transport/ssh/properties.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f711d879523cfcce845fcda91f5ad153542b9e4be4da04c2c84e6a50ff49161e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.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 \u0060stub\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/transport/ssh/properties.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ec78d53a02860ece4c89c0bffee38e1ba379ed3f015519771013afd62ed9e2"}},{"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.unwrap()\u0060 in \u0060stub\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/transport/ssh/properties.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"896c38aed659dfe7168ff2830ca4cdfd8f6567671a681a2ad2ee65a93707c0cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026offsets)\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_clock\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20f66198d1f158e968341ed13f2c624b3332cc3d5402b676ca84f885cf6533f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(\u0026pending,serde_json::to_vec(\u0026offsets).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 \u0060set_clock\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d8c671503a3cd4ac89db910dc09ee2cd6e1041f304170f4b35054e927bf79a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::rename(pending,directory.join(\u0022clock.json\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 \u0060set_clock\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b857af53a468d72c63c78f0c771073d2f99cb198eb391dd9b0498532028d6dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var_os(\u0022ORX_CHAOS_WORKER\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 \u0060crash_point\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd6c3df5a2c70f4bf98404b5aeeb6087bad3b4a87927b9d3eb297d001a47f22"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(directory.join(\u0022crashed\u0022),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 \u0060crash_point\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6231f69f925ccace9306372945ac34c470bd59092c080ae4d630f69475f81b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::remove_file(\u0026path)\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 \u0060apply_requests\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"323f41b1d43d3cd9231a5e64b579011f3d2fbdf66b44286a1336229f529217fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(\u0026marker,b\u0022\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 \u0060apply_requests\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"2470ee0c0440ac9d83a8850bf227f397e4718e689ed45eb41f7103ce1556a261"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::remove_file(\u0026marker)\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 \u0060apply_requests\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee8ecb0ba9fb3ef63701a86c70ad43583bfcf7284b4edb33fc1f3eb179d6005"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::remove_file(\u0026path)\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 \u0060apply_requests\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e0b354c41f277a15cfc22775a265602d0a3b3ebdef6626ad3b4aef47848175"}},{"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 \u0060worker\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"265b35b1f165728483364cae00b975a8727bbb11b15c3194bd392ed9fd0b9ba6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Process::spawn(\u0026mut command)\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 \u0060worker\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"807f3b00d3103e6d563ea009f379c03cd395c500281d423da9df6a88939d92a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060process.wait(Duration::from_secs(5))\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 \u0060kill_worker\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1b2f1899c39acb19819c6bc0b5914c62492efc37c9c383e2146ef20a667486"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060BackendDescriptor::parse(r#\u0022{\u0022kind\u0022:\u0022ssh_job\u0022}\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 \u0060insert\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aab6c268ab82ddf946a52626f877bbb14ea2eeb4a54e3c99e7475a4f492bbf2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.insert_submitting_run(submission(id,script,\u0026orx_host::sha(script.as_bytes()),experiment,\u0026metadata,\u0026launch,))\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 \u0060insert\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"882d0e9490ea4c630afe81c883afb58d711c7a4ea0382260ce4aca42e2950400"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rusqlite::Connection::open(server.directory().join(\u0022store/orx.db\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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"addc2d968c7687157e4a6561617b1c97cf1e8f36369fcf97baf91678fc0bd403"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060db.prepare(\u0022SELECT id, status, (SELECT count(*) FROM run_notices n WHERE n.run_id=runs.id AND n.kind=\u0027terminal\u0027 AND n.chat_session_id=\u0027chaos\u0027) FROM runs WHERE experiment_id=\u0027exp\u0027\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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"af138c7d169621da972bc44e4ab7b70719f25a3c6e100d3d233bd9cd29597e19"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060query.query_map([],|row|{Ok((row.get::\u003C_,String\u003E(0)?,row.get::\u003C_,String\u003E(1)?,row.get::\u003C_,usize\u003E(2)?,))})\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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cf5b3f73b3d1a3ffa3ced9173d256c0af793b1c83493c149c5dc563145f616"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060query.query_map([],|row|{Ok((row.get::\u003C_,String\u003E(0)?,row.get::\u003C_,String\u003E(1)?,row.get::\u003C_,usize\u003E(2)?,))}).unwrap().collect::\u003Cstd::result::Result\u003CVec\u003C_\u003E,_\u003E\u003E()\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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf8654423af97f124bbd38e4ebc16cd981a68df82a02ebae513ae1f793b8b2f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060db.prepare(\u0022SELECT run,phase FROM chaos_phases ORDER BY rowid\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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"5619ec1f5191b15320cb860db9569982b15c9501510e93f2717d3589ef4b9a8b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060statement.query_map([],|row|{Ok((row.get::\u003C_,String\u003E(0)?,row.get::\u003C_,String\u003E(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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97d71db34e4720e55684ab6c63e03249619e4f3110a6f2a9e3776191dc65fb0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060row\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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b4f9809d29706401ef298f8efadd6161a68b5f2b507f21f5bea4bf0717cf68"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Phase::parse(\u0026phase)\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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5836a264aa44877accea771fd2fdd57b07a661153bca0edd1d06684d391e55"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Phase::parse(\u0026status)\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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"568a98802e463ed15e1ee3ddc39c163e56c4b2a56c5f9cdbd39602ecacdc0b02"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060orx_host::wrapper::state(\u0026remote)\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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1758dbb32112f07d45745c0149419da4b1397b8c1b2a6b6d7b8e55c473e2bd5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_slice(\u0026bytes)\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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1911b8f04f4e6f5b4cb775473608b30ae6dc11e778fd9d776bf3c331fc81c3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read(range.file)\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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"996cc3f4f2de3b0fa4d73f09b80a60328ff965db1426c5bd82e6f12de07bd793"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::File::open(remote.join(\u0022log\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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a152d1e2c402a04ba277930ee857e755daeafaa3e224abcdb971c5e6c18451f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.seek(SeekFrom::Start(range.offset))\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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b64289eeb815dc68a78df635e129ffe2fcecf83c33a0b4e69c17667b7db0b5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.read_exact(\u0026mut remote_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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0c5f6dcdb74567259a20a9ff865fa42c553b16564f12a26bb8a6751acd4adb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060worker.stderr()\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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ba24da65df0de0f8338d3c35c779b621fd7d31d21b34848d838c8e95d9edeb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::process::command(\u0022ps\u0022).args([\u0022-axo\u0022,\u0022comm=,args=\u0022]).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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b5098128633f69d0da2625a89d608864b0cebc16337bce064861f4d7519afd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060config.to_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 \u0060assert_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebc0f41c84c5ef1a5b0ab8c3325e06bd6e393c0ef362b8a9cbed971b4f70b08"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parts[0].parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe7a1f06aba0091b8d29cd9167adeb8a57b8c5a185481e578f819215ab08f87"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a1a468ae7481c4bcdeb8ccbf0ac04ea05acc4aadc345a567463645f10086cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a124d9e30663ccabb89a0c67b5854db26ff880d4103c59e67a768c354d108a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060seconds.parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47e8cf6183cf0e95a013437d37506fb5f54f21d1f9e3b1925082a80799c2537"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060runs.parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf43261bb1d6a93c8d9a2eafefd22fedd58d3a56a50a6faeeab4bc9a00ac0ff2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Sshd::start()\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6e476728cc4f95829d1495bc19b0d960bdd84535d1fc4adefa118d473f4a33"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Store::open_at(server.directory().join(\u0022store\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"1610a3767a8df998b47b0d4cc26b43c8acc059c7a810ee71e8cc6a3afde4b754"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.create_local_experiment(\u0026LocalExperiment{id:\u0022exp\u0022.into(),project_id:\u0022proj\u0022.into(),parent_experiment_id:None,slug:\u0022exp\u0022.into(),branch_name:\u0022chaos\u0022.into(),title:None,description:None,run_command:\u0022true\u0022.into(),agent_status:\u0022idle\u0022.into(),created_at:1,updated_at:1,chat_session_id:None,archived:false,})\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e1e07f4b9c6532135425b0add024803416b8ca4e6212513cef63e352a7e740"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rusqlite::Connection::open(server.directory().join(\u0022store/orx.db\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37a1c7c586cde5000df3686667881953841064caf7a31cb44998ed5b2cba811"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060db.execute_batch(\u0022CREATE TABLE chaos_phases(run TEXT, phase TEXT); CREATE TRIGGER chaos_phase AFTER UPDATE OF status ON runs BEGIN INSERT INTO chaos_phases VALUES(NEW.id,NEW.status); END;\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d0f16ca6fbb4f829cb7c1bbf788b9009800d382cc7e3cae12a1cd78e99364d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060.start()\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b58d3326da7e073d81d3cd018f1b515b1b49e2cfdecd497ef6cfab25b87d9f9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(auth.config_path())\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48fcaaaf5c58a29fdc7ec999266e577d48f2463ad04c5dfb8658884efd52f90"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(server.config_path())\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e2d8d3eb66017cd222916458290e7e749082e76fb7382cdae6178461e2fd22"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(server.config_path(),config)\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3fba55ec4094a57472985d09aa5ca1548f696404e7e1963d58a1007475656b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.get_local_experiment(\u0022exp\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9aa5ba49a8262b7fb690ea12189f5ea6f2a6f877932d2eb8710d26ee6ca9bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.get_local_experiment(\u0022exp\u0022).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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"d755b36df5d9e7cdbea53b2d3abed8c6ca283ceb472d7ff2fef15fe89d3312b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.create_local_experiment(\u0026experiment)\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2b1a17ab390575ec12e7032837f9e920161f5969c8bea2025b1cef9b06260a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.engine_host(\u0022chaos-rejected\u0022,\u0022~/chaos-root\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcf4a89828e9ae0d74595baa8f7bb58599528a5e3371b89ffb56feb385aada8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060process.stderr()\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b0a15a4c46150e95a2019fef565c6b85d458bf683b979a2f34868ed5db9374"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060auth.auth_attempts()\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ab380f632b70f5307d8f120517c6cbb85a92e655e3caca22942019bfee4953"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060auth.auth_attempts()\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f52dec4e0c091827cbbf0d4cd06b8803b59af0646afc89c094c2e6fdc9d419"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crashing.wait(Duration::from_secs(30))\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"d602b54ae35fce3d4bea03e6e2e872f8f7a474d2213cc66d8ae6c3fc148743e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(server.directory().join(\u0022crashed\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b67684d44391b8c9114179b2a4d15f72576312b8755c18502c3303f1fa3d18"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060process.stderr()\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"6504700adf3787761523e61e655820064ce95fff7e49ba070a33c8b46384851e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060orx_host::read_json(\u0026boot.join(\u0022wrapper.json\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d0914ee7fe06d03a1648fbf51224b3e0288b73a107bfa21e5b6b03c66936df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060orx_host::platform::process(identity.pid)\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"038f6b4894406e1cdd3ea84484d1134566b1bc9e945ee1eb67eb6cb927ab1ef5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060orx_host::platform::signal(\u0026wrapper,libc::SIGKILL)\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"666ca8d63a53fa2b7433c1c1c8a89d07ff8ab5d5d21c1e4f596900b1be4d9b1e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(boot.join(\u0022started\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c8850f10afcfa6216928f65fa00781e3edc8a95defbe02a9175bce6c9de236"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060orx_host::platform::scan(Some(\u0026identity),tag.trim(),false)\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0880867709a4727d18a5c77993300fba1c6ed0fb9b2db9195bbaa31bacc94c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060orx_host::publish(\u0026boot.join(\u0022wrapper.json\u0022),\u0026identity)\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c5f79cc80b317933e109abc0fb50e31077fa65004cb9ee949b10213433a967"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(\u0026requests)\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad5fb71b586be49bdcd977ebdaf0b6f74b014382a2a5a08f0d36a575829d056"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(requests.join(format!(\u0022{run}.{action}\u0022)),b\u0022\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"d269e5f58f8585a100c9699aa132390b93af295a31dc87b932b6fb5307f979f5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060server.proxy().set(Faults{black_hole:true,..Faults::default()})\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e5b257c7b0e1030bdfda2ac68946889360b91d2b9ea6128007a87aafe8a173"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060server.proxy().set(Faults{paused:true,..Faults::default()})\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0f9d97e3961b1fe064ac81783d0f696ba49e0480dbd9baa565a102597a1271"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060server.proxy().set(Faults{latency:Duration::from_millis(50\u002Brng.next()%150),..Faults::default()})\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"71aa4e48ae7885063c14777baac4a752b2587d7851a5fd77ed54d3b945a2be3a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060server.proxy().set(Faults{bytes_per_second:NonZeroU64::new(4096\u002Brng.next()%32768),..Faults::default()})\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e5524e86201c137fef0ea6cbbe295e878bfe6047b055c5eacc37271673f13f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060server.proxy().reset()\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"74834b261809350a56a77f565de919bd80f02d08882677a2c58a4d78f33f035f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060server.proxy().set(Faults{refuse_new:true,..Faults::default()})\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb320be828e6df9ff12b380d690aa58ab0ca46e5b9cf0d43c39630dd17bca99b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060server.proxy().reset()\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"046690e1926e05b8d4b63157d7f70d85725f6b44437ac1ee6829eb74c959ea10"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060server.restart()\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a34c030fe18fe28b26793a7bfcc7820ceff5c672eec996d1e768b1f9b67bb52"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.engine_host(server.alias(),\u0022~/chaos-root\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"66efcd34e671e7bea77dd48c92b229b1a9b72194702a8a92f30e59e7becb8233"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.engine_host(server.alias(),\u0022~/chaos-root\u0022).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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0094ce5e40faa267cdc8b5eb91fbb4ddd6e90ca1ca141bf0aa6b6c901ba1814"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060auth.auth_attempts()\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"f800a2cb54bff6f99fc496438efd2f430fcbf0aa0d76f25ef34ea8d3185a244f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.engine_host(\u0022chaos-rejected\u0022,\u0022~/chaos-root\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"3688a27a6384d943197e2fad27fb8fd8b1a1f26ecde9ee159eff29c22c61a7ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.engine_host(\u0022chaos-rejected\u0022,\u0022~/chaos-root\u0022).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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbcb7dba1318f42dcfd6b4125b05505800d6a0a17e2ce75330e9570318063a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060server.proxy().clear()\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c5a61f5fd68a5e1ef86c8078bd12755bd81ed910cf48e2d4ea1b4a394358d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060server.proxy().reset()\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac973333ec0ccad6922c254d1e450fd87d6ca91f0f7c6d60541fb5d6f3fbabb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060server.proxy().clear()\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee04a8fe5dbab560436f3fe2e7fb2a66d865adb3be6db9273e9fdae9b275f42d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.list_runs_by_experiment(\u0022exp\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"471aa4132a0ae9e52ed3df49992b5964910fd7de47a8356942165ca5fca6d5a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Phase::parse(\u0026run.status)\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0446a2b8ba72ec279a1966a2d6be5acb7b6fa7ab05c73a62eb88de6d83a2771"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.list_runs_by_experiment(\u0022exp\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18e6c0e8215e90a941ad520040b84fa56521bbf050f7901e7b0800f453237be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rusqlite::Connection::open(server.directory().join(\u0022store/orx.db\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff0e29b1acb1b566167d3da9af69169bd60e543fde9482b07ecb089a2776916"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060db.query_row(\u0022SELECT count(*) FROM log_collections WHERE done = 0\u0022,[],|row|row.get(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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"6357e169e960ac404fd5051257a41b788a6026761f1617951479fe90e3037ca7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.list_runs_by_experiment(\u0022exp\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 \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/runtime/chaos.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5e67dcf16007d15880de86832b8d5ae73a157912dcb74e5666c5921521b9f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060kept.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 \u0060kept_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":"src/engine/adapters/openresearch.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"040f1348b46898e75ab0c625765f02920f1636238925c327ce680f009ca2082b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060descriptor.openresearch_ssh_target()\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 \u0060inspect\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/adapters/openresearch.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ac331824b770a828aa2989f2bd722d3390dd0d4e1fe61edd226fa1ef987682"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060transport.log_dir.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 \u0060cancel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/engine/adapters/openresearch.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6c91682f08566cd907880da539da1487cf9d5cbb10ba029d5a0aff92534ef6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::net::remote_client().connect_timeout(Duration::from_secs(5)).build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060forward\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/commands/alphaxiv_mcp.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"947fe516692d54b20044f2cf50b602c3916812ffb333c92c2b8f3cda1d63c303"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060MainThreadMarker::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 \u0060run_event_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":"src/commands/app.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ded12e751ea8a1ecef50a310b49c0377ca7b3d94fddecb7086e23f53e1b07df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window.default_vbox()\u0060 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_event_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":"src/commands/app.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d63dd4d91510e201061213807db3f656f6915f716d5bfdd7ab0adb0c90eded"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060MainThreadMarker::new()\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 \u0060intercept_native_quit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/commands/app.rs"},"region":{"startLine":1770}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61df753b50af26dfed2338d3712f31b1f4294e8e59668f70551a0d8277f4f45"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060MainThreadMarker::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 \u0060add_window_material\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/commands/app.rs"},"region":{"startLine":2329}}}],"partialFingerprints":{"codehealthFindingId/v1":"50005e268526a033803e834f24daa3c7e8ad02fef0604b1a5c980223b5402ba3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ranges.iter().map(|range|range.offset\u002Brange.len).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 \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":"src/commands/logs.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff435e49f02ea800279a963567cbc0453b250ebb5578230e544b0ace1305ad5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060hmac::Hmac::\u003CSha256\u003E::new_from_slice(token.as_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 \u0060hello_mac\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/commands/remote_host.rs"},"region":{"startLine":1685}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4957120d326d459e07405460c188ced3fd776ab3259afabc95e245b052d51df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060remote_instance_id.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 \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":"src/commands/up.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6f3385b3028449733a316d83509d52e1d70c07c37912417c9e1180df3e0015"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060remote_auth.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 \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":"src/commands/up.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"685a52de2176ce92b469c93810435d63ac5ecd8324df485459f0146e418f90d1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(p)\u0060 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_json_with_artifacts_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":"src/commands/up.rs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea9ee0395df6e92ce5dd671e60bc1cdfb848144c7651b501d396c528de66e3b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060claude.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 \u0060overlay_claude_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/commands/up.rs"},"region":{"startLine":8516}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce304ee971f386678debe69428bda3c287090d302556574a600ca2d7caf0db2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060local::harness::resolve_entry(claude,default_model.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 \u0060enqueue_claude_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":"src/commands/up.rs"},"region":{"startLine":8633}}}],"partialFingerprints":{"codehealthFindingId/v1":"48752276afbf012dd5e8acd856903ca7e6229fa527d480f714de78f527695d86"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060payload[\u0022harnesses\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 \u0060finish_harnesses_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":"src/commands/up.rs"},"region":{"startLine":9122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a062d186475e8d8167c940536c8b5f458137ab041df2861dc3a4d87f2cb1103b"}},{"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.unwrap()\u0060 in \u0060serve_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/commands/up_remote.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e895bf10ebd4f3c83e1cf47cd317a8e0081fd6a58fe65766cee58895fdecbfd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060downstream_upgrade\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060proxy_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":"src/commands/up_remote.rs"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"295ca19f86b36072d2c4e5bb8c9631fc3c86bf9b6242abd74e46c8e1cd57039d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.rsplit_once(\u0027/\u0027)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060storage_root\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/commands/up_remote.rs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bbf7c6043a3fa37e347fc0cd9b8fd7ad2709156b5a5eabf24a1fbc1b6619aa"}},{"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.unwrap()\u0060 in \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/commands/up/api_v2.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c8d644916a019feaf75145cb257a0546afc6ab178881dc8ee2e354c0d2a0c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060digest[..8].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_log\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/commands/up/api_v2.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc451b21dbe710d7028d30b0c0fbd8ce26195457537c62b1cf01fd0ec2bae8a4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060written.iter().find(|(name,..)|*name==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 \u0060set_slurm_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/commands/up/compute_settings.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c119b38e186727390da92695cd046db4b13e98ae6f600297b22eb33bc9a52ffe"}},{"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.unwrap()\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":"src/commands/up/harness_setup.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f6324c3b66f5bb390904a66aa5e381182fe2a05e2b339b06a4e4ae5ac9ed47"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060update_command(harness)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060managed_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":"src/commands/up/harness_setup.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2f30a0ab52fb03dc62bc3b35b89ae76b06b7c2a8f66e313e6211ce34065e8a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060update_command(harness)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060keep_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":"src/commands/up/harness_setup.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"17886dcf76e23395fa64e98998b638579a4e4d081702e8eba1869d787ba3ec53"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/researchActivity.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3fed9d7ae3ad183a2deb13af0959782491cc85fd447e77485a9f07018ea401"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/researchActivity.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2b22064a55086eebf5cf02af4c4456a70e1b17ba7c3b95fd5d4d9596531923"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/researchActivity.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c973f6e3a79f93865dec6a7573a19dfe3e72d0bf61523f5aa0cca55b6535b0a"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060\u003Cdiv class=\u0022file-view-note flex items-center gap-2 py-2.5 px-4 text-sm text-muted\u0022\u003E\u0060 under \u0060page === null || page !== prepared . page\u0060, but \u0060page\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/HtmlPreview.tsx"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fb2ead6ddb3199e294902c4ba442df44270b12b05dbe2d233efc22571b984d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060cookie_files\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/browser_cookies.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"adec932531525aedc2426a93fc35d09f7fd529fca653bc8b16ca6b4f698b8934"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060renew_turn_leases\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/local/chat/mod.rs"},"region":{"startLine":4456}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e532991e5fda89779f3a70c425133ddaa1d49dd84d306fd432991c1bf4cd1b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060expand_ssh_include\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/commands/up/compute_settings.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"76856180a57e3c7c857cb60124daefe877ee78b84713279754072954b404dcf2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060default_api_url\u0060 turns every \u0060Err\u0060 into \u0060\u0022https://api.openresearch.sh\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":"src/config.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4b3e38b33eb41d3ab89c10045dee7bc09bbf0f8b957569083ff6d42a8595fd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060alphaxiv_api_url\u0060 turns every \u0060Err\u0060 into \u0060\u0022https://api.alphaxiv.org\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":"src/config.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdf917e09f8a16b5f3f16625a88ac68ebbe45f34c2abaeb08c87cbc8a3e48c1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060alphaxiv_web_url\u0060 turns every \u0060Err\u0060 into \u0060\u0022https://www.alphaxiv.org\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":"src/config.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"792d6b0bd0ec8cea40edad4773feb262fa49db99ad7e31d872536e352bf570b8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060openalex_api_url\u0060 turns every \u0060Err\u0060 into \u0060\u0022https://api.openalex.org\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":"src/config.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2a4ea31102d4d305f99eadc0c8d733b5935b75a76f123e71c10f837ad1ceae"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060biorxiv_api_url\u0060 turns every \u0060Err\u0060 into \u0060\u0022https://api.biorxiv.org\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":"src/config.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8e27cea7f8b8e9be6377c554864c7a2f8519b64c3e75ba0ed093dbb2f96e50"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060pubmed_api_url\u0060 turns every \u0060Err\u0060 into \u0060\u0022https://eutils.ncbi.nlm.nih.gov/entrez/eutils\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":"src/config.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ef1bf6581f7847345fe9f26a50d57a1850e9eb31edd02054a6d74fbd40b7f4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060ncbi_email\u0060 turns every \u0060Err\u0060 into \u0060\[e-mail redacted]\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":"src/config.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"833e6024bc96546f035f9f6789a2fc88f3673083bd7f955c8f92fe8b195d238c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_synced_env\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/config.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0364bb1d20cb996e1566438f317f3e5358bd71838811bd2380968544a14e23"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060orx\u0060 turns every \u0060Err\u0060 into \u0060\u0022orx\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":"src/invocation.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"abef68782db5210084f80d11d6f0cc0f06bd6901ffc7d223ad3fcce15ecb54e5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060endpoint\u0060 turns every \u0060Err\u0060 into \u0060\u0022https://huggingface.co\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":"src/jobs/huggingface.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e039fd9efe652319a566d4bca7c8e5decf7cabea3d1e249d615306302c9125"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060dir_size\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/datadir.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb45ba856cf9beed66679845c4bfa0d033498d96c041171ddd6fd8325230c73"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060installed_plugin_skills_dirs\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/local/harness/claude.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"0800d5f4d331c2edd3d74cc8833e8fd6f99102a672d467757be80f63a20379cf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060plugin_skill_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/local/harness/claude.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ca4bd10445ed9b447f5043619fc3effd2557b40a4fa20aceb4aed7cc034bf4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_log_tail\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/harness/cursor.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73bc970ac8e4146ed190cd52ccfce6b516dfbb99c1533c6baa6faf793e77ad4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_in\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/local/latex_templates.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e57ec7d44eb8544ef02d43283ff27f8437cdd1bbfc4f3cea68a79b2c4a54c13"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060claude_sources\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/local/native_chats.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3d95ba2008b345bee40e843cf27b98e9490143681f6debb1ca8ca4f8c7a5c4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060support_files\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/local/overleaf.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d264d9d35abfdbbabcea1ddb996a5eb29c68e9750581820799e89e4a2df72f48"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_uploaded_in\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/local/user_skills.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd1b36bc28c2cb5719fbd6b0391bf19dbe12962f87d839ccf3366c9b921685c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_project_skills\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/local/user_skills.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c2e5624441b7e121168522fd1d5776625589cd8331f5616958f89fd97b9e40"}}],"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-117","guid":"1cfadbc2-a979-485e-b768-c70fc922201e","name":"Improper Output Neutralization for Logs","shortDescription":{"text":"Improper Output Neutralization for Logs"},"helpUri":"https://cwe.mitre.org/data/definitions/117.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-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-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-88","guid":"32dec161-013d-ac58-8599-1309e12e67f5","name":"Improper Neutralization of Argument Delimiters in a Command (\u0027Argument Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Argument Delimiters in a Command (\u0027Argument Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/88.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"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-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":66,"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."]}]}