{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D25","name":"ADR Conformance","shortDescription":{"text":"ADR Conformance"},"helpUri":"https://codehealth.canine.dev/dimensions/D25"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"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":"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":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"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":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"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":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"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":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"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":"codex-native-hook.dispatchCodexNativeHook (cyclomatic 290): codex-native-hook.dispatchCodexNativeHook has cyclomatic complexity 290 (threshold 15). Of this number, 288 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":21948}}}],"partialFingerprints":{"codehealthFindingId/v1":"6267db40db3ec606231f8a3f2f974f4330235baaa4fd0ffceb9ff48b8440d984"}},{"ruleId":"D1","level":"warning","message":{"text":"api-interop.executeTeamApiOperation (cyclomatic 275): api-interop.executeTeamApiOperation has cyclomatic complexity 275 (threshold 15). Of this number, 270 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/api-interop.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"970a219538fd5bb43c2a292a3e6a0a203742b50d8decb1a8bfe6ec62cb077b08"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectConductorDownloaderOutputTargets (cyclomatic 274): codex-native-hook.collectConductorDownloaderOutputTargets has cyclomatic complexity 274 (threshold 15). Of this number, 249 points are the body\u0027s own statements and 25 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14853}}}],"partialFingerprints":{"codehealthFindingId/v1":"48252cd08672a64a6d47fb4eaf5ab0c17515819016128acd790e41762283e7ba"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.shutdownTeam (cyclomatic 232): runtime.shutdownTeam has cyclomatic complexity 232 (threshold 15). Of this number, 159 points are the body\u0027s own statements and 73 belong to 18 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":"src/team/runtime.ts"},"region":{"startLine":5068}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e5e1beb3eb0508e25743f03f11844618ea6366dae7e9de127cebd77a41056a"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.setup (cyclomatic 231): setup.setup has cyclomatic complexity 231 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/cli/setup.ts"},"region":{"startLine":4449}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f7f56f65d94e8d59571409f0bede1f0dc50debb03bcd7a2f5c0300f376f183"}},{"ruleId":"D1","level":"warning","message":{"text":"notify-hook.main (cyclomatic 197): notify-hook.main has cyclomatic complexity 197 (threshold 15). Of this number, 194 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":"src/scripts/notify-hook.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7fee65a0172a958e1d48b58d5be116facb6b6abd83dbd85b63fdf9001e278a"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.inspectConductorRuntimeExecutions (cyclomatic 174): codex-native-hook.inspectConductorRuntimeExecutions has cyclomatic complexity 174 (threshold 15). Of this number, 165 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13056}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c140b0322a486dbd43d7e58f0bf846d8e7ee9dafad2733293dbafd54abfd8e3"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.scanConductorShellSegment (cyclomatic 171): codex-native-hook.scanConductorShellSegment has cyclomatic complexity 171 (threshold 15). Of this number, 166 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18826}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd577b359c96cfa4b3e4d40e7de56a29d51596d3483842c09637358ac66873be"}},{"ruleId":"D1","level":"warning","message":{"text":"scaling.scaleUp (cyclomatic 169): scaling.scaleUp has cyclomatic complexity 169 (threshold 15). Most of this is not in the body itself: 4 of the 169 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 602, 784, 908, \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":"src/team/scaling.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d807b403ae8b44d6ba271be1b8e94e05bbb24a6d57953541c084bb73b2b88b"}},{"ruleId":"D1","level":"warning","message":{"text":"smoke-packed-install.smokeInstalledNativeHookDist (cyclomatic 158): smoke-packed-install.smokeInstalledNativeHookDist has cyclomatic complexity 158 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This shape REPEATS in the file: one other method here (smoke-packed-install.smokeInstalledNativeHookDist::runPackedTransportRegressions) 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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d6ee491c0292ecd2690784878d83e8b71bbf34d53187ab7f1c3de8b3ff3940"}},{"ruleId":"D1","level":"warning","message":{"text":"team-leader-nudge.maybeNudgeTeamLeader (cyclomatic 154): team-leader-nudge.maybeNudgeTeamLeader has cyclomatic complexity 154 (threshold 15). To reduce it, separate the cases: extract each independent 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 (team-leader-nudge.maybeNudgeTeamLeader::persistLeaderNudgeBookkeeping) 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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a203b00f087406d46c7334fb79a2e8b6bdb97406cac797defceda712b47723"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-detector.recordSkillActivation (cyclomatic 133): keyword-detector.recordSkillActivation has cyclomatic complexity 133 (threshold 15). Of this number, 120 points are the body\u0027s own statements and 13 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":"src/hooks/keyword-detector.ts"},"region":{"startLine":3883}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ebc3fc653b89c2d7aef25e4094381264df8a9c7b1614ebd79381f4b967651e"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.applyShellPosixStateEffect (cyclomatic 132): codex-native-hook.applyShellPosixStateEffect has cyclomatic complexity 132 (threshold 15). Of this number, 123 points are the body\u0027s own statements and 9 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18083}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7dbce8258dc714c18193278190a9f0503484aa718df27bf95ffee577c15a09"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.startTeam (cyclomatic 131): runtime.startTeam has cyclomatic complexity 131 (threshold 15). To reduce it, separate the cases: extract each independent 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 (runtime.startTeam::runWorkerStartupAttempt) 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":"src/team/runtime.ts"},"region":{"startLine":3562}}}],"partialFingerprints":{"codehealthFindingId/v1":"67357d6df32a58510d52a5be2438cb698ab095ac19760739d2641de820d3cdfd"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-session.createTeamSession (cyclomatic 125): tmux-session.createTeamSession has cyclomatic complexity 125 (threshold 15). Of this number, 108 points are the body\u0027s own statements and 17 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":"src/team/tmux-session.ts"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0e60728bb8f7bc3098af32632dca6946ae9fe39384710a79dc0bc429231677"}},{"ruleId":"D1","level":"warning","message":{"text":"timeline.buildSessionTimeline (cyclomatic 106): timeline.buildSessionTimeline has cyclomatic complexity 106 (threshold 15). Of this number, 83 points are the body\u0027s own statements and 23 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/timeline.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"382d06b60cfa591ef2bb07d7591f83546690a485a773fc79955e89eaf40f5ad0"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.extractNodeFsSemanticMutations (cyclomatic 102): codex-native-hook.extractNodeFsSemanticMutations has cyclomatic complexity 102 (threshold 15). Of this number, 82 points are the body\u0027s own statements and 20 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13472}}}],"partialFingerprints":{"codehealthFindingId/v1":"a131267694c31167324f563c5a272cc02d0b9d230d0793daf64565bdcc8c8196"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 102): main has cyclomatic complexity 102 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 47 belong to 10 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8084276b37082ed7fd728cb23cb272a2b2ca1d375bb40223f856564aef98b84"}},{"ruleId":"D1","level":"warning","message":{"text":"operations.executeStateOperation (cyclomatic 95): operations.executeStateOperation has cyclomatic complexity 95 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 77 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":"src/state/operations.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"9076e7df867e8b9cfe5f53b377554e0bf2938396e13e5e47247e53061e28c79f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.runWatchMode::renderTick (cyclomatic 91): index.runWatchMode::renderTick has cyclomatic complexity 91 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/hud/index.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b842418b316d801aee585a33592c11d3302ab2875d65080d1f67b1fbe598955"}},{"ruleId":"D1","level":"warning","message":{"text":"reconcile.reconcileHudForPromptSubmit (cyclomatic 89): reconcile.reconcileHudForPromptSubmit has cyclomatic complexity 89 (threshold 15). Of this number, 66 points are the body\u0027s own statements and 23 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":"src/hud/reconcile.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec2f0437934943ad0a0f9d0d4e7788480a1f81e5c5b7179c3d4b083fe7ee836"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.materializePackagedOmxPluginCacheImpl (cyclomatic 88): plugin-marketplace.materializePackagedOmxPluginCacheImpl 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/cli/plugin-marketplace.ts"},"region":{"startLine":3876}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c84055b7034848e21aaba11d674545959a8cff306750815bfd9b2cfe967f38"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectConductorMutationCommandTargets (cyclomatic 87): codex-native-hook.collectConductorMutationCommandTargets has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15724}}}],"partialFingerprints":{"codehealthFindingId/v1":"0619c02d3c3e4749b4d869338751648fe760f35771f60ae5f10fb04e2a70fc2e"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-detector.persistStatefulSkillSeedState (cyclomatic 84): keyword-detector.persistStatefulSkillSeedState has cyclomatic complexity 84 (threshold 15). Of this number, 78 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b41bab960fa2ccc70fd156db90344f8adbb540aa106f6e7fe2269e31e24fd8d"}},{"ruleId":"D1","level":"warning","message":{"text":"advisory.readProjectionForGeneration (cyclomatic 82): advisory.readProjectionForGeneration has cyclomatic complexity 82 (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/ralplan/advisory.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a75e1ec27fe42584f8f1533de0e070cf93930c01f5264df81b47c8c26d606df"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.commandHasUnsafeDynamicLoaderEnvironment (cyclomatic 82): codex-native-hook.commandHasUnsafeDynamicLoaderEnvironment has cyclomatic complexity 82 (threshold 15). Of this number, 76 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11828}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b5bfe7c1cae409bc66d5b07b4b659f57b0fcb878e09642928a8e8afbbcf315"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.removeChildIfIdentity (cyclomatic 80): plugin-marketplace.removeChildIfIdentity has cyclomatic complexity 80 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 27 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b10822335707c38a7eaca7333e12ac822121b7be7751eadde182fce70846b86"}},{"ruleId":"D1","level":"warning","message":{"text":"artifacts.checkpointUltragoal (cyclomatic 79): artifacts.checkpointUltragoal has cyclomatic complexity 79 (threshold 15). Most of this is not in the body itself: 1 of the 79 points is its own statement and the rest belongs to one function literal inside it that branches (line 1797). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ultragoal/artifacts.ts"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c37b62b1ce5e0d0beb494edfb6819f849cd571ff6a3570006cd66bd02caabf"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-injection.handleTmuxInjection (cyclomatic 77): tmux-injection.handleTmuxInjection has cyclomatic complexity 77 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 14 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":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6f0d0fb260e9c292f4c006f9c75040934c95b0ba72a7f3e0c86b01375abdcf"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.readOmxPluginCacheFileNoFollow (cyclomatic 76): plugin-marketplace.readOmxPluginCacheFileNoFollow has cyclomatic complexity 76 (threshold 15). Of this number, 75 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/cli/plugin-marketplace.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ef2b6aea5f8332d07e549528a84560acd6bdb3cb83b0a4fba3e494488024b9"}},{"ruleId":"D1","level":"warning","message":{"text":"notify-fallback-delivery.deliverNotifyFallback (cyclomatic 76): notify-fallback-delivery.deliverNotifyFallback has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96fe41ca434e9aa537f745818d02f4b67d54c696d6b466609c7d54752caa8d6"}},{"ruleId":"D1","level":"warning","message":{"text":"index.main (cyclomatic 75): index.main 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, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/cli/index.ts"},"region":{"startLine":5072}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f51e704101313a33c3f0868cb768529972aa4794db26fbd0395296cc96c0b0"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.recordSubagentTurn (cyclomatic 74): tracker.recordSubagentTurn has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fc4decfa3ec126dd9661d4d5c460a027f8dedd5901a3cf97cd5b8057c4b170"}},{"ruleId":"D1","level":"warning","message":{"text":"pane-status.readTeamPaneStatus (cyclomatic 72): pane-status.readTeamPaneStatus has cyclomatic complexity 72 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 50 belong to 46 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":"src/team/pane-status.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e6e3dbac18326d066b44f2c28513aba63039790ce8921d248b08c394e99500"}},{"ruleId":"D1","level":"warning","message":{"text":"scaling.scaleDown (cyclomatic 70): scaling.scaleDown has cyclomatic complexity 70 (threshold 15). Most of this is not in the body itself: 1 of the 70 points is its own statement and the rest belongs to 13 function literals inside it that branch (lines 1940, 2087, 2187, \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":"src/team/scaling.ts"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b851c54e0289ce1b9008bee6a134938ae8236c0d78a9df37984ee117b31c4a"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.collectTeamDoctorIssues (cyclomatic 70): doctor.collectTeamDoctorIssues has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/cli/doctor.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"714ab801156c52847bf237c5ae2595db376854f5630720a69ee97ccd0ebaf395"}},{"ruleId":"D1","level":"warning","message":{"text":"team.teamCommand (cyclomatic 70): team.teamCommand has cyclomatic complexity 70 (threshold 15). Of this number, 65 points are the body\u0027s own statements and 5 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":"src/cli/team.ts"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76f9ca9bef52a9805e161221ff71c218681e6b3f589e525bf5c8a22fffe08d5"}},{"ruleId":"D1","level":"warning","message":{"text":"ralplan.ralplanCommand (cyclomatic 70): ralplan.ralplanCommand has cyclomatic complexity 70 (threshold 15). Of this number, 65 points are the body\u0027s own statements and 5 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":"src/cli/ralplan.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc32a184dcac59b803640573a47eed4f0717dbfcb57eda4ea31b9e06aae700b"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.monitorTeam (cyclomatic 69): runtime.monitorTeam has cyclomatic complexity 69 (threshold 15). Of this number, 66 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":"src/team/runtime.ts"},"region":{"startLine":4609}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2706a9c21ee0efad4c089474fdf510fd9cae7b1d113c4c7562edd6a54dda46c"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.formatStateRootSessionBindingDiagnostic (cyclomatic 69): doctor.formatStateRootSessionBindingDiagnostic has cyclomatic complexity 69 (threshold 15). Of this number, 64 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc631a88390ee74e507776f3b611a8a30fc086a4355330959cf1c28c88bf187"}},{"ruleId":"D1","level":"warning","message":{"text":"team-dispatch.injectDispatchRequest (cyclomatic 69): team-dispatch.injectDispatchRequest has cyclomatic complexity 69 (threshold 15). Of this number, 66 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":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4672eb0c9d2302b49f90eb7196f794e30d44f7a139eff1fb9ceb3dd4443704"}},{"ruleId":"D1","level":"warning","message":{"text":"session.recoverDeadSessionPointer (cyclomatic 68): session.recoverDeadSessionPointer has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"009325866e428f1061934d1bf53b56a41c8cc4e119fe7f8763e49c274d6d145c"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.normalizeSubagentTrackingState (cyclomatic 67): tracker.normalizeSubagentTrackingState has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/subagents/tracker.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc150cb7a31457207e0d746bec98a04df15001b6b94a19e66186e3e72f9e2cd"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.firstInterpreterScriptOperands (cyclomatic 66): codex-native-hook.firstInterpreterScriptOperands has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f004498ae6b6020a561555e395c24acc51a4b381d46c9a944caccc845941a7fa"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.commandHasUnsafeConductorShellState (cyclomatic 66): codex-native-hook.commandHasUnsafeConductorShellState has cyclomatic complexity 66 (threshold 15). Of this number, 63 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11668}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3be1d94c30d59bb7a3e8bcce5b7c3c8c6fa2a3b79c52066d160306cdf883f9"}},{"ruleId":"D1","level":"warning","message":{"text":"team.formatInspectItemLine (cyclomatic 65): team.formatInspectItemLine has cyclomatic complexity 65 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"378470b8964ac052964faa1436c2361ec6a51c01d653433d328912a1c722fc3e"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.parseStrictSubagentTrackingState (cyclomatic 64): tracker.parseStrictSubagentTrackingState has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29ed1180248fe3cd34337da2b5c81056fc3bb237afc5f7d3de8bf272053821a"}},{"ruleId":"D1","level":"warning","message":{"text":"ultragoal.ultragoalCommand (cyclomatic 64): ultragoal.ultragoalCommand has cyclomatic complexity 64 (threshold 15). Of this number, 63 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/cli/ultragoal.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf230a311ec1c0c2f85f04c7f3b7abfad40c9f9cf8798aabea35bcded8e609f1"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.registerOmxPluginCacheLivePin (cyclomatic 63): plugin-marketplace.registerOmxPluginCacheLivePin has cyclomatic complexity 63 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/cli/plugin-marketplace.ts"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffe891fdbd246a0b0a2b838c35429b95333057f52d32aacd53bc7e455a666f1"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.evaluateConductorBashWrite (cyclomatic 63): codex-native-hook.evaluateConductorBashWrite has cyclomatic complexity 63 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 13 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":20192}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e4d717c4f6084c4a96a83a2a64bcaf0e618fd5bdbcb770061bd69a0cbca84e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.runDetachedSessionLeader (cyclomatic 62): index.runDetachedSessionLeader has cyclomatic complexity 62 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 14 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":"src/cli/index.ts"},"region":{"startLine":8999}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e432e9cbab0f044f3610749c38c0473362c869b4908868bec029e23d171966"}},{"ruleId":"D1","level":"warning","message":{"text":"team-worker.maybeNotifyLeaderWorkerIdle (cyclomatic 61): team-worker.maybeNotifyLeaderWorkerIdle has cyclomatic complexity 61 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/scripts/notify-hook/team-worker.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"890737e90897d5b8c9186286d9c9b336c4d9fc7692d39f69c44e12402b265283"}},{"ruleId":"D1","level":"warning","message":{"text":"state.retireTeamMailboxMessages (cyclomatic 60): state.retireTeamMailboxMessages has cyclomatic complexity 60 (threshold 15). Most of this is not in the body itself: 15 of the 60 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 2581, 2593, 2621, \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":"src/team/state.ts"},"region":{"startLine":2547}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9121933557d0541b97bcf3109b5139b5ad405d1f32b33c67e42b9dda04121df"}},{"ruleId":"D1","level":"warning","message":{"text":"code-intel-server.handleCodeIntelToolCall (cyclomatic 60): code-intel-server.handleCodeIntelToolCall has cyclomatic complexity 60 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/code-intel-server.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e8d89cdede9ed1fcacf125427ca102a5cb716140c05860efdc78a3bf90c179"}},{"ruleId":"D1","level":"warning","message":{"text":"team-tmux-guard.evaluatePaneInjectionReadiness (cyclomatic 59): team-tmux-guard.evaluatePaneInjectionReadiness has cyclomatic complexity 59 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 8 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":"src/scripts/notify-hook/team-tmux-guard.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd792c8335e1aeace1d2d88e494066f993e76122f7c21d06ac1909948db5f77"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.tokenizeShellWords (cyclomatic 59): codex-native-hook.tokenizeShellWords has cyclomatic complexity 59 (threshold 15). Of this number, 56 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6802}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55fd0b78beba15ff189f44274f351ae87d03e6129bd0486e7537955ed01b035"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.unwrapOmxStateTransportCommandOnce (cyclomatic 59): codex-native-hook.unwrapOmxStateTransportCommandOnce has cyclomatic complexity 59 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7054}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db788e929641b59de76da5d569a0b3b431f00402e2726ef893102e5d38ffb9e"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.reconcileProjectTrustPayload (cyclomatic 55): generator.reconcileProjectTrustPayload has cyclomatic complexity 55 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b255342fcd213159641e020771e1e36449512c62281b15216e4dbc2f67a30e09"}},{"ruleId":"D1","level":"warning","message":{"text":"mode-binding-lease-helper.readPinnedOwner (cyclomatic 55): mode-binding-lease-helper.readPinnedOwner has cyclomatic complexity 55 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 5 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":"src/state/mode-binding-lease-helper.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccea4c683147eb420a55432d774c438c5bd5d925b1561c008732addd3131386"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.isLivePinnedSnapshot (cyclomatic 54): plugin-marketplace.isLivePinnedSnapshot has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"de667a7cb91f3f21246a19752c73ebb80286721f067721c5ce28bbd931f967be"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectConductorStaticReadOnlyDownloadUrls (cyclomatic 54): codex-native-hook.collectConductorStaticReadOnlyDownloadUrls has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14629}}}],"partialFingerprints":{"codehealthFindingId/v1":"57090d93bedca16e9645ddf6a464874d895fd2322bb22b8b4e744b13621b5d50"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.consumeDirectChildReopenContext (cyclomatic 53): tracker.consumeDirectChildReopenContext has cyclomatic complexity 53 (threshold 15). Most of this is not in the body itself: 3 of the 53 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 1637, 1665, 1675, \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":"src/subagents/tracker.ts"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"006a7bd1c5c80d423dbe46e9ed0920e0ef9ce6f0d9bb61fb2650d61b614e9e85"}},{"ruleId":"D1","level":"warning","message":{"text":"memory-server.handleMemoryToolCall (cyclomatic 52): memory-server.handleMemoryToolCall has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/memory-server.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7630558e11b27c28c5b97b80b27d74a26afa936d0d3c7edfa9a9a92416aff0"}},{"ruleId":"D1","level":"warning","message":{"text":"uninstall.uninstall (cyclomatic 52): uninstall.uninstall has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.ts"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e75fb26eb33541d3035acdf51e3fab4b5a741ec54d49e48b4028b712463956"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isAllowedDeepInterviewBashWrite (cyclomatic 52): codex-native-hook.isAllowedDeepInterviewBashWrite has cyclomatic complexity 52 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 14 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10340}}}],"partialFingerprints":{"codehealthFindingId/v1":"89086b25f55eca79681e0da1cfb7d11888d5dbf619f44fd08b2d61014f39dce0"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.maskJavaScriptStringsAndComments (cyclomatic 52): codex-native-hook.maskJavaScriptStringsAndComments has cyclomatic complexity 52 (threshold 15). Of this number, 50 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11278}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a90bf7e1538aee580efd995607bad31015500e9d368b545e4f7414a639ac3d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.cancelModes (cyclomatic 52): index.cancelModes has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (index.cancelModes::loadStates) 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":"src/cli/index.ts"},"region":{"startLine":10503}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c38e07683c1e846a9cd3b6bba0e3c32159b873ba799f04ed35e42a8b9b55a2"}},{"ruleId":"D1","level":"warning","message":{"text":"session.resumeRecoveryCheckpoint (cyclomatic 51): session.resumeRecoveryCheckpoint has cyclomatic complexity 51 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/hooks/session.ts"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd191236f97fe655e59e4922e3447b189808b21e1ef2222c69459b6b538ff309"}},{"ruleId":"D1","level":"warning","message":{"text":"auto-nudge.maybeAutoNudge (cyclomatic 51): auto-nudge.maybeAutoNudge has cyclomatic complexity 51 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"888793a57ba69a02cb4511f4b693cfa1b3281f3113e0f535e1e45fe72506f8c0"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isPositivelyReadOnlyNodeInlineEval (cyclomatic 51): codex-native-hook.isPositivelyReadOnlyNodeInlineEval has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13726}}}],"partialFingerprints":{"codehealthFindingId/v1":"2933a9650a7f5bd951fb1e8d4215bd585587376dedba42a2d1d90ed79701f45e"}},{"ruleId":"D1","level":"warning","message":{"text":"update.executeUpdate (cyclomatic 50): update.executeUpdate has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"b882dd847a7b904638d28a2bd9608c9edf430c9965df936a4f8f9ae23379d0aa"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.writePendingSessionRegistration (cyclomatic 49): codex-native-hook.writePendingSessionRegistration has cyclomatic complexity 49 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 5 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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d95aba5a82fe8c85b4975434a5974a5b74e441ec735b4f846ac3531930b2b61"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.buildStopHookOutput (cyclomatic 49): codex-native-hook.buildStopHookOutput 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":21527}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98a4cb9cf14374832d73d858263c8889dc5ca772f86f935a43405b916490e40"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.joinConductorShellStates (cyclomatic 47): codex-native-hook.joinConductorShellStates has cyclomatic complexity 47 (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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16863}}}],"partialFingerprints":{"codehealthFindingId/v1":"a375a4e0e5db623c2cd121471e79b29703d06ecc3883e1e945c4b5c9e72e03c1"}},{"ruleId":"D1","level":"warning","message":{"text":"team-dispatch.drainPendingTeamDispatch (cyclomatic 47): team-dispatch.drainPendingTeamDispatch has cyclomatic complexity 47 (threshold 15). Most of this is not in the body itself: 9 of the 47 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1191, 1204). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"379a65bb92e3471385b002f7ef4589b0e205d1db4b69fb74abbd52ca55ad4193"}},{"ruleId":"D1","level":"warning","message":{"text":"mode-binding-lease-helper.runPinnedClaimMode (cyclomatic 47): mode-binding-lease-helper.runPinnedClaimMode 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/state/mode-binding-lease-helper.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc4fd3a7cd511125549b95813dea5d844ac5fc83e950a55259b36fd901203c5"}},{"ruleId":"D1","level":"warning","message":{"text":"team-worker-stop.maybeNudgeLeaderForAllowedWorkerStop (cyclomatic 46): team-worker-stop.maybeNudgeLeaderForAllowedWorkerStop has cyclomatic complexity 46 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd73b33046345a7b647e1aefd628a9c79cdb001534e9086bf261f669a32df94"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.buildAdditionalContextMessage (cyclomatic 46): codex-native-hook.buildAdditionalContextMessage has cyclomatic complexity 46 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2770}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd99fd02cd5602e2b22b2a4d5e524f2ecd1e246ac60a8036617c0abc0f6b8c0"}},{"ruleId":"D1","level":"warning","message":{"text":"index.runCodex (cyclomatic 46): index.runCodex has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (index.runCodex::launchDetachedSession::bootstrapLeader) 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":"src/cli/index.ts"},"region":{"startLine":8119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9373e45cb7c405aac68d4748efee3ced0abc00a179658c018bc7de7208e82ff5"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.installSkills (cyclomatic 45): setup.installSkills has cyclomatic complexity 45 (threshold 15). Of this number, 44 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":"src/cli/setup.ts"},"region":{"startLine":6363}}}],"partialFingerprints":{"codehealthFindingId/v1":"87402648949f9db31c114c842565c141fe55440862843139ad8f3d8fc70951a1"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.integrateWorkerCommitsIntoLeader (cyclomatic 44): runtime.integrateWorkerCommitsIntoLeader has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"7760e2ffba48c613c5c44d9aad26a7593f3ad59ba7458fe0a53db7a00be87da9"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.teamWorkerMutationTargetsProtectedWorkflowState (cyclomatic 44): codex-native-hook.teamWorkerMutationTargetsProtectedWorkflowState has cyclomatic complexity 44 (threshold 15). Of this number, 42 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10697}}}],"partialFingerprints":{"codehealthFindingId/v1":"305ab9272839c57c98c0533f78e6220e5f0d0a6928d244d0421ccb465e10f8e1"}},{"ruleId":"D1","level":"warning","message":{"text":"state-root.resolveVerifiedDetachedTeamContext (cyclomatic 43): state-root.resolveVerifiedDetachedTeamContext has cyclomatic complexity 43 (threshold 15). Of this number, 41 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":"src/team/state-root.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4355c33c07137030f228868a0482485a6e8dfafc9e3be96150426a35ae781ede"}},{"ruleId":"D1","level":"warning","message":{"text":"mailbox.sendDirectMessage (cyclomatic 43): mailbox.sendDirectMessage has cyclomatic complexity 43 (threshold 15). Most of this is not in the body itself: 3 of the 43 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 218, 260, 247, \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":"src/team/state/mailbox.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2c54bb34647846ff1bd74aef27c17472ce12e227517680a1030447c9eeeaff"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux.parseTmuxPaneSnapshot (cyclomatic 43): tmux.parseTmuxPaneSnapshot has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e07d61b6dcdfef083987d869d36791c593d02cb6813cee7bdf102ea6ed476af"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.retireUnpinnedManagedSnapshots (cyclomatic 43): plugin-marketplace.retireUnpinnedManagedSnapshots has cyclomatic complexity 43 (threshold 15). Of this number, 42 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/cli/plugin-marketplace.ts"},"region":{"startLine":3665}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f3ab3a4d7bf19f95fe65bfd8c88d79c62a15a387b97425efc532884c2fb9b9"}},{"ruleId":"D1","level":"warning","message":{"text":"mission.parseMissionArgs (cyclomatic 43): mission.parseMissionArgs has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mission.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea1797a834149bcf6ae3bc4e991ac5c54f35eae28e1a204300c074ad512a9b4"}},{"ruleId":"D1","level":"warning","message":{"text":"model-contract.parseTeamWorkerLaunchArgs (cyclomatic 42): model-contract.parseTeamWorkerLaunchArgs has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/model-contract.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c6658c46148dd626bd2e897f98838a2a6fd1b0c68690b8e49643f7a97cf357"}},{"ruleId":"D1","level":"warning","message":{"text":"triage-heuristic.triagePrompt (cyclomatic 42): triage-heuristic.triagePrompt has cyclomatic complexity 42 (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/hooks/triage-heuristic.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"359b574c4be26b12696ccc1d20d151feb8da618da474ef3beb07c496a4f1a20f"}},{"ruleId":"D1","level":"warning","message":{"text":"friction.inspectRolloutFile (cyclomatic 42): friction.inspectRolloutFile has cyclomatic complexity 42 (threshold 15). Of this number, 41 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/session-history/friction.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4b858091c3a9cf4ef6fa359eaeab6d390f2f7e6393abf27fc9a4343411bbef"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.buildSessionStartContext (cyclomatic 42): codex-native-hook.buildSessionStartContext has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c59fa71d26358e3beb22f2848b1f9d1e0e604eac9254160607ffed694c9a32"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.rsyncInvocationHasUnsafeRuntimeEnvironment (cyclomatic 42): codex-native-hook.rsyncInvocationHasUnsafeRuntimeEnvironment has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19799}}}],"partialFingerprints":{"codehealthFindingId/v1":"197d467c677081f1a9be8c965bb8791f4c8348325aceba11af31b99eabb30b68"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.conductorStateWriteTransportIsBoundToActiveSession (cyclomatic 42): codex-native-hook.conductorStateWriteTransportIsBoundToActiveSession has cyclomatic complexity 42 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":20109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac16c7e4ab05b0d6ce40ccd4740666fe163992619894aaa5342f9730529750c8"}},{"ruleId":"D1","level":"warning","message":{"text":"omx_sparkshell::parse_input (cyclomatic 42): omx_sparkshell::parse_input has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-sparkshell/src/main.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"27589f58b69fad3940bcebcb3d939b5b1caf1000171af799c750b0b61381bc46"}},{"ruleId":"D1","level":"warning","message":{"text":"policy.validateNativeReleaseManifest (cyclomatic 41): policy.validateNativeReleaseManifest has cyclomatic complexity 41 (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/native-assets/policy.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96df949ce21c4659c630749531a372fce9f85993f0ee7af62b672cdcd637bdb"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.runRalplanConsensus (cyclomatic 41): runtime.runRalplanConsensus 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/ralplan/runtime.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7b93b28221ccea8a94219a503fbebbe4a61b33aaf71f594b9574f0afde9cac"}},{"ruleId":"D1","level":"warning","message":{"text":"team-tmux-guard.sendPaneInput (cyclomatic 41): team-tmux-guard.sendPaneInput has cyclomatic complexity 41 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-tmux-guard.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"586c92cc585a35573db19a57fabd02a18de2fcbd7fb28ec1d80d58b38c4ded79"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-pre-post.tokenizeShellCommandWithBoundaries (cyclomatic 41): codex-native-pre-post.tokenizeShellCommandWithBoundaries has cyclomatic complexity 41 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-pre-post.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd29456ff36e9b08165450e108370f6dde30b4bf06900f1158cd272ee04fd1d"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.applyConductorTrackedVariableWriter (cyclomatic 41): codex-native-hook.applyConductorTrackedVariableWriter has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17372}}}],"partialFingerprints":{"codehealthFindingId/v1":"46af78e85ba7b5417bc091a40c1e6d61dc36e069bbed3860ccfc8e6f8b9cbc58"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.scanConductorShellSource (cyclomatic 41): codex-native-hook.scanConductorShellSource has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19624}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ffae651ddd3351d0855c0e44781aa0ca85885af61ec5c71f3219875cbd8615"}},{"ruleId":"D1","level":"warning","message":{"text":"index.notifyLifecycle (cyclomatic 41): index.notifyLifecycle has cyclomatic complexity 41 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/index.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c1919086617872cb9003f332c4d505630d74a8b70d76a85bce98797acf0fe1"}},{"ruleId":"D1","level":"warning","message":{"text":"advisory.readCurrentRalplanAdvisory (cyclomatic 40): advisory.readCurrentRalplanAdvisory 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/ralplan/advisory.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3620d89e1df7a4965a72327953cb393d0af996c29cc869905beae1332ddf3135"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.sweepExpiredOmxPluginCacheLivePinIntents (cyclomatic 40): plugin-marketplace.sweepExpiredOmxPluginCacheLivePinIntents has cyclomatic complexity 40 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6312b019f7d8212362f44a4c83d2a0117544abc283efe64037366fdeccb110"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.planNativeHookSetupTransaction (cyclomatic 40): setup.planNativeHookSetupTransaction 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/cli/setup.ts"},"region":{"startLine":4113}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0d2176e351daf358ad3b65f7427598765ac550abfc24f4bc6b37e78728be82"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.parseShellHeredocDelimiter (cyclomatic 40): codex-native-hook.parseShellHeredocDelimiter 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8649}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ce294a85441070cb1f5c9de5b4f10e377e55045e983b75174fb15885512125"}},{"ruleId":"D1","level":"warning","message":{"text":"index.cleanupPostLaunchModeStateFiles (cyclomatic 40): index.cleanupPostLaunchModeStateFiles has cyclomatic complexity 40 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":7776}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6f4d5693d0f2f7ae657103e1f7a8843e6b1560fe13ac2cf14dee117f7cb3fc"}},{"ruleId":"D1","level":"warning","message":{"text":"smoke-packed-install.smokePackedHookTrustLifecycle (cyclomatic 40): smoke-packed-install.smokePackedHookTrustLifecycle has cyclomatic complexity 40 (threshold 15). Of this number, 39 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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":5026}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3aaec3ec6d9943e023e5743e79e35a008f84621e68af9a723d415a34a53e84"}},{"ruleId":"D1","level":"warning","message":{"text":"tasks.transitionTaskStatus (cyclomatic 39): tasks.transitionTaskStatus has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 6 of the 39 points are its own statements and the rest belongs to one function literal inside it that branches (line 205). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/tasks.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd754b7fee52504631561b9f77bceaf42ab256663e09f1068b65876d2fbc878"}},{"ruleId":"D1","level":"warning","message":{"text":"session-timeline.parseSessionTimelineArgs (cyclomatic 39): session-timeline.parseSessionTimelineArgs has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/session-timeline.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e205f03bee4c8732d84ff7b3d014f314374601147a8bffa176cde2cb9e7ff1"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.terminalizeExactWorkflowSessionForHookCancel (cyclomatic 39): codex-native-hook.terminalizeExactWorkflowSessionForHookCancel has cyclomatic complexity 39 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":4070}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f243b964c08fdbe6c9b90b1f64726410571e0d4ef4363c7b8d73dc335ff735"}},{"ruleId":"D1","level":"warning","message":{"text":"notify-hook.isOmxManagedCwd (cyclomatic 39): notify-hook.isOmxManagedCwd has cyclomatic complexity 39 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c330a54c249ffd0c875bf41f733880d28bc40cf1634278bb3213fc6d0044ff5"}},{"ruleId":"D1","level":"warning","message":{"text":"smoke-packed-install.assertInstalledPluginSurface (cyclomatic 39): smoke-packed-install.assertInstalledPluginSurface has cyclomatic complexity 39 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab23a3f6035588bf4b9d8dfcb96027c6112fb10bc1d129d1f888dc17c85a766b"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.validateCodexHooksDocument (cyclomatic 38): codex-hooks.validateCodexHooksDocument has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"175ed411fe3b507a59f7ccc968b8e3992cb4cb8b3cb0ad89ec482e0a53681164"}},{"ruleId":"D1","level":"warning","message":{"text":"advisory.observeRalplanAdvisoryPrompt (cyclomatic 38): advisory.observeRalplanAdvisoryPrompt has cyclomatic complexity 38 (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/ralplan/advisory.ts"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"0911f9ce166655a27055c32d8701528b70ed82a0e9b1e4a6d72fa242cbaa3f9d"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.checkNativePostCompactHookRuntime (cyclomatic 38): doctor.checkNativePostCompactHookRuntime has cyclomatic complexity 38 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 18 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":3296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2024baef81a602ec066727f4f63b325ec8d7befb4cd77cc41112cd2d7c26e7"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.recoverStaleDeadStopTranscriptSession (cyclomatic 38): codex-native-hook.recoverStaleDeadStopTranscriptSession has cyclomatic complexity 38 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":4493}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4014ccafb131c0bdffb87977bc4e5a091c0a3e56aeda0ca51610ef1cfa81f8e"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.parseConductorStaticGhApiInvocation (cyclomatic 38): codex-native-hook.parseConductorStaticGhApiInvocation has cyclomatic complexity 38 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12300}}}],"partialFingerprints":{"codehealthFindingId/v1":"85462f93971476d685e06c65c25c8810c79b7a94f9b6fe5d07322ee64f373b65"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.hasExactConductorOrchestrationOptionSchema (cyclomatic 38): codex-native-hook.hasExactConductorOrchestrationOptionSchema has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16495}}}],"partialFingerprints":{"codehealthFindingId/v1":"18649e04241caa0bc7218b35d093c2ca667abe8e0ebcd1b43e470772b3da487b"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-injection.resolvePaneTarget (cyclomatic 38): tmux-injection.resolvePaneTarget has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa17b2e8edf965928ddaeb054955653576b6111042c148366d26eb308b3a69e"}},{"ruleId":"D1","level":"warning","message":{"text":"smoke-packed-install.smokeInstalledNativeHookDist::runPackedTransportRegressions (cyclomatic 38): smoke-packed-install.smokeInstalledNativeHookDist::runPackedTransportRegressions has cyclomatic complexity 38 (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 (smoke-packed-install.smokeInstalledNativeHookDist) 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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c1768835ff6afb26a10ab5d21c4857b114d429d1a7bd590303e626ef5fa6dc"}},{"ruleId":"D1","level":"warning","message":{"text":"pinned-atomic-file-darwin-janitor.main (cyclomatic 38): pinned-atomic-file-darwin-janitor.main has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/pinned-atomic-file-darwin-janitor.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"206998bb46d2b03c8cee24e72b8cd3147eff879b98ecaaa0edb632ed57b1c47a"}},{"ruleId":"D1","level":"warning","message":{"text":"advisory-evidence.projectAdvisoryReviewLifecycle (cyclomatic 37): advisory-evidence.projectAdvisoryReviewLifecycle has cyclomatic complexity 37 (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/ralplan/advisory-evidence.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d00ff0bc432566888f2e014a95337ca4ba60bceba404360badfc8b075a0d4c6"}},{"ruleId":"D1","level":"warning","message":{"text":"scaling.reconcileScaleDownCleanupDebt (cyclomatic 37): scaling.reconcileScaleDownCleanupDebt has cyclomatic complexity 37 (threshold 15). Most of this is not in the body itself: 1 of the 37 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1764, 1877). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aba3f2355068d2571412114d528aa68fca1a0a07985375764a478b687594a40"}},{"ruleId":"D1","level":"warning","message":{"text":"dispatcher.dispatchHookEvent (cyclomatic 37): dispatcher.dispatchHookEvent has cyclomatic complexity 37 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/hooks/extensibility/dispatcher.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"413c5aa20d1be22e054f1e8f00e5864360cf28c55acdfb5fcf24ce166d448903"}},{"ruleId":"D1","level":"warning","message":{"text":"native-hook-claim-journal.recoverNativeHookClaimJournal (cyclomatic 37): native-hook-claim-journal.recoverNativeHookClaimJournal has cyclomatic complexity 37 (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/cli/native-hook-claim-journal.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"81633e78dec3d3e47415bd39e4458530751727accc1d06fdf8d33aabd075f344"}},{"ruleId":"D1","level":"warning","message":{"text":"team-worker.maybeNotifyLeaderAllWorkersIdle (cyclomatic 37): team-worker.maybeNotifyLeaderAllWorkersIdle has cyclomatic complexity 37 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 3 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":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5af47a05c01e504a865faddf81de3a184757c5090f07017b3d3465b1bf18fe9"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.resolveStateWriteInputFileCwd (cyclomatic 37): codex-native-hook.resolveStateWriteInputFileCwd has cyclomatic complexity 37 (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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5917}}}],"partialFingerprints":{"codehealthFindingId/v1":"315ce3bd867edfe1698c81a43845b551f04f57403b8fe15add9488c28d8a0da9"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.sourcesFileWrittenEarlierInSameCommand::scanCommand (cyclomatic 37): codex-native-hook.sourcesFileWrittenEarlierInSameCommand::scanCommand has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6537}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57ab0123fb0e64dc0969f1d13e4caed36eb750fa6a94275b939080e9dfa9992"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectConductorFiniteDestinationLeaves (cyclomatic 37): codex-native-hook.collectConductorFiniteDestinationLeaves has cyclomatic complexity 37 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 18 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15598}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc863ef02635b155007d5ba1e0a8b06233854fd7a39387839de06ed6ab32e6a8"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.hasSafeConductorOrchestrationRuntimeEnvironment (cyclomatic 37): codex-native-hook.hasSafeConductorOrchestrationRuntimeEnvironment has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16285}}}],"partialFingerprints":{"codehealthFindingId/v1":"3229fe30c8b2c922ca9713b1833b9d5c1c12f6c18970f04ce5ac294164fd125d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.cancelModes::loadStates (cyclomatic 37): index.cancelModes::loadStates has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (index.cancelModes) 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":"src/cli/index.ts"},"region":{"startLine":10526}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7443e6038b0427272df06a6aa28caa4162be9779f824d2e1b6558a36d3554da"}},{"ruleId":"D1","level":"warning","message":{"text":"team-dispatch.finalizeClaimedDispatchRequest (cyclomatic 37): team-dispatch.finalizeClaimedDispatchRequest has cyclomatic complexity 37 (threshold 15). Most of this is not in the body itself: 1 of the 37 points is its own statement and the rest belongs to one function literal inside it that branches (line 519). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"797f3010e29fb787933ebc3f0109f989dce3f8a8e600be651d20c7f4f05da23f"}},{"ruleId":"D1","level":"warning","message":{"text":"state-paths.readCanonicalSessionBindingSnapshot (cyclomatic 36): state-paths.readCanonicalSessionBindingSnapshot 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/mcp/state-paths.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffc4587f3e21dae623aecaaec4fbe67600e47e6adf8096fd29f0bb725f00b26"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.analyzeOmxSeededBehavioralDefaults (cyclomatic 36): generator.analyzeOmxSeededBehavioralDefaults has cyclomatic complexity 36 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 19 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":"src/config/generator.ts"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"744b0a83c8389e74f79a6610d51091f8f05a199e11b99c511193f71d785ecfa0"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.getPinnedLauncherIncompatibilityReason (cyclomatic 36): plugin-marketplace.getPinnedLauncherIncompatibilityReason has cyclomatic complexity 36 (threshold 15). Of this number, 35 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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3576}}}],"partialFingerprints":{"codehealthFindingId/v1":"901b93963d7ae37cd46b854e3fe9b9e23bc6b7a7888a7f412d8ffddd312bc499"}},{"ruleId":"D1","level":"warning","message":{"text":"worker-provenance.resolveAuthoritativeTeamWorkerContext (cyclomatic 36): worker-provenance.resolveAuthoritativeTeamWorkerContext has cyclomatic complexity 36 (threshold 15). Of this number, 33 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":"src/team/worker-provenance.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3608124df791fb71124987b4bc383c1d843a2af0ee3893ea7837bb36f88352c0"}},{"ruleId":"D1","level":"warning","message":{"text":"documented-leader-preflight.darwinPinned (cyclomatic 35): documented-leader-preflight.darwinPinned has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 1 of the 35 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 128, 115, 104, \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":"src/ralplan/documented-leader-preflight.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ddb720c3a3191b9aaa9eda927e84fc8271088e67968d0f1e1b36d45b19ad35"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-active.syncCanonicalSkillStateForModeUnlocked (cyclomatic 35): skill-active.syncCanonicalSkillStateForModeUnlocked has cyclomatic complexity 35 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (skill-active.syncCanonicalSkillStateForModeUnlocked::applyEntriesToState) 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":"src/state/skill-active.ts"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"328acf0c123a2b46ccca25eda19551f4ec6017bfd07b13d8fbcab1606b91f25f"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.hasLivePinIntent (cyclomatic 35): plugin-marketplace.hasLivePinIntent 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/cli/plugin-marketplace.ts"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d04174dfe65804b9c6662d2f4a19d8c244cc3a9159f82ef871465802eee809c"}},{"ruleId":"D1","level":"warning","message":{"text":"artifacts.validateUltragoalSteeringProposal (cyclomatic 35): artifacts.validateUltragoalSteeringProposal has cyclomatic complexity 35 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/ultragoal/artifacts.ts"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"05da988e0ded3e1a9ac46fe1ec4c4123eb9d7da59dd3a1323b059e2dcae8b643"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isAllowedDeepInterviewTerminalStateWriteCommand (cyclomatic 35): codex-native-hook.isAllowedDeepInterviewTerminalStateWriteCommand has cyclomatic complexity 35 (threshold 15). 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, name the conditions: bind each compound test to a 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9551}}}],"partialFingerprints":{"codehealthFindingId/v1":"289032f24825e003ae59fb781234a1be554466a2c51adf2369842e4fbbb93f1f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.launchWithHud (cyclomatic 35): index.launchWithHud has cyclomatic complexity 35 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/cli/index.ts"},"region":{"startLine":5634}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcaa4c803b6a1ee901b8cad7215e469d789beb0eaf0c5f6b1a1622351cead323"}},{"ruleId":"D1","level":"warning","message":{"text":"session.writeSessionEnd (cyclomatic 34): session.writeSessionEnd has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":3808}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae116a8ea1cff076994a0550bc27b41d2988a120b26628ebd798d7464c6f5c9"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.hasUnprovenManagedMarkerHooksStateSyntax (cyclomatic 34): generator.hasUnprovenManagedMarkerHooksStateSyntax 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/config/generator.ts"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fa575ca13fc0d32eb13443c1ea14ac4b3294c60ff60049d15d2ba166b91a62"}},{"ruleId":"D1","level":"warning","message":{"text":"documented-leader-preflight.routingOnlySkill (cyclomatic 34): documented-leader-preflight.routingOnlySkill has cyclomatic complexity 34 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/documented-leader-preflight.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"38dd303308d282c9bd8aff0b8fb4fc1b4bcb0d0a33e02a8a6e1071931f351a31"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-session.restoreStandaloneHudPane (cyclomatic 34): tmux-session.restoreStandaloneHudPane has cyclomatic complexity 34 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 7 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":"src/team/tmux-session.ts"},"region":{"startLine":3050}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1439eb5d85b003d2d3ce3a63306928106e32476102069a7d0f9372c70c70d8"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.atomicWriteNativeHookTransactionArtifact (cyclomatic 34): setup.atomicWriteNativeHookTransactionArtifact 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/cli/setup.ts"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"940260a42674a7963ee19bfcfd805ae00c09ed581d246fb01ce0490bbd7300ab"}},{"ruleId":"D1","level":"warning","message":{"text":"artifacts.validateQualityGate (cyclomatic 34): artifacts.validateQualityGate has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ultragoal/artifacts.ts"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f393a508f8a2fbea2ef3d0bca09725e001a3270742dfd01b6424c7bf9f3bfa"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectConductorRsyncStaticTransferPaths (cyclomatic 34): codex-native-hook.collectConductorRsyncStaticTransferPaths has cyclomatic complexity 34 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19877}}}],"partialFingerprints":{"codehealthFindingId/v1":"3015ec1be46257655f26f22a3b4ba26e100af9cce94f7cfb0dd88dd88b1ae2ca"}},{"ruleId":"D1","level":"warning","message":{"text":"index.mergeProjectLaunchRuntimeHistoryEntries (cyclomatic 34): index.mergeProjectLaunchRuntimeHistoryEntries has cyclomatic complexity 34 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 3 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":"src/cli/index.ts"},"region":{"startLine":1936}}}],"partialFingerprints":{"codehealthFindingId/v1":"517bb39223fbc3eef79a98ea1500d6ec2f664b17c1ba04802a4808d8dbed0b15"}},{"ruleId":"D1","level":"warning","message":{"text":"dispatch.normalizeDispatchRequest (cyclomatic 33): dispatch.normalizeDispatchRequest has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/dispatch.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18e89ee54543515bc5d6cfa0bfb0c595d4df6489973df3a33d5e549cb0a6a2a"}},{"ruleId":"D1","level":"warning","message":{"text":"state.isTeamManifestV2 (cyclomatic 33): state.isTeamManifestV2 has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"6471b81c6d0a880c364099300a7372309a065aed3c582f3bbb46e7a612b0cf17"}},{"ruleId":"D1","level":"warning","message":{"text":"completion-gate.validateAutopilotCompletionTransition (cyclomatic 33): completion-gate.validateAutopilotCompletionTransition has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/autopilot/completion-gate.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaabd8a1d710679c714fb5f9ebe5a4aff44296252988d133b6c359153d6257f"}},{"ruleId":"D1","level":"warning","message":{"text":"advisory.terminalizeRalplanAdvisoryUnlocked (cyclomatic 33): advisory.terminalizeRalplanAdvisoryUnlocked has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"116c79cacbe1a14757fd934cb513172feec0123972e4e7d25aac776ae7239d77"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-hook.parseConfig (cyclomatic 33): tmux-hook.parseConfig has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tmux-hook.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b1a048cad29960a948385c5b6f448f2765c7038af5cebf339a5eb59ff852ab"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux.registerHudResizeHook (cyclomatic 33): tmux.registerHudResizeHook has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe9c1964c07aaff395c819ed673feb80248d1d0c5ccf3cee3844bf2488921d8"}},{"ruleId":"D1","level":"warning","message":{"text":"notice-ledger.normalizeLedger (cyclomatic 33): notice-ledger.normalizeLedger has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/notice-ledger.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e15f37397dd2aded31cbb353069b2cf6bddafbb766a2af6e6933dd4866f053"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.assignTask (cyclomatic 33): runtime.assignTask 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 one function literal inside it that branches (line 4900). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":4893}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f80300188123f42893db0de0c3fb62901f6fcde925939e0779f37f0b9fcd0b"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.dispatchCriticalInboxInstruction (cyclomatic 33): runtime.dispatchCriticalInboxInstruction has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c548445f202cc5d155471088a557c8ba838571939914a6f481d44fecc746364b"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.doctor (cyclomatic 33): doctor.doctor has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8d33956b4fe96b6dfa39fd7d2ae5aa6f734cee587ed32da1fb26087be9015d"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.checkExistingNativeHooks (cyclomatic 33): doctor.checkExistingNativeHooks has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":2817}}}],"partialFingerprints":{"codehealthFindingId/v1":"d768a97d40a0d47607e761d11aaf170cb314d001278f6de3f2889b8b1f190808"}},{"ruleId":"D1","level":"warning","message":{"text":"index.isSafeIpv4 (cyclomatic 33): index.isSafeIpv4 has cyclomatic complexity 33 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/url-reader/index.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3ae4a0879cab7a20074dd586b57f607970b937c0e2d700fa57cd8c8cd6cc19"}},{"ruleId":"D1","level":"warning","message":{"text":"package-manager-ownership.validatePackageManagerOwnership (cyclomatic 33): package-manager-ownership.validatePackageManagerOwnership has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/package-manager-ownership.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e668312de59116c1268ef02f5d7b5e0f7184c00352b860c87a37b6c95eed289f"}},{"ruleId":"D1","level":"warning","message":{"text":"managed-tmux.resolveManagedSessionContext (cyclomatic 33): managed-tmux.resolveManagedSessionContext has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/managed-tmux.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d728218bc896dc918433d9a1c04ebf2b8d878c623a4a35f0d2db2b0d9bdbab22"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.stateReadTrailingArgsAreSafe (cyclomatic 33): codex-native-hook.stateReadTrailingArgsAreSafe has cyclomatic complexity 33 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9806}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d48bb7f4f206c3e1a0519daca3c52cc7ec4ee938adcac9afc0bb994fe5ce765"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isStaticallyValidatedOmxStateWriteInvocation (cyclomatic 33): codex-native-hook.isStaticallyValidatedOmxStateWriteInvocation has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16433}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8ddaf7c4fc75cf9656284d6c49faafa24981f0520d4cd278ee2415a819d920"}},{"ruleId":"D1","level":"warning","message":{"text":"index.listHookVisibleRunDirStateRefs (cyclomatic 33): index.listHookVisibleRunDirStateRefs has cyclomatic complexity 33 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 14 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":10035}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a5c70cbea4f13973db97eadc39777fa14742dd68c82fdc4af74c43a8e00c30"}},{"ruleId":"D1","level":"warning","message":{"text":"state.readDispatchRequests (cyclomatic 32): state.readDispatchRequests has cyclomatic complexity 32 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 11 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":"src/team/state.ts"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c48ba422eef96a53d8d4c2ea1ccff200c587f7e820ebcdf00c1a0b1db46801"}},{"ruleId":"D1","level":"warning","message":{"text":"hotswap.runAuthHotswap (cyclomatic 32): hotswap.runAuthHotswap 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/auth/hotswap.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"853f34d2fd7f604c28751486ad64bb1057c15e6713ed54f6ac37cad5f8be7c86"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux.createHudWatchPane (cyclomatic 32): tmux.createHudWatchPane has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e6092bab5b655120ba629d54bf4662311c3c5b68fc6d0cc4c6f21375845970"}},{"ruleId":"D1","level":"warning","message":{"text":"base.updateModeStateUnderCanonicalLock (cyclomatic 32): base.updateModeStateUnderCanonicalLock 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":"src/modes/base.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76784bf4956d93860c4eb22c4190d36456bbf31a274a7cde5d611dfcae96d59"}},{"ruleId":"D1","level":"warning","message":{"text":"team.parseTeamArgs (cyclomatic 32): team.parseTeamArgs 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. This is NOT this file\u0027s highest cyclomatic complexity: team.sampleValueForTeamApiField (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0581122d3fe2637cc22251ebf196db51e12ba45f2c67f0db7a2f72e6e201682"}},{"ruleId":"D1","level":"warning","message":{"text":"package-manager-ownership.isCompletePackageManagerOwnership (cyclomatic 32): package-manager-ownership.isCompletePackageManagerOwnership has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/package-manager-ownership.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"effc2471bc907eea47dae9535213fd4c440ba2fc9ab7ae5b621621cd48892c8d"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.commandExecutesUninspectedScript (cyclomatic 32): codex-native-hook.commandExecutesUninspectedScript 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5447}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4065662c3cc0d41268c2d5849c1bb7d1b6c5baf8eac54601f1059955a59db1b"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectOmxStateCommandOperations::scanNestedSubstitutions (cyclomatic 32): codex-native-hook.collectOmxStateCommandOperations::scanNestedSubstitutions 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7968}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4365df36e3297f8e6f1e3ba613185b826c4513161becb3a2bf0d3da44bfde7"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isInsideConductorSubstitutionGrouping (cyclomatic 32): codex-native-hook.isInsideConductorSubstitutionGrouping 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19490}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2408814adba097cbc3a2f4d5f8db77c6b7122d5548ec9c519eaf2c49ef7f6f0"}},{"ruleId":"D1","level":"warning","message":{"text":"hasLivePinForDelegate (cyclomatic 32): hasLivePinForDelegate has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2eee24e0051a5f6169887387b26c7958c465b21dfceb1078f111db25906f12f"}},{"ruleId":"D1","level":"warning","message":{"text":"session.readNativeSessionOwnerEvidence (cyclomatic 31): session.readNativeSessionOwnerEvidence has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":3556}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2a674b08c841ad0e9773725226df66a0814a7673e8840690cb1b1e717201e5"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.collectManagedHookTrustStateSourceRepresentations (cyclomatic 31): generator.collectManagedHookTrustStateSourceRepresentations has cyclomatic complexity 31 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 11 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":"src/config/generator.ts"},"region":{"startLine":2305}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f2f4755b479b03dd1a226d29d8b39ca0f1f3ec8392558df681db5223ce3c16"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.migrateManagedCodexHookTrustStateCoordinates (cyclomatic 31): generator.migrateManagedCodexHookTrustStateCoordinates 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/config/generator.ts"},"region":{"startLine":2520}}}],"partialFingerprints":{"codehealthFindingId/v1":"073ce639d2bed1bde6fcf0b50f2bba706940dbb9ad3d900728ff97d897572347"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-hook-engine.evaluateInjectionGuards (cyclomatic 31): tmux-hook-engine.evaluateInjectionGuards 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/scripts/tmux-hook-engine.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd91801a0a395426ece88b5b1843e0e00eb33e1c8ccd1dd2a9a6c17e6bfa0e42"}},{"ruleId":"D1","level":"warning","message":{"text":"reconcile.assessOwnedHudLayout (cyclomatic 31): reconcile.assessOwnedHudLayout has cyclomatic complexity 31 (threshold 15). 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, name the conditions: bind each compound test to a well-named local or 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/hud/reconcile.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b5b59e8c3342609beef9b68133bdb00a0fb1b1f01a3a83593b4eae39f7d39f"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.terminateTrackedProcessTree (cyclomatic 31): runtime.terminateTrackedProcessTree 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/team/runtime.ts"},"region":{"startLine":2768}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0deb95d964128c7ba4202b461036a1a14964094aca8e56e36b7b8f7bbe375ba"}},{"ruleId":"D1","level":"warning","message":{"text":"export.exportSessionHistory (cyclomatic 31): export.exportSessionHistory 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/session-history/export.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a5d368f47dc968db39e323ca4eb69bb2455b53359650c20eea5cd3ae7f18a3"}},{"ruleId":"D1","level":"warning","message":{"text":"mission.missionCommand (cyclomatic 31): mission.missionCommand has cyclomatic complexity 31 (threshold 15). Of this number, 29 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":"src/cli/mission.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d623bd5bb4a2b9c9afb41a62dd214b8e33a6ff5a410b41c2d88a7300d70710"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-detector.directCandidateIndexes::addBlock (cyclomatic 31): keyword-detector.directCandidateIndexes::addBlock has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (keyword-detector.directCandidateIndexes) 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":"src/hooks/keyword-detector.ts"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a078289ec1d6a1a412135f0e9d15328c8b8b484019542e2855fd4ea50212c21"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.tokenizeConductorShellWords (cyclomatic 31): codex-native-hook.tokenizeConductorShellWords has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16022}}}],"partialFingerprints":{"codehealthFindingId/v1":"215807176cc07140ddc88383a1cddde3854b525320e9d4489e3ff6223809c7fa"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.nestedExecEnvironmentClearBoundary (cyclomatic 31): codex-native-hook.nestedExecEnvironmentClearBoundary has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18709}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df7729ac8301b497a726d2f3c5c1b9b646644f0b8d706449728549b21561887"}},{"ruleId":"D1","level":"warning","message":{"text":"index.decodeDetachedLeaderPayload (cyclomatic 31): index.decodeDetachedLeaderPayload has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":8879}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38e1043e9413a439bfe87e2daf3f1734b57f5bc5c231724b4a58c2f014664e8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.selectAuthorizedHookVisibleRunDirState (cyclomatic 31): index.selectAuthorizedHookVisibleRunDirState 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/cli/index.ts"},"region":{"startLine":10217}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef173db9188f343576b596254b4098b7866bb340c26d17f6ade02d54df1f1cb"}},{"ruleId":"D1","level":"warning","message":{"text":"notify-fallback-delivery.validateOutcome (cyclomatic 31): notify-fallback-delivery.validateOutcome has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a282d63d8d2174e3012d03ff643228e1ef536a517bc66626fcf4ec43f28369b5"}},{"ruleId":"D1","level":"warning","message":{"text":"notify-fallback-watcher.resolveActiveTeamState (cyclomatic 31): notify-fallback-watcher.resolveActiveTeamState 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/scripts/notify-fallback-watcher.ts"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"05172f047f3acd0c50fbe0acd7a84b4d9f2ff2402cf204f826145ca802316f6f"}},{"ruleId":"D1","level":"warning","message":{"text":"scaling.validateScaleDownCleanupResources (cyclomatic 30): scaling.validateScaleDownCleanupResources has cyclomatic complexity 30 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c9d2097bf312b4d38871654804a0c14e0835518c4b108c75d070eb32b8282b"}},{"ruleId":"D1","level":"warning","message":{"text":"wiki-server.handleWikiToolCallWithOptions (cyclomatic 30): wiki-server.handleWikiToolCallWithOptions has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/wiki-server.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e6dd50acf477b810aa385866777367db54168aa3cc96ed128bc2537fe04306"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.applyNativeHookTransactionArtifact (cyclomatic 30): setup.applyNativeHookTransactionArtifact has cyclomatic complexity 30 (threshold 15). Of this number, 29 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/cli/setup.ts"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c01cae09bfbd0bad03933063d927762ad0540daa804f81a5dd3f0cc0ccab89a"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.refreshNativeAgentConfigs (cyclomatic 30): setup.refreshNativeAgentConfigs 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/cli/setup.ts"},"region":{"startLine":6176}}}],"partialFingerprints":{"codehealthFindingId/v1":"df07cc7a89860f46aa8278910275e91ed1d00a91f071c802544d43e90d6d940b"}},{"ruleId":"D1","level":"warning","message":{"text":"uninstall.atomicReplaceFile (cyclomatic 30): uninstall.atomicReplaceFile 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/cli/uninstall.ts"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b44f8459936cef76c0dff103c431e0da36bbd5e63682b9dd2ce084d51a7f6fe"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.buildRalplanAdvisoryRoutingObservation (cyclomatic 30): codex-native-hook.buildRalplanAdvisoryRoutingObservation has cyclomatic complexity 30 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10270}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d73731a8048aaacb749f0e257488665fd0b373fb4c8bbe5f7e5b3f79838b76"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.nestedShellHasUnsafeStartup (cyclomatic 30): codex-native-hook.nestedShellHasUnsafeStartup has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12992}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a6838f2adae803387e5c74ef9240d816715377207b46402a8d09863361561e"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectConductorSafeReferenceControlTargets (cyclomatic 30): codex-native-hook.collectConductorSafeReferenceControlTargets has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14203}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f866b2675b495d1821b99a84ebff2bc3d159ac57a92843788a34c4dc526434"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.applyShellCwdStateEffect (cyclomatic 30): codex-native-hook.applyShellCwdStateEffect has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17223}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d7cf09324826e3055d8df8880b429d9b323d9f62f03afccaa23814b40c8b69"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.nestedShellEnablesPosix (cyclomatic 30): codex-native-hook.nestedShellEnablesPosix has cyclomatic complexity 30 (threshold 15). Of this number, 27 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18618}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a89386f1a08167abcf11d97f544c3284064149d902c1b03a4a2c236cd3ffc3c"}},{"ruleId":"D1","level":"warning","message":{"text":"template-engine.computeTemplateVariables (cyclomatic 30): template-engine.computeTemplateVariables has cyclomatic complexity 30 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/template-engine.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7a119896d4bf70d71d7b465475cc3cbaf00e3544108c3cedbb234182d5fb32"}},{"ruleId":"D1","level":"warning","message":{"text":"index.acquireHistoryPersistenceLock (cyclomatic 30): index.acquireHistoryPersistenceLock has cyclomatic complexity 30 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7e2172741b741bca320b980ba8c40d6f8fa16761d0ccefd74cf445bbfb2a14"}},{"ruleId":"D1","level":"warning","message":{"text":"index.persistProjectLaunchRuntimeHistoryArtifacts (cyclomatic 30): index.persistProjectLaunchRuntimeHistoryArtifacts has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 4 of the 30 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1631, 1661, 1665). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30a293233db411aa7a9defcc15868622f2ef041f67fa152ea71f825685e4b62"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime-cli.main (cyclomatic 30): runtime-cli.main has cyclomatic complexity 30 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime-cli.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc3e0c471da62a5e7044285bc8956c55ecb0153acc674c32d7ea0680930034d"}},{"ruleId":"D1","level":"warning","message":{"text":"hasKnownLiveSessionPin (cyclomatic 30): hasKnownLiveSessionPin has cyclomatic complexity 30 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0960b6cf9f503c91fdc474bb61e0c91927c6cf886eea1b319f71725d23017a"}},{"ruleId":"D1","level":"warning","message":{"text":"session.recoverSessionPointerLock (cyclomatic 29): session.recoverSessionPointerLock has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aef9fc84e50da4385d494d9f4e3233611ebefd2751c092a79b7afbfd825b9fb"}},{"ruleId":"D1","level":"warning","message":{"text":"mailbox.executeBridgeCommand (cyclomatic 29): mailbox.executeBridgeCommand has cyclomatic complexity 29 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/mailbox.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3821c9a19c57d60aa627b9c2bc1931d2608348d676381b8bab4c750ea2d491f"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.inventoryProjectTrustPayload (cyclomatic 29): generator.inventoryProjectTrustPayload 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/config/generator.ts"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac68d895854ab2e4b40960b221871032c0f1d16d083dfe773411ef254d53110"}},{"ruleId":"D1","level":"warning","message":{"text":"state.readUltragoalState (cyclomatic 29): state.readUltragoalState has cyclomatic complexity 29 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 8 belong to 6 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/state.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb129ae6d02ae0d38d66bf83de9a7bd5b82d235baa4cf1be8c60747371126d4d"}},{"ruleId":"D1","level":"warning","message":{"text":"advisory.reconcileRalplanAdvisoryUnlocked (cyclomatic 29): advisory.reconcileRalplanAdvisoryUnlocked has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory.ts"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60a8258460c8a6ebb6892be7927c48da71b8416d2190687b4cfc8e82e429262"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux.readHudHookHealth (cyclomatic 29): tmux.readHudHookHealth has cyclomatic complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or 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/hud/tmux.ts"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a1800755dfc8811ce4db5990ee89d3f08581b681b8f31bb718d9c0e8326992"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap.autoStartStdioMcpServer (cyclomatic 29): bootstrap.autoStartStdioMcpServer has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 7 of the 29 points are its own statements and the rest belongs to 6 function items inside it that branch (runDuplicateSiblingWatchdog, stopDuplicateSiblingWatchdog, logLifecycle, \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/mcp/bootstrap.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d91cb193bf30cd30b637290fd645e79a4be59bef613fbc0e9dfd3b9ce316bc5"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.terminateExactPaneProcessTree (cyclomatic 29): runtime.terminateExactPaneProcessTree has cyclomatic complexity 29 (threshold 15). Of this number, 27 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. This is NOT this file\u0027s highest cyclomatic complexity: runtime.isDetachedSessionDestroyReceipt (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":2981}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b7716ef2afd9d6fabaa71ab0824e6719ebf870785168deeaea067a6d97d55f"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.isValidGonePaneDescendantCleanupDebt (cyclomatic 29): runtime.isValidGonePaneDescendantCleanupDebt has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 7 of the 29 points are its own statements and the rest belongs to one function literal inside it that branches (line 3203). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: runtime.isDetachedSessionDestroyReceipt (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":3198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14e4d88fb2330557ed7b32ab565cca5cb28c05076439c62af10cc9d08554532"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.claimPublicationLock (cyclomatic 29): plugin-marketplace.claimPublicationLock 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/cli/plugin-marketplace.ts"},"region":{"startLine":2690}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6304834ed33d8f2bac92435494ec263aa7b825eb2da009cd11e5f64b9bbca6"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-pre-post.parseGitCommitCommand (cyclomatic 29): codex-native-pre-post.parseGitCommitCommand has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-pre-post.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e9d71d1667aedb0f46c0dfec6ab14b257c18fb65f2aff4ea19463de2b58aca"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isConductorFinalPipelineMember (cyclomatic 29): codex-native-hook.isConductorFinalPipelineMember has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb47b48a9d9627bb20e889f7f9dcb7d70439d056320cb8ebe900f3fbd55f2b5"}},{"ruleId":"D1","level":"warning","message":{"text":"index.postLaunch (cyclomatic 29): index.postLaunch has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":9250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77379fff78e7863f4a91ec015c64416cffe5421df743f640aa74e2b7797c94c"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.tokenizePosixCommand (cyclomatic 28): codex-hooks.tokenizePosixCommand 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/config/codex-hooks.ts"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d77684d3910d7aa4dd6a9c97f4fe89dafd7ce35421d3eba4be2f0b81afb07cd"}},{"ruleId":"D1","level":"warning","message":{"text":"session.reconcileNativeTransition.\u003Creturned closure\u003E (cyclomatic 28): session.reconcileNativeTransition.\u003Creturned closure\u003E 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/hooks/session.ts"},"region":{"startLine":3646}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0d55cba42b4c7577e438eb2ad440d4b063b646fd22f90e2b82fe1c1c7ddb14"}},{"ruleId":"D1","level":"warning","message":{"text":"completion-evidence.validateCompletionEvidence (cyclomatic 28): completion-evidence.validateCompletionEvidence has cyclomatic complexity 28 (threshold 15). 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, name the conditions: bind each compound test to a well-named local or 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/team/completion-evidence.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a41758ff327e4502f2745ac30dd37d2a532e916045e1fb57ddca6cd2ed3502"}},{"ruleId":"D1","level":"warning","message":{"text":"worktree.ensureWorktree (cyclomatic 28): worktree.ensureWorktree 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/team/worktree.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"e959f6c66fa8045e35b3bed4161075822cac9d9ad9c4be36e43e11a70e3f1f78"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-hook-engine.normalizeTmuxHookConfig (cyclomatic 28): tmux-hook-engine.normalizeTmuxHookConfig 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/scripts/tmux-hook-engine.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dfd87262be8f0e833b76ec80e78504909f5f8b8bc1665ec097fbceb31f3899"}},{"ruleId":"D1","level":"warning","message":{"text":"session-status.readRelevantSkillState (cyclomatic 28): session-status.readRelevantSkillState has cyclomatic complexity 28 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/notifications/session-status.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64c1195b36fe0edd7ece329e9508cfe7f4fa7966537b8da1d942862e9e5eba3"}},{"ruleId":"D1","level":"warning","message":{"text":"render.renderTeamWorkers (cyclomatic 28): render.renderTeamWorkers has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 11 of the 28 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 215, 253, 252, \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":"src/hud/render.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f746f468443b4c041aa6627666d19b8af8445dd90fd21d478674d716c7a9473a"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-session.buildWorkerProcessLaunchSpecForMode (cyclomatic 28): tmux-session.buildWorkerProcessLaunchSpecForMode 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/team/tmux-session.ts"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"79791d36cb30c3ac162069618fe309946997b648b16e7d53bd1a3a9d693f54f1"}},{"ruleId":"D1","level":"warning","message":{"text":"phase-controller.buildTransitionPath (cyclomatic 28): phase-controller.buildTransitionPath 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/team/phase-controller.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"44980058832cf6086976b1e150a0e5c049b1e4b6f1788342bf8d91f01e23d3ab"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.openManagedCacheNamespace (cyclomatic 28): plugin-marketplace.openManagedCacheNamespace has cyclomatic complexity 28 (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/cli/plugin-marketplace.ts"},"region":{"startLine":3058}}}],"partialFingerprints":{"codehealthFindingId/v1":"8830010b0498f263ef1ce46f4c86a9a4878cb074a2938112c8ae53eeedc1d164"}},{"ruleId":"D1","level":"warning","message":{"text":"team.resolveApprovedTeamFollowupContext (cyclomatic 28): team.resolveApprovedTeamFollowupContext has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: team.sampleValueForTeamApiField (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a92b2a4ca5a5ced5ec48a53003531d4d5e30f727b0364648a65f5cb791fa642"}},{"ruleId":"D1","level":"warning","message":{"text":"question.questionCommand (cyclomatic 28): question.questionCommand 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/cli/question.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6201f25cf7ee97ced240c88b002752c5146f1f7f832c1407f38ae9eaa3ee4a6"}},{"ruleId":"D1","level":"warning","message":{"text":"continuation.parseImagegenContinuationArgs (cyclomatic 28): continuation.parseImagegenContinuationArgs has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/imagegen/continuation.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e934d1b2d485507e2ad38029e7c666036a6c1e768cce42b2205a9768237e29e"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-detector.collectQuoteRanges (cyclomatic 28): keyword-detector.collectQuoteRanges 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/hooks/keyword-detector.ts"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a9d3fc25f6bf19debf9791ff3627f94665f33e36e802c7e910c9cd8191a4f0"}},{"ruleId":"D1","level":"warning","message":{"text":"auto-nudge.syncSkillStateFromTurn (cyclomatic 28): auto-nudge.syncSkillStateFromTurn 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/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"276e31a92b3214c2c38f3bb23405c94fc05f4d21ed6fc7a718c8ad94edb5d3a7"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.classifyPreToolUseMutationTransport (cyclomatic 28): codex-native-hook.classifyPreToolUseMutationTransport has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5653}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79524fa326086ee78927ef106829a194e7fdfec238677a91abd49f6f2793aea"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.extractPackageManagerExecCommand (cyclomatic 28): codex-native-hook.extractPackageManagerExecCommand has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6998}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbcbcd0a675cb2694b0680ab2e08ed4e574f71a69552b321eaf145e7271821a"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.parseConductorTimeInvocation (cyclomatic 28): codex-native-hook.parseConductorTimeInvocation has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7475}}}],"partialFingerprints":{"codehealthFindingId/v1":"beab8edeec66212ad3da46081fda8b2ff270f3743d704a79d11fa35f73fc96f1"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isAllowedTrustedAbsoluteOmxReadOnlyCommand (cyclomatic 28): codex-native-hook.isAllowedTrustedAbsoluteOmxReadOnlyCommand has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c039ac01a083fb9b6070bb64e18db395dd3fb9382b4e7fdb4dbd2616bbddf50"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isAllowedRalplanBashWrite (cyclomatic 28): codex-native-hook.isAllowedRalplanBashWrite 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10536}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f46261a0a739376a4048f7f3200bfb89634892c4c8bd404e2dfaae2e3141f8"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isPositivelyClassifiedRgCommand (cyclomatic 28): codex-native-hook.isPositivelyClassifiedRgCommand has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12558}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c991cb1d6b5be4c3676db5e1fbd46101352f90fb385bb0442c5212ccddfcae"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.wgetInvocationHasUnsafeFiniteTransferMode (cyclomatic 28): codex-native-hook.wgetInvocationHasUnsafeFiniteTransferMode has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14390}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f21601bbd70efab030077c729c49c91929252bc0f08e82363b0c1bc166a5c2f"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.conductorMutationOptionValueWordCount (cyclomatic 28): codex-native-hook.conductorMutationOptionValueWordCount has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15539}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c65533c13425c9bbba3e468c657941240b7b2437ec1a7ecaa1fc89b0ef21b46"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectProcessSubstitutionExpansionPrefix (cyclomatic 28): codex-native-hook.collectProcessSubstitutionExpansionPrefix has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19444}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8eca2d47cd3ae1b2050d16f2ebe38fcb6bffd35e48cca7e8c276bd760f779b0"}},{"ruleId":"D1","level":"warning","message":{"text":"report.renderReport (cyclomatic 28): report.renderReport has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/evals/astra-defaults/report.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7774230851b391460ff60b1a20febbfcff873f7c2485f2da456cce5d7876cb"}},{"ruleId":"D1","level":"warning","message":{"text":"notify-fallback-delivery.terminalGraph (cyclomatic 28): notify-fallback-delivery.terminalGraph 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/scripts/notify-fallback-delivery.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd163a12c830eaf42fe0bc5a074a420b16f75efceecaea643641fa2e6f56b90"}},{"ruleId":"D1","level":"warning","message":{"text":"smoke-packed-install.resolvePinnedCodexExecutable (cyclomatic 28): smoke-packed-install.resolvePinnedCodexExecutable 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/scripts/smoke-packed-install.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d56657e094d263af82f12afee58af7d09bd9e53610709dc29fc16cc782d37e8"}},{"ruleId":"D1","level":"warning","message":{"text":"smoke-packed-install.assertNativeHookAdvisoryPreToolUse (cyclomatic 28): smoke-packed-install.assertNativeHookAdvisoryPreToolUse 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/scripts/smoke-packed-install.ts"},"region":{"startLine":2367}}}],"partialFingerprints":{"codehealthFindingId/v1":"451fdf2910926a350b71607f7a3089e061457eddd039ec02f263079ad43a1f59"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.livePinDirectory (cyclomatic 27): codex-native-hook.livePinDirectory has cyclomatic complexity 27 (threshold 15). Of this number, 25 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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"b977fa78598569f59f4f4a17547d898d7354d3e087a7f4c9a69b602e4b909951"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.writePendingSessionPin (cyclomatic 27): codex-native-hook.writePendingSessionPin has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"043813d6d1dba8f270a5f3a4b917ab9ba17b298e165b1bb2059e3baa09de0e1f"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.planManagedCodexHooksMerge (cyclomatic 27): codex-hooks.planManagedCodexHooksMerge has cyclomatic complexity 27 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":2713}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35294a09bd684efe225f9da7cb6f49a89a17a6c506715c83350406c22f31ce0"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.reconcileProjectScopeTrustState (cyclomatic 27): generator.reconcileProjectScopeTrustState has cyclomatic complexity 27 (threshold 15). Of this number, 26 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":"src/config/generator.ts"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2894f8246bf934f5af6614bb994ac930f6dfcc794e0ed5fc5714f753210715b"}},{"ruleId":"D1","level":"warning","message":{"text":"reply-listener.pollDiscordOnce (cyclomatic 27): reply-listener.pollDiscordOnce 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/notifications/reply-listener.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af9000a2d039dec281be022a75470498a5a030bdc332fd1c1d4d495a714236b"}},{"ruleId":"D1","level":"warning","message":{"text":"renderer.launchQuestionRenderer (cyclomatic 27): renderer.launchQuestionRenderer 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/question/renderer.ts"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c7522282e43dfb4c9a37c5981100acd4ecdbdfee507611a0f0ac590ebed563"}},{"ruleId":"D1","level":"warning","message":{"text":"autoresearch-goal.autoresearchGoalCommand (cyclomatic 27): autoresearch-goal.autoresearchGoalCommand 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/cli/autoresearch-goal.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8796fd6e3f78d150a0b715e5d7a49fa95421e27fd3676c4e03102ecd8dcf8c6"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.installPrompts (cyclomatic 27): setup.installPrompts 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/cli/setup.ts"},"region":{"startLine":6025}}}],"partialFingerprints":{"codehealthFindingId/v1":"420a514aa4a80807acdad4fecc853d4cf6f6d01d6ad95b34cfae3f341bc34fff"}},{"ruleId":"D1","level":"warning","message":{"text":"usage.buildSessionUsageReport (cyclomatic 27): usage.buildSessionUsageReport has cyclomatic complexity 27 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/usage.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be056fb33cdde8355a8f2962ca5226151ed31ed079992cfab49abce6400df7d"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.shouldRetireShadowedRalphStartingSeed (cyclomatic 27): codex-native-hook.shouldRetireShadowedRalphStartingSeed has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b073524e7bd8186f075806cd043401daa49c44f30fb8bff3ca48ef44c3735d74"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.extractDeepInterviewCommandWriteTargets (cyclomatic 27): codex-native-hook.extractDeepInterviewCommandWriteTargets 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5712}}}],"partialFingerprints":{"codehealthFindingId/v1":"d341627e9a0a9ac1808894f4f78fa7da69868201a7e8f6277298a9465776166f"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.extractStateWriteOperationPayload (cyclomatic 27): codex-native-hook.extractStateWriteOperationPayload has cyclomatic complexity 27 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6645}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e936bccc798051dba149741880cbb32d041d5c138d23fb48999ae0e5323f35"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.extractEnvSplitStringCommand (cyclomatic 27): codex-native-hook.extractEnvSplitStringCommand 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6967}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9dda4771e1a9a8e292eed4445e33c300d87c4b8e04a7333ec996e911382667"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isAllowedOmxReadOnlyCommand (cyclomatic 27): codex-native-hook.isAllowedOmxReadOnlyCommand has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10098}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe77bddc14a0c01470f38c9a721bc7a6d3d7cb7ee2c182f33118b2dd691b67e7"}},{"ruleId":"D1","level":"warning","message":{"text":"index.executeDetachedLaunchStateMachine (cyclomatic 27): index.executeDetachedLaunchStateMachine 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/cli/index.ts"},"region":{"startLine":4857}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48c63d150e40b320dc06b1afc01ea324101c45954c3e64dabd1065b745854dd"}},{"ruleId":"D1","level":"warning","message":{"text":"readPinnedRoutingRecord (cyclomatic 27): readPinnedRoutingRecord has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"54918755a39db98c5e2af89860c6b0992672db0cf9c7e64ff88921fd676115fb"}},{"ruleId":"D1","level":"warning","message":{"text":"toml-source.analyzeTomlSource (cyclomatic 26): toml-source.analyzeTomlSource 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/utils/toml-source.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3027ed0a30a838f66fa5dbec20b6a1a2b0b768794b540c7896d232701a08f0b"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.inspectOwnership (cyclomatic 26): codex-hooks.inspectOwnership has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own 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/config/codex-hooks.ts"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d795aa76c524c6a869d66926f57617a05a6b2fd8d93af48fe93422d037f3acc"}},{"ruleId":"D1","level":"warning","message":{"text":"session.createSessionState (cyclomatic 26): session.createSessionState has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d439c5206a2d211e2a9b80ae4c8ea5e04e39fb7ee1a51c012aa0ae602f05e9"}},{"ruleId":"D1","level":"warning","message":{"text":"session.parseLockOwner (cyclomatic 26): session.parseLockOwner 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/hooks/session.ts"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cce6dac8cc0ba60e035a8856231de106b2dbae7284e91587d6482c67e0d4e4e"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.upsertTuiStatusLine (cyclomatic 26): generator.upsertTuiStatusLine 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/config/generator.ts"},"region":{"startLine":3634}}}],"partialFingerprints":{"codehealthFindingId/v1":"360984e5a4a1d898c544965c0c8a1f063b5753eb6af8ed2bb9be3b34b3bbd697"}},{"ruleId":"D1","level":"warning","message":{"text":"mode-binding-lease.withModeBindingOwnerTransaction (cyclomatic 26): mode-binding-lease.withModeBindingOwnerTransaction has cyclomatic complexity 26 (threshold 15). Of this number, 16 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":"src/state/mode-binding-lease.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"607a76ae7e57291f8d3a7d45b497d76a2259764c1cfe82669f53614cf8fc8dd0"}},{"ruleId":"D1","level":"warning","message":{"text":"events.normalizeSubmittedAnswers (cyclomatic 26): events.normalizeSubmittedAnswers has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 10 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 215). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/events.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"378d6686cb7ebc4c24e2b18e9394a3b0175cbef3424bf10739fdf798b97f5238"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-session.waitForWorkerReadyDetailedAsync (cyclomatic 26): tmux-session.waitForWorkerReadyDetailedAsync has cyclomatic complexity 26 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 13 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":"src/team/tmux-session.ts"},"region":{"startLine":3653}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c488539d945a76e56b88648139cfcb0b5658336c41f0c96c27176d2e75db604"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.startTeam::runWorkerStartupAttempt (cyclomatic 26): runtime.startTeam::runWorkerStartupAttempt has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (runtime.startTeam) 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. This is NOT this file\u0027s highest cyclomatic complexity: runtime.isDetachedSessionDestroyReceipt (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":4159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6262746cb9691b99c329db77db9c97029e460ec22f6cb22d7310d65dc8f90e6"}},{"ruleId":"D1","level":"warning","message":{"text":"session-search.parseSessionSearchArgs (cyclomatic 26): session-search.parseSessionSearchArgs 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/cli/session-search.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"990029e70ace77c0982e26e3b21ff9f37a0bb31f58ed7fae75997d7c11b1362f"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.conductorMetadataWriteSizesStayBounded (cyclomatic 26): codex-native-hook.conductorMetadataWriteSizesStayBounded has cyclomatic complexity 26 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 8 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5300}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98d3fb8fb7a8f570c2ca9d9833dcb0c93d24a429d01cd5deaebded4f407127d"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.firstPlanningTmpScriptExecutionTarget::scanCommand (cyclomatic 26): codex-native-hook.firstPlanningTmpScriptExecutionTarget::scanCommand has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6463}}}],"partialFingerprints":{"codehealthFindingId/v1":"2274090bbb0577e69b7c798c4ea02c0eb4e3e1b9a13d905c4e9bb4a7a8e6c4a1"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectShellCasePhases (cyclomatic 26): codex-native-hook.collectShellCasePhases has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7678}}}],"partialFingerprints":{"codehealthFindingId/v1":"00570ceead39c6b486262b8e4f7c81f258b602b2600941cd975516f0ac19c4ec"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.readActiveRalplanStateForPreToolUse (cyclomatic 26): codex-native-hook.readActiveRalplanStateForPreToolUse has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10489}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9e31d315f52ec8a1903c5b50ae24678e21266b6bc3621e6f194813b9ee7491"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isPositivelyClassifiedFindCommand (cyclomatic 26): codex-native-hook.isPositivelyClassifiedFindCommand has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12193}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4d15abb21f7daa36feb6889f0142829bbee647d183337ecb58cff5b94ccac7"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.curlUrlGlobCaptureValues (cyclomatic 26): codex-native-hook.curlUrlGlobCaptureValues has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14578}}}],"partialFingerprints":{"codehealthFindingId/v1":"264d16781673edc076fee91bac1fa20941e630e01510cf074eea68473ff2a39b"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.stripShellCommentsForConductorScan (cyclomatic 26): codex-native-hook.stripShellCommentsForConductorScan has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19316}}}],"partialFingerprints":{"codehealthFindingId/v1":"293b83e5c1be78ccac33562bc2356c11b3beb137188598fc8fd04a0700893e8f"}},{"ruleId":"D1","level":"warning","message":{"text":"update-worker.main (cyclomatic 26): update-worker.main has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update-worker.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3270e2219e85df779c261d4fbf0cef7fccc6e3d1b07a7659ad0d2536711383"}},{"ruleId":"D1","level":"warning","message":{"text":"collector.collectRecord (cyclomatic 26): collector.collectRecord 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/evals/astra-defaults/collector.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dc7e006af79f9c76e017fe99db72ea01ddd4f17c76fc2792294da1ac983eec"}},{"ruleId":"D1","level":"warning","message":{"text":"isChildRoutingSessionStart (cyclomatic 26): isChildRoutingSessionStart 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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c60205a21d3c634f646f843cdf5e81b569b85d244ea5cc134b9859c9c51339f"}},{"ruleId":"D1","level":"warning","message":{"text":"artifacts.readApprovedExecutionLaunchHintOutcome (cyclomatic 25): artifacts.readApprovedExecutionLaunchHintOutcome 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/planning/artifacts.ts"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d7e2e920e777b4ab49a89328c2c38bf41f8f0d8e021cde285d882b3ea7a970"}},{"ruleId":"D1","level":"warning","message":{"text":"native-assets.inspectManagedNativeBinary (cyclomatic 25): native-assets.inspectManagedNativeBinary 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/cli/native-assets.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a942be5cad9c3ce7c7c0ea2f850bb80d41ada35d7066ebd93bd688e9128bd2"}},{"ruleId":"D1","level":"warning","message":{"text":"session.malformedRecoveryPointerReason (cyclomatic 25): session.malformedRecoveryPointerReason has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9131a120ce1e1dbd6587fb4e3d8177049d585a25314953ef4373499da717a7"}},{"ruleId":"D1","level":"warning","message":{"text":"session.startPointerTransition.\u003Creturned closure\u003E (cyclomatic 25): session.startPointerTransition.\u003Creturned closure\u003E has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":2866}}}],"partialFingerprints":{"codehealthFindingId/v1":"511078185116dc346564e48ae3f9da547c1d4dffc51acd0ba93a41c44fae027a"}},{"ruleId":"D1","level":"warning","message":{"text":"session.isAuthorizedBoundPointer (cyclomatic 25): session.isAuthorizedBoundPointer 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/hooks/session.ts"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b396bfe2194836b447528d7ef102b11a701e1bebc2e2ca5315588c3c97675c"}},{"ruleId":"D1","level":"warning","message":{"text":"dispatch-recovery.reconcileRuntimeFinalizations (cyclomatic 25): dispatch-recovery.reconcileRuntimeFinalizations has cyclomatic complexity 25 (threshold 15). Of this number, 23 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":"src/team/state/dispatch-recovery.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c747ec829eb8e75040d2bf99bcd355f2d246d7c48584cbe3d6f2dfdde14f6c"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.selectReusableSubagentEntry (cyclomatic 25): tracker.selectReusableSubagentEntry has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 1898, 1888, 1914). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"998f10806879bbb0bdccea64c3ccd1688a86e2f9a12579143a38aa59514b6e20"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-active.normalizeSkillActiveState (cyclomatic 25): skill-active.normalizeSkillActiveState has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/skill-active.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd35546bc03954e9fd97dd0e62aba5c8ab013a59e15f105b06fa23a4d698de60"}},{"ruleId":"D1","level":"warning","message":{"text":"contract.validateAndNormalizeRalphState (cyclomatic 25): contract.validateAndNormalizeRalphState 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/ralph/contract.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76f6d42c10bb385b3502f0c1a114f8eaf704aa00bbcfb3b46867560c06c2b48"}},{"ruleId":"D1","level":"warning","message":{"text":"renderer.isWideCodePoint (cyclomatic 25): renderer.isWideCodePoint has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/renderer.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"128ac894ac3a730812fbc9dbfd9483002e1445d3a330534a84f99972892a5d43"}},{"ruleId":"D1","level":"warning","message":{"text":"state.validateAnswerAgainstQuestion (cyclomatic 25): state.validateAnswerAgainstQuestion 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/question/state.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaaf36fe54387a6d3649b86b4418ecefefc84a38ed8a4c004ae0c38ebd3f18ca"}},{"ruleId":"D1","level":"warning","message":{"text":"role-router.routeTaskToRole (cyclomatic 25): role-router.routeTaskToRole 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/team/role-router.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e56ae3d3022ef7ac636641fa6b0cd94a81c4e14eb294858e7cebbc338a4ec9"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.readOmxPluginCacheState (cyclomatic 25): plugin-marketplace.readOmxPluginCacheState 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/cli/plugin-marketplace.ts"},"region":{"startLine":3352}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c52521314a543969b27d3d7a74f873675f173f28c6cbb33ae761276f9fead44"}},{"ruleId":"D1","level":"warning","message":{"text":"state.stateCommand (cyclomatic 25): state.stateCommand 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/cli/state.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f955299c3dd161bc0161ad44b4257a7f07b459e6d2250020f6fe3885a41e0dd"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.readActiveRalphState (cyclomatic 25): codex-native-hook.readActiveRalphState 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4a4c3397f655bb1cab29b2f5a243c29dc6927865d65b74f87d31f06c31a375"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.findActiveGoalWorkflowReconciliationRequirement (cyclomatic 25): codex-native-hook.findActiveGoalWorkflowReconciliationRequirement has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":3410}}}],"partialFingerprints":{"codehealthFindingId/v1":"3714be844cf519befa05f49a836d015914082c31a303f8267abfc321c3f1f94b"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.resolveEnvWrappedCommandCwd (cyclomatic 25): codex-native-hook.resolveEnvWrappedCommandCwd 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5834}}}],"partialFingerprints":{"codehealthFindingId/v1":"121b8ab0ba5b42bf34737e0197a90abdcf3db2f30c414f6a4e5b72b46426bd31"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.findPackageManagerExecSubcommandIndex (cyclomatic 25): codex-native-hook.findPackageManagerExecSubcommandIndex has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7034}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7bec1a68ee6e8796a830f9e7f041cf0e52863e4e3c244ba8ab7eb0f8ef8d24"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.findTimeoutDispatchOperandIndex (cyclomatic 25): codex-native-hook.findTimeoutDispatchOperandIndex 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7525}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fecf79192e69aae054bd95828983a71fa76629f3e05512c544dacd3f6df6f3c"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.splitStateScanSegments (cyclomatic 25): codex-native-hook.splitStateScanSegments has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7874}}}],"partialFingerprints":{"codehealthFindingId/v1":"1878aff14f874c0155e49fd6046b8e1d6f5bcfea068b21d890d2844808e23a7d"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.evaluateDeepInterviewRalplanHandoffCommand (cyclomatic 25): codex-native-hook.evaluateDeepInterviewRalplanHandoffCommand 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9396}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a2c51e1b62b79c5d51aa439245fde6cdc59d69b3c485edd0e3a55b48175609"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.resolvePreToolUseWriteActor (cyclomatic 25): codex-native-hook.resolvePreToolUseWriteActor 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10893}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57451fe307ded2e3b7bcb8968fd8d88fff3853dd51a11421c2906af6fd43834"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.nodeCommandHasUnsafeRuntimeOutput (cyclomatic 25): codex-native-hook.nodeCommandHasUnsafeRuntimeOutput 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12901}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ab14e2fe1d61dd7ee32b009b9711fb23afb8f88ec7f9467e6b39aa6f685c1c"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectConductorBoundedTruncateTargets (cyclomatic 25): codex-native-hook.collectConductorBoundedTruncateTargets 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15688}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62004c5dc6cc40e94ae72f465fb40268594377b47c327936b9f681921b67e47"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isInvocationIsolated (cyclomatic 25): codex-native-hook.isInvocationIsolated 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b0c422f4d7a5b4636afff2db9e201afbe679a3bdb18637fb8d8d4561d68749"}},{"ruleId":"D1","level":"warning","message":{"text":"index.showStatus (cyclomatic 25): index.showStatus has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":5423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28a3646cc0781307c76e591dbb9b85cfe777a2e2bac55dfdd33da70f3520337"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.readLivePinMutationLock (cyclomatic 24): codex-native-hook.readLivePinMutationLock has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"065fa6c11bd263ae8dc5b367662e1d08464abdbd5a8a326ef8f08b971f38454e"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.parseJsonSource::parseValue (cyclomatic 24): codex-hooks.parseJsonSource::parseValue 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/config/codex-hooks.ts"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"275c5358b5816ee7d6909dac2811c8b34dc96fcf1fd16c2b3b8810cc1463306f"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.tokenizePowerShellCommand (cyclomatic 24): codex-hooks.tokenizePowerShellCommand 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/config/codex-hooks.ts"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31220ed5040db4c8ec2cb8016741c9b77f76659cbaed8046f6c18a71f2e4cb6"}},{"ruleId":"D1","level":"warning","message":{"text":"state-root.validateWorkerNotifyStateRoot (cyclomatic 24): state-root.validateWorkerNotifyStateRoot has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state-root.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68bd6e13d04d32d67f6c08b21208d768c964a69f3cf7fd11ae4060342968b03"}},{"ruleId":"D1","level":"warning","message":{"text":"state.commitTeamMembershipTaskTransaction (cyclomatic 24): state.commitTeamMembershipTaskTransaction has cyclomatic complexity 24 (threshold 15). Of this number, 23 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/team/state.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b55275155e42715397c45d4a99ffb9804c03b724de11557ada89732ea6c0136"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.recordNativeSubagentAuthorityObservation (cyclomatic 24): tracker.recordNativeSubagentAuthorityObservation has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1127, 1132). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"600443287afd9a7a34f790bcec79d85031b0a332bd332875d27e387d5915de01"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux.lexPosixWords (cyclomatic 24): tmux.lexPosixWords 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/hud/tmux.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5b196ee10d23ebc3f6ef3566cc4061ca5e0324bda8d5d351dae6e9f4b65b03"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux.containsPowerShellHudOwnerReferenceOutsideQuotes (cyclomatic 24): tmux.containsPowerShellHudOwnerReferenceOutsideQuotes 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/hud/tmux.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b59362c5c9905dd5d9ba0e04ce83e51f8f15725776a7558260c69b0784a690a"}},{"ruleId":"D1","level":"warning","message":{"text":"config.mergeEnvIntoFileConfig (cyclomatic 24): config.mergeEnvIntoFileConfig 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":"src/notifications/config.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7987f123cd54b86fd2aa1c2580f30efb54b8a3ca1c68b2ef6dc44cf3028e48"}},{"ruleId":"D1","level":"warning","message":{"text":"quality-gates.readQualityGatesConfig (cyclomatic 24): quality-gates.readQualityGatesConfig 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/config/quality-gates.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a275965132f6a1c13cad8b436d8b12402c186af7563d55c42d0459c4613f04"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.deliverPendingMailboxMessages (cyclomatic 24): runtime.deliverPendingMailboxMessages has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 7 of the 24 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 6927, 6959). 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. This is NOT this file\u0027s highest cyclomatic complexity: runtime.isDetachedSessionDestroyReceipt (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6911}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09ea90de89040d31b11fa26b83a3d1f4bf5d20759cbf5d7f75616609df64176"}},{"ruleId":"D1","level":"warning","message":{"text":"api-interop.buildStallState (cyclomatic 24): api-interop.buildStallState has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/api-interop.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc00b501ad04962ca538f7699853b4f5b83ab77fff655feb67b1581c5702933"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.removeChild (cyclomatic 24): plugin-marketplace.removeChild has cyclomatic complexity 24 (threshold 15). Of this number, 20 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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9779072c9b3381d20cbe4c3782e7d8e613de0a6b9ef3a69bf6aa2b09991c8a"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.discoverOmxPluginCacheDirs (cyclomatic 24): plugin-marketplace.discoverOmxPluginCacheDirs 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/cli/plugin-marketplace.ts"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7c815395af6aab6818116800e8d84a055ef7d26d83e1ff15ff55e3119fa92f"}},{"ruleId":"D1","level":"warning","message":{"text":"performance-goal.performanceGoalCommand (cyclomatic 24): performance-goal.performanceGoalCommand 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/cli/performance-goal.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0fdd77d24a63884b8aeb2af0dc18ba578d9581ef8b5252bb357711d54cb9dd"}},{"ruleId":"D1","level":"warning","message":{"text":"search.extractSearchableTexts (cyclomatic 24): search.extractSearchableTexts has cyclomatic complexity 24 (threshold 15). Of this number, 22 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":"src/session-history/search.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe015b90562da205e72547512b876379388810a2cbdcb0d15ffa14dc4d6b7210"}},{"ruleId":"D1","level":"warning","message":{"text":"codebase-map.generateCodebaseMap (cyclomatic 24): codebase-map.generateCodebaseMap 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/hooks/codebase-map.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b502eb8bc854bd5a633358fd27af2f6d96c7d0dae7f38954ef188c552a5925d"}},{"ruleId":"D1","level":"warning","message":{"text":"managed-tmux.verifyManagedPaneTarget (cyclomatic 24): managed-tmux.verifyManagedPaneTarget 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":"src/scripts/notify-hook/managed-tmux.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7ecd4f0e19d9b06fbb894abbbf7c38f4ffeaaa76a2f8d1ea383afe36339aaf"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-detector.persistDeepInterviewModeState (cyclomatic 24): keyword-detector.persistDeepInterviewModeState 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/hooks/keyword-detector.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa0d147149b363679c84ac5c43ac13f9ce344b182832888e63c15031f9ee7ea"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-detector.collectMarkdownReferenceIndex (cyclomatic 24): keyword-detector.collectMarkdownReferenceIndex 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/hooks/keyword-detector.ts"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76fd87e527c014f18659e7fc846ff461e1592d37e71f2453d7318ff30bb96f2"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-detector.directCandidateIndexes (cyclomatic 24): keyword-detector.directCandidateIndexes has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (keyword-detector.directCandidateIndexes::addBlock) 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":"src/hooks/keyword-detector.ts"},"region":{"startLine":2790}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f92ef038808dcf3833db8f8bf79be0a03e5920ea0af8551c31aafd035ac8d1a"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-pre-post.commandInvokesOmxQuestion (cyclomatic 24): codex-native-pre-post.commandInvokesOmxQuestion 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/scripts/codex-native-pre-post.ts"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"913283cc793c336a5f9a3eebcf8fa5eb89080ca556bd6fac6d4ed3385ac209cd"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.pythonInvocationHasUnsafeRuntimeEnvironment::applyRange (cyclomatic 24): codex-native-hook.pythonInvocationHasUnsafeRuntimeEnvironment::applyRange has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6299}}}],"partialFingerprints":{"codehealthFindingId/v1":"546622a9e2d327a4e951ac45104aab2da29ba81aacc4cb1a8db8a73120c2e355"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.findEnvDispatchOperandIndex (cyclomatic 24): codex-native-hook.findEnvDispatchOperandIndex has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7413}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb75083a092633157498f4ea66ff7632c785827fd257d2773740544cdbea347a"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.expandShellPositionalParameters (cyclomatic 24): codex-native-hook.expandShellPositionalParameters has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08df128f928b19d4b0fb544be4151f883b6f94b89c3b57ba2994b705879171e"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.splitShellCommandSegments (cyclomatic 24): codex-native-hook.splitShellCommandSegments has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8436}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b3b11633066de016ac2969f9874ac1f9b6e15255ac671a9c3ce40f17a1b7d2"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.hasUnsafeConductorArithmeticCommand (cyclomatic 24): codex-native-hook.hasUnsafeConductorArithmeticCommand has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8781}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8020d23f46a3e2271c4c8d742d060fe39d0d3cd1a818e0a649c3e838674ea3"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.maskShellNonCommandExpansionsForConductorScan (cyclomatic 24): codex-native-hook.maskShellNonCommandExpansionsForConductorScan has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8933}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65d550fc7284bb58460531ebd9e6ec7803b32a82eb04a5ae8309376d7aea84c"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isStandaloneParsedOmxStateWriteTransport (cyclomatic 24): codex-native-hook.isStandaloneParsedOmxStateWriteTransport has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9243}}}],"partialFingerprints":{"codehealthFindingId/v1":"817d75d6a7d4c625d32e6eb80a411e5374c33d726563315e8d709f1e51e98287"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isPositivelyClassifiedSedCommand (cyclomatic 24): codex-native-hook.isPositivelyClassifiedSedCommand has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12632}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ecf51712bdaa8b7725ee071eafb238f598b0dda59d0210bfef9730beba00cf"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.conductorPathMayResolveRepositoryExecutable (cyclomatic 24): codex-native-hook.conductorPathMayResolveRepositoryExecutable has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17825}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9a0aa2586e525e31dcafc1456c76c72543d1d5827db1b3adc28208b1d604b9"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectLexicalCommandSubstitutions (cyclomatic 24): codex-native-hook.collectLexicalCommandSubstitutions has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19587}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2acee18baba2a167ec886b9dfcd31a427348d2468b09b47e17b56529857995c"}},{"ruleId":"D1","level":"warning","message":{"text":"process-tree.runProcessTreeWithTimeout (cyclomatic 24): process-tree.runProcessTreeWithTimeout has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 129, 175, 185, \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":"src/runtime/process-tree.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a16b94b665bd05a347d869ec1b1a91466eda62505eb17138944d402a782ec6a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.copyProjectLaunchRuntimeHistoryDirectory (cyclomatic 24): index.copyProjectLaunchRuntimeHistoryDirectory has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own 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/cli/index.ts"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"801cefb92f09ebe0820682e6ca030277ee21716ba07bed01f8e1ccc87eaf7a3b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.readMadmaxDetachedActiveRecord (cyclomatic 24): index.readMadmaxDetachedActiveRecord 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":"src/cli/index.ts"},"region":{"startLine":4243}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da85fbb5f7e7c08077086f19cbb67288435756592a0b7d0270da40a1b50789a"}},{"ruleId":"D1","level":"warning","message":{"text":"suite.validateRunRecords (cyclomatic 24): suite.validateRunRecords 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/evals/astra-defaults/suite.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8e50dfbdeaf40e82df5725cb46520c4c03bad89b797b5a7bfa859d0d69877c"}},{"ruleId":"D1","level":"warning","message":{"text":"team-dispatch.updateMailboxNotified (cyclomatic 24): team-dispatch.updateMailboxNotified has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 1043, 1049, 1046, \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":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"c830cc482dbf0516391705f90236bf3b26c2e178545a5bf84cbe07d249c27be9"}},{"ruleId":"D1","level":"warning","message":{"text":"omx_runtime::run (cyclomatic 24): omx_runtime::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/omx-runtime/src/main.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd9d95edf39367fb8b0a810491c12d9feb46b2ed81601554e58ca33cb226ab7"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge.isStrictDispatchRecord (cyclomatic 23): bridge.isStrictDispatchRecord has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime/bridge.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"7988953c0fff30ac74c3c2993ba94c870b09be19efce42cd5a23e0451450d183"}},{"ruleId":"D1","level":"warning","message":{"text":"state-paths.discoverSessionAuthorityBaseStateDir (cyclomatic 23): state-paths.discoverSessionAuthorityBaseStateDir 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/mcp/state-paths.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dea3850bca348df224ceafa871f6c97a696181472f4aa06bddaead29113a0c4"}},{"ruleId":"D1","level":"warning","message":{"text":"state-paths.resolveWritableStateScope (cyclomatic 23): state-paths.resolveWritableStateScope 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":"src/mcp/state-paths.ts"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79a03004a51fb0a5df4d01cc2743cf9188d08b7efb4bec5f28657af032a6987"}},{"ruleId":"D1","level":"warning","message":{"text":"session.inspectSessionPointerLockAtContext (cyclomatic 23): session.inspectSessionPointerLockAtContext 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/hooks/session.ts"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4ed5d8287f939093a37d97e2a281103b0c5b874e839a98e290d0266d2c667b"}},{"ruleId":"D1","level":"warning","message":{"text":"mailbox.readLegacyMailboxMessageIds (cyclomatic 23): mailbox.readLegacyMailboxMessageIds 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":"src/team/state/mailbox.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4be34cf34665d6cd4c2f24976ffaaeb54faaddc377b7ff14b341354e5d3ae0"}},{"ruleId":"D1","level":"warning","message":{"text":"state.normalizeTeamLeaderAttentionState (cyclomatic 23): state.normalizeTeamLeaderAttentionState 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/team/state.ts"},"region":{"startLine":2848}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c97beea45ae5719c023d939a4629c2a59865e065cc46d5bb9fa24b9de90ac8"}},{"ruleId":"D1","level":"warning","message":{"text":"config.isEventEnabled (cyclomatic 23): config.isEventEnabled has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/config.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"5517bee4b17ee6941c538f5f6b3a24d28adc44792ee8c3ee3a79f67fe67fe4f2"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-session.waitForWorkerReady (cyclomatic 23): tmux-session.waitForWorkerReady has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (check, sendRobustEnter). 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/team/tmux-session.ts"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acfa46c688ce65c88af88450b1dcb4edf295cce035e60577858358e2e81089d"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.emitMonitorDerivedEvents (cyclomatic 23): runtime.emitMonitorDerivedEvents has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: runtime.isDetachedSessionDestroyReceipt (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6097}}}],"partialFingerprints":{"codehealthFindingId/v1":"6899c2fc191756955bbea67058ba9ba09062d4ffa5a26226f120d243003988c8"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.refreshOmxPluginCacheLivePinRecordMtime (cyclomatic 23): plugin-marketplace.refreshOmxPluginCacheLivePinRecordMtime has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f1440f972abb10dfe7e6ded91a0fd304cb00dc327e73e7bddb20889ce71a98"}},{"ruleId":"D1","level":"warning","message":{"text":"authority.validateAuthorityState (cyclomatic 23): authority.validateAuthorityState has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/authority.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6448768116b9f6a286d9539b851c0dfee3980b3ee4e38f1a02ae17073d71e6"}},{"ruleId":"D1","level":"warning","message":{"text":"team.buildTeamExecutionPlan (cyclomatic 23): team.buildTeamExecutionPlan has cyclomatic complexity 23 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: team.sampleValueForTeamApiField (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"644da2ad4d963baffba5594006c3165b98fec1c7d1633f487c9b253c8b84169f"}},{"ruleId":"D1","level":"warning","message":{"text":"advisory-activation.activateOrResumeRalplanAdvisoryUnderCanonicalLock (cyclomatic 23): advisory-activation.activateOrResumeRalplanAdvisoryUnderCanonicalLock 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":"src/ralplan/advisory-activation.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c454c187f280051db941630fe6f4c1ed161555a57c10425365dad7e1607c147"}},{"ruleId":"D1","level":"warning","message":{"text":"sparkshell.parseSparkShellFallbackInvocation (cyclomatic 23): sparkshell.parseSparkShellFallbackInvocation 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":"src/cli/sparkshell.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"9318fd45054380ec66d9fe932ca7a8a1ee37b021138b4a5323444d2ed8ab8dcb"}},{"ruleId":"D1","level":"warning","message":{"text":"update.runDeferredGlobalUpdate (cyclomatic 23): update.runDeferredGlobalUpdate has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8fa3de7208c0a09d7b3bcfc4ce7e0dbf9b9a6fd837c450bcf7bf7ff5cec504"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-detector.collectExplicitPrefixNegationIndex (cyclomatic 23): keyword-detector.collectExplicitPrefixNegationIndex 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/hooks/keyword-detector.ts"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ce9c87e926f50d5f84f761f4dc2c5ada9a9fd7b64f6dfc4328281275a0b98e"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.resolveTeamWorkerStopDecision (cyclomatic 23): codex-native-hook.resolveTeamWorkerStopDecision has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2963}}}],"partialFingerprints":{"codehealthFindingId/v1":"003acab5e8351c1b2e75c90f889747570693734ceb762d76f5cd842d1e365aa1"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.hasDynamicNestedShellExecution (cyclomatic 23): codex-native-hook.hasDynamicNestedShellExecution has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8238}}}],"partialFingerprints":{"codehealthFindingId/v1":"2727009cec88c1e0df60d4a6ef16b7365f00dae18ae28c611e63fdfc07c20030"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.readActiveDeepInterviewStateForPreToolUse (cyclomatic 23): codex-native-hook.readActiveDeepInterviewStateForPreToolUse has cyclomatic complexity 23 (threshold 15). Of this number, 20 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0173151d5add2c1c2b296a1af472dca1ff8c2697cdb2b0e72ef1677a765a3412"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.readActiveConductorStateForPreToolUse (cyclomatic 23): codex-native-hook.readActiveConductorStateForPreToolUse 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10937}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2fbd56c3c9ade106c5f556c8c0361f69604999feaa53e09034a56a2be10a30"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.commandConfiguresNodeOptions (cyclomatic 23): codex-native-hook.commandConfiguresNodeOptions has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12670}}}],"partialFingerprints":{"codehealthFindingId/v1":"d038dbb70fd53083b4c1f2fccc47888359291dd88dd25339a40475abf8b45dd6"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectConductorBoundedDdTargets (cyclomatic 23): codex-native-hook.collectConductorBoundedDdTargets has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15656}}}],"partialFingerprints":{"codehealthFindingId/v1":"4641bd826631bce7a8688c8a929be46582c81b6b3aa0f0d022b24a17bf3da448"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.applyNestedBashShoptOptions (cyclomatic 23): codex-native-hook.applyNestedBashShoptOptions has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18462}}}],"partialFingerprints":{"codehealthFindingId/v1":"592ab21d27f20ed608417c77af5a0347099e84055f5cd79e4496b9c6e6ed0ce9"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectLexicalProcessSubstitutions (cyclomatic 23): codex-native-hook.collectLexicalProcessSubstitutions has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19549}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dcef14b05ef2b32813b93349b1c9ef5fd051b0ea11293cae34bfd9a27136d4"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.runCodexNativeHookCli (cyclomatic 23): codex-native-hook.runCodexNativeHookCli has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":23189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f9a2d444ce4b42a643f6e27ef0d26d826c37db783accac9fa659e4f4fbbca2"}},{"ruleId":"D1","level":"warning","message":{"text":"notify-fallback-watcher.processLine (cyclomatic 23): notify-fallback-watcher.processLine 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"9caa5d452694d694343d55b0500b17862e1ba89f874c094a97724f1cf40d872e"}},{"ruleId":"D1","level":"warning","message":{"text":"mode-binding-lease-helper.sameOwnerState (cyclomatic 23): mode-binding-lease-helper.sameOwnerState has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/mode-binding-lease-helper.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"852ab236b31384df0253338e16e13882a72bc74071e420bca2cc1fd883b06625"}},{"ruleId":"D1","level":"warning","message":{"text":"artifacts.selectLaunchHintMatch (cyclomatic 22): artifacts.selectLaunchHintMatch has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 503, 471, 488). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/planning/artifacts.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5543117bee7db2c47e2c02823ebf013a1713c5faf645d2a13d40e996cabc593"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.decodedPosixCommandWords (cyclomatic 22): codex-hooks.decodedPosixCommandWords has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b9f4ba14169bdb81f3dabe202d913dbf553bb35daf0609242e615dc2cde341"}},{"ruleId":"D1","level":"warning","message":{"text":"policy.archiveHintMismatch (cyclomatic 22): policy.archiveHintMismatch has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native-assets/policy.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc361b2380069adcf1500d40771987d4f8b56cc02848f548f3794dab3c9d6ca"}},{"ruleId":"D1","level":"warning","message":{"text":"native-assets.readOpenedFile (cyclomatic 22): native-assets.readOpenedFile has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/native-assets.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ae4933ec7ed435835250b04d8704a672a3ebfbadfa9b669b39d00bc8c71ebc"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt-session-provenance.evaluateResolvedPromptTurn (cyclomatic 22): prompt-session-provenance.evaluateResolvedPromptTurn 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/hooks/prompt-session-provenance.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb34233f3e5b617c6cd7c8b2928380e9e37f7a156a0b235b827636f509c52d46"}},{"ruleId":"D1","level":"warning","message":{"text":"session.parseProcessIdentityOutput (cyclomatic 22): session.parseProcessIdentityOutput has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own 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/hooks/session.ts"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"f721049ca9890a7b768c62437b6ad2b4aabe53e2e0425379c99e9075a989164f"}},{"ruleId":"D1","level":"warning","message":{"text":"worktree.replaySubmoduleRecovery (cyclomatic 22): worktree.replaySubmoduleRecovery has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worktree.ts"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"39128139644cf00c3d8b519b9eb326282e628eba00ce2693397baf67488d6bcc"}},{"ruleId":"D1","level":"warning","message":{"text":"mode-state-context.captureRalphPaneBinding (cyclomatic 22): mode-state-context.captureRalphPaneBinding has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/mode-state-context.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"89657f343bfe68137a1d063be2d6c6d902128644344e6ab5b60aa0f0bfe1c7e7"}},{"ruleId":"D1","level":"warning","message":{"text":"reply-listener.pollTelegramOnce (cyclomatic 22): reply-listener.pollTelegramOnce has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 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":"src/notifications/reply-listener.ts"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3ec8d5a2d13a73d786195e13d436e035a9c12f415cf837f65969a693c526ae"}},{"ruleId":"D1","level":"warning","message":{"text":"render.renderUltragoal (cyclomatic 22): render.renderUltragoal has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 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":"src/hud/render.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8968a066719cba6840f9ef5da34c8d3d195c28292f4acc2e3688a540f396c51"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-session.captureSourcePaneAuthority (cyclomatic 22): tmux-session.captureSourcePaneAuthority has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/tmux-session.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c72dd01ada11ef81f36789fb21df962aa2433d3b2457507b10531dfe00b9489"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.prepareShutdownMergeReport (cyclomatic 22): runtime.prepareShutdownMergeReport 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. This is NOT this file\u0027s highest cyclomatic complexity: runtime.isDetachedSessionDestroyReceipt (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"b503fc79a50fe425cf250a890978b119650229f1d33890b51db882d3179a4038"}},{"ruleId":"D1","level":"warning","message":{"text":"query.queryWiki (cyclomatic 22): query.queryWiki 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/wiki/query.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"8927f734bda7ac31c7de2e32c87c3e54de85d8126a5839660486c289f589aa84"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.checkPluginScopedNativeHooks (cyclomatic 22): doctor.checkPluginScopedNativeHooks 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/cli/doctor.ts"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed25aa74526b9513cca91ec03620f1b74713c81ac8b463a866f1da0fa73cb8e"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.checkPluginMarketplaceRegistration (cyclomatic 22): doctor.checkPluginMarketplaceRegistration has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 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":"src/cli/doctor.ts"},"region":{"startLine":3606}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fa21a37f3ba0fe1db085b217e39fd0ebe6b3a236f272488267bcf49e1e903d"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.commitNativeHookTransaction (cyclomatic 22): setup.commitNativeHookTransaction 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/cli/setup.ts"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a5831b64a9dc4e1c56cd224d6c56b8ffde50fed5f08edef911a32859c36325"}},{"ruleId":"D1","level":"warning","message":{"text":"team.renderTeamPaneStatus (cyclomatic 22): team.renderTeamPaneStatus 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. This is NOT this file\u0027s highest cyclomatic complexity: team.sampleValueForTeamApiField (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"185f5215afbfa505b4d50fa40f2a35feb4a45eca93ef6c238304595923928f53"}},{"ruleId":"D1","level":"warning","message":{"text":"question.parseQuestionArgs (cyclomatic 22): question.parseQuestionArgs 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/cli/question.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbceb9075e1aac264b4fc7c7ed5132048dfa82f452bf5f2bd042ea0145ffa10"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-detector.classifyKeywordInput (cyclomatic 22): keyword-detector.classifyKeywordInput 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/hooks/keyword-detector.ts"},"region":{"startLine":3474}}}],"partialFingerprints":{"codehealthFindingId/v1":"873ff07f826ec4cc372060b2616dfeda79d92bf66483742939feb6d25f904e33"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-pre-post.commandInvokesApplyPatch (cyclomatic 22): codex-native-pre-post.commandInvokesApplyPatch 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/scripts/codex-native-pre-post.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"198d13e65f7fd97852a4a6ff7186ae5a4a61178caa4f5fede3f1c82cee10021b"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isStructuredUltragoalSteeringShellCommand (cyclomatic 22): codex-native-hook.isStructuredUltragoalSteeringShellCommand 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8196}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea58cd1b0a7b0119b31ee3f8f271f9e98505ff28a79564e0d97af747f0392a7"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.gitStatusInvocationHasSafeEnvironment (cyclomatic 22): codex-native-hook.gitStatusInvocationHasSafeEnvironment 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12760}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b94b063b1b339ef52fd6d326a0f28fcf7d5ff4e05570e4b09fb826bd30666e"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.findSudoDispatchOperandIndex (cyclomatic 22): codex-native-hook.findSudoDispatchOperandIndex has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14074}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c1995face4773851ef15c7284b3c8467ce3cae0be09e40aa1a28cae7423533"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.findConductorIsolatedFunctionDefinitionRegion (cyclomatic 22): codex-native-hook.findConductorIsolatedFunctionDefinitionRegion 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19266}}}],"partialFingerprints":{"codehealthFindingId/v1":"964b550acebf406d001d485479aed27142285281a290a482f2479d0d12f57132"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.readBlockingSkillForStop (cyclomatic 22): codex-native-hook.readBlockingSkillForStop has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":20621}}}],"partialFingerprints":{"codehealthFindingId/v1":"4687e06ff9bf6f8a69ddae6631a93c080295fe9cd1c7fe121cf1e07dfd4fdd89"}},{"ruleId":"D1","level":"warning","message":{"text":"index.readDetachedLeaderReport (cyclomatic 22): index.readDetachedLeaderReport has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":6833}}}],"partialFingerprints":{"codehealthFindingId/v1":"e393e8d723cd5c37e04af43ec4b3666239ff9d16edc07eb7584ffc8081103d5c"}},{"ruleId":"D1","level":"warning","message":{"text":"omx_explore_harness::validate_direct_command (cyclomatic 22): omx_explore_harness::validate_direct_command has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-explore/src/main.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"e608a2478508856db5dea06b4d8aa35b0493fe4bd4aaa21932c79b880ab26aa9"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeEngine::load (cyclomatic 22): RuntimeEngine::load has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime-core/src/engine.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8e6363be136a32203a879b2648953e92c8a1495c165ac3ac3e763eedd9dbef"}},{"ruleId":"D1","level":"warning","message":{"text":"config.normalizeFromCustomAliases (cyclomatic 21): config.normalizeFromCustomAliases has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/openclaw/config.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84aa92315cfbcb05e5242add5f5782396a581f05c8d44a6000bbb58175c5f67"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.removalProof (cyclomatic 21): codex-hooks.removalProof has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec3ec35b64eb74eb12df369d7e7be4058e69fc565b8ec2b6dd3eb96714f03a0"}},{"ruleId":"D1","level":"warning","message":{"text":"native-assets.validateDescendant (cyclomatic 21): native-assets.validateDescendant 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/cli/native-assets.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f0d3368f9bf709b71857521edc48aab2c6e9c59b2e6113c3c3ff5f9be3d823"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt-session-provenance.preflightSelectedTargetOwner (cyclomatic 21): prompt-session-provenance.preflightSelectedTargetOwner 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/hooks/prompt-session-provenance.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12acecf509c163c218cf231ad519eec71cf391e06576553d1bd8b3a910479fa"}},{"ruleId":"D1","level":"warning","message":{"text":"worktree.rollbackProvisionedWorktrees (cyclomatic 21): worktree.rollbackProvisionedWorktrees has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worktree.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"11dcf1a09fa4d5542e589aa83766b3b3b6c779e201381276f354d5c5dacf3b12"}},{"ruleId":"D1","level":"warning","message":{"text":"tasks.claimTask (cyclomatic 21): tasks.claimTask has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 72). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/tasks.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d5c8d6b5b916ab9138f8e606764ac86879787317d532a4421d9ddb9ede3e9f"}},{"ruleId":"D1","level":"warning","message":{"text":"state.removeDispatchRequestsForWorkers (cyclomatic 21): state.removeDispatchRequestsForWorkers has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 2278, 2309). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e6cb4924f767de8851a3aa565496159fa6395a1539ac17b993c5da194816cd"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.stripProofManagedCodexHookTrustStateTables (cyclomatic 21): generator.stripProofManagedCodexHookTrustStateTables has cyclomatic complexity 21 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":2758}}}],"partialFingerprints":{"codehealthFindingId/v1":"23865449db090c0fa0611cb85f1d0695cb0309076f48cc45560ccb68f2d7b882"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.findLauncherTimeoutRepairTargets (cyclomatic 21): generator.findLauncherTimeoutRepairTargets has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":4041}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5098b6ae1bd861990bd81fcb694418ae8131ceb1e132a27daaacff432920658"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.buildMergedConfig (cyclomatic 21): generator.buildMergedConfig has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":4287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb7bf2dec8968ffe567790ba4dabc29247607b7bb06d6a44a8130d4b02ff029"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.readCrossProcessLockState (cyclomatic 21): tracker.readCrossProcessLockState has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ed729749e764eb1094da0d36ec5b585fbf210d0f35c96e784234e255e05235"}},{"ruleId":"D1","level":"warning","message":{"text":"state.normalizeGuardexFinishEvent (cyclomatic 21): state.normalizeGuardexFinishEvent has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/state.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf40062a4a41bb592976ed12be57339704cee04ee7269f05fa6c346091b664a"}},{"ruleId":"D1","level":"warning","message":{"text":"state.readAllState (cyclomatic 21): state.readAllState has cyclomatic complexity 21 (threshold 15). Of this number, 18 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":"src/hud/state.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62e18ab33916012df79d18f8ff19c6833b8827fa39cdefddeef2046c4d7b49e"}},{"ruleId":"D1","level":"warning","message":{"text":"advisory-activation-verifier.verifyPinnedJsonAndSync (cyclomatic 21): advisory-activation-verifier.verifyPinnedJsonAndSync has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory-activation-verifier.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb497dd15cc89d316c231473de87f8137f73c4d382bb16aa0efca5cef82fb43"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-hook.detectInitialTarget (cyclomatic 21): tmux-hook.detectInitialTarget 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/cli/tmux-hook.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0f2ba7b615383a70a8a529f8d68153b281ab075aaf5da5c47111d7a84e79d0"}},{"ruleId":"D1","level":"warning","message":{"text":"operations.completeRalplanSession (cyclomatic 21): operations.completeRalplanSession has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/operations.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"923a4d7a7321dc6bf9aabd264c15f9c4eabcf506efab62e12ab58e86f336786d"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux.hudPaneMatchesOwner (cyclomatic 21): tmux.hudPaneMatchesOwner has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/hud/tmux.ts"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"a039efd0fe6578e6fef26f103fcbc784c259364bd8b6ec4cf86308a92a6cae68"}},{"ruleId":"D1","level":"warning","message":{"text":"temp-contract.parseNotifyTempContractFromArgs (cyclomatic 21): temp-contract.parseNotifyTempContractFromArgs 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/notifications/temp-contract.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d56557ef595c0c7b035948b012ebcd3195946f9615b24792ca76c3777d9bc5"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.removeGeneratedShutdownReport (cyclomatic 21): runtime.removeGeneratedShutdownReport has cyclomatic complexity 21 (threshold 15). Of this number, 17 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. This is NOT this file\u0027s highest cyclomatic complexity: runtime.isDetachedSessionDestroyReceipt (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"62437d82820e7db3fe203f0b8db5aa7f55a8c8fb802ae8f2bff596c0a45b0d0a"}},{"ruleId":"D1","level":"warning","message":{"text":"events.normalizeRawTeamEvent (cyclomatic 21): events.normalizeRawTeamEvent has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/events.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f765c055662a8264b5d5cbc4f24799deca3a010520b27f48ea41390a8c17a4a7"}},{"ruleId":"D1","level":"warning","message":{"text":"lifecycle.feedProjectMemory (cyclomatic 21): lifecycle.feedProjectMemory has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lifecycle.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"312a4d3746a28aa41c169789e2592e7826c983f04d46027d816d35d8afd2469c"}},{"ruleId":"D1","level":"warning","message":{"text":"agents-init.agentsInit (cyclomatic 21): agents-init.agentsInit 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/cli/agents-init.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11ae5520d54261ca91b2bf6e9438a0e23e293b53e6e35d94e2981ead71c521b"}},{"ruleId":"D1","level":"warning","message":{"text":"uninstall.printSummary (cyclomatic 21): uninstall.printSummary has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.ts"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bfffeae018c87bfdae95fed325a9a2622b2d7d6bb000874a9fef9a7282489f"}},{"ruleId":"D1","level":"warning","message":{"text":"watch-owner.createHudOwnerAliveProbe.\u003Creturned closure\u003E (cyclomatic 21): watch-owner.createHudOwnerAliveProbe.\u003Creturned closure\u003E has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/watch-owner.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa57aa4ac12b00f75fb6962d0dfdb8fb21608605132808abe16042aeadc5e9b1"}},{"ruleId":"D1","level":"warning","message":{"text":"ralplan.parseRoleIntentWriteArgs (cyclomatic 21): ralplan.parseRoleIntentWriteArgs 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/cli/ralplan.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25fb4d5cebab603008862d07bf4dcba57459fa32698c8d9c95a916df6530dee"}},{"ruleId":"D1","level":"warning","message":{"text":"session-usage.parseSessionUsageArgs (cyclomatic 21): session-usage.parseSessionUsageArgs 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/cli/session-usage.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf61d2dfe7f60026496d83cd774dd466d990c8931419f94b401cac5d9a35a9ed"}},{"ruleId":"D1","level":"warning","message":{"text":"session-search.parseSessionFrictionArgs (cyclomatic 21): session-search.parseSessionFrictionArgs 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/cli/session-search.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"145bac0966e91e7f1653c3d84517e5a5fa97c9ba50e7c784476793907a58b1fe"}},{"ruleId":"D1","level":"warning","message":{"text":"update.runDevGlobalUpdate (cyclomatic 21): update.runDevGlobalUpdate has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1c7724d43c290887a6e4f68cbf47d206c24ed8ce64d2f26ff2f81d3b23d324"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-detector.markdownDocumentationRange (cyclomatic 21): keyword-detector.markdownDocumentationRange 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/hooks/keyword-detector.ts"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"9816a78bb6bedf866d27420d6f8e951eb88215d504e62dce962c62a193d6beb9"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.pythonCommandHasOnlySafeOptions (cyclomatic 21): codex-native-hook.pythonCommandHasOnlySafeOptions 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6241}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e623a0ecb81fda72ae81cc3e1be6ab544c6c9c88fafb82fef56d4a123a5484"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.handleDirectOmxCancel (cyclomatic 21): codex-native-hook.handleDirectOmxCancel has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9721}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7aef8f9f4fbb8b7c8d649f6335de327314688fde8f4cdc501f79541a733e98f"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.omxOrGjcReadOnlyShapeMatches (cyclomatic 21): codex-native-hook.omxOrGjcReadOnlyShapeMatches 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, name the conditions: bind each compound test to a 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10041}}}],"partialFingerprints":{"codehealthFindingId/v1":"306f14e46063dbf8477299aca701772817407f57ff1a80dc21704d267be2e315"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.gitConfigTextHasExecutableStatusSurface (cyclomatic 21): codex-native-hook.gitConfigTextHasExecutableStatusSurface 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12015}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ab9f20fee99f022e5c4f3190d1eb3cb8cb2037743526bfc6fd77b5dffa8538"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isConductorPipelineMember (cyclomatic 21): codex-native-hook.isConductorPipelineMember 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb04ec3b910767496337245159d173451c02d20816dc59e242084cd7178531a"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isStaticallyRecognizedConductorOrchestrationMutation (cyclomatic 21): codex-native-hook.isStaticallyRecognizedConductorOrchestrationMutation has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16557}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43e2838c2d269b3589ff93e61516bdc1df28c93e2669515049120588873e76e"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.conductorCommandPrefixPreservesInheritedResolution (cyclomatic 21): codex-native-hook.conductorCommandPrefixPreservesInheritedResolution 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17702}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68f8fd2a91834bc0c03a7e1353245f4764fcfc7a20e9be0066165823764d700"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectInPlaceEditorWriteTargets (cyclomatic 21): codex-native-hook.collectInPlaceEditorWriteTargets 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":20438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a25a8cdee39828f608fc4c57fc00f1fda73c545a145847624cb19ba71af92e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.copyFilePreservingTimestamps (cyclomatic 21): index.copyFilePreservingTimestamps has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b0055307c576ec836df53fa14148c30fdb0317041baaa7b276288fec731e20"}},{"ruleId":"D1","level":"warning","message":{"text":"index.prepareRuntimeCodexHomeForProjectLaunch (cyclomatic 21): index.prepareRuntimeCodexHomeForProjectLaunch has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":2142}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb179b7aaf4340533de07c2a9376c3a55759b9a190b47ef6d3bf49e1390c935"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux.sendTmuxKeys (cyclomatic 21): tmux.sendTmuxKeys has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/extensibility/sdk/tmux.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2df357ece9075bc31948c33ac68a9ea33c60ad533489331bc49bb888f2bc2dc"}},{"ruleId":"D1","level":"warning","message":{"text":"notify-dispatcher.acquireTurnDispatchGuard (cyclomatic 21): notify-dispatcher.acquireTurnDispatchGuard has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-dispatcher.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f536f67c9989e26a8a19c6e90eef8cf2203faf7fef2f344994bc630287fe702"}},{"ruleId":"D1","level":"warning","message":{"text":"openclaw.observeOpenClaw (cyclomatic 20): openclaw.observeOpenClaw 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/adapt/openclaw.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b435705d321ae3c4766f1c266deb3ed8a3ad9bfa64132cc39d59edbbf2b728"}},{"ruleId":"D1","level":"warning","message":{"text":"native-assets.hydrateNativeBinary (cyclomatic 20): native-assets.hydrateNativeBinary 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/cli/native-assets.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad0eaf6c855b6e46510e585f6f64517aca35f6f7b1c06ff406a6eea8f26b1c2"}},{"ruleId":"D1","level":"warning","message":{"text":"session.acquirePointerLock (cyclomatic 20): session.acquirePointerLock 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/hooks/session.ts"},"region":{"startLine":2409}}}],"partialFingerprints":{"codehealthFindingId/v1":"73072d50aff033d7969e0a9e4c2bc15043b3d0d3c3cf2e1b5a9472ed4ed67126"}},{"ruleId":"D1","level":"warning","message":{"text":"session.establishLaunchSessionBinding (cyclomatic 20): session.establishLaunchSessionBinding has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":3099}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3c6e6aae56dcd9c659018ea05b96b026e039da1265e90163118c566318f678"}},{"ruleId":"D1","level":"warning","message":{"text":"dispatch.normalizeBridgeDispatchRecord (cyclomatic 20): dispatch.normalizeBridgeDispatchRecord has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/team/state/dispatch.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c3b8bd2578b545647f7bc4b51247d4bf3b60b59fa9d217f4ce0511c753ad27"}},{"ruleId":"D1","level":"warning","message":{"text":"monitor.getTeamSummary (cyclomatic 20): monitor.getTeamSummary 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/team/state/monitor.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"959863e92f0a646a6aea10cd15aff5643f1544797faa705b80dd3c16d355fe14"}},{"ruleId":"D1","level":"warning","message":{"text":"monitor.readTeamPhase (cyclomatic 20): monitor.readTeamPhase 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/team/state/monitor.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9d9430a7724e286e567a41bdce54da21ed06937864c8478292c91276979b32"}},{"ruleId":"D1","level":"warning","message":{"text":"state.validateMembershipTransactionFiles (cyclomatic 20): state.validateMembershipTransactionFiles 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/team/state.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b87a92813a66ac2ede9db80ab3be1319eac90a678228c3e66e3d37ebe9d6aad"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.advancePastInlineTomlValue (cyclomatic 20): generator.advancePastInlineTomlValue 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/config/generator.ts"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b4aa5649b08a68b6a31576894e34d683ee0a3d409a3eea312645aca2a5aa2f"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.repairPersistedRootIdentityInState (cyclomatic 20): tracker.repairPersistedRootIdentityInState 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/subagents/tracker.ts"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bc3ab2c8a2944b7ca7e3afb94e7b831b43e1c4195a0d31a7af2ae5ac1788cd"}},{"ruleId":"D1","level":"warning","message":{"text":"advisory-lifecycle-validation.journalValid (cyclomatic 20): advisory-lifecycle-validation.journalValid has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory-lifecycle-validation.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2c45b455a62c55b54c941aa9190517b1d57e9e50d555b562e494c9bb4201db"}},{"ruleId":"D1","level":"warning","message":{"text":"advisory.commitBoundActivationIntent (cyclomatic 20): advisory.commitBoundActivationIntent has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 138). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c908068648d61c027688f0067423e86ba59573c15cf0f5d3449788a8d0c81591"}},{"ruleId":"D1","level":"warning","message":{"text":"base.startModeUnderCanonicalLock (cyclomatic 20): base.startModeUnderCanonicalLock 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/modes/base.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6258c19ac04cb94637bceb0ffdde0e9f57c26fded682964a31b4b01a75149903"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-session.queryDetachedSessionLeaderBinding (cyclomatic 20): tmux-session.queryDetachedSessionLeaderBinding has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/tmux-session.ts"},"region":{"startLine":4684}}}],"partialFingerprints":{"codehealthFindingId/v1":"412b4829dcf248d7c612cdd8b2b8a418b633be45bd4f01fcd4d50f1ecd3adb1e"}},{"ruleId":"D1","level":"warning","message":{"text":"scaling.asScaleDownDebtResources (cyclomatic 20): scaling.asScaleDownDebtResources has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: scaling.asScaleDownDebtPanes::validate (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa150a10774ab76032efbc6a1b5cf95cb1570362a2ea338238406cdbf3289477"}},{"ruleId":"D1","level":"warning","message":{"text":"dispatcher.runPluginRunner (cyclomatic 20): dispatcher.runPluginRunner has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 200, 100, 125, \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":"src/hooks/extensibility/dispatcher.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fff3137b5a04b27635e8fb0ed0d5d57bcea49259bfe3530adc25a5e906693f"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.destroyConfiguredDetachedTeamSession (cyclomatic 20): runtime.destroyConfiguredDetachedTeamSession has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 885). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: runtime.isDetachedSessionDestroyReceipt (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b3b9a48535d4b80c1b7fbcd683556ca836a20d16eab8554ecef627a32078d1"}},{"ruleId":"D1","level":"warning","message":{"text":"ask.parseAskArgs (cyclomatic 20): ask.parseAskArgs 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/cli/ask.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1e5ce555fca8884cb628ea8f87006825d65c9aff8b2094392ffc2ac394791d"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.readOmxPluginCacheLivePinMutationLock (cyclomatic 20): plugin-marketplace.readOmxPluginCacheLivePinMutationLock 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, separate the cases: extract each independent branch into its own 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/cli/plugin-marketplace.ts"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39f9587e3b968151ded611caa106c71cd5a16d795b05a0b5cc526b4ac9b5189"}},{"ruleId":"D1","level":"warning","message":{"text":"index.resolveHudWatchCwd (cyclomatic 20): index.resolveHudWatchCwd has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/index.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cd32e5a568bf1f49cd07c352cdd5464af6254fdad4834aa0b3ab73b7752e01"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-detector.implicitClauseRange (cyclomatic 20): keyword-detector.implicitClauseRange 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/hooks/keyword-detector.ts"},"region":{"startLine":3180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5432ac7ee5ed474f7815671516228b3d6315baa5c6f7c862f2c5bddfe0e7de5"}},{"ruleId":"D1","level":"warning","message":{"text":"auto-nudge.normalizeAutoNudgeConfig (cyclomatic 20): auto-nudge.normalizeAutoNudgeConfig 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, name the conditions: bind each compound test to a well-named local or 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/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1adc6c5622b380ec82eece2b41f7d5ffa18daa82da22aea23c85a982934b877"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.maskQuotedRedirectMetacharsForCommandScan (cyclomatic 20): codex-native-hook.maskQuotedRedirectMetacharsForCommandScan 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5064}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bce4e2d419c649631489441e439b3daec03ce15203136f6d21b2bbddb43cb6"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.downloaderHasUnsafeTlsKeyLogEnvironment (cyclomatic 20): codex-native-hook.downloaderHasUnsafeTlsKeyLogEnvironment 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14458}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46f9ab0bf0be1cf50b2fc5d1273c17d2570260bcdb77d0fa62021202afe2010"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.conductorResolvedPackageCliCandidateIsTrusted (cyclomatic 20): codex-native-hook.conductorResolvedPackageCliCandidateIsTrusted 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17994}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e46e3a56e2a8e67c722803b82acbafe9cac2093d1f6e2f827c4a30d5c40a17"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.functionDefinitionMayBeConditional (cyclomatic 20): codex-native-hook.functionDefinitionMayBeConditional has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19227}}}],"partialFingerprints":{"codehealthFindingId/v1":"187c5fb57fe59c4e8437fdb8ff3d621272b2a93f09d62a7aa23bd25c5545d55d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.execWithOverlay (cyclomatic 20): index.execWithOverlay 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":"src/cli/index.ts"},"region":{"startLine":5855}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea23c178a8d35b8c64da3b157c21384dfd1a3b7677b4befd8385f04cbe9382df"}},{"ruleId":"D1","level":"warning","message":{"text":"index.buildDetachedLaunchControlPlane (cyclomatic 20): index.buildDetachedLaunchControlPlane 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/cli/index.ts"},"region":{"startLine":7088}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0e5e7a62ae5e37e5086dd0b1e0fc795f688928e889eba5775f498c909a8120"}},{"ruleId":"D1","level":"warning","message":{"text":"collect-astra-defaults.main (cyclomatic 20): collect-astra-defaults.main has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/eval/collect-astra-defaults.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39fc3b0d2742c00ad9d44d534168c34a22a612cc1bba69f20492d029f059bed"}},{"ruleId":"D1","level":"warning","message":{"text":"mode-binding-lease-helper.acquire (cyclomatic 20): mode-binding-lease-helper.acquire 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/state/mode-binding-lease-helper.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"210e9cdc79c13ba9e54366060ee0e2eeaa9068447f27e6d971a22e5752496ea4"}},{"ruleId":"D1","level":"warning","message":{"text":"pinned-atomic-file-darwin-janitor.recover (cyclomatic 20): pinned-atomic-file-darwin-janitor.recover 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/state/pinned-atomic-file-darwin-janitor.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b443a51ed8743b4d53f05d9e0ab82735f68210b7acc7cc399f553d106d4935"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.tokenizeWindowsDirectCommand (cyclomatic 19): codex-hooks.tokenizeWindowsDirectCommand 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/config/codex-hooks.ts"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"074d4893f2d701c8e4b002c804ab8c801b819455b8aa560844c8753a7f650728"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.prepareLegacyState (cyclomatic 19): codex-hooks.prepareLegacyState 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/config/codex-hooks.ts"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cc42944bd24eaa41ae72fcd1269001e84c41074184093866d0c34c6af41b61"}},{"ruleId":"D1","level":"warning","message":{"text":"state-root.resolveWorkerTeamStateRootWithOptions (cyclomatic 19): state-root.resolveWorkerTeamStateRootWithOptions 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/team/state-root.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8a949bfc004675738f5610890452afda494609b5377c75efcd81bbd4a5fb36"}},{"ruleId":"D1","level":"warning","message":{"text":"state-paths.normalizeSessionMetadata (cyclomatic 19): state-paths.normalizeSessionMetadata has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/state-paths.ts"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"60de4d0509ade77d0e7502d21c565ec4af119c63cc239cc0f2f81c2e8eb5dadf"}},{"ruleId":"D1","level":"warning","message":{"text":"session.writePointerTransaction (cyclomatic 19): session.writePointerTransaction 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/hooks/session.ts"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"549cdea49cc52363abdf3e23b12b87a529f92dda423c80b7077e6fe7e0bf0b5c"}},{"ruleId":"D1","level":"warning","message":{"text":"session.consumeBoundDirectoryAuthorizationUnderLock (cyclomatic 19): session.consumeBoundDirectoryAuthorizationUnderLock has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":3411}}}],"partialFingerprints":{"codehealthFindingId/v1":"16716e374f7ecd7a497c6f09c86e8d8182fa91a2aa30c25e1cd16aef5c4df32e"}},{"ruleId":"D1","level":"warning","message":{"text":"coordination-protocol.normalizeTeamTaskCoordinationPlanForStorage (cyclomatic 19): coordination-protocol.normalizeTeamTaskCoordinationPlanForStorage has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/coordination-protocol.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20bd07f576c048b4f36dc3e42ed3146b2e963ecad7a4db16dbc01f370569c3a"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.parseTomlSourceTableHeader (cyclomatic 19): generator.parseTomlSourceTableHeader 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/config/generator.ts"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4cb8f768f04aa4326b0d7f6c5f54efafafff2f1f3f9a77efc25640890ee21b"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.removeManagedHookTrustStateFences (cyclomatic 19): generator.removeManagedHookTrustStateFences has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own 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/config/generator.ts"},"region":{"startLine":2711}}}],"partialFingerprints":{"codehealthFindingId/v1":"434f356d3589dc9d40cddf77cf2f433a4451ab901c8b5bb9279315a9d3a42e87"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-goal-snapshot.parseCodexGoalSnapshot (cyclomatic 19): codex-goal-snapshot.parseCodexGoalSnapshot has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/goal-workflows/codex-goal-snapshot.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e26a7a0d434d794e0e36a09417306a7f9f427d8ab3d9dc32cee32aa5788a0e"}},{"ruleId":"D1","level":"warning","message":{"text":"contract.parseNativeSubagentResultDisposition (cyclomatic 19): contract.parseNativeSubagentResultDisposition has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/leader/contract.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a40da17b7da047844c43130a8032e092a137f02c621687f48b80565f0800cb"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.quarantinePersistedRootAuthority (cyclomatic 19): tracker.quarantinePersistedRootAuthority has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 1580). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"4964144e4815eb10b5a63d3e3246ce46f9dc57e2dada4498e24b10e8fb2981e9"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-active.acquireRootSkillActiveStateLock (cyclomatic 19): skill-active.acquireRootSkillActiveStateLock 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/state/skill-active.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72582743fbf533fb31fe34125fe30a965b8059e1f557ac10165deac8b66816c"}},{"ruleId":"D1","level":"warning","message":{"text":"advisory-contract.validateAdvisoryInactiveState (cyclomatic 19): advisory-contract.validateAdvisoryInactiveState has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory-contract.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0038295bc98cb383df8e59066f03df3678a1ea38b0035fbadbfbdb134386b1b"}},{"ruleId":"D1","level":"warning","message":{"text":"operations.listStateStatuses (cyclomatic 19): operations.listStateStatuses 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/state/operations.ts"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3d855f1dd4410f95d22d702cc5a9dfab0cd2d4fbbfaace6f66909d003b0386"}},{"ruleId":"D1","level":"warning","message":{"text":"formatter.parseTmuxTail (cyclomatic 19): formatter.parseTmuxTail 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/notifications/formatter.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1126aebe5ed12a4ac3ef82b340a0716a9543f61ae120ca3b8c70cb8de04a1fd"}},{"ruleId":"D1","level":"warning","message":{"text":"quality-gates.validateAllQualityGates (cyclomatic 19): quality-gates.validateAllQualityGates 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/config/quality-gates.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b41aec7e7121518d40db138ca61a1622d5c28e405a1b8fd2988a1afdaa8f52"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-session.resolveTeamWorkerCliForResolvedLaunchArgs (cyclomatic 19): tmux-session.resolveTeamWorkerCliForResolvedLaunchArgs has cyclomatic complexity 19 (threshold 15). 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: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/team/tmux-session.ts"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ff27c126dda44646185728447920f2ab302ec786580c9d250c6407ec4f0cd4"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-session.killWorkerByPaneId (cyclomatic 19): tmux-session.killWorkerByPaneId has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (tmux-session.killWorkerByPaneIdAsync) 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":"src/team/tmux-session.ts"},"region":{"startLine":4128}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a5c4df3731a74afa1117df16083d3bdb109ae22d88f9b2de61db396902333e"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-session.killWorkerByPaneIdAsync (cyclomatic 19): tmux-session.killWorkerByPaneIdAsync has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (tmux-session.killWorkerByPaneId) 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":"src/team/tmux-session.ts"},"region":{"startLine":4209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd512df18e898a6e1fd08b666d93933e2ee0a87adbf59523d16757ebe3e4af8"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.reconcileStartupCleanupPanes (cyclomatic 19): runtime.reconcileStartupCleanupPanes has cyclomatic complexity 19 (threshold 15). Of this number, 16 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. This is NOT this file\u0027s highest cyclomatic complexity: runtime.isDetachedSessionDestroyReceipt (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c08946434bc1f706db10f98fe4fd977468fade09eaafe974ef1743ac56cf88"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.applyCreatedInteractiveSessionToConfig (cyclomatic 19): runtime.applyCreatedInteractiveSessionToConfig has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: runtime.isDetachedSessionDestroyReceipt (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"81956ce150212049937be1e28a9c1d335bd99752e33608beb1991caf7c815796"}},{"ruleId":"D1","level":"warning","message":{"text":"trace-server.handleTraceToolCall (cyclomatic 19): trace-server.handleTraceToolCall has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/trace-server.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7716edf4fd5370beaa437f88380d496d456ce79e2092f93bf7e10d66c92f5c1"}},{"ruleId":"D1","level":"warning","message":{"text":"autoresearch-guided.parseInitArgs (cyclomatic 19): autoresearch-guided.parseInitArgs 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/cli/autoresearch-guided.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"96eac87279467f098d9b7acab5b6b5afffab69999df7bd06dafed8266d417507"}},{"ruleId":"D1","level":"warning","message":{"text":"native-hook-claim-journal.restoreNativeHookClaimNoClobber (cyclomatic 19): native-hook-claim-journal.restoreNativeHookClaimNoClobber has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/native-hook-claim-journal.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"66591395cab21ecd3982e595902a966bc66885f1ee71d0629af32b6f139d9bf7"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.writePendingOmxPluginCacheLivePinRegistration (cyclomatic 19): plugin-marketplace.writePendingOmxPluginCacheLivePinRegistration 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/cli/plugin-marketplace.ts"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd7fab5b0a741e6f13f349c3a86bcc97bcf7c7e11777a0645deecd6971e2d88"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.hasLiveSessionPinRecord (cyclomatic 19): plugin-marketplace.hasLiveSessionPinRecord 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/cli/plugin-marketplace.ts"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e60850930fb2079b2d52d1b58730e1a4775c6297bd03fab4df8d9e450b33fc"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.omxPluginCacheManifestProvenanceReason (cyclomatic 19): plugin-marketplace.omxPluginCacheManifestProvenanceReason has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2804}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc902bdd232638b5cdb1526a8e3409ef05cf661761cdbad4d03732659d06a9b"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.checkStateRootSessionBinding (cyclomatic 19): doctor.checkStateRootSessionBinding has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf241b5aa58b07a74cb2d671d93c7be5c6bbc747bc27fa31fedbd798340fecde"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.repairStateProjections (cyclomatic 19): doctor.repairStateProjections 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/cli/doctor.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcaefc8f2b98548757d2edcbe14b7e9a01ff939249404106b87e5e7fcab9a708"}},{"ruleId":"D1","level":"warning","message":{"text":"uninstall.parseNotifyMetadata (cyclomatic 19): uninstall.parseNotifyMetadata has cyclomatic complexity 19 (threshold 15). Of this number, 17 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":"src/cli/uninstall.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb13bae3d630f9aab9e30fac0c79f2e8808299c1c6f649e7ff8fab4b72502cb"}},{"ruleId":"D1","level":"warning","message":{"text":"sparkshell.sparkshellCommand (cyclomatic 19): sparkshell.sparkshellCommand 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/cli/sparkshell.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6287d7cc5f417e9f6fadc979581f438242b228d2eabe230c32a08e60ab6b5e7"}},{"ruleId":"D1","level":"warning","message":{"text":"usage.inspectTranscript (cyclomatic 19): usage.inspectTranscript 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/session-history/usage.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7511775d84ce4abcea01b286c2e02c989ba59db091ddfb8a35f7e3341162ffcc"}},{"ruleId":"D1","level":"warning","message":{"text":"auto-nudge.resolveNudgePaneTarget (cyclomatic 19): auto-nudge.resolveNudgePaneTarget 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/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0137edaa66511a1471323a60f945673ddb0996021c6e5f7bc13c41f31cadcd"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-pre-post.tokenizeShellCommand (cyclomatic 19): codex-native-pre-post.tokenizeShellCommand 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/scripts/codex-native-pre-post.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"60aa0bddadb546601fb372fc2de7afa5404340980d39dc99dc577252f5c6c7ae"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-pre-post.findGitCommandTokenIndex (cyclomatic 19): codex-native-pre-post.findGitCommandTokenIndex 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/scripts/codex-native-pre-post.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"321c4c33392cfc2d66f011cfd0a34b6374f9cf6173121816a896284adc2c272a"}},{"ruleId":"D1","level":"warning","message":{"text":"pre-tool-use-advisory.toAdvisoryOrCancelPreToolUseOutput (cyclomatic 19): pre-tool-use-advisory.toAdvisoryOrCancelPreToolUseOutput 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/hooks/native/pre-tool-use-advisory.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ebe6d4e476ede1e2e11e81895a55e283cc1c79841e73cb63e93bd6201e42f8"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.commandHasDestructiveGitSubcommand (cyclomatic 19): codex-native-hook.commandHasDestructiveGitSubcommand 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5359}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c8a2356732e1d938d52739608fbc7bb025f7723c4bd4759b79ef76dcaf262f"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.findShellFunctionBodyEnd (cyclomatic 19): codex-native-hook.findShellFunctionBodyEnd 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6004}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53e7899ddf7ef0ef755a380aee3eab360829ccc443143bcb145694211d4fcd0"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.envCommandHasCwdChangingOption (cyclomatic 19): codex-native-hook.envCommandHasCwdChangingOption 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6738}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31aa949c9b8ab8579c8df52e8ed591e1bdef3777fb295466918e186c08e52a6"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.extractNestedCommandSubstitutionStringsForStateScan (cyclomatic 19): codex-native-hook.extractNestedCommandSubstitutionStringsForStateScan 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b473e5a4dfd4fc31e3f2e11701f0c703848c34fd50e4914bdaa354a7c3e23039"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.staticExpansionAssignmentMarker (cyclomatic 19): codex-native-hook.staticExpansionAssignmentMarker 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8901}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce49509a24c3f19b406e5b76fbfd24ce437cb94933f330c5a0888ccf641e48fe"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isAllowedOmxSessionLockInspectCommand (cyclomatic 19): codex-native-hook.isAllowedOmxSessionLockInspectCommand 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10059}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffdc6d96d2468a215edca3310017e458195323f1c06599c1f00af86bd72a3de"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.gitStatusTrackedSurfaceIsSafe (cyclomatic 19): codex-native-hook.gitStatusTrackedSurfaceIsSafe 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12069}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e7ae64b0bc963ccd9f4a3f11f79c152532dd6cd54399bd661aca8ad15c26e0"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isPositivelyClassifiedUniqCommand (cyclomatic 19): codex-native-hook.isPositivelyClassifiedUniqCommand 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12529}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffa18c53448db22b583a6e61371e826a85cd2969a457fc60bb0a4497c7acac0"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isPositivelyModeledPythonSource (cyclomatic 19): codex-native-hook.isPositivelyModeledPythonSource 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13820}}}],"partialFingerprints":{"codehealthFindingId/v1":"338800bf58bdbef05f13a4306a0c892b84946c5086ee21b7fb69fa99cc66b26e"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectConductorSedTargets (cyclomatic 19): codex-native-hook.collectConductorSedTargets 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15397}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46df3538ea7237c8a493dc7e777793fed17cac1ae3ceec3cac1f0d7c8fd1516"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.applyNestedShellEnvironment (cyclomatic 19): codex-native-hook.applyNestedShellEnvironment 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18572}}}],"partialFingerprints":{"codehealthFindingId/v1":"572a5b061c1cf8d41bd841458d9e1cfdd0e0d42327a01db083875fcb0bed5dd3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.queryMadmaxDetachedRuntimeBinding (cyclomatic 19): index.queryMadmaxDetachedRuntimeBinding has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":4295}}}],"partialFingerprints":{"codehealthFindingId/v1":"989c706a7d4f5ed3dab78e3966772ab3f6a4d390bef2a289488b427f622f5f6a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.parseDetachedHudAuthorityProof (cyclomatic 19): index.parseDetachedHudAuthorityProof has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":8914}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f56bae893b9032a4e7b4d14fda4edd69b53494fd7f9db5cf23a55e3811cb1d2"}},{"ruleId":"D1","level":"warning","message":{"text":"team-dispatch.runtimeExec (cyclomatic 19): team-dispatch.runtimeExec has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e230c61393c2eaf899a58f2d7c8a6ac329c6bb9dadb0a880953f4b091caaae4"}},{"ruleId":"D1","level":"warning","message":{"text":"team-leader-nudge.maybeNudgeTeamLeader::persistLeaderNudgeBookkeeping (cyclomatic 19): team-leader-nudge.maybeNudgeTeamLeader::persistLeaderNudgeBookkeeping has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (team-leader-nudge.maybeNudgeTeamLeader) 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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ea72bb9586f077259766f1f90d3160d92a1fc90c6b4c3c89d6ed32c722cfb3"}},{"ruleId":"D1","level":"warning","message":{"text":"notify-fallback-watcher.resolveActiveModeState (cyclomatic 19): notify-fallback-watcher.resolveActiveModeState 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/scripts/notify-fallback-watcher.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"c154b90d7dab91a9f4e71a220e6246a22700a24c999e1eb2b2c4e4eefb5395b2"}},{"ruleId":"D1","level":"warning","message":{"text":"notify-fallback-watcher.runFallbackAutoNudgeTick (cyclomatic 19): notify-fallback-watcher.runFallbackAutoNudgeTick has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e235b51adb49ed24800ab30dac18335b36d25f73f1ff34e90940c328cec7b27"}},{"ruleId":"D1","level":"warning","message":{"text":"notify-fallback-watcher.enforceLifecycleGuards (cyclomatic 19): notify-fallback-watcher.enforceLifecycleGuards 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/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e3a32d528c1b77c801e68021ea56204f9e0e08359a5fffde8cf870e895617c"}},{"ruleId":"D1","level":"warning","message":{"text":"smoke-packed-install.smokeInstalledLaunchArgumentBoundary (cyclomatic 19): smoke-packed-install.smokeInstalledLaunchArgumentBoundary 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/scripts/smoke-packed-install.ts"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5608920c623878e996ccf83fb1c1d45602e36d24230362c695701213953aa7"}},{"ruleId":"D1","level":"warning","message":{"text":"readNoFollowText (cyclomatic 19): readNoFollowText has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4fdd97c0314ad7b2fa3d83bf6fe4bd9a3a11943ed40bea9a23eb99e6c0c4a2"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.removeVerifiedLockEntry (cyclomatic 18): codex-native-hook.removeVerifiedLockEntry has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a0e433a3a4c5d240ba2403eddba01a2195997c3eb08387dd0e76e07a452a8a"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.isValidRustRegexEscape (cyclomatic 18): codex-hooks.isValidRustRegexEscape 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/config/codex-hooks.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9067f949e9004556593a9679b386241db9a8e1386521df2a30fc097f206d299"}},{"ruleId":"D1","level":"warning","message":{"text":"session.classifySessionProcessForRecovery (cyclomatic 18): session.classifySessionProcessForRecovery 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/hooks/session.ts"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ed64e6fd3929eccbc67150131ad60d64e5804155e7caa738bd361d224e2da0"}},{"ruleId":"D1","level":"warning","message":{"text":"session.authorizeBoundDirectoryBeforeTransaction (cyclomatic 18): session.authorizeBoundDirectoryBeforeTransaction 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":"src/hooks/session.ts"},"region":{"startLine":3357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e65a5f5c46e6279faf64af2ee5c88a851f6e7d5b0300dcba035dd8b43f44a28"}},{"ruleId":"D1","level":"warning","message":{"text":"monitor.normalizeWorkerIntegrationState (cyclomatic 18): monitor.normalizeWorkerIntegrationState has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/monitor.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"893bf64f9c91c72098c957610d0806f082d064aab2aa10c3799b686cc3559364"}},{"ruleId":"D1","level":"warning","message":{"text":"coordination-protocol.normalizeTeamTaskCoordinationPlanForRender (cyclomatic 18): coordination-protocol.normalizeTeamTaskCoordinationPlanForRender 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/team/coordination-protocol.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8c4ef9fd095f09e0455b873ce370bde26acac5d1b2668a256b5b8c3cd1d6ab"}},{"ruleId":"D1","level":"warning","message":{"text":"contract.supportEvidenceFromBlocker (cyclomatic 18): contract.supportEvidenceFromBlocker 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/leader/contract.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"836e408fbcafac1fe6642c45523dd69022187682497bfe2469173acd7650c34d"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-active.listActiveSkills (cyclomatic 18): skill-active.listActiveSkills 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":"src/state/skill-active.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"400346037d5859407e05624389dfe5efde6e2227b3a9de424f118db23ffeff42"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-active.reclaimOwnerlessStaleLock (cyclomatic 18): skill-active.reclaimOwnerlessStaleLock 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/state/skill-active.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aac3645f45071e200680be567896a57ef362091c92840a5dddbeb8c585a9db8"}},{"ruleId":"D1","level":"warning","message":{"text":"types.normalizeQuestionItem (cyclomatic 18): types.normalizeQuestionItem 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/question/types.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b20f30b92a08b0746f050980ad5f2767d5e7fe0bb48c1fc1968ca7535270ced"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.parseAutoresearchCandidateArtifact (cyclomatic 18): runtime.parseAutoresearchCandidateArtifact 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":"src/autoresearch/runtime.ts"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c269555708cc80b432bd8e07d68d0d6d14585bdca0a13af0eb07a66db48ba4a"}},{"ruleId":"D1","level":"warning","message":{"text":"model-contract.tokenizeWorkerLaunchArgs (cyclomatic 18): model-contract.tokenizeWorkerLaunchArgs 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/team/model-contract.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b998b0d27182c5e44ee4a99ea5263eea6e29963719039a9730c9d904d5f908e"}},{"ruleId":"D1","level":"warning","message":{"text":"worker-bootstrap.generateInitialInbox (cyclomatic 18): worker-bootstrap.generateInitialInbox has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 806). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-bootstrap.ts"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7f14d43dfb8b087d7eb1f5e621fd53fa3e882b954ff18d17f14434eed4c002"}},{"ruleId":"D1","level":"warning","message":{"text":"autoresearch-guided.runAutoresearchNoviceBridge (cyclomatic 18): autoresearch-guided.runAutoresearchNoviceBridge has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/autoresearch-guided.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"67642e972b1aa8055bc32af251a7b05ff2091a82e944a72fe269f46955f3c307"}},{"ruleId":"D1","level":"warning","message":{"text":"triage-config.readTriageConfig (cyclomatic 18): triage-config.readTriageConfig 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/hooks/triage-config.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"03896be0ee57c0485154e4858d1b38c59f0dc49341cfa3bc69bd29cec7a73e87"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.validateStagedPluginSnapshot (cyclomatic 18): plugin-marketplace.validateStagedPluginSnapshot 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/cli/plugin-marketplace.ts"},"region":{"startLine":3159}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f7df30cee2c541753dcf1a34a2bb67049f3c6af8a3749b1ecb437b6ec47352"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.collectRepoArtifactOwnershipIssues::visit (cyclomatic 18): doctor.collectRepoArtifactOwnershipIssues::visit 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/cli/doctor.ts"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e711b1ac304bea2220ac236e27f1dde78a20a9deee6a6a07103794211f27797"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.checkSparkRouting (cyclomatic 18): doctor.checkSparkRouting 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/cli/doctor.ts"},"region":{"startLine":4030}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2783d63dceb41850228c7f109b95e6cd0162a201b7d100ff9f6a11650fc228"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.ensureSnapshotBackup (cyclomatic 18): setup.ensureSnapshotBackup 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/cli/setup.ts"},"region":{"startLine":2042}}}],"partialFingerprints":{"codehealthFindingId/v1":"72099ee17583f0b0596c3aa28f16e93868486d2eb26b52ee6684fd6a923d02fc"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.assertManagedDestination (cyclomatic 18): setup.assertManagedDestination 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/cli/setup.ts"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b88dc86d4aa2344fb5e13f619970b6e3354c647504e232cb682813e38b1039c"}},{"ruleId":"D1","level":"warning","message":{"text":"uninstall.stageAndRemoveFile (cyclomatic 18): uninstall.stageAndRemoveFile 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/cli/uninstall.ts"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"225a22d6f0b3ff994fad2b424875e2f9af2f14b472597ebaf9c0d713cb75c46f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.launchTmuxPane (cyclomatic 18): index.launchTmuxPane has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/index.ts"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a92af3b55c165915be2876d56543d8e5539e5585fd6a742243d5030acc58dd"}},{"ruleId":"D1","level":"warning","message":{"text":"team.parseTeamApiArgs (cyclomatic 18): team.parseTeamApiArgs has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: team.sampleValueForTeamApiField (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36243d546ae2794377a3864eb5116429d4c8500dc23c461b828b1a85237e2c3"}},{"ruleId":"D1","level":"warning","message":{"text":"AdvisoryLifecycleHandler.activate (cyclomatic 18): AdvisoryLifecycleHandler.activate has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/runtime-advisory-lifecycle.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb05b05f0815535b9ef3e7969fcc807ceb4d20ed12c8e8e2f256686892ea98d8"}},{"ruleId":"D1","level":"warning","message":{"text":"session-export.parseSessionExportArgs (cyclomatic 18): session-export.parseSessionExportArgs 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/cli/session-export.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a3b6bb5d420644dc59c852e9afc1287e71457a6ca71362feaf46a788aa417f"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-detector.collectImplicitClauseIndex (cyclomatic 18): keyword-detector.collectImplicitClauseIndex 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/hooks/keyword-detector.ts"},"region":{"startLine":3088}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf86aeb703d79bf8306ac4448f32ca74bc1c9931bd9e2231959fb272f5cfdcbb"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-pre-post.readInlineEnvironmentAssignments (cyclomatic 18): codex-native-pre-post.readInlineEnvironmentAssignments has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own 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/scripts/codex-native-pre-post.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"16456a51d0eebb6577a6efe3aa9da0b2102d26df7f8d8007a5cbee958bf1b35a"}},{"ruleId":"D1","level":"warning","message":{"text":"triage-state.isTriageStateFile (cyclomatic 18): triage-state.isTriageStateFile 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":"src/hooks/triage-state.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"160bdd44303f57aa727025629f3b2a1db95b7773e2898f53e8c84daec76eb91e"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectSloppyFallbackFindingsFromPatch (cyclomatic 18): codex-native-hook.collectSloppyFallbackFindingsFromPatch has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cdf99d7ffec0ae40897f24bd9e09ce12592e8c457b23bb32b935219f000878"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.classifyRalplanBeadsMetadataCommand (cyclomatic 18): codex-native-hook.classifyRalplanBeadsMetadataCommand has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":4865}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e0d3927cc7d94671b4449773ae2403464de98a70036edf7a1cf6adeaa55bcf"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.conductorMetadataRedirectsHaveBoundedProducers (cyclomatic 18): codex-native-hook.conductorMetadataRedirectsHaveBoundedProducers has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3b66e4c367bed6cf8faa09d8e1ab55638cfc2aed33d079b5d325db897a03bd"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.commandHasPackageInstallIntent (cyclomatic 18): codex-native-hook.commandHasPackageInstallIntent has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5393}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76dbfeea785d2c6ea2b443befd20e8675b8f0cf56cb447d031c8f1679232fe1"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.findPackageInstallSubcommandIndex (cyclomatic 18): codex-native-hook.findPackageInstallSubcommandIndex has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5410}}}],"partialFingerprints":{"codehealthFindingId/v1":"43311f0fc55104e4c57fb3b7e3c4bb79cf19d43359393d12f3f6c4b509d9c537"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.resolveWrappedCommandExecutionContext (cyclomatic 18): codex-native-hook.resolveWrappedCommandExecutionContext has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5871}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8118cbe82b1e0cd77701ade52c13c825235a6b49e0836469106c31dedf10cde"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.sliceShellWordsTailPreservingQuoting (cyclomatic 18): codex-native-hook.sliceShellWordsTailPreservingQuoting has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7221}}}],"partialFingerprints":{"codehealthFindingId/v1":"1737c616ceed672aa25f28d2b31157f111d860c7a5dafd46b6806aefa7624e50"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.findCaseArmCommandIndex (cyclomatic 18): codex-native-hook.findCaseArmCommandIndex has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7640}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd54cb094d31cda20666d0c16b2183015655fd84064a6b5376b2cadaf7d33ee1"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.nodeCommandHasPreloadExecution (cyclomatic 18): codex-native-hook.nodeCommandHasPreloadExecution has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12707}}}],"partialFingerprints":{"codehealthFindingId/v1":"897eb2e1a77684d388b39c7cd563e3546626d4e837628b59bb0fbecec27a9277"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.collectConductorCoprocCompoundBodies (cyclomatic 18): codex-native-hook.collectConductorCoprocCompoundBodies has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12949}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59f1c2382b49f0904beae3df87b290f892aba3834e42acfff82b9fe9c687726"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.commandMayBeConditionallyExecuted (cyclomatic 18): codex-native-hook.commandMayBeConditionallyExecuted has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16846}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b14561e525058fb888e6a845e52ec44b4166b8c19c6c0c9de15effa82fafa7"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.applyPersistentFunctionEffects (cyclomatic 18): codex-native-hook.applyPersistentFunctionEffects has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a331fe37d212842dbaa27e6ae5269b669b4155bef8e7c2bf638e78261b48197f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.runCodex::launchDetachedSession::bootstrapLeader (cyclomatic 18): index.runCodex::launchDetachedSession::bootstrapLeader 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 (index.runCodex) 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":"src/cli/index.ts"},"region":{"startLine":8418}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d194b4772e111f3223167f385ca9fbfb16d0b3f53f050c92537954ac44e99b"}},{"ruleId":"D1","level":"warning","message":{"text":"notify-hook.terminalStateMatchesNotifyTurn (cyclomatic 18): notify-hook.terminalStateMatchesNotifyTurn 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":"src/scripts/notify-hook.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdd2f763e1eff263458546190eff40f42697383667c0de2102503a6bbb38b99"}},{"ruleId":"D1","level":"warning","message":{"text":"notify-hook.dispatchTurnCompleteHookEvents (cyclomatic 18): notify-hook.dispatchTurnCompleteHookEvents 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":"src/scripts/notify-hook.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"da663972320c36ca41566ffef792ed39535c84e38db7d65d05e20dc1bee4b6fe"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-native-agents.assertTomlStructure (cyclomatic 18): verify-native-agents.assertTomlStructure 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/scripts/verify-native-agents.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d3370cc325a8e1b9202baee43bf2d62ddaf8d2067faa1a9979e18d67df221a"}},{"ruleId":"D1","level":"warning","message":{"text":"mode-binding-lease-helper.readPinnedRecord (cyclomatic 18): mode-binding-lease-helper.readPinnedRecord 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":"src/state/mode-binding-lease-helper.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a94ad718c5e89aa8c4886cf7a445c96ecaba6072a13e1c36d52506c421290fe"}},{"ruleId":"D1","level":"warning","message":{"text":"pinned-atomic-file-darwin-helper.main (cyclomatic 18): pinned-atomic-file-darwin-helper.main 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/state/pinned-atomic-file-darwin-helper.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcff5cba7a606cc19bc009419ad29e1dfb3fbf2864c646fdfb22aced694aecb4"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.classifyManagedCodexNativeHookWindowsShimOwnership (cyclomatic 17): codex-hooks.classifyManagedCodexNativeHookWindowsShimOwnership 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/config/codex-hooks.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d449dac95977c27d1c74aeb85a9e6ad36ae11349e5d573e4bff5d173428144"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.validateCommandHandler (cyclomatic 17): codex-hooks.validateCommandHandler has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"7350067af73a615d543319eaa1343c850084d6c3b1e48834460a099d75af4fe8"}},{"ruleId":"D1","level":"warning","message":{"text":"state-paths.resolveRuntimeStateScope (cyclomatic 17): state-paths.resolveRuntimeStateScope has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/state-paths.ts"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"1551675817af6e813528e6b694d13100c4c28d981e02bad7ecee12a0116fb0b7"}},{"ruleId":"D1","level":"warning","message":{"text":"session.classifyParsedSessionPointer (cyclomatic 17): session.classifyParsedSessionPointer has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7365e371fe917b2bf2310224ebb72b7db2357a8b729ddd36b4bb2231317254a8"}},{"ruleId":"D1","level":"warning","message":{"text":"session.acquireDirectoryCapability (cyclomatic 17): session.acquireDirectoryCapability 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/hooks/session.ts"},"region":{"startLine":3032}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6f404fb28b44749a0d12dace78af5c26dc159441d2caed30c3b3181fa2b065"}},{"ruleId":"D1","level":"warning","message":{"text":"worktree.parseWorktreeMode (cyclomatic 17): worktree.parseWorktreeMode 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/team/worktree.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cd032524fd1f125f8a9d2f352d13dff4b4d13258d7e783370b619a37d97dd3"}},{"ruleId":"D1","level":"warning","message":{"text":"dispatch.executeBridgeCommand (cyclomatic 17): dispatch.executeBridgeCommand 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/team/state/dispatch.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da002eee174b889dba6b43f75b5057f9f88ba9598fa8153d973dd08b2c53108"}},{"ruleId":"D1","level":"warning","message":{"text":"state.deriveLeaderStopAttentionState (cyclomatic 17): state.deriveLeaderStopAttentionState has cyclomatic complexity 17 (threshold 15). Of this number, 15 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. This is NOT this file\u0027s highest cyclomatic complexity: state.isStrictLegacyDispatchRequestForRollback (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":2954}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c0a12f239a6c92ced9033457f501a38b781cc778c9974613bccfaf14b2c62f"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.projectTrustCandidateIsSafe (cyclomatic 17): generator.projectTrustCandidateIsSafe has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8b3dc2ccea5cff436ce71edb55a9565a1c4e3b16fa411419d75ac21c57309b"}},{"ruleId":"D1","level":"warning","message":{"text":"mode-binding-lease.resolveValidatedCanonicalModeBinding (cyclomatic 17): mode-binding-lease.resolveValidatedCanonicalModeBinding 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/state/mode-binding-lease.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1216f5b4dfd99970f880c62576d98bb16aae8b7055f69dd4de0ab604251c00d6"}},{"ruleId":"D1","level":"warning","message":{"text":"advisory-evidence.canonicalArtifactPath (cyclomatic 17): advisory-evidence.canonicalArtifactPath 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/ralplan/advisory-evidence.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d924f0000d1acc21668fa57f2305752e4a1c3f2fad1175c0970740830bf6f2ce"}},{"ruleId":"D1","level":"warning","message":{"text":"advisory-contract.classifyAdvisoryPrompt (cyclomatic 17): advisory-contract.classifyAdvisoryPrompt has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory-contract.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ea1ef39f865bf80b4b0a8a535b02a5cb6aa5873d92416e3c9948108daad461"}},{"ruleId":"D1","level":"warning","message":{"text":"advisory.administrativelyAbandonRalplanAdvisory (cyclomatic 17): advisory.administrativelyAbandonRalplanAdvisory has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 954). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory.ts"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c0503cc528eb25f76cf91a8477ac4b26c225b9911f48e0b109664574edbb3b"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux.parsePosixHudEnvAssignments.inspect (cyclomatic 17): tmux.parsePosixHudEnvAssignments.inspect 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/hud/tmux.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6a16d177e274e18f6dca2513dc9be92bbfab4f2dea0cfa00cc111a409e7c7a"}},{"ruleId":"D1","level":"warning","message":{"text":"session-status.buildDiscordSessionStatusReply (cyclomatic 17): session-status.buildDiscordSessionStatusReply has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/notifications/session-status.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13e0b60a1991f7d7239779fbbb5e3f43ab1721cbf5d3462a654e9e7dea0ed30"}},{"ruleId":"D1","level":"warning","message":{"text":"reconcile.acquireHudReconcileLock (cyclomatic 17): reconcile.acquireHudReconcileLock 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/hud/reconcile.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90b47040b7d8ca822162ff551fb01cee4de7707ae19cae321bbb769a7ba1196"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-session.requireFrozenWindowTopologySync (cyclomatic 17): tmux-session.requireFrozenWindowTopologySync 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/team/tmux-session.ts"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d7bf0ce45e3d14f46f31a453da820f2c82cc0f48b9da99b345cda12897539d"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-session.sendToWorker (cyclomatic 17): tmux-session.sendToWorker 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/team/tmux-session.ts"},"region":{"startLine":3852}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f73ff93bab4d6230ddadc2d2467c65eb218a313f6dd0a961a24fae835a285e"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-session.teardownWorkerPanes (cyclomatic 17): tmux-session.teardownWorkerPanes 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/team/tmux-session.ts"},"region":{"startLine":4518}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c7291b9d8ae732e8baefdf59a9ce4d7a144f4f1c3b80086dd37f498374b0ad"}},{"ruleId":"D1","level":"warning","message":{"text":"scaling.recoverCreatedWorktreeAfterEnsureFailure (cyclomatic 17): scaling.recoverCreatedWorktreeAfterEnsureFailure has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: scaling.asScaleDownDebtPanes::validate (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aaaa758610cc870f335cd76cdf52f73325f137fa53e27805c84916fd60bf9f0"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.syncRootTeamModeStateOnTerminalPhase (cyclomatic 17): runtime.syncRootTeamModeStateOnTerminalPhase has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: runtime.isDetachedSessionDestroyReceipt (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eff0d384c68d5dcb6110fb3e96ff1ce8d75ec58aabceaf25fe19e269c3a76e9"}},{"ruleId":"D1","level":"warning","message":{"text":"auth.authCommand (cyclomatic 17): auth.authCommand 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/cli/auth.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2c520fa12186e275cd7f431690f92800d1723b7cb81f95399ec68bca3785c3"}},{"ruleId":"D1","level":"warning","message":{"text":"autopilot.autopilotCommand (cyclomatic 17): autopilot.autopilotCommand 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/cli/autopilot.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d229ad0a36dadfe1be081b057f9e3300822be98cc3e302ab7a5cd2ba0c1d815"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.omxPluginCacheSkillsProvenanceReason (cyclomatic 17): plugin-marketplace.omxPluginCacheSkillsProvenanceReason 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/cli/plugin-marketplace.ts"},"region":{"startLine":2887}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2e704ccd33d281874a36e39fd43e5fea1ec6dbe943d18b2597d8de99c9c90e"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.decideWindowsNativeHookShimReference (cyclomatic 17): setup.decideWindowsNativeHookShimReference 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/cli/setup.ts"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec59a9af318209a28da2659ec8c6970ca07a98bde48b8f82e889b5d9b43ecf6c"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.ensureProjectGitignore (cyclomatic 17): setup.ensureProjectGitignore 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/cli/setup.ts"},"region":{"startLine":3473}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e05bb6e25ef349514be03c803e77465cca1cd54ab3575222cdf752afa69a530"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.syncManagedAgentsContent (cyclomatic 17): setup.syncManagedAgentsContent 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/cli/setup.ts"},"region":{"startLine":5948}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83ab2a9951147d55baf0f5cc1f756bed0d8891adc80b6529c83e53bcd615e42"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.cleanupLegacyManagedSkills (cyclomatic 17): setup.cleanupLegacyManagedSkills 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/cli/setup.ts"},"region":{"startLine":6573}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc22ee7d31bfb6280833b2e7b1367995b20e7b3541f739de756e239eb2270312"}},{"ruleId":"D1","level":"warning","message":{"text":"authority.runHudAuthorityTick (cyclomatic 17): authority.runHudAuthorityTick 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/hud/authority.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"58336e43c2a0a866345d0dfe6525ce7dd0f7c91e12f329794adc460ebf3f190d"}},{"ruleId":"D1","level":"warning","message":{"text":"followup-planner.pickSpecialistRole (cyclomatic 17): followup-planner.pickSpecialistRole 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/team/followup-planner.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6e9fc51cd379b0cd1844a8c76e9e25e4dd5ed9f44e6c378b324535f3000658"}},{"ruleId":"D1","level":"warning","message":{"text":"artifacts.validateArchitectureInvariantGate (cyclomatic 17): artifacts.validateArchitectureInvariantGate 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/ultragoal/artifacts.ts"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"1005b32db62a0c910fa7d16be02117072166ad02136d2ff2dfc434a2b6b83ecf"}},{"ruleId":"D1","level":"warning","message":{"text":"index.ipv6ToBigInt (cyclomatic 17): index.ipv6ToBigInt has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/url-reader/index.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6b08f214bc5bb012ef3877ca8785065224e0382fefcaee8ccff715264c961f"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-detector.collectFencedCodeRanges (cyclomatic 17): keyword-detector.collectFencedCodeRanges 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/hooks/keyword-detector.ts"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ee9f516d523e647feb2e93af133697ad4b8a286ac6ec3a35a91b27ac2dba4f"}},{"ruleId":"D1","level":"warning","message":{"text":"team-tmux-guard.queuePaneInput (cyclomatic 17): team-tmux-guard.queuePaneInput has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/scripts/notify-hook/team-tmux-guard.ts"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16ce7bf905026af3c7ef9b33992c7b4e84bdd3b2daade13f27d0e7912f483b4"}},{"ruleId":"D1","level":"warning","message":{"text":"orchestration-intent.classifyLeaderActionState (cyclomatic 17): orchestration-intent.classifyLeaderActionState has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/orchestration-intent.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7b316d428d8205c41afe8c128b37751308e75765b073837d86d8fd58d2529e"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isNativeSubagentHook (cyclomatic 17): codex-native-hook.isNativeSubagentHook has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca380eb7530f23ae5c9ceb8ea8eec58ccf7bb16cf6bc532ccb3d867ed50cb0f"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.buildPersistedSubagentReopenContext (cyclomatic 17): codex-native-hook.buildPersistedSubagentReopenContext has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de3142bc1ff8e8a596e23f8469f336f90b5a2339d910759d7dfd864f6b6ad9f"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.findWrappedCommandPositionIndex (cyclomatic 17): codex-native-hook.findWrappedCommandPositionIndex has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7788}}}],"partialFingerprints":{"codehealthFindingId/v1":"07290f6ec00f413e1982527b3aa5e0ed65794e6a71924b6bf3a70dbafc3ea893"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.hasUnresolvedShellArithmeticExpansion (cyclomatic 17): codex-native-hook.hasUnresolvedShellArithmeticExpansion has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8815}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12d104a80b1779a34625af2ee436d5c3dfbfa495093d8acb1a4a6f5e93daf5a"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.extractShellHeredocOpeners (cyclomatic 17): codex-native-hook.extractShellHeredocOpeners has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8992}}}],"partialFingerprints":{"codehealthFindingId/v1":"3523efde75ed7f80a225a2fe3d3a9e4fed3a5f10ed43f5549414b08303db0cc5"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isPositivelyClassifiedPerlCommand (cyclomatic 17): codex-native-hook.isPositivelyClassifiedPerlCommand has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11573}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30f21978c9fad3347d3817c4edc2cbef2e55a8d9e08194dd1f100b0f66ae06a"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.classifyConductorExecutableRuntime (cyclomatic 17): codex-native-hook.classifyConductorExecutableRuntime has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13879}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4610442525d4b0dc8bd65e63f9bf9e412b3399fb8fd35ca1b753369f7d1770"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isPositivelyModeledPythonMetadataWriteSource (cyclomatic 17): codex-native-hook.isPositivelyModeledPythonMetadataWriteSource has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14007}}}],"partialFingerprints":{"codehealthFindingId/v1":"667fd7fb5dce9eff6efd5f3ab5fb00335bb8231189c35d4690d9274d6e5d0e9d"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.conductorXargsOptionValueWordCount (cyclomatic 17): codex-native-hook.conductorXargsOptionValueWordCount has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15510}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d11a2e133d63c3459418a8f62b046923843689665b18e27a1ed0b04c45b18c"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.conductorExecutableHasTrustedSystemIdentity (cyclomatic 17): codex-native-hook.conductorExecutableHasTrustedSystemIdentity has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17620}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3878354607f5df1116fe942f746fbf1aaf44966abfdf069e07524b64ceea100"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.conductorPackageCliHasTrustedNodeInterpreter (cyclomatic 17): codex-native-hook.conductorPackageCliHasTrustedNodeInterpreter has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17956}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57070f206b2fa828455ceb0d755dabe53f0e792fd2147eee8d08a326a4803f9"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.applyShellFunctionBindingEffect (cyclomatic 17): codex-native-hook.applyShellFunctionBindingEffect has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18797}}}],"partialFingerprints":{"codehealthFindingId/v1":"37501b91b523895cdbb55830573fac086be4f7478a7e1e01467b5f8f72904f44"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isConductorSafeRsyncMetadataControl (cyclomatic 17): codex-native-hook.isConductorSafeRsyncMetadataControl has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19955}}}],"partialFingerprints":{"codehealthFindingId/v1":"82eea576301d1932303a4d82edc9bcfa4092f7bd200fab836c2611dfecc792d2"}},{"ruleId":"D1","level":"warning","message":{"text":"index.wakeOpenClaw (cyclomatic 17): index.wakeOpenClaw 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/openclaw/index.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2123d30a7db358768fa2ac020397f530a401f45a618d715542550f06447c0ed9"}},{"ruleId":"D1","level":"warning","message":{"text":"index.resolveSetupAgentsMergePolicyArg (cyclomatic 17): index.resolveSetupAgentsMergePolicyArg has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbfee839ef83eedbb400841592fed66dd7b8ffb22fade2b8a878fcfeed13df3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.persistProjectLaunchRuntimeJsonlArtifact (cyclomatic 17): index.persistProjectLaunchRuntimeJsonlArtifact 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/cli/index.ts"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b16ab03641677c8952b63ced5b0bebd58982dd119a818c663df584b37ee4d7"}},{"ruleId":"D1","level":"warning","message":{"text":"index.completePreLaunchSetup (cyclomatic 17): index.completePreLaunchSetup 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/cli/index.ts"},"region":{"startLine":8032}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8188ba46b4d0309c6fcbd07a09f334f6bb52a93998b51fe1a820d9cb87fc3cc"}},{"ruleId":"D1","level":"warning","message":{"text":"index.assertCompatibleNestedSkillOwners (cyclomatic 17): index.assertCompatibleNestedSkillOwners 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/cli/index.ts"},"region":{"startLine":10450}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a84adb740becfa6aaef11ae7cfdf687c2d868fd4a337315644bc1dffcdcc02"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime-state.readHudState (cyclomatic 17): runtime-state.readHudState 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/hooks/extensibility/sdk/runtime-state.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"de52f3c3d580342648b786522949412e3e1411bb7f98655208f6318251261d8f"}},{"ruleId":"D1","level":"warning","message":{"text":"operational-events.buildOperationalContext (cyclomatic 17): operational-events.buildOperationalContext 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/scripts/notify-hook/operational-events.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe009159f01efefd1d5dfc62d4db1c7cd365115395e8a91d6d5f71ba9a10ff92"}},{"ruleId":"D1","level":"warning","message":{"text":"hook-derived-watcher.inferDerivedEvent (cyclomatic 17): hook-derived-watcher.inferDerivedEvent has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd464971ebfcf5e0edb5be8ac3cac21338c0389af56bfee09d8ada747e8893da"}},{"ruleId":"D1","level":"warning","message":{"text":"hook-derived-watcher.processLine (cyclomatic 17): hook-derived-watcher.processLine 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/scripts/hook-derived-watcher.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"bead291e31b94f8bade9f72cc991f027d0724c9ac6ce8774fb4a3ea817aa471d"}},{"ruleId":"D1","level":"warning","message":{"text":"notify-fallback-delivery.compactNotifyFallbackDeliveries (cyclomatic 17): notify-fallback-delivery.compactNotifyFallbackDeliveries has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c5ab6a1e66db06430de1143cf6a6a9518fbd1a5ec2598b5724a804492100c1"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-native-agents.verifyNativeAgents (cyclomatic 17): verify-native-agents.verifyNativeAgents 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/scripts/verify-native-agents.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6b06323d21389aa74df4a36012d12291cb070d653dc51e7480066d64b6c29d"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeEngine::process (cyclomatic 17): RuntimeEngine::process has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime-core/src/engine.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63296be5cb1453b13da735c9c0a6fc4193d949761e43989f62568fe9cfb91b4"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.readJsonStringLiteral (cyclomatic 16): codex-native-hook.readJsonStringLiteral 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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae8c3d11d7e4d9c7dfd4e5ae88a4d537b499f14e0d1e448c53460cf18430386"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.hasPendingSessionRegistration (cyclomatic 16): codex-native-hook.hasPendingSessionRegistration 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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"027762602dde36e71bf8a24fa782136c271fb2be1799866edf7b42b5e3413dae"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.renewPendingSessionPinLease (cyclomatic 16): codex-native-hook.renewPendingSessionPinLease 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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7f51cd194b7ec3b504d852fef148af4473579d033a5e212fcf34e2152b3d68"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.applyCoordinateSafeRemovals (cyclomatic 16): codex-hooks.applyCoordinateSafeRemovals has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ef9f85635419269b0e58d14a67502cd6079bc8e4ac0922f474f1d8c493eae9"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-hooks.hasExecutableForeignHandlerInUnknownEvent (cyclomatic 16): codex-hooks.hasExecutableForeignHandlerInUnknownEvent 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/config/codex-hooks.ts"},"region":{"startLine":2630}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee85a0b6c4820de63a08ebeafd26627adb089f4886869b98e4e819485b2cedd"}},{"ruleId":"D1","level":"warning","message":{"text":"session.classifySessionProcess (cyclomatic 16): session.classifySessionProcess 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/hooks/session.ts"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"01eee3f83e03fb71e4f03b983861e0f802a14767f32af38b794864d428601dd2"}},{"ruleId":"D1","level":"warning","message":{"text":"session.updateDetachedSessionMetadata (cyclomatic 16): session.updateDetachedSessionMetadata has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":3186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5de0b5ceef5a26f573cb99a2605522759961f4f5a478a0c55f1a7a96425a85c"}},{"ruleId":"D1","level":"warning","message":{"text":"dispatch.enqueueDispatchRequest (cyclomatic 16): dispatch.enqueueDispatchRequest has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 274). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/dispatch.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9973c3af47684c7534cf2047211294070f0506dac4d7cf6cdf20953365f7428a"}},{"ruleId":"D1","level":"warning","message":{"text":"state.writeMailbox (cyclomatic 16): state.writeMailbox has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent 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: state.isStrictLegacyDispatchRequestForRollback (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a3cf570ffbc0d8dd941bc974ad585c2933a65d6107644e52bc660d9ce0c1c6"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.projectTrustEqual (cyclomatic 16): generator.projectTrustEqual 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/config/generator.ts"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dc1ebca152672e60197479d286fa507e29b814a273118be89407e9dce9e76c"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.upsertPluginModeRuntimeFeatureFlags (cyclomatic 16): generator.upsertPluginModeRuntimeFeatureFlags 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/config/generator.ts"},"region":{"startLine":3063}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bf04a2e11f4cad638ffd5700986ebd7b70ad97aa2002cc48d834fc7c1c442c"}},{"ruleId":"D1","level":"warning","message":{"text":"exact-pane.parseExactPaneProof (cyclomatic 16): exact-pane.parseExactPaneProof 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/team/exact-pane.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b0f4730936654c7187fd939e1c96e41f4030f4dce25c460d4c5c178ddf4f1a"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-hook-engine.resolveCodexPane (cyclomatic 16): tmux-hook-engine.resolveCodexPane 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/scripts/tmux-hook-engine.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2316022f2b2538963aa5894a46b3513a745ac7115dcabed675ebfed041ba57"}},{"ruleId":"D1","level":"warning","message":{"text":"documented-leader-preflight.neutralizeOwnedRoutingRalplan (cyclomatic 16): documented-leader-preflight.neutralizeOwnedRoutingRalplan 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/ralplan/documented-leader-preflight.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c4068b5e00182b9f5bec513e12bc81ee7e57f69a666581c69b171e1cb3e74c"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-active.syncCanonicalSkillStateForModeUnlocked::applyEntriesToState (cyclomatic 16): skill-active.syncCanonicalSkillStateForModeUnlocked::applyEntriesToState 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: one other method here (skill-active.syncCanonicalSkillStateForModeUnlocked) 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":"src/state/skill-active.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc0004a7c91e26a76dd11f048efbf869933d7eb0416becc2282496932800ce9"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux.unregisterHudResizeHook (cyclomatic 16): tmux.unregisterHudResizeHook has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"167be0c05be4b2af3df07114fd0a2431ebcac5acabb164ce074817c48ce67738"}},{"ruleId":"D1","level":"warning","message":{"text":"render.sliceAnsiVisible (cyclomatic 16): render.sliceAnsiVisible 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/hud/render.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4548ba7df07879d0662fbdb98e8a791f147791d6889adc5bad5805613bde80"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-session.isWorkerAlive (cyclomatic 16): tmux-session.isWorkerAlive 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/team/tmux-session.ts"},"region":{"startLine":4009}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3809c74b29a12ed153bdf282ec8b842b5aa6483e96427e3b02a18978a2712d4"}},{"ruleId":"D1","level":"warning","message":{"text":"ultragoal-context.resolveLeaderOwnedUltragoalContextOutcome (cyclomatic 16): ultragoal-context.resolveLeaderOwnedUltragoalContextOutcome has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/team/ultragoal-context.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75a4ee2ac552f156febb85fcf900874931be1935afe85253505ff65bb360944"}},{"ruleId":"D1","level":"warning","message":{"text":"team-identity.candidateFromDir (cyclomatic 16): team-identity.candidateFromDir 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/team/team-identity.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ce15fcbb85346dfbcfbd759b1e6895407b14e916904c9618218415173c7b26"}},{"ruleId":"D1","level":"warning","message":{"text":"cleanup.cleanupOmxMcpProcesses (cyclomatic 16): cleanup.cleanupOmxMcpProcesses 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/cli/cleanup.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb842b75079822c0af93a3d9952ac2d396a07c3cf33418692746a0310757b58"}},{"ruleId":"D1","level":"warning","message":{"text":"toml.upsertTopLevelTomlString (cyclomatic 16): toml.upsertTopLevelTomlString 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, separate the cases: extract each independent branch into its own 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/utils/toml.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2eea6ad15405f1c7e87b406f3a1aa5b8c0532b27feeae19b4e9cde55368416"}},{"ruleId":"D1","level":"warning","message":{"text":"process-identity.parseProcessOwnerToken (cyclomatic 16): process-identity.parseProcessOwnerToken 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/state/process-identity.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"903bb4201ed84ae4b1298d325a3e65a92ded21a691949e14763dee4bcc739f0c"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.hasManagedSnapshotOwnershipRecord (cyclomatic 16): plugin-marketplace.hasManagedSnapshotOwnershipRecord 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/cli/plugin-marketplace.ts"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"0792fd8c351794b68fcda99fd985060b411493184f5dfe6e4e892e3c9db4a03a"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-marketplace.inspectIncompletePublicationClaim (cyclomatic 16): plugin-marketplace.inspectIncompletePublicationClaim has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2a58392aa46594c6a2f4bee20aa5dc27fd46b75c4dec590a0dfb5113889d80"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.checkExternalCodexProcessGuards (cyclomatic 16): doctor.checkExternalCodexProcessGuards 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/cli/doctor.ts"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"235e97a9ea6a5d1a9cd5d6727f73188e77a804ed1b9027eb67c8546578e76da4"}},{"ruleId":"D1","level":"warning","message":{"text":"artifacts.parseUltragoalSteeringDirective (cyclomatic 16): artifacts.parseUltragoalSteeringDirective has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ultragoal/artifacts.ts"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7308fa0f79ca6dc9692225aead3a95907d9fa9c848eb958c07af5071a37a53c"}},{"ruleId":"D1","level":"warning","message":{"text":"artifacts.applySteeringMutation (cyclomatic 16): artifacts.applySteeringMutation 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/ultragoal/artifacts.ts"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"254202b288978a221a9f987f9634e8193ff6f9d52a838857355020101a18eb6d"}},{"ruleId":"D1","level":"warning","message":{"text":"friction.buildRisks (cyclomatic 16): friction.buildRisks has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/friction.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"833e33ee0cb3fc5d76fc159d818eb58fa79b30e1b22e2c3f424cd47fa04b4b64"}},{"ruleId":"D1","level":"warning","message":{"text":"index.isSafeIpv6 (cyclomatic 16): index.isSafeIpv6 has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/url-reader/index.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a551ba6ca774a503025e58f635af4eef3c70052f457353b483a5d01f19638424"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-detector.isActiveImplicitMatch (cyclomatic 16): keyword-detector.isActiveImplicitMatch 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/hooks/keyword-detector.ts"},"region":{"startLine":3384}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba1a9c99ec7fe2070b4603df10cf021fe54c8aff51fb381cedee675d90296d1"}},{"ruleId":"D1","level":"warning","message":{"text":"team-worker-posttooluse.handleTeamWorkerPostToolUseSuccess (cyclomatic 16): team-worker-posttooluse.handleTeamWorkerPostToolUseSuccess has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-posttooluse.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c3d1d507336de214f1b7ea8d70e64838dc4ded2066e06ca4cf170becafb699"}},{"ruleId":"D1","level":"warning","message":{"text":"hook-payload-guard.readJsonStringLiteral (cyclomatic 16): hook-payload-guard.readJsonStringLiteral 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/scripts/hook-payload-guard.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b73e3a29500514a207e91ba4574d51f4ad94cd91d9621d6b1a685b1c9ddde3"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.resolveSessionOwnerPidFromAncestry (cyclomatic 16): codex-native-hook.resolveSessionOwnerPidFromAncestry has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6da6b95682ce6a903ee3babab3576bf71f0c419e1789a51b5b8d7d2bd15e0d"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.listRawActiveSkillEntries (cyclomatic 16): codex-native-hook.listRawActiveSkillEntries has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":3174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b247b736af28f5ed667840d65191bf052be1ce5fecc9968753be7883c6685f67"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.buildModeBasedStopOutput (cyclomatic 16): codex-native-hook.buildModeBasedStopOutput has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":3204}}}],"partialFingerprints":{"codehealthFindingId/v1":"da883ecd73aa1bb275b98e7ecb0f35b465aa00605e8d025afee0a7b351ca3b22"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.decodeStaticRedirectShellWord (cyclomatic 16): codex-native-hook.decodeStaticRedirectShellWord has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78fa97282cb53f001543c6b6d101518cf9b1c2a0614311009c6998796df6cf8"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.conductorHeredocRedirectHasBoundedProducer (cyclomatic 16): codex-native-hook.conductorHeredocRedirectHasBoundedProducer has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a76219a366b6f0052229b7dbe8248fc27ab5ad94b662cde71e5853ff5698d0"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.findStdbufDispatchOperandIndex (cyclomatic 16): codex-native-hook.findStdbufDispatchOperandIndex has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7587}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ad6fd1b7d1ba18055d02b39e2f88a7cb6465dbc8d9cc97d087f70334989fda"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.extractDispatchBuiltinOperand (cyclomatic 16): codex-native-hook.extractDispatchBuiltinOperand has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8276}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab781856c11662149e16e8a8108b32b4e0795ae682ccb1d1c1dad7fb56f7bc7"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.decodeShellHeredocAnsiEscape (cyclomatic 16): codex-native-hook.decodeShellHeredocAnsiEscape has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8632}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fe0a72a222f6d1d16645aef2783c3d92ed09070f96aeeed6a880d73adac6c5"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.packageManagerInvokesScriptRuntime (cyclomatic 16): codex-native-hook.packageManagerInvokesScriptRuntime has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11600}}}],"partialFingerprints":{"codehealthFindingId/v1":"3845d07267f38addbc9084b096595ff9adebbc8de96e696a32b1a4aba0e95452"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.isPositivelyReadOnlyGitCommand (cyclomatic 16): codex-native-hook.isPositivelyReadOnlyGitCommand has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12134}}}],"partialFingerprints":{"codehealthFindingId/v1":"adba40419d34eea4f53d76322724cf99c0c66b800677cb4a22731092abaa6077"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.commandMayPopulateSensitiveRuntimeEnvironment (cyclomatic 16): codex-native-hook.commandMayPopulateSensitiveRuntimeEnvironment has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12867}}}],"partialFingerprints":{"codehealthFindingId/v1":"062c32e3b0705eb6c6e2051d9e2dac1ed5405be15c61342ddb79950f14773ee9"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.maskPythonStringsAndComments (cyclomatic 16): codex-native-hook.maskPythonStringsAndComments has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13789}}}],"partialFingerprints":{"codehealthFindingId/v1":"679e54bf1b43dbf85d14118620e5f98c5c25d217d893189f7a9911bbc61cae85"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.extractConductorInterpreterWrites (cyclomatic 16): codex-native-hook.extractConductorInterpreterWrites 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 branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13931}}}],"partialFingerprints":{"codehealthFindingId/v1":"72977b9e92ef30c08956b6ef9bcf05b7e89b33182dc00b7df11c06d7f0f8b855"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.conductorMutationUsesUnsafeOption (cyclomatic 16): codex-native-hook.conductorMutationUsesUnsafeOption has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3acba287c5c9ad4bef08d51e3d6c898f648a2fd94d36fedbfbf0114046ed0d"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.commandHasUnsafeConductorOrchestrationPrefixEnvironment (cyclomatic 16): codex-native-hook.commandHasUnsafeConductorOrchestrationPrefixEnvironment 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 one function literal inside it that branches (line 16385). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16380}}}],"partialFingerprints":{"codehealthFindingId/v1":"729dd724bdf2233354119d21760d9b7c5a391261790f39916358786688b9fdad"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.resolveConductorStaticDirectoryChange (cyclomatic 16): codex-native-hook.resolveConductorStaticDirectoryChange has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd2eef9e6dfa63c2736209a63103b14fd8b846175afba16c42c6956b9608b5e"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.conductorTrustedScriptInterpreterIsSafe (cyclomatic 16): codex-native-hook.conductorTrustedScriptInterpreterIsSafe has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17783}}}],"partialFingerprints":{"codehealthFindingId/v1":"c665fb23c7b762d21bad3417639a50c8251d6982d3ac75e93aa6b7d43d637b94"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.stripCommandSubstitutionBodiesForConductorScan (cyclomatic 16): codex-native-hook.stripCommandSubstitutionBodiesForConductorScan has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19401}}}],"partialFingerprints":{"codehealthFindingId/v1":"027458648a739747fa66b5a71502b66f1f9e60860c64b2d20d8a2978cf68d7a0"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-native-hook.unscopedRootRalplanStateIsNewerTerminalPlanningCompletion (cyclomatic 16): codex-native-hook.unscopedRootRalplanStateIsNewerTerminalPlanningCompletion has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: codex-native-hook.conductorShellStateNameIsSensitive (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 173 of the 693 methods over the threshold \u2014 including the worst \u2014 and 3045 of the 11411 points over it (27%), 5.5\u00D7 the next-largest file (src/team/runtime.ts at 552). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":20756}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc80e8cd90e62c96f5ca1b178a845b3ee6631192d8b698b60cdf16deba55739"}},{"ruleId":"D1","level":"warning","message":{"text":"index.materializeProjectLaunchRuntimeHistoryEntries (cyclomatic 16): index.materializeProjectLaunchRuntimeHistoryEntries 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/cli/index.ts"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"4660a12236c2b16f0f440af117704481d4432148be97e55b07820878a8171325"}},{"ruleId":"D1","level":"warning","message":{"text":"index.collectDetachedFailureSegments (cyclomatic 16): index.collectDetachedFailureSegments has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":4640}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ff568fed102693aa48d08eabcd260ee27552b70362ac75c9c6e00dd4e2b910"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt-inventory.buildRepositorySizeInventory (cyclomatic 16): prompt-inventory.buildRepositorySizeInventory has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/scripts/prompt-inventory.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12b9f592308d08938d93da2a394107f4150a89a470be01bebe4ffde8d5d3d0d"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectConductorDownloaderOutputTargets (cognitive 476): codex-native-hook.collectConductorDownloaderOutputTargets has cognitive complexity 476 (threshold 15). Drivers by points: if/else 146 (363 pts), boolean chains 87, ternaries 16 (45 pts), loops 9 (21 pts) (nesting depth added 258). 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 (codex-native-hook.collectConductorDownloaderOutputTargets::finalizeCurlTransfer) 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14853}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcda28a6787826d2044177e1df88f0fdc3ef1712bed1299898f954486db8754"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.dispatchCodexNativeHook (cognitive 441): codex-native-hook.dispatchCodexNativeHook has cognitive complexity 441 (threshold 15). Drivers by points: if/else 102 (221 pts), boolean chains 108, ternaries 35 (82 pts), error handling 8 (27 pts), loops 1 (3 pts) (nesting depth added 187). Of this number, 439 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":21948}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46453096c90ac1214d27e29cd2a2394851bbcdbecfd4434b6f1216b484639c7"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.setup (cognitive 394): setup.setup has cognitive complexity 394 (threshold 15). Drivers by points: if/else 118 (186 pts), ternaries 57 (147 pts), boolean chains 46, loops 8 (12 pts), error handling 2 (3 pts) (nesting depth added 163). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":4449}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f20e94f7ff02b462a7d010100822e4c7433a3241649a601cf20f7d38ff9b1f"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.shutdownTeam (cognitive 385): runtime.shutdownTeam has cognitive complexity 385 (threshold 15). Drivers by points: if/else 84 (198 pts), ternaries 39 (91 pts), boolean chains 62, loops 12 (21 pts), error handling 8 (13 pts) (nesting depth added 180). Of this number, 284 points are the body\u0027s own statements and 101 belong to 18 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":"src/team/runtime.ts"},"region":{"startLine":5068}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa29908260a21eceb3d7a4865cb5e9e688ad730b10c65e85d23d7c98e05e953"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.inspectConductorRuntimeExecutions (cognitive 337): codex-native-hook.inspectConductorRuntimeExecutions has cognitive complexity 337 (threshold 15). Drivers by points: if/else 78 (239 pts), boolean chains 50, loops 11 (32 pts), ternaries 4 (16 pts) (nesting depth added 194). Of this number, 324 points are the body\u0027s own statements and 13 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13056}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb107701ffd7c7a94b18c283fe68b6dc1cd2399ce74fee78b3e903fb9680bd6b"}},{"ruleId":"D2","level":"warning","message":{"text":"api-interop.executeTeamApiOperation (cognitive 304): api-interop.executeTeamApiOperation has cognitive complexity 304 (threshold 15). Drivers by points: boolean chains 124, if/else 58 (118 pts), ternaries 30 (57 pts), error handling 2 (4 pts), match/switch 1 (nesting depth added 89). Of this number, 300 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/api-interop.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a3d4231d1623298fe9197ddd105117589499a36835c028337c5fd84947f6fc"}},{"ruleId":"D2","level":"warning","message":{"text":"notify-hook.main (cognitive 303): notify-hook.main has cognitive complexity 303 (threshold 15). Drivers by points: if/else 68 (152 pts), boolean chains 77, error handling 19 (39 pts), ternaries 14 (30 pts), loops 2 (5 pts) (nesting depth added 123). Of this number, 298 points are the body\u0027s own statements and 5 belong to 2 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":"src/scripts/notify-hook.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8de0840fa4d4b5b2f6a02f243860f49ba53c8af9e9f124e8d6460794829cde"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.startTeam (cognitive 282): runtime.startTeam has cognitive complexity 282 (threshold 15). Drivers by points: if/else 88 (206 pts), ternaries 32 (59 pts), boolean chains 34, error handling 9 (30 pts), loops 14 (27 pts) (nesting depth added 179). 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 (runtime.startTeam::runWorkerStartupAttempt) 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":"src/team/runtime.ts"},"region":{"startLine":3562}}}],"partialFingerprints":{"codehealthFindingId/v1":"991c8726bab79475fd2489a5f805a5751bff00a67fa2051e4be6f237a74d59e3"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.scanConductorShellSegment (cognitive 277): codex-native-hook.scanConductorShellSegment has cognitive complexity 277 (threshold 15). Drivers by points: if/else 56 (143 pts), boolean chains 64, ternaries 21 (50 pts), loops 6 (20 pts) (nesting depth added 130). Of this number, 273 points are the body\u0027s own statements and 4 belong to 2 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18826}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e493e0b92f5a90f710cf3d851ae0dcecb9103681897776dbcdef95c76c32ed9"}},{"ruleId":"D2","level":"warning","message":{"text":"scaling.scaleUp (cognitive 257): scaling.scaleUp has cognitive complexity 257 (threshold 15). Drivers by points: if/else 63 (124 pts), ternaries 39 (71 pts), boolean chains 33, error handling 13 (19 pts), loops 10 (nesting depth added 99). Most of this is not in the body itself: 3 of the 257 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 602, 784, 908, \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":"src/team/scaling.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebd6df82e8cf604f58e2fc0605188355ccc9c225c19b5a968284333856448e3"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.applyShellPosixStateEffect (cognitive 236): codex-native-hook.applyShellPosixStateEffect has cognitive complexity 236 (threshold 15). Drivers by points: if/else 71 (163 pts), boolean chains 36, loops 11 (21 pts), ternaries 7 (16 pts) (nesting depth added 111). Of this number, 231 points are the body\u0027s own statements and 5 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18083}}}],"partialFingerprints":{"codehealthFindingId/v1":"286e9c3b26e3ce1b9f9b323a83e5e89147ec25ad9744e9b387189c3477181e9d"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-session.createTeamSession (cognitive 232): tmux-session.createTeamSession has cognitive complexity 232 (threshold 15). Drivers by points: if/else 68 (142 pts), ternaries 13 (30 pts), boolean chains 27, loops 9 (23 pts), error handling 5 (10 pts) (nesting depth added 110). Of this number, 210 points are the body\u0027s own statements and 22 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":"src/team/tmux-session.ts"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c2cf55a726d4742d8be5264f6a7c28ef17a0e7f37b1c2c4d931d527a6e717b"}},{"ruleId":"D2","level":"warning","message":{"text":"timeline.buildSessionTimeline (cognitive 230): timeline.buildSessionTimeline has cognitive complexity 230 (threshold 15). Drivers by points: if/else 54 (144 pts), ternaries 11 (46 pts), boolean chains 39, loops 1 (nesting depth added 125). Of this number, 211 points are the body\u0027s own statements and 19 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/timeline.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e304703b1754f75543c4a71d6863daec48a930de578aab48e5f4871f810d6c9e"}},{"ruleId":"D2","level":"warning","message":{"text":"team-leader-nudge.maybeNudgeTeamLeader (cognitive 230): team-leader-nudge.maybeNudgeTeamLeader has cognitive complexity 230 (threshold 15). Drivers by points: if/else 58 (121 pts), boolean chains 65, ternaries 28 (60 pts), error handling 11 (25 pts), loops 3 (nesting depth added 109). To reduce it, split the body into named stages: move each independent 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 (team-leader-nudge.maybeNudgeTeamLeader::persistLeaderNudgeBookkeeping) 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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"066b0032d4b3e13b3ed112381922f5edb33e458d83097becda693e9f0ad0a7a4"}},{"ruleId":"D2","level":"warning","message":{"text":"smoke-packed-install.smokeInstalledNativeHookDist (cognitive 215): smoke-packed-install.smokeInstalledNativeHookDist has cognitive complexity 215 (threshold 15). Drivers by points: loops 87 (111 pts), if/else 65 (98 pts), boolean chains 27, ternaries 6 (10 pts) (nesting depth added 61). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (smoke-packed-install.smokeInstalledNativeHookDist::runPackedTransportRegressions) 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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"647b64539102830ccd83e291e927c856f3dc0abfb44cf3c15bbf1af9a4ca2c12"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.extractNodeFsSemanticMutations (cognitive 194): codex-native-hook.extractNodeFsSemanticMutations has cognitive complexity 194 (threshold 15). Drivers by points: if/else 48 (120 pts), loops 18 (38 pts), boolean chains 25, ternaries 4 (11 pts) (nesting depth added 99). Of this number, 156 points are the body\u0027s own statements and 38 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13472}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1323c25193715dfd0601b95b7ec29744e56d0fc7172073991eb2ee55c72148a"}},{"ruleId":"D2","level":"warning","message":{"text":"operations.executeStateOperation (cognitive 178): operations.executeStateOperation has cognitive complexity 178 (threshold 15). Drivers by points: if/else 42 (103 pts), ternaries 15 (41 pts), boolean chains 22, error handling 4 (8 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 93). Of this number, 19 points are the body\u0027s own statements and 159 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":"src/state/operations.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad3845c46baa5ad01ac9f89adce7aa783c98515ae61ab79d39ce51e22f263c6"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.commandHasUnsafeDynamicLoaderEnvironment (cognitive 177): codex-native-hook.commandHasUnsafeDynamicLoaderEnvironment has cognitive complexity 177 (threshold 15). Drivers by points: if/else 46 (129 pts), loops 12 (28 pts), boolean chains 19, ternaries 1 (nesting depth added 99). Of this number, 171 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11828}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8317907e9ab0a300903b9ad32e7f39e3392d2033bd474119dde7e7ab8d14f3b"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.materializePackagedOmxPluginCacheImpl (cognitive 176): plugin-marketplace.materializePackagedOmxPluginCacheImpl has cognitive complexity 176 (threshold 15). Drivers by points: if/else 47 (98 pts), error handling 14 (35 pts), ternaries 12 (30 pts), boolean chains 13 (nesting depth added 90). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3876}}}],"partialFingerprints":{"codehealthFindingId/v1":"accdd417b86dc6a3997d7ca3876aaeab310edcbd00089db97629292f01ef055c"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.collectTeamDoctorIssues (cognitive 170): doctor.collectTeamDoctorIssues has cognitive complexity 170 (threshold 15). Drivers by points: if/else 32 (86 pts), ternaries 8 (33 pts), error handling 6 (20 pts), loops 7 (16 pts), boolean chains 15 (nesting depth added 102). 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/cli/doctor.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"773130c2adff42c82af0b1fa24e4fdc12ab426d28ed38ccea346e094edeb66d5"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.removeChildIfIdentity (cognitive 164): plugin-marketplace.removeChildIfIdentity has cognitive complexity 164 (threshold 15). Drivers by points: if/else 33 (87 pts), ternaries 11 (35 pts), boolean chains 22, error handling 8 (20 pts) (nesting depth added 90). Of this number, 105 points are the body\u0027s own statements and 59 belong to 7 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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b863e4cf99011ec619c712fa43de405fb89f46f3aa66cbc1e05377cca348cdf7"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.recordSkillActivation (cognitive 163): keyword-detector.recordSkillActivation has cognitive complexity 163 (threshold 15). Drivers by points: ternaries 35 (62 pts), boolean chains 51, if/else 19 (33 pts), error handling 6 (13 pts), loops 2 (4 pts) (nesting depth added 50). Of this number, 154 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":"src/hooks/keyword-detector.ts"},"region":{"startLine":3883}}}],"partialFingerprints":{"codehealthFindingId/v1":"454894672fd70b9ff7459c4b63c0c89a7a888b34effdfc19695c268a8cf23801"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.commandHasUnsafeConductorShellState (cognitive 148): codex-native-hook.commandHasUnsafeConductorShellState has cognitive complexity 148 (threshold 15). Drivers by points: if/else 37 (114 pts), boolean chains 17, loops 6 (17 pts) (nesting depth added 88). Of this number, 147 points are the body\u0027s own statements and 1 belongs 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11668}}}],"partialFingerprints":{"codehealthFindingId/v1":"de92c4d6a08cb5e0eed0f9c22ef04faff0ba59fe4d1db4eb449f70d89351ebba"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectConductorMutationCommandTargets (cognitive 148): codex-native-hook.collectConductorMutationCommandTargets has cognitive complexity 148 (threshold 15). Drivers by points: if/else 49 (111 pts), boolean chains 25, ternaries 5 (11 pts), loops 1 (nesting depth added 68). 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15724}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21829bcf0e0a410ffeb6eb7e0f7bdfe681e011579b7376eafb8438eb1b48c46"}},{"ruleId":"D2","level":"warning","message":{"text":"team.teamCommand (cognitive 135): team.teamCommand has cognitive complexity 135 (threshold 15). Drivers by points: if/else 37 (73 pts), ternaries 19 (45 pts), boolean chains 13, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 64). Of this number, 123 points are the body\u0027s own statements and 12 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"41729671b11e0705678f15d1bea127463397022552464c10fc5f7afc3d43480e"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.formatStateRootSessionBindingDiagnostic (cognitive 123): doctor.formatStateRootSessionBindingDiagnostic has cognitive complexity 123 (threshold 15). Drivers by points: ternaries 49 (104 pts), boolean chains 12, if/else 6 (7 pts) (nesting depth added 56). Of this number, 118 points are the body\u0027s own statements and 5 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":"src/cli/doctor.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd45a97118466b7abc09184cb1e8bbbf9c73237485387a6fc5699e525afb957"}},{"ruleId":"D2","level":"warning","message":{"text":"artifacts.checkpointUltragoal (cognitive 122): artifacts.checkpointUltragoal has cognitive complexity 122 (threshold 15). Drivers by points: if/else 34 (63 pts), ternaries 17 (38 pts), boolean chains 21 (nesting depth added 50). None of this is in the body itself: all 122 points belong to one function literal inside it that branches (line 1797). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ultragoal/artifacts.ts"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6908fc5d1ffd76573fb69534618f28b12428158b264236d3bf2034b747fba2"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectConductorStaticReadOnlyDownloadUrls (cognitive 117): codex-native-hook.collectConductorStaticReadOnlyDownloadUrls has cognitive complexity 117 (threshold 15). Drivers by points: if/else 28 (87 pts), boolean chains 17, ternaries 3 (9 pts), loops 2 (4 pts) (nesting depth added 67). 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14629}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb6cb7ea58524636718fd00144c16771dc153821ff28cc5d5a8ef3442d32fca"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 113): main has cognitive complexity 113 (threshold 15). Drivers by points: if/else 49 (72 pts), boolean chains 22, other 8, error handling 3 (5 pts), ternaries 5, loops 1 (nesting depth added 25). Of this number, 53 points are the body\u0027s own statements and 60 belong to 10 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfeeef8217e5fb60583aa1df54dd00784d784a754e5b0d083e60ea2c63295113"}},{"ruleId":"D2","level":"warning","message":{"text":"state.retireTeamMailboxMessages (cognitive 112): state.retireTeamMailboxMessages has cognitive complexity 112 (threshold 15). Drivers by points: if/else 23 (70 pts), boolean chains 16, loops 6 (13 pts), ternaries 3 (9 pts), error handling 2 (4 pts) (nesting depth added 62). Of this number, 28 points are the body\u0027s own statements and 84 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":"src/team/state.ts"},"region":{"startLine":2547}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd98533ebaafc41eef4c8658ade4ee8987365d75420f0ebb449190702833666"}},{"ruleId":"D2","level":"warning","message":{"text":"ralplan.ralplanCommand (cognitive 109): ralplan.ralplanCommand has cognitive complexity 109 (threshold 15). Drivers by points: if/else 24 (44 pts), ternaries 16 (41 pts), boolean chains 24 (nesting depth added 45). Of this number, 102 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/ralplan.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"991a1f89934e726591669de6363d6bd56601f4316e7fba2530c091110f66fdea"}},{"ruleId":"D2","level":"warning","message":{"text":"index.cleanupPostLaunchModeStateFiles (cognitive 109): index.cleanupPostLaunchModeStateFiles has cognitive complexity 109 (threshold 15). Drivers by points: if/else 16 (48 pts), ternaries 10 (41 pts), error handling 3 (10 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 71). Of this number, 107 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":"src/cli/index.ts"},"region":{"startLine":7776}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ec5747f15a96c70c4fd1e1c052e8d86da46e41c5702720097ac7f23beda170"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.firstInterpreterScriptOperands (cognitive 106): codex-native-hook.firstInterpreterScriptOperands has cognitive complexity 106 (threshold 15). Drivers by points: if/else 31 (87 pts), boolean chains 18, loops 1 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6378}}}],"partialFingerprints":{"codehealthFindingId/v1":"4289012b3dcb05d89a7b38c09c4612dfe8ed4b8bacec4f89e6e29ac8f461dd32"}},{"ruleId":"D2","level":"warning","message":{"text":"ultragoal.ultragoalCommand (cognitive 104): ultragoal.ultragoalCommand has cognitive complexity 104 (threshold 15). Drivers by points: if/else 44 (76 pts), ternaries 6 (15 pts), boolean chains 12, error handling 1 (nesting depth added 41). Of this number, 103 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/cli/ultragoal.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"745f66f930dcad8e46114678f06e2fed2b58e2adfccd28aae9183be067577555"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.sourcesFileWrittenEarlierInSameCommand::scanCommand (cognitive 102): codex-native-hook.sourcesFileWrittenEarlierInSameCommand::scanCommand has cognitive complexity 102 (threshold 15). Drivers by points: if/else 14 (54 pts), loops 9 (23 pts), ternaries 5 (17 pts), boolean chains 8 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6537}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d11271b8b0b1d59e160bd12710b43f297ac42a455fc86c1e40721cb0fd48eb"}},{"ruleId":"D2","level":"warning","message":{"text":"notify-fallback-delivery.deliverNotifyFallback (cognitive 101): notify-fallback-delivery.deliverNotifyFallback has cognitive complexity 101 (threshold 15). Drivers by points: if/else 37 (51 pts), ternaries 8 (31 pts), boolean chains 18, error handling 1 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55dc4dd64e508bcf926350981de7ad8e5e023f4d604ad6724b25d2ce77f5222"}},{"ruleId":"D2","level":"warning","message":{"text":"reconcile.reconcileHudForPromptSubmit (cognitive 100): reconcile.reconcileHudForPromptSubmit has cognitive complexity 100 (threshold 15). Drivers by points: if/else 36 (45 pts), ternaries 17 (26 pts), boolean chains 24, loops 3 (5 pts) (nesting depth added 20). Of this number, 82 points are the body\u0027s own statements and 18 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/reconcile.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"6addf3399f22178c71fabb6c1e93e25df3b383ed4606ccb01d1f67b7aefcc365"}},{"ruleId":"D2","level":"warning","message":{"text":"team-dispatch.injectDispatchRequest (cognitive 99): team-dispatch.injectDispatchRequest has cognitive complexity 99 (threshold 15). Drivers by points: if/else 23 (49 pts), boolean chains 38, error handling 3 (7 pts), ternaries 3 (4 pts), loops 1 (nesting depth added 31). Of this number, 96 points are the body\u0027s own statements and 3 belong to 2 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":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adf9e582a2ebee92eaeac057008af9a91d63316e280eeff32e681f126be6264"}},{"ruleId":"D2","level":"warning","message":{"text":"model-contract.parseTeamWorkerLaunchArgs (cognitive 97): model-contract.parseTeamWorkerLaunchArgs has cognitive complexity 97 (threshold 15). Drivers by points: if/else 24 (68 pts), ternaries 7 (20 pts), boolean chains 8, loops 1 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/model-contract.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0941ea51e93f419f8735e679caf0ba802b9073456d2e3185a754a02cd6355a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.teamWorkerMutationTargetsProtectedWorkflowState (cognitive 96): codex-native-hook.teamWorkerMutationTargetsProtectedWorkflowState has cognitive complexity 96 (threshold 15). Drivers by points: if/else 22 (64 pts), boolean chains 12, ternaries 3 (11 pts), loops 2 (5 pts), error handling 1 (4 pts) (nesting depth added 56). Of this number, 94 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10697}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc8aa2a036ff506350a27f7a6a0ac60ac84327395fdc0aff61ae4ff0f006a1e"}},{"ruleId":"D2","level":"warning","message":{"text":"code-intel-server.handleCodeIntelToolCall (cognitive 93): code-intel-server.handleCodeIntelToolCall has cognitive complexity 93 (threshold 15). Drivers by points: if/else 22 (51 pts), loops 8 (16 pts), boolean chains 15, error handling 3 (6 pts), ternaries 2 (4 pts), match/switch 1 (nesting depth added 42). Of this number, 88 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/code-intel-server.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef6f940e799e66b82fe5fdba2abd1d036aa31e39d76bd32f4eb0f6ee4c8db20"}},{"ruleId":"D2","level":"warning","message":{"text":"memory-server.handleMemoryToolCall (cognitive 91): memory-server.handleMemoryToolCall has cognitive complexity 91 (threshold 15). Drivers by points: if/else 25 (54 pts), error handling 8 (18 pts), ternaries 4 (8 pts), boolean chains 5, loops 2 (5 pts), match/switch 1 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/memory-server.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa3fc26208673f88c99d6c5eee20894f24ab0ab48b251e59eac5167afb9ed17"}},{"ruleId":"D2","level":"warning","message":{"text":"index.runWatchMode::renderTick (cognitive 91): index.runWatchMode::renderTick has cognitive complexity 91 (threshold 15). Drivers by points: if/else 31 (51 pts), boolean chains 24, ternaries 9 (13 pts), error handling 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/index.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4b8bf2f555772010a3c1487b3d28154524431a754302768c549ea463075c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.maskJavaScriptStringsAndComments (cognitive 91): codex-native-hook.maskJavaScriptStringsAndComments has cognitive complexity 91 (threshold 15). Drivers by points: if/else 34 (71 pts), boolean chains 15, loops 2 (5 pts) (nesting depth added 40). Of this number, 89 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11278}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd3bb1b2a1d892f049f59761cad4bfa18082eff62d8cc463cce30a7e52ce6c3"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.uninstall (cognitive 90): uninstall.uninstall has cognitive complexity 90 (threshold 15). Drivers by points: ternaries 22 (42 pts), if/else 23 (35 pts), loops 4 (8 pts), boolean chains 5 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.ts"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff68752cb925ba4bc124a92bcadd35a5174fc2cd9685398f65b66423c947ce1b"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.buildStopHookOutput (cognitive 90): codex-native-hook.buildStopHookOutput has cognitive complexity 90 (threshold 15). Drivers by points: if/else 36 (72 pts), error handling 2 (6 pts), boolean chains 5, ternaries 3 (5 pts), loops 1 (2 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":21527}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbc20b170fec0ec0926c707feb48de34eccff4e80e8fce70b4b738760c80c1f"}},{"ruleId":"D2","level":"warning","message":{"text":"omx_sparkshell::parse_input (cognitive 89): omx_sparkshell::parse_input has cognitive complexity 89 (threshold 15). Drivers by points: if/else 38 (84 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-sparkshell/src/main.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4a035f718f6cf71fc4f1707532b653670d97a3965bc3c0842f44a5be1dc509"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.monitorTeam (cognitive 88): runtime.monitorTeam has cognitive complexity 88 (threshold 15). Drivers by points: if/else 21 (36 pts), ternaries 13 (20 pts), boolean chains 14, loops 9 (13 pts), error handling 2 (5 pts) (nesting depth added 29). Of this number, 86 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":4609}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8cb0878fc7292c66d803c9f6a5bc50398018d062dc7f5c587e1adfc36b4c46"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.installSkills (cognitive 88): setup.installSkills has cognitive complexity 88 (threshold 15). Drivers by points: if/else 21 (49 pts), ternaries 5 (19 pts), boolean chains 11, loops 6 (9 pts) (nesting depth added 45). Of this number, 87 points are the body\u0027s own statements and 1 belongs 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":"src/cli/setup.ts"},"region":{"startLine":6363}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f23624fc01eaa4020c99ca1755f038cdbc0535a216e130c4d5e72a4ecdc8d9e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.runDetachedSessionLeader (cognitive 88): index.runDetachedSessionLeader has cognitive complexity 88 (threshold 15). Drivers by points: if/else 30 (52 pts), error handling 6 (11 pts), ternaries 7 (11 pts), boolean chains 9, loops 3 (5 pts) (nesting depth added 33). Of this number, 67 points are the body\u0027s own statements and 21 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":8999}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e57bb64dd6753dbdef3cbc08911c0789ae3e0768a53a51214a7ea55dce8657"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.unwrapOmxStateTransportCommandOnce (cognitive 86): codex-native-hook.unwrapOmxStateTransportCommandOnce has cognitive complexity 86 (threshold 15). Drivers by points: if/else 31 (57 pts), boolean chains 14, ternaries 3 (10 pts), loops 3 (5 pts) (nesting depth added 35). Of this number, 78 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7054}}}],"partialFingerprints":{"codehealthFindingId/v1":"015cd19ae041005d089278271f4d661c0a71f4b6a00a45bcc7e06647fcb1a2f2"}},{"ruleId":"D2","level":"warning","message":{"text":"index.cancelModes (cognitive 85): index.cancelModes has cognitive complexity 85 (threshold 15). Drivers by points: if/else 81 (210 pts), ternaries 25 (68 pts), boolean chains 52, loops 12 (28 pts), error handling 7 (20 pts) (nesting depth added 201). 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 (index.cancelModes::loadStates) 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":"src/cli/index.ts"},"region":{"startLine":10503}}}],"partialFingerprints":{"codehealthFindingId/v1":"3672b40853ee56b6bcf88d43f7f0bf64f4228dfb3ba931fcb9a80138e2fddd1d"}},{"ruleId":"D2","level":"warning","message":{"text":"scaling.scaleDown (cognitive 83): scaling.scaleDown has cognitive complexity 83 (threshold 15). Drivers by points: if/else 30 (44 pts), boolean chains 18, loops 8 (11 pts), ternaries 5 (6 pts), error handling 3 (4 pts) (nesting depth added 19). None of this is in the body itself: all 83 points belong to 13 function literals inside it that branch (lines 1940, 2087, 2017, \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":"src/team/scaling.ts"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"f992edb63bb14769e1b211de5aaa8d63e052b1442f45cb1e8cdbb4c9ddbb9cf3"}},{"ruleId":"D2","level":"warning","message":{"text":"pane-status.readTeamPaneStatus (cognitive 83): pane-status.readTeamPaneStatus has cognitive complexity 83 (threshold 15). Drivers by points: ternaries 61 (73 pts), boolean chains 7, if/else 2, loops 1 (nesting depth added 12). Of this number, 33 points are the body\u0027s own statements and 50 belong to 46 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":"src/team/pane-status.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e88832b8157abbced7797020f09a95a856c4680e3184e80ddc455711574182b"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.runRalplanConsensus (cognitive 83): runtime.runRalplanConsensus has cognitive complexity 83 (threshold 15). Drivers by points: if/else 19 (50 pts), ternaries 7 (18 pts), boolean chains 6, error handling 2 (5 pts), loops 2 (4 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":"src/ralplan/runtime.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"534ab9e56ba8e31c861d0b32ed8239abc4f76f9566c77c7731a0933b706a42dd"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.tokenizeShellWords (cognitive 83): codex-native-hook.tokenizeShellWords has cognitive complexity 83 (threshold 15). Drivers by points: if/else 28 (53 pts), boolean chains 24, ternaries 2 (5 pts), loops 1 (nesting depth added 28). Of this number, 79 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6802}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0054dbeb9f70eb0079c1e89c7b1ee439ee5551ee19d942f4064385e951b5085"}},{"ruleId":"D2","level":"warning","message":{"text":"team-dispatch.drainPendingTeamDispatch (cognitive 83): team-dispatch.drainPendingTeamDispatch has cognitive complexity 83 (threshold 15). Drivers by points: if/else 21 (58 pts), boolean chains 16, loops 4 (7 pts), ternaries 1 (2 pts) (nesting depth added 41). Most of this is not in the body itself: 14 of the 83 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1191, 1204). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9502b6b660ec70cf0d5e54f2d9fef9c8f90d2dbf65803d9466d5c31e122a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.applyConductorTrackedVariableWriter (cognitive 81): codex-native-hook.applyConductorTrackedVariableWriter has cognitive complexity 81 (threshold 15). Drivers by points: if/else 25 (61 pts), boolean chains 8, loops 3 (7 pts), ternaries 2 (5 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9e8fc62c00baf772527e5f4c6385437be773fb0e1eec4ee66ccd4fb09e1949"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.recordSubagentTurn (cognitive 80): tracker.recordSubagentTurn has cognitive complexity 80 (threshold 15). Drivers by points: ternaries 44 (63 pts), boolean chains 14, if/else 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9324fb0f3b6c8c2b3e84c8943d0b284a4ab709ce28389962ffc891a79bb2fbc"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.parseStrictSubagentTrackingState (cognitive 79): tracker.parseStrictSubagentTrackingState has cognitive complexity 79 (threshold 15). Drivers by points: if/else 19 (49 pts), boolean chains 23, loops 3 (6 pts), error handling 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9390796a7aa35162a782ff01075389722debcf72c5898456f4ca4e2fb979ed"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.readOmxPluginCacheFileNoFollow (cognitive 79): plugin-marketplace.readOmxPluginCacheFileNoFollow has cognitive complexity 79 (threshold 15). Drivers by points: if/else 30 (42 pts), boolean chains 23, ternaries 6 (9 pts), loops 3 (4 pts), error handling 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/cli/plugin-marketplace.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff782159e917053af2f5d3faf85a44bb8fc5146492ff0821ddad92e961b194f6"}},{"ruleId":"D2","level":"warning","message":{"text":"team-tmux-guard.evaluatePaneInjectionReadiness (cognitive 79): team-tmux-guard.evaluatePaneInjectionReadiness has cognitive complexity 79 (threshold 15). Drivers by points: if/else 33 (53 pts), boolean chains 16, ternaries 7 (9 pts), error handling 1 (nesting depth added 22). Of this number, 70 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-tmux-guard.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01df83262181c320e51f515991dc6befb53fa22e4c5c3882e77440e62464510"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.resolveWrappedCommandExecutionContext (cognitive 78): codex-native-hook.resolveWrappedCommandExecutionContext has cognitive complexity 78 (threshold 15). Drivers by points: ternaries 10 (65 pts), if/else 5 (11 pts), boolean chains 1, loops 1 (nesting depth added 61). 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5871}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d2d5a781a00c681bd17e63cc3cc15ae6da2e2c0dd5ac982e85a5f248af5386"}},{"ruleId":"D2","level":"warning","message":{"text":"session.recoverDeadSessionPointer (cognitive 77): session.recoverDeadSessionPointer has cognitive complexity 77 (threshold 15). Drivers by points: ternaries 13 (35 pts), if/else 18 (23 pts), boolean chains 11, error handling 7 (8 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/hooks/session.ts"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bad6e6fe914a7fd07c0a907fb04ae24d51e391b7f1c40b2fb3dd156f2d0b2b2"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.integrateWorkerCommitsIntoLeader (cognitive 77): runtime.integrateWorkerCommitsIntoLeader has cognitive complexity 77 (threshold 15). Drivers by points: if/else 23 (52 pts), boolean chains 15, loops 4 (7 pts), ternaries 1 (3 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bb2835ea66253b7ea5e679659e9f5b1b2f73c52e3fa1cf9358489af73532ea"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.persistStatefulSkillSeedState (cognitive 76): keyword-detector.persistStatefulSkillSeedState has cognitive complexity 76 (threshold 15). Drivers by points: boolean chains 28, ternaries 16 (25 pts), if/else 15 (23 pts) (nesting depth added 17). Of this number, 66 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aac0cbf0fc27f8b506841f578a9e690a5c9aa38fe376002d0d5453a136a4fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.wgetInvocationHasUnsafeFiniteTransferMode (cognitive 75): codex-native-hook.wgetInvocationHasUnsafeFiniteTransferMode has cognitive complexity 75 (threshold 15). Drivers by points: if/else 19 (58 pts), ternaries 3 (11 pts), boolean chains 3, loops 2 (3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14390}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13639a44d4fad7aaa6dd00bd988f8fff3faedce0ab40cd92729e6bfae1ad1bf"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.hasSafeConductorOrchestrationRuntimeEnvironment (cognitive 75): codex-native-hook.hasSafeConductorOrchestrationRuntimeEnvironment has cognitive complexity 75 (threshold 15). Drivers by points: if/else 17 (41 pts), ternaries 4 (14 pts), loops 6 (11 pts), boolean chains 8, error handling 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16285}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecfcdb4de61611868c9ddc786a2173014caf1a395a7e3aab6e223f7c32f0a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.scanConductorShellSource (cognitive 75): codex-native-hook.scanConductorShellSource has cognitive complexity 75 (threshold 15). Drivers by points: if/else 18 (35 pts), loops 7 (16 pts), ternaries 5 (15 pts), boolean chains 9 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19624}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da1e2de0183ecb79e3f6b5828589bd3b3e36a974f4cd9b385b633c30fbd44d0"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.rsyncInvocationHasUnsafeRuntimeEnvironment (cognitive 75): codex-native-hook.rsyncInvocationHasUnsafeRuntimeEnvironment has cognitive complexity 75 (threshold 15). Drivers by points: if/else 14 (33 pts), ternaries 4 (17 pts), loops 7 (14 pts), boolean chains 11 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19799}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce2f12f42c7d43ac019a953eb1dc6b9a5244bffe7bd88f7e21b0e6d59f4aae7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.mergeProjectLaunchRuntimeHistoryEntries (cognitive 75): index.mergeProjectLaunchRuntimeHistoryEntries has cognitive complexity 75 (threshold 15). Drivers by points: if/else 19 (51 pts), error handling 5 (15 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 44). Of this number, 70 points are the body\u0027s own statements and 5 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":"src/cli/index.ts"},"region":{"startLine":1936}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9106869b1b36d48bd37ed90e6162501eefd5a695e40aef9ffaa79b5358110f8"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findWrappedCommandPositionIndex (cognitive 74): codex-native-hook.findWrappedCommandPositionIndex has cognitive complexity 74 (threshold 15). Drivers by points: ternaries 10 (65 pts), if/else 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 58). 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7788}}}],"partialFingerprints":{"codehealthFindingId/v1":"6173346541b62369b352479c8e75516ba3a5e04be5d46fde473d6f9e15f2e20e"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.commandExecutesUninspectedScript (cognitive 73): codex-native-hook.commandExecutesUninspectedScript has cognitive complexity 73 (threshold 15). Drivers by points: if/else 20 (59 pts), boolean chains 8, loops 3 (6 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5447}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d8da6e8d62501a7a3efe62068bfe6fb6c57d41ba2bc2de5f2b6eae1591baff"}},{"ruleId":"D2","level":"warning","message":{"text":"index.executeDetachedLaunchStateMachine (cognitive 73): index.executeDetachedLaunchStateMachine has cognitive complexity 73 (threshold 15). Drivers by points: ternaries 9 (45 pts), if/else 8 (14 pts), error handling 6 (12 pts), boolean chains 2 (nesting depth added 48). 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/cli/index.ts"},"region":{"startLine":4857}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf89ae2993fad86a5cacae45d814f9df215fd4a47502d6ad9d99195ccc45985f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.runCodex (cognitive 72): index.runCodex has cognitive complexity 72 (threshold 15). Drivers by points: if/else 51 (125 pts), ternaries 23 (35 pts), error handling 8 (21 pts), boolean chains 20, loops 7 (16 pts) (nesting depth added 108). 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 (index.runCodex::launchDetachedSession::bootstrapLeader) 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":"src/cli/index.ts"},"region":{"startLine":8119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1250efa5b158729ccbced3908398d9c5b2c259e02237906b6573516c0fc685"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.validateCodexHooksDocument (cognitive 70): codex-hooks.validateCodexHooksDocument has cognitive complexity 70 (threshold 15). Drivers by points: if/else 20 (50 pts), boolean chains 8, loops 3 (6 pts), ternaries 3 (6 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb80a1156a35127bb10c01987f2d18889faf4e0e1babac9027eb81c4606c346c"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.reconcileProjectTrustPayload (cognitive 70): generator.reconcileProjectTrustPayload has cognitive complexity 70 (threshold 15). Drivers by points: if/else 22 (43 pts), boolean chains 13, loops 7 (11 pts), ternaries 3 (nesting depth added 25). Of this number, 66 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"113671728c36e5e61e096337c822d277757a5383908d4c68e7fdadf3bde905dc"}},{"ruleId":"D2","level":"warning","message":{"text":"team-worker.maybeNotifyLeaderWorkerIdle (cognitive 70): team-worker.maybeNotifyLeaderWorkerIdle has cognitive complexity 70 (threshold 15). Drivers by points: if/else 27 (34 pts), boolean chains 19, error handling 9 (12 pts), ternaries 3 (5 pts) (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4efa19178677930a8e55475a3be332cd86021d039b541c162fbda1adf9ff13"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.isLivePinnedSnapshot (cognitive 69): plugin-marketplace.isLivePinnedSnapshot has cognitive complexity 69 (threshold 15). Drivers by points: if/else 23 (49 pts), boolean chains 11, error handling 5 (8 pts), loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"908b611a974fe9586197312c31f4353c6e54fda77281a4922888baaef60ff0b3"}},{"ruleId":"D2","level":"warning","message":{"text":"friction.inspectRolloutFile (cognitive 69): friction.inspectRolloutFile has cognitive complexity 69 (threshold 15). Drivers by points: if/else 20 (48 pts), boolean chains 11, ternaries 9, loops 1 (nesting depth added 28). Of this number, 68 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/session-history/friction.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"0661a3dfe5c8bc1e1e94dd3d644145736536a91ac6bb43c98549020c08b48ce8"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.hasLivePinIntent (cognitive 68): plugin-marketplace.hasLivePinIntent has cognitive complexity 68 (threshold 15). Drivers by points: if/else 18 (48 pts), error handling 5 (11 pts), boolean chains 8, loops 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dd1b6e3c8b2e78d7df1dba40534abf5b75e8ee976bb482933ee1a7a2f0fad4"}},{"ruleId":"D2","level":"warning","message":{"text":"update.executeUpdate (cognitive 68): update.executeUpdate has cognitive complexity 68 (threshold 15). Drivers by points: if/else 24 (38 pts), ternaries 13 (19 pts), boolean chains 10, error handling 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"23968d70c61eb7795c896d39b2610e8d4e48933abe2d161548815c2f7fddd206"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.evaluateConductorBashWrite (cognitive 68): codex-native-hook.evaluateConductorBashWrite has cognitive complexity 68 (threshold 15). Drivers by points: if/else 34 (43 pts), boolean chains 18, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 12). Of this number, 58 points are the body\u0027s own statements and 10 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":20192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4883810b5a9da1ddc9b4bc64f563ce5973f2b8a9b8fef6e5c2ba9570027e55bd"}},{"ruleId":"D2","level":"warning","message":{"text":"index.cancelModes::loadStates (cognitive 68): index.cancelModes::loadStates has cognitive complexity 68 (threshold 15). Drivers by points: if/else 13 (34 pts), ternaries 6 (12 pts), boolean chains 11, error handling 2 (6 pts), loops 2 (5 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (index.cancelModes) 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":"src/cli/index.ts"},"region":{"startLine":10526}}}],"partialFingerprints":{"codehealthFindingId/v1":"3603ae08c2fefce164df5b9a7830f1d19e7c5118f13998caafb9026e359d180c"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-pre-post.tokenizeShellCommandWithBoundaries (cognitive 67): codex-native-pre-post.tokenizeShellCommandWithBoundaries has cognitive complexity 67 (threshold 15). Drivers by points: if/else 27 (55 pts), boolean chains 10, loops 1, ternaries 1 (nesting depth added 28). Of this number, 65 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-pre-post.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a11fcbc8537dae988b5467eabc708f8b26698ad8573f9c227f8dcbbf1ecf1d"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.buildSessionStartContext (cognitive 67): codex-native-hook.buildSessionStartContext has cognitive complexity 67 (threshold 15). Drivers by points: if/else 22 (42 pts), ternaries 6 (11 pts), boolean chains 9, error handling 2 (4 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6d8309d740342d076c0bdf1becbc9925149edba3f59f0fabf997c45e99a68a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.pythonInvocationHasUnsafeRuntimeEnvironment::applyRange (cognitive 67): codex-native-hook.pythonInvocationHasUnsafeRuntimeEnvironment::applyRange has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (56 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6299}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1546b387e8ef58ed59354dc9cc1b50f61b1180b54814527fabeb0ff3e105d4"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.inspectOwnership (cognitive 66): codex-hooks.inspectOwnership has cognitive complexity 66 (threshold 15). Drivers by points: if/else 11 (41 pts), ternaries 4 (12 pts), boolean chains 7, loops 3 (6 pts) (nesting depth added 41). Of this number, 63 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"10651c59895cc757c0359b286509f201b7cc79b9104e6fdde48c71f8179496b4"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.parseConductorTimeInvocation (cognitive 66): codex-native-hook.parseConductorTimeInvocation has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (54 pts), boolean chains 5, loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7475}}}],"partialFingerprints":{"codehealthFindingId/v1":"160552c02ddb398dbbc3baf295e59a9854432c0c81b1326d87eea32674196f84"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.terminateTrackedProcessTree (cognitive 65): runtime.terminateTrackedProcessTree has cognitive complexity 65 (threshold 15). Drivers by points: if/else 14 (37 pts), error handling 6 (14 pts), loops 6 (10 pts), boolean chains 4 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":2768}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e44d27fcd1696196cc1451eb4f80b2ab62fcd581e021f4d6e769881237920c3"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isPositivelyReadOnlyNodeInlineEval (cognitive 65): codex-native-hook.isPositivelyReadOnlyNodeInlineEval has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (45 pts), boolean chains 14, loops 3, ternaries 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13726}}}],"partialFingerprints":{"codehealthFindingId/v1":"660b0f0f43ef037dbdf91898c39399c1d32bd310f8730b9b4f90cace6156a0ba"}},{"ruleId":"D2","level":"warning","message":{"text":"team.formatInspectItemLine (cognitive 64): team.formatInspectItemLine has cognitive complexity 64 (threshold 15). Drivers by points: ternaries 64. 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/cli/team.ts"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1326dfdaf2eb0dcd3d6716683c29e0c5bccc4249b5cf81f0ccb7f3f59c544cd"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.collectMarkdownReferenceIndex (cognitive 64): keyword-detector.collectMarkdownReferenceIndex has cognitive complexity 64 (threshold 15). Drivers by points: if/else 12 (52 pts), boolean chains 6, ternaries 1 (5 pts), loops 1 (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56c37df08391cf555f273603372453bcf7876161a3da500be9e25b8075b855d"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-injection.handleTmuxInjection (cognitive 64): tmux-injection.handleTmuxInjection has cognitive complexity 64 (threshold 15). Drivers by points: if/else 22 (35 pts), boolean chains 28, ternaries 12 (18 pts), error handling 4 (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. This shape REPEATS in the file: one other method here (tmux-injection.handleTmuxInjection::scanActiveModeStateDirs) 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":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4d6a4003aa3e1eb7d919bf4791e2a2b4ba81738fbd63170378eb659b419d86"}},{"ruleId":"D2","level":"warning","message":{"text":"index.acquireHistoryPersistenceLock (cognitive 63): index.acquireHistoryPersistenceLock has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (39 pts), ternaries 3 (12 pts), boolean chains 7, error handling 2 (4 pts), loops 1 (nesting depth added 35). Of this number, 48 points are the body\u0027s own statements and 15 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/cli/index.ts"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"861cdecea24f0db65e8a593eda2f339a7eb1148696fdf657903acb4cd0bbe564"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.claimPublicationLock (cognitive 62): plugin-marketplace.claimPublicationLock has cognitive complexity 62 (threshold 15). Drivers by points: if/else 11 (32 pts), error handling 8 (23 pts), boolean chains 6, loops 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2690}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f1e03d0803940940330b7ecca13668c5340b915abfed136cb2068ec04ab0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.applyNativeHookTransactionArtifact (cognitive 62): setup.applyNativeHookTransactionArtifact has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 7 (25 pts), if/else 13 (21 pts), error handling 6 (14 pts), boolean chains 2 (nesting depth added 34). Of this number, 60 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":"src/cli/setup.ts"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ec1ca0281585c7d19e3337f92582072422a359dc153f65796a2755bf7c5c03"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.hasUnprovenManagedMarkerHooksStateSyntax (cognitive 61): generator.hasUnprovenManagedMarkerHooksStateSyntax has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (41 pts), loops 7 (10 pts), boolean chains 8, ternaries 1 (2 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/config/generator.ts"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6a8141b6a83dae119e4b4fdc58883ce5691bee617c07b4434fcd29b9c6409c"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.registerOmxPluginCacheLivePin (cognitive 61): plugin-marketplace.registerOmxPluginCacheLivePin has cognitive complexity 61 (threshold 15). Drivers by points: if/else 24 (32 pts), error handling 8 (14 pts), boolean chains 13, loops 1, ternaries 1 (nesting depth added 14). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fb273e90e3c77597c75d5bdfae62b76ff50924fa41926fc3956bd3aa686bf4"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.normalizeSubagentTrackingState (cognitive 60): tracker.normalizeSubagentTrackingState has cognitive complexity 60 (threshold 15). Drivers by points: boolean chains 28, ternaries 7 (20 pts), if/else 4 (9 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f6cfe3b0542fbc595e36b157cb87021a90d7907af22b31e0a61123d4c02a77"}},{"ruleId":"D2","level":"warning","message":{"text":"team-tmux-guard.sendPaneInput (cognitive 60): team-tmux-guard.sendPaneInput has cognitive complexity 60 (threshold 15). Drivers by points: if/else 19 (26 pts), ternaries 8 (17 pts), error handling 6 (10 pts), boolean chains 6, loops 1 (nesting depth added 20). Of this number, 55 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-tmux-guard.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"42396771a25ee2555921e036d98a002f00664a2667c3e88095b498ab4bb37485"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.nestedExecEnvironmentClearBoundary (cognitive 60): codex-native-hook.nestedExecEnvironmentClearBoundary has cognitive complexity 60 (threshold 15). Drivers by points: if/else 14 (48 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18709}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d17a63cb37be38eb0950f6517b4ff8086f7e71b30bf901f8a06342b412ac47"}},{"ruleId":"D2","level":"warning","message":{"text":"toml-source.analyzeTomlSource (cognitive 59): toml-source.analyzeTomlSource has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (43 pts), loops 3 (7 pts), boolean chains 5, ternaries 1 (4 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/toml-source.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a0200ea216f281bcd9cf744036e7a14127b89f599de3b0ce8a670678eb8dce"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux.lexPosixWords (cognitive 59): tmux.lexPosixWords has cognitive complexity 59 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 5 (13 pts), boolean chains 5 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6e2ada0db25f7456f28e88002d007ca456050e504edec429f0ee6bbeec4756"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.atomicWriteNativeHookTransactionArtifact (cognitive 59): setup.atomicWriteNativeHookTransactionArtifact has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (25 pts), ternaries 11 (24 pts), error handling 3 (7 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"9510eeac927e431c1ba369f6e5c159a02e6fc685221fd0c7ccce0e81b94276a3"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.refreshNativeAgentConfigs (cognitive 59): setup.refreshNativeAgentConfigs has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (40 pts), ternaries 4 (10 pts), boolean chains 6, 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/cli/setup.ts"},"region":{"startLine":6176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dbcd94b942bf7e24a8ba034a84d002aa1117e1b247d9eeca3469a687b90871"}},{"ruleId":"D2","level":"warning","message":{"text":"export.exportSessionHistory (cognitive 59): export.exportSessionHistory has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (35 pts), ternaries 4 (13 pts), boolean chains 10, loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/export.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"019e4c55b86dff86855a9c43d7026e80f6e97ae9cef817cc18e8ed8b26e68b62"}},{"ruleId":"D2","level":"warning","message":{"text":"mission.parseMissionArgs (cognitive 59): mission.parseMissionArgs has cognitive complexity 59 (threshold 15). Drivers by points: if/else 26 (47 pts), boolean chains 9, ternaries 2, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mission.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c5198f3dce92c7d14a1e71315d708390994ea9cc5fbb42fa60065f64ba64de"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-injection.resolvePaneTarget (cognitive 59): tmux-injection.resolvePaneTarget has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (28 pts), ternaries 5 (15 pts), boolean chains 9, error handling 4 (7 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ed2e3a31f05c58685bcb5aa5a787d4220eacba04330bddeae5078673430180"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.retireUnpinnedManagedSnapshots (cognitive 58): plugin-marketplace.retireUnpinnedManagedSnapshots has cognitive complexity 58 (threshold 15). Drivers by points: if/else 20 (33 pts), error handling 5 (12 pts), boolean chains 10, loops 3 (nesting depth added 20). Of this number, 57 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/cli/plugin-marketplace.ts"},"region":{"startLine":3665}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a91cdf82dd0b3255f3b8117051745e41c3ad37f757cfbb3b0edac98ddb5ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"advisory.readProjectionForGeneration (cognitive 57): advisory.readProjectionForGeneration has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 17, error handling 6 (8 pts), ternaries 6 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b27cc56f7b92d79c66654acaeda5cacf23d228b69f81e5a4d38ca6fedee9f85"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.buildAdditionalContextMessage (cognitive 56): codex-native-hook.buildAdditionalContextMessage has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 18 (31 pts), if/else 12 (13 pts), boolean chains 12 (nesting depth added 14). Of this number, 51 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2770}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec18992012eba41f5e04938f7e50a92270a73cf3da1f5ffaedc668bdd5b0106"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.stateReadTrailingArgsAreSafe (cognitive 56): codex-native-hook.stateReadTrailingArgsAreSafe has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (45 pts), boolean chains 10, loops 1 (nesting depth added 27). Of this number, 55 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9806}}}],"partialFingerprints":{"codehealthFindingId/v1":"58382fafcc7e10418d22228f66a1d870f3f2b23094ff7ae53a6993396d0d7824"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isStaticallyValidatedOmxStateWriteInvocation (cognitive 56): codex-native-hook.isStaticallyValidatedOmxStateWriteInvocation has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (45 pts), boolean chains 8, error handling 1, loops 1, ternaries 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16433}}}],"partialFingerprints":{"codehealthFindingId/v1":"295b77ab0b30c82edbc0c42163434fb9ac53836341fa8e123c84c62133f7550a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.persistProjectLaunchRuntimeHistoryArtifacts (cognitive 56): index.persistProjectLaunchRuntimeHistoryArtifacts has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (39 pts), error handling 3 (9 pts), boolean chains 7, loops 1 (nesting depth added 28). Most of this is not in the body itself: 3 of the 56 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1631, 1661, 1665). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fee30d9530c78ae91209d9b52a66229dac66da6fda94beeeed06d8e4adea64e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.selectAuthorizedHookVisibleRunDirState (cognitive 56): index.selectAuthorizedHookVisibleRunDirState has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (32 pts), error handling 4 (8 pts), loops 4 (7 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":10217}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1349b98316a24676f2fa8bf29b2fc8546aeb76d0664f8b74373d19c863908a7"}},{"ruleId":"D2","level":"warning","message":{"text":"notify-hook.isOmxManagedCwd (cognitive 56): notify-hook.isOmxManagedCwd has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 18, error handling 3 (8 pts), loops 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 19). Of this number, 55 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/scripts/notify-hook.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05751d0f23a8df7c5ef753813de59e8d54ab280e6d8d7d98f9c7a745df01a9f"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-active.syncCanonicalSkillStateForModeUnlocked (cognitive 55): skill-active.syncCanonicalSkillStateForModeUnlocked has cognitive complexity 55 (threshold 15). Drivers by points: boolean chains 26, if/else 11 (17 pts), ternaries 8 (11 pts), loops 1 (nesting depth added 9). Of this number, 38 points are the body\u0027s own statements and 17 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":"src/state/skill-active.ts"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7f75183d866a6faf021b3600eefa1a474d5401a58eabf14b521c806d41bd55"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.installPrompts (cognitive 55): setup.installPrompts has cognitive complexity 55 (threshold 15). Drivers by points: if/else 15 (37 pts), ternaries 3 (9 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":6025}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ff463a372afce946d2c37291720bd71b44452eef76860980901b825658df71"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorStateWriteTransportIsBoundToActiveSession (cognitive 55): codex-native-hook.conductorStateWriteTransportIsBoundToActiveSession has cognitive complexity 55 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 16, ternaries 3 (9 pts), loops 2 (3 pts) (nesting depth added 21). Of this number, 51 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":20109}}}],"partialFingerprints":{"codehealthFindingId/v1":"785befd592487fd7df49da36ef0f63a97e13bf76f83732d1f4eb47695c8db0e4"}},{"ruleId":"D2","level":"warning","message":{"text":"smoke-packed-install.resolvePinnedCodexExecutable (cognitive 55): smoke-packed-install.resolvePinnedCodexExecutable has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (50 pts), loops 2 (3 pts), boolean chains 2 (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/scripts/smoke-packed-install.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa2561949b3260058896fbe98679e8f956b986a740a077daf8c7eaf0cada8e3"}},{"ruleId":"D2","level":"warning","message":{"text":"mission.missionCommand (cognitive 54): mission.missionCommand has cognitive complexity 54 (threshold 15). Drivers by points: if/else 24 (38 pts), loops 3 (7 pts), ternaries 3 (5 pts), boolean chains 3, error handling 1 (nesting depth added 20). Of this number, 53 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/cli/mission.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7128691aea6160804a7d5e80c87d674ce763e2f9b956e1a61195b083ac2166"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.hasDynamicNestedShellExecution (cognitive 54): codex-native-hook.hasDynamicNestedShellExecution has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (44 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2a26e698df9b5c78d042499107a8c8ccacbdcf590e816b939528a12cac6571"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.parseConductorStaticGhApiInvocation (cognitive 54): codex-native-hook.parseConductorStaticGhApiInvocation has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (42 pts), boolean chains 10, loops 1, ternaries 1 (nesting depth added 24). Of this number, 45 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12300}}}],"partialFingerprints":{"codehealthFindingId/v1":"e373805e724bfe57af6f921caac8747c7be1a451293f3ff5465af8c687819385"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.openManagedCacheNamespace (cognitive 53): plugin-marketplace.openManagedCacheNamespace has cognitive complexity 53 (threshold 15). Drivers by points: if/else 9 (24 pts), error handling 6 (13 pts), boolean chains 8, loops 3 (8 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3058}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad03789e0f745862be365b7546a7fc6e76606035d38b485d6544e54a63875163"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.collectExplicitPrefixNegationIndex (cognitive 53): keyword-detector.collectExplicitPrefixNegationIndex has cognitive complexity 53 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 7 (17 pts), boolean chains 6 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ea669a239df0a313564bb7a462e21f85f2be238e72b9849b1329eb67f2d239"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.sweepExpiredOmxPluginCacheLivePinIntents (cognitive 52): plugin-marketplace.sweepExpiredOmxPluginCacheLivePinIntents has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (37 pts), boolean chains 10, error handling 2 (4 pts), loops 1 (nesting depth added 18). Of this number, 48 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e3e0da1b9e16df447581ce02ec7ddae294d9770f3d07304cda9d3126fde06f"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.doctor (cognitive 52): doctor.doctor has cognitive complexity 52 (threshold 15). Drivers by points: if/else 28 (36 pts), ternaries 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdd2e97301e0a824d816bc6d0ea8bccaafbe8fe015f027077ff11d5de90200a"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.planNativeHookSetupTransaction (cognitive 52): setup.planNativeHookSetupTransaction has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (31 pts), boolean chains 10, ternaries 8 (10 pts), error handling 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/cli/setup.ts"},"region":{"startLine":4113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5136c40a4081f57f30b3e869fb2762de8f8931f495de34e4ff2bb197f6e92d1a"}},{"ruleId":"D2","level":"warning","message":{"text":"usage.buildSessionUsageReport (cognitive 52): usage.buildSessionUsageReport has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (33 pts), boolean chains 9, loops 3 (6 pts), ternaries 1 (4 pts) (nesting depth added 27). Of this number, 48 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/usage.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2c1583257520c74ad9b05846968fef3648049cf431c157a60042d1ef4203ad"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectConductorRsyncStaticTransferPaths (cognitive 52): codex-native-hook.collectConductorRsyncStaticTransferPaths has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (36 pts), boolean chains 8, ternaries 3 (7 pts), loops 1 (nesting depth added 26). Of this number, 51 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19877}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec42a087c47bec1b3c1d198c7db020596b8ecfe84573e6e8bfb7166b2e375f33"}},{"ruleId":"D2","level":"warning","message":{"text":"index.listHookVisibleRunDirStateRefs (cognitive 52): index.listHookVisibleRunDirStateRefs has cognitive complexity 52 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 6 (11 pts), error handling 6 (9 pts), loops 5 (8 pts), boolean chains 6 (nesting depth added 20). Of this number, 37 points are the body\u0027s own statements and 15 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/cli/index.ts"},"region":{"startLine":10035}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa98ab879841444637909925e1a6d9b2b1b71b07e57777b8df226268fd34126e"}},{"ruleId":"D2","level":"warning","message":{"text":"mode-binding-lease-helper.runPinnedClaimMode (cognitive 52): mode-binding-lease-helper.runPinnedClaimMode has cognitive complexity 52 (threshold 15). Drivers by points: if/else 29 (42 pts), boolean chains 8, error handling 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":"src/state/mode-binding-lease-helper.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fd58bba7a91f802b3c194b431d56c181d2f00f706597352343c369c1de4dd1"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.upsertTuiStatusLine (cognitive 51): generator.upsertTuiStatusLine has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 6 (10 pts), boolean chains 6, ternaries 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":3634}}}],"partialFingerprints":{"codehealthFindingId/v1":"1009341619b67c987668c35a80d674c328b0a6b2f2015396f6c7cc60c3cb53d6"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.readOmxStateCommandFromSegmentWords (cognitive 51): codex-native-hook.readOmxStateCommandFromSegmentWords has cognitive complexity 51 (threshold 15). Drivers by points: ternaries 8 (44 pts), if/else 3 (6 pts), loops 1 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7827}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8afaf1e6d44057a3a4c6dad06cf5798170dc4ceee992183d0cc4cf8c3bf6dc"}},{"ruleId":"D2","level":"warning","message":{"text":"mode-binding-lease-helper.readPinnedOwner (cognitive 51): mode-binding-lease-helper.readPinnedOwner has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 17, ternaries 11 (13 pts) (nesting depth added 7). Of this number, 47 points are the body\u0027s own statements and 4 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":"src/state/mode-binding-lease-helper.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef726108b871d061f378a41b34c418f746f235446193789518534b806e2d4401"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux.parseTmuxPaneSnapshot (cognitive 50): tmux.parseTmuxPaneSnapshot has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 13 (29 pts), if/else 8 (12 pts), boolean chains 8, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d349433039a73a03af6917e50734d9d9a28b9d1302ea077f95ab97f15bae2452"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.dispatchCriticalInboxInstruction (cognitive 50): runtime.dispatchCriticalInboxInstruction has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (33 pts), ternaries 5 (9 pts), boolean chains 8 (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/team/runtime.ts"},"region":{"startLine":6392}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c6ea7c4d0d201429ee799061a520092681145e92855cb1fcce06cb6b6304bf"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-session.restoreStandaloneHudPane (cognitive 49): tmux-session.restoreStandaloneHudPane has cognitive complexity 49 (threshold 15). Drivers by points: if/else 25 (39 pts), boolean chains 7, loops 3 (nesting depth added 14). Of this number, 42 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/tmux-session.ts"},"region":{"startLine":3050}}}],"partialFingerprints":{"codehealthFindingId/v1":"999b0bb9dc05d28010b14bbf7a0760a6c844787ed86770ce4334cb23ff306499"}},{"ruleId":"D2","level":"warning","message":{"text":"auto-nudge.maybeAutoNudge (cognitive 49): auto-nudge.maybeAutoNudge has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (25 pts), boolean chains 18, ternaries 4 (5 pts), error handling 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/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86a6b449e527ad1ef6f76d998673e4a3662fc17c2a988b24d8909c15074bcc8"}},{"ruleId":"D2","level":"warning","message":{"text":"team-worker-stop.maybeNudgeLeaderForAllowedWorkerStop (cognitive 49): team-worker-stop.maybeNudgeLeaderForAllowedWorkerStop has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 13, ternaries 6 (8 pts), error handling 1 (nesting depth added 8). Of this number, 48 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eba0046420fa037c5adeb50353d0331096edb52b29287b9faf387302aaa78d3"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.firstPlanningTmpScriptExecutionTarget::scanCommand (cognitive 49): codex-native-hook.firstPlanningTmpScriptExecutionTarget::scanCommand has cognitive complexity 49 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 5 (10 pts), ternaries 3 (10 pts), boolean chains 7 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6463}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff54343b63c87f1896f156a01d7057741b483c84d1ec43c1c388747f3b93a4bc"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.decodeShellHeredocAnsiEscape (cognitive 49): codex-native-hook.decodeShellHeredocAnsiEscape has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 10 (46 pts), boolean chains 2, if/else 1 (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8632}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e952fc17e762e3c7705b21552933feda68439080e43177b217135a66fd17cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isInsideConductorSubstitutionGrouping (cognitive 49): codex-native-hook.isInsideConductorSubstitutionGrouping has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 6 (15 pts), boolean chains 12, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19490}}}],"partialFingerprints":{"codehealthFindingId/v1":"a929af051ce629b377fea726b34a0a359b522d7d1b336ffacf950c48a6c02e7e"}},{"ruleId":"D2","level":"warning","message":{"text":"pinned-atomic-file-darwin-janitor.main (cognitive 49): pinned-atomic-file-darwin-janitor.main has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (35 pts), boolean chains 8, error handling 2 (5 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/pinned-atomic-file-darwin-janitor.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9723928bd379a80925b2254e51cfefce3dab11792916c7a6d677e47342a422ce"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.writePendingSessionRegistration (cognitive 48): codex-native-hook.writePendingSessionRegistration has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 15, error handling 5 (6 pts) (nesting depth added 7). Of this number, 44 points are the body\u0027s own statements and 4 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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"8178a48a6b4a96c6046edb6347a8d875d0f77e145000a3b54eacb61a7d97961e"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.tokenizePosixCommand (cognitive 48): codex-hooks.tokenizePosixCommand has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"a085e72e4ad8908998103edad96ebdd0baa8bd24a08572965b27afb801ada831"}},{"ruleId":"D2","level":"warning","message":{"text":"state-paths.readCanonicalSessionBindingSnapshot (cognitive 48): state-paths.readCanonicalSessionBindingSnapshot has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (20 pts), ternaries 6 (12 pts), error handling 8 (11 pts), boolean chains 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/state-paths.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea793d8c07eaeb97ecf61702af4157d9b0c592847950d96f2b40c9ff6e5d579c"}},{"ruleId":"D2","level":"warning","message":{"text":"mailbox.sendDirectMessage (cognitive 48): mailbox.sendDirectMessage has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 11, ternaries 4 (7 pts), loops 1 (2 pts), error handling 1 (nesting depth added 16). Most of this is not in the body itself: 2 of the 48 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 218, 265, 241, \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":"src/team/state/mailbox.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ba9ddf3a8a3027e53c4b9288df5fe92d9fd6aeefc2f05352616d7a0edb3f28"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.consumeDirectChildReopenContext (cognitive 48): tracker.consumeDirectChildReopenContext has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24 (34 pts), boolean chains 11, loops 1 (2 pts), error handling 1 (nesting depth added 11). Most of this is not in the body itself: 2 of the 48 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 1637, 1675, 1665, \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":"src/subagents/tracker.ts"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b791165a39033824d2ffd95a1bb3024ce9c7ead0c236de9aef1356c1831e59"}},{"ruleId":"D2","level":"warning","message":{"text":"phase-controller.buildTransitionPath (cognitive 48): phase-controller.buildTransitionPath has cognitive complexity 48 (threshold 15). Drivers by points: if/else 27 (48 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/team/phase-controller.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"319034121fd2297392477eeede0ca4c5a4769f502f9bd6a292eb15ef567f5ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"session-timeline.parseSessionTimelineArgs (cognitive 48): session-timeline.parseSessionTimelineArgs has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (29 pts), ternaries 4 (10 pts), boolean chains 6, match/switch 1 (2 pts), 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/cli/session-timeline.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4d3870508801c5a73c6d614229c4161a3b1bed3138a6478f00c945d0219579"}},{"ruleId":"D2","level":"warning","message":{"text":"index.launchWithHud (cognitive 48): index.launchWithHud has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (26 pts), error handling 7 (10 pts), ternaries 5 (7 pts), boolean chains 5 (nesting depth added 15). Of this number, 45 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":5634}}}],"partialFingerprints":{"codehealthFindingId/v1":"4728145c8f196298a7dfeec397f06323499ce2386092bdc82c353fe234621b59"}},{"ruleId":"D2","level":"warning","message":{"text":"notify-fallback-watcher.resolveActiveTeamState (cognitive 48): notify-fallback-watcher.resolveActiveTeamState has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (25 pts), ternaries 8 (16 pts), boolean chains 5, loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8faee14809e19e8b106c2c7d01a89b0df5d3e1eb8618c280f580f65fae7086f"}},{"ruleId":"D2","level":"warning","message":{"text":"state-paths.resolveWritableStateScope (cognitive 47): state-paths.resolveWritableStateScope has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (38 pts), boolean chains 7, ternaries 2 (nesting depth added 25). Of this number, 42 points are the body\u0027s own statements and 5 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":"src/mcp/state-paths.ts"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e17918b0c788b215f5428cb86b53a15153580ab86765fc2461489a4bd8a203"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-active.acquireRootSkillActiveStateLock (cognitive 47): skill-active.acquireRootSkillActiveStateLock has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (29 pts), error handling 4 (15 pts), boolean chains 2, loops 1 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/skill-active.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"244035b8b1513792f42790de04726f8ec4f997ae8984ddd741680412958b527e"}},{"ruleId":"D2","level":"warning","message":{"text":"advisory.reconcileRalplanAdvisoryUnlocked (cognitive 47): advisory.reconcileRalplanAdvisoryUnlocked has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (37 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 20). Of this number, 45 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory.ts"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"b311997b3eea85a54649f57bbdaec92bbfdadcd8133d63c48f6e76a877cb5e92"}},{"ruleId":"D2","level":"warning","message":{"text":"quality-gates.readQualityGatesConfig (cognitive 47): quality-gates.readQualityGatesConfig has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (9 pts), boolean chains 5, error handling 2 (5 pts), ternaries 1 (nesting depth added 28). 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/config/quality-gates.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4019f26f8d1339b2ce909c9b8a1f74c3da7f454c148669b7a7fe083a7304bd"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.startTeam::runWorkerStartupAttempt (cognitive 47): runtime.startTeam::runWorkerStartupAttempt has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (34 pts), ternaries 4 (7 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (runtime.startTeam) 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":"src/team/runtime.ts"},"region":{"startLine":4159}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae3d41181537273d39c2efc599521271d5891996b914c4d2422d854de3ee213"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.checkExistingNativeHooks (cognitive 47): doctor.checkExistingNativeHooks has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 10 (22 pts), if/else 12 (15 pts), error handling 3 (6 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":2817}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f4063883ff53c5ee73581dc7b244b2764db94387c7b5ae9be7389219ef6381"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-pre-post.commandInvokesApplyPatch (cognitive 47): codex-native-pre-post.commandInvokesApplyPatch has cognitive complexity 47 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 6 (16 pts), boolean chains 6 (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/scripts/codex-native-pre-post.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7be71aeea02ebe76568da5b1099cd59a022f8091f1d9f1ffebdd34c5024b0a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorMetadataWriteSizesStayBounded (cognitive 47): codex-native-hook.conductorMetadataWriteSizesStayBounded has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 3 (6 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1 (nesting depth added 24). Of this number, 40 points are the body\u0027s own statements and 7 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5300}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bad9e2a58e134adeb15863c8aa81217d701170a13d2a5525392bed76dd12535"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectOmxStateCommandOperations::scanNestedSubstitutions (cognitive 47): codex-native-hook.collectOmxStateCommandOperations::scanNestedSubstitutions has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (13 pts), ternaries 4 (12 pts), boolean chains 6 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7968}}}],"partialFingerprints":{"codehealthFindingId/v1":"76aea8d1810179c91731125e8876f83daa8af1dcd8a68a048dfe99d5a9f6ecea"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.nestedShellHasUnsafeStartup (cognitive 47): codex-native-hook.nestedShellHasUnsafeStartup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (23 pts), ternaries 4 (12 pts), boolean chains 10, loops 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12992}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ff74ca903ae874137bab76eb9f6805afd56d83f4c17dc3e351aa523c46e65d"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.applyNestedBashShoptOptions (cognitive 47): codex-native-hook.applyNestedBashShoptOptions has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (41 pts), boolean chains 5, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18462}}}],"partialFingerprints":{"codehealthFindingId/v1":"2179440cc3948650d360655eae6cf1759ff0d1dc377b47a0d4500710d513141a"}},{"ruleId":"D2","level":"warning","message":{"text":"team-dispatch.finalizeClaimedDispatchRequest (cognitive 47): team-dispatch.finalizeClaimedDispatchRequest has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 17, ternaries 5 (11 pts) (nesting depth added 13). None of this is in the body itself: all 47 points belong to one function literal inside it that branches (line 519). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"046034b697a76ac73966102c1b5aa2a8deb7c4a395f2a04b9e21654f74682dd0"}},{"ruleId":"D2","level":"warning","message":{"text":"session.resumeRecoveryCheckpoint (cognitive 46): session.resumeRecoveryCheckpoint has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 16, ternaries 5 (7 pts), error handling 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/hooks/session.ts"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4687bdb34ba8f469b66502548788992e72a64558eebda2092e2dbfb9b9ee58"}},{"ruleId":"D2","level":"warning","message":{"text":"session.acquirePointerLock (cognitive 46): session.acquirePointerLock has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 7 (22 pts), if/else 7 (16 pts), error handling 4 (7 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":2409}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f2d08d11cf896a5d1a160f4ceae86795c655059f72d72aec7f5a2abe081ab8"}},{"ruleId":"D2","level":"warning","message":{"text":"scaling.reconcileScaleDownCleanupDebt (cognitive 46): scaling.reconcileScaleDownCleanupDebt has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 8, ternaries 3 (4 pts), error handling 3, loops 1 (nesting depth added 11). None of this is in the body itself: all 46 points belong to 2 function literals inside it that branch (lines 1764, 1877). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab613243fdabb3fba29982b9948b0dc6b23d36fd021054717f9541fadd1d8b47"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.commitNativeHookTransaction (cognitive 46): setup.commitNativeHookTransaction has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 5 (17 pts), if/else 7 (12 pts), error handling 4 (10 pts), loops 4 (6 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/cli/setup.ts"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dedea0cd62288d10de42ebcf121ba0d7ef8fa1ac562a73176061a3d3bed1738"}},{"ruleId":"D2","level":"warning","message":{"text":"codebase-map.generateCodebaseMap (cognitive 46): codebase-map.generateCodebaseMap has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 3 (7 pts), ternaries 3 (6 pts), boolean chains 4, error handling 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/hooks/codebase-map.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f87dab78ec76e707b0f00706b32b65ff7e3b3ccbab6a6019ab5c34464066a62"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.nestedShellEnablesPosix (cognitive 46): codex-native-hook.nestedShellEnablesPosix has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 8, ternaries 2 (6 pts), loops 3 (4 pts) (nesting depth added 19). Of this number, 44 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18618}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef16c795584b59d6fe315e86f5d68386ca1e0229c3fb8653710dc1528357e797"}},{"ruleId":"D2","level":"warning","message":{"text":"mode-binding-lease-helper.acquire (cognitive 46): mode-binding-lease-helper.acquire has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (36 pts), error handling 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/mode-binding-lease-helper.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff09c133d83b04c4c5ba78893f9bae43c55f4ed5998c30e0e21820835891e09"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.parseJsonSource::parseValue (cognitive 45): codex-hooks.parseJsonSource::parseValue has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (40 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3dd14a986b9d93b54143553f9c0d9686e031ba84844b1bebc094ac5c5d5fa71"}},{"ruleId":"D2","level":"warning","message":{"text":"advisory.readCurrentRalplanAdvisory (cognitive 45): advisory.readCurrentRalplanAdvisory has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 12, error handling 3 (5 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c9d7f74096079abef59a22d2ac1c4134fdffd3a6fa97c90e132376c1a690b7"}},{"ruleId":"D2","level":"warning","message":{"text":"advisory.terminalizeRalplanAdvisoryUnlocked (cognitive 45): advisory.terminalizeRalplanAdvisoryUnlocked has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 11, ternaries 2 (4 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e490510b0a7f22461b9ac959c5cd083c0a957c940412d6a3d85f99ee2b1c2bf4"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux.registerHudResizeHook (cognitive 45): tmux.registerHudResizeHook has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 11, ternaries 5 (7 pts), error handling 3 (4 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cc166f077a7b1d6b6ce56a0b276f9adbffea0463ace50d6edddbcd005d34f5"}},{"ruleId":"D2","level":"warning","message":{"text":"session-search.parseSessionSearchArgs (cognitive 45): session-search.parseSessionSearchArgs has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (42 pts), boolean chains 2, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/session-search.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0597ffc7b61b4ae6895a6c1a25b7cb0f8d4e592c203cdb53309dea0cc3bb006"}},{"ruleId":"D2","level":"warning","message":{"text":"smoke-packed-install.smokePackedHookTrustLifecycle (cognitive 45): smoke-packed-install.smokePackedHookTrustLifecycle has cognitive complexity 45 (threshold 15). Drivers by points: if/else 29 (35 pts), boolean chains 9, error handling 1 (nesting depth added 6). Of this number, 44 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":5026}}}],"partialFingerprints":{"codehealthFindingId/v1":"3869cf2c47b710f4d174509c0cbcd2b67f2ef524f81ba82d6190d1e334b1cf3d"}},{"ruleId":"D2","level":"warning","message":{"text":"state-root.resolveVerifiedDetachedTeamContext (cognitive 44): state-root.resolveVerifiedDetachedTeamContext has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 16, ternaries 2, loops 1 (nesting depth added 7). 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":"src/team/state-root.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f042a0906bc57f77e606bc6db6b0b5b46c72993c9385fae6c3397b49282c6dcd"}},{"ruleId":"D2","level":"warning","message":{"text":"autoresearch-goal.autoresearchGoalCommand (cognitive 44): autoresearch-goal.autoresearchGoalCommand has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (34 pts), boolean chains 6, ternaries 1 (3 pts), error handling 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/cli/autoresearch-goal.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"629fb37b378a8d05f881f279ef47bf0f39cfd5fe072e8421370bdbc8bcde1ea9"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.expandShellPositionalParameters (cognitive 44): codex-native-hook.expandShellPositionalParameters has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 7, loops 3 (7 pts), ternaries 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8358}}}],"partialFingerprints":{"codehealthFindingId/v1":"459549fbd84bcb09c3ffea1ddaabeb8a9c0d689ad7a67a078d2d1f7ab2ee0232"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isAllowedDeepInterviewBashWrite (cognitive 44): codex-native-hook.isAllowedDeepInterviewBashWrite has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (23 pts), boolean chains 15, ternaries 4 (5 pts), error handling 1 (nesting depth added 2). Of this number, 34 points are the body\u0027s own statements and 10 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10340}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d58ac910deb4242272932a624f2b3b20d3bfa6a8910eebd6df841cabd55471"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.joinConductorShellStates (cognitive 44): codex-native-hook.joinConductorShellStates has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 21, if/else 8 (14 pts), loops 5, ternaries 2 (4 pts) (nesting depth added 8). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16863}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c67488d4168cd890b7a349e2c7b18871efcb142c27f2998782d60116f48b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorPathMayResolveRepositoryExecutable (cognitive 44): codex-native-hook.conductorPathMayResolveRepositoryExecutable has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (29 pts), error handling 4 (9 pts), boolean chains 3, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17825}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4be1340e7c127639449eeda331b41eae1a0be3767d1b4baa9621f28ca7b620"}},{"ruleId":"D2","level":"warning","message":{"text":"worktree.replaySubmoduleRecovery (cognitive 43): worktree.replaySubmoduleRecovery has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 5, error handling 2 (5 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 21). Of this number, 38 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worktree.ts"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4e82e562131ca41d5a2281b363c5e5ace26edd62f815be7bbd833017b1360c"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.collectManagedHookTrustStateSourceRepresentations (cognitive 43): generator.collectManagedHookTrustStateSourceRepresentations has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 7 (9 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 17). Of this number, 31 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":"src/config/generator.ts"},"region":{"startLine":2305}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f2e457930c7e81e94fcbd936e045853e9244372f23cab77518eea8da88240d"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux.containsPowerShellHudOwnerReferenceOutsideQuotes (cognitive 43): tmux.containsPowerShellHudOwnerReferenceOutsideQuotes has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 5, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7b3026cc1fc7a9b5abaafc60a25033ab246047ecba20b47ee51cf3b3bac7b7"}},{"ruleId":"D2","level":"warning","message":{"text":"query.queryWiki (cognitive 43): query.queryWiki has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 4 (8 pts), boolean chains 4 (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/wiki/query.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c872976071bccb99698be7727b6fb90c3909800703a1989b20fa278e24d26ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"worker-provenance.resolveAuthoritativeTeamWorkerContext (cognitive 43): worker-provenance.resolveAuthoritativeTeamWorkerContext has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 10, loops 2, error handling 1, ternaries 1 (nesting depth added 9). Of this number, 40 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":"src/team/worker-provenance.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6e85d66aad654d08a784c7446b5eec64ad7b928a1e237b550e64428c014f06"}},{"ruleId":"D2","level":"warning","message":{"text":"question.parseQuestionArgs (cognitive 43): question.parseQuestionArgs has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (41 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/cli/question.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c54eb4ff70cf7d7de6733b6eec1c894c96e6de53962b2d664893c437d7698e3"}},{"ruleId":"D2","level":"warning","message":{"text":"search.extractSearchableTexts (cognitive 43): search.extractSearchableTexts has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 5, ternaries 2 (5 pts) (nesting depth added 19). Of this number, 39 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/search.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfcf41b15af5fdca5bbaf924a8e30f4bde2e976688ec8c32e0070f4b95b34d0"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.hasExactConductorOrchestrationOptionSchema (cognitive 43): codex-native-hook.hasExactConductorOrchestrationOptionSchema has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 16, ternaries 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16495}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8633d17e2a005043b246d64f2ff9ac20adf55d7c5d11dc1ce49a551ed478b7"}},{"ruleId":"D2","level":"warning","message":{"text":"native-assets.inspectManagedNativeBinary (cognitive 42): native-assets.inspectManagedNativeBinary has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 7 (20 pts), if/else 6 (10 pts), error handling 7 (8 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/native-assets.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"9020c30afb3ad11ca4d25b48ffe33bdcc70c84e2cf3d5f30eb2a584ae5410cee"}},{"ruleId":"D2","level":"warning","message":{"text":"reply-listener.pollDiscordOnce (cognitive 42): reply-listener.pollDiscordOnce has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 4 (8 pts), error handling 3 (7 pts), boolean chains 3, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/reply-listener.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"7587ffa139cbf835e548c3099a5a114d734b2a0f72279abab8cdfd880a243980"}},{"ruleId":"D2","level":"warning","message":{"text":"artifacts.validateUltragoalSteeringProposal (cognitive 42): artifacts.validateUltragoalSteeringProposal has cognitive complexity 42 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 9, ternaries 1 (2 pts), error handling 1 (nesting depth added 9). Of this number, 41 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/ultragoal/artifacts.ts"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"10236a00e4143899d2a77dcaa8897aa28a319f5fae9af569b0c93280f03e875d"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isPositivelyClassifiedFindCommand (cognitive 42): codex-native-hook.isPositivelyClassifiedFindCommand has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (34 pts), boolean chains 7, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12193}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b02edcd6b59abab466b0319f4102296a1bb700f2662738b4b31f37640cd1a9"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.removalProof (cognitive 41): codex-hooks.removalProof has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 7 (11 pts), boolean chains 5, ternaries 1 (4 pts) (nesting depth added 21). Of this number, 40 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/config/codex-hooks.ts"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab8d26fc4c0ca6f0815856eb7933a2d837a2aeaa1a3ec7a60ccd7089b742c7a"}},{"ruleId":"D2","level":"warning","message":{"text":"state-paths.discoverSessionAuthorityBaseStateDir (cognitive 41): state-paths.discoverSessionAuthorityBaseStateDir has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (20 pts), ternaries 3 (13 pts), boolean chains 4, error handling 1 (3 pts), loops 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/state-paths.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b27a3efb57b1a4e900930284c1f673252cb9de9b7ad1af13a2e80bfe0966b0e"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatch-recovery.reconcileRuntimeFinalizations (cognitive 41): dispatch-recovery.reconcileRuntimeFinalizations has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 7, ternaries 2 (7 pts), loops 1 (2 pts), error handling 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/dispatch-recovery.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"47375024be54df35ef5fe6a1a2ec514a437d9984f6ee7a98596f9cd415e0e5d6"}},{"ruleId":"D2","level":"warning","message":{"text":"hotswap.runAuthHotswap (cognitive 41): hotswap.runAuthHotswap has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 6, error handling 4 (5 pts), ternaries 3 (5 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/auth/hotswap.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d29e4a9cbfa1c33ba54a6518ea5a8be02118de9f2af3fdf3eca41b46d4e77e8"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatcher.dispatchHookEvent (cognitive 41): dispatcher.dispatchHookEvent has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 14, error handling 1 (2 pts), ternaries 2, 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/hooks/extensibility/dispatcher.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cc28641b45e979135aea843061c1a52b699caa923c69460a2c35bf0c69905e"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.assignTask (cognitive 41): runtime.assignTask has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 8, ternaries 4 (5 pts), error handling 2 (3 pts), loops 1 (nesting depth added 10). None of this is in the body itself: all 41 points belong to one function literal inside it that branches (line 4900). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":4893}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf664b1dd046243a456426ccca4d47146082d9a8b476363534aebae6a364437"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.directCandidateIndexes::addBlock (cognitive 41): keyword-detector.directCandidateIndexes::addBlock has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 7, loops 4 (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. This shape REPEATS in the file: one other method here (keyword-detector.directCandidateIndexes) 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":"src/hooks/keyword-detector.ts"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3c30bd8009eca916dbfd785edfa1e5084884c425dd634421763f62307c7c57"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.extractDeepInterviewCommandWriteTargets (cognitive 41): codex-native-hook.extractDeepInterviewCommandWriteTargets has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 7 (10 pts), boolean chains 4 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5712}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff244607f72f1de446bb844818710c6749459629758394c12095a6e294c578f"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.splitShellCommandSegments (cognitive 41): codex-native-hook.splitShellCommandSegments has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (34 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8436}}}],"partialFingerprints":{"codehealthFindingId/v1":"578ea0064b1effb8fbc818fd439bbb261b98e04d16ce7ecc73df82a563d48406"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.parseShellHeredocDelimiter (cognitive 41): codex-native-hook.parseShellHeredocDelimiter has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 14, loops 2, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8649}}}],"partialFingerprints":{"codehealthFindingId/v1":"858e7bfb840b29aafcada5a71a3c04217f92bc30690ed389aa9a464bec4f7eb1"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isPositivelyClassifiedRgCommand (cognitive 41): codex-native-hook.isPositivelyClassifiedRgCommand has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 8, ternaries 1 (3 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12558}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15570015784e8f7a4e52777a2412fb53bbe36d6189d6386aef01808cb0da29f"}},{"ruleId":"D2","level":"warning","message":{"text":"base.updateModeStateUnderCanonicalLock (cognitive 40): base.updateModeStateUnderCanonicalLock has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (21 pts), ternaries 6 (12 pts), boolean chains 7 (nesting depth added 12). Of this number, 39 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":"src/modes/base.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e925c1cf475d178b1bd53566322e67028bbb21a3da56e64ee6ad4f5c22fdd8cf"}},{"ruleId":"D2","level":"warning","message":{"text":"triage-heuristic.triagePrompt (cognitive 40): triage-heuristic.triagePrompt has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 14, loops 5 (6 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/triage-heuristic.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5afc17bb474936bb39625f18d27131992ceea8e3b5fb6a436978bed25af5cd"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.decideWindowsNativeHookShimReference (cognitive 40): setup.decideWindowsNativeHookShimReference has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 4 (10 pts), boolean chains 2, ternaries 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b72b7038aaae0eaa8eab132946c200a2e0b2ab2282973417cb4bc66f090dfb1"}},{"ruleId":"D2","level":"warning","message":{"text":"performance-goal.performanceGoalCommand (cognitive 40): performance-goal.performanceGoalCommand has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (34 pts), boolean chains 3, ternaries 1 (2 pts), error handling 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/cli/performance-goal.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02430bcafbfeee529dd08d3a68338084fdc7dc0e77b388cc64d4cc424e2d94f"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.terminalizeExactWorkflowSessionForHookCancel (cognitive 40): codex-native-hook.terminalizeExactWorkflowSessionForHookCancel has cognitive complexity 40 (threshold 15). Drivers by points: error handling 10 (13 pts), if/else 10 (11 pts), boolean chains 8, loops 3 (5 pts), ternaries 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":4070}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fe40b212fb35308e4017a08b728f755fa7744f94d83dd5c912dc403b1dde95"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.curlUrlGlobCaptureValues (cognitive 40): codex-native-hook.curlUrlGlobCaptureValues has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 9, ternaries 2 (3 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14578}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6d95e49833d0093440f2f70adbaa7ebaee9b1acdd831bd12199819e2a50aa9"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectConductorFiniteDestinationLeaves (cognitive 40): codex-native-hook.collectConductorFiniteDestinationLeaves has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (17 pts), ternaries 8 (12 pts), boolean chains 8, error handling 3 (nesting depth added 7). Of this number, 23 points are the body\u0027s own statements and 17 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15598}}}],"partialFingerprints":{"codehealthFindingId/v1":"559b93b207ce8b1daeaddf7c472578c2c0d0a24ec5f4984d673cd975f42aa5b1"}},{"ruleId":"D2","level":"warning","message":{"text":"index.notifyLifecycle (cognitive 40): index.notifyLifecycle has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 16, if/else 12 (15 pts), ternaries 3 (4 pts), error handling 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/notifications/index.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"51169aba69f1f4684d22bf502107985ea6898c7bd3738fa814f3b102f1c49be7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.prepareRuntimeCodexHomeForProjectLaunch (cognitive 40): index.prepareRuntimeCodexHomeForProjectLaunch has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 3 (5 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/cli/index.ts"},"region":{"startLine":2142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff47633b83d39e087855be5bcea783d9271f13875197be4b95e8da9eadd0467"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime-cli.main (cognitive 40): runtime-cli.main has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (26 pts), error handling 6 (9 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 11). Of this number, 30 points are the body\u0027s own statements and 10 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":"src/team/runtime-cli.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3c86774f37be887a97929635ec9173733492cbcc336db224791aa4aac7c40b"}},{"ruleId":"D2","level":"warning","message":{"text":"openclaw.observeOpenClaw (cognitive 39): openclaw.observeOpenClaw has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 8 (20 pts), if/else 4 (10 pts), boolean chains 5, loops 2 (4 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/adapt/openclaw.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d82e6b83556041087080c5e476d574183611fcc44f5c2227fcbb89f369e3cc"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.decodedPosixCommandWords (cognitive 39): codex-hooks.decodedPosixCommandWords has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 5, loops 1 (nesting depth added 14). Of this number, 38 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":"src/config/codex-hooks.ts"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d27287a64b8bef5bb2305e0ff0174a8c81ddbb18f2f149fbaf297b8a22c3490"}},{"ruleId":"D2","level":"warning","message":{"text":"state.readDispatchRequests (cognitive 39): state.readDispatchRequests has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 6 (12 pts), boolean chains 8, error handling 1, loops 1 (nesting depth added 10). Of this number, 30 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":"src/team/state.ts"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c4eabe22fdea660e8bb542e6c4c8043edd2479ff2c4e3f37e09a03e07857d1"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.analyzeOmxSeededBehavioralDefaults (cognitive 39): generator.analyzeOmxSeededBehavioralDefaults has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 7 (14 pts), boolean chains 13, if/else 9 (11 pts), loops 1 (nesting depth added 9). Of this number, 22 points are the body\u0027s own statements and 17 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":"src/config/generator.ts"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea73999a0cfe2396c1b3260f3df847af65a3c391b1a9c3fe8cd3c3bd8bc2cf30"}},{"ruleId":"D2","level":"warning","message":{"text":"state.runGit (cognitive 39): state.runGit has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (37 pts), error handling 1 (2 pts) (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/state.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf12e3d22e20d3450f86759244e154dde3aa147f308eb1b425828eba88f415af"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.terminateExactPaneProcessTree (cognitive 39): runtime.terminateExactPaneProcessTree has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 8, loops 2 (nesting depth added 11). Of this number, 37 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":2981}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebf702f5572cb4f816dc87b5753c6d8c40e132cf2b53a9f48b3b8f1351c7db6"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.discoverOmxPluginCacheDirs (cognitive 39): plugin-marketplace.discoverOmxPluginCacheDirs has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 4, error handling 3 (4 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"07be94a86933e67a7348b034b97c441a04e80906702977a1aaef867d78ff3262"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.atomicReplaceFile (cognitive 39): uninstall.atomicReplaceFile has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 5 (11 pts), boolean chains 8, error handling 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.ts"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"119af03ac765546d6134e1cca96e542a61c0c4ca4f2bd3d0d7c1ae2589e3d42b"}},{"ruleId":"D2","level":"warning","message":{"text":"state.stateCommand (cognitive 39): state.stateCommand has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 2, error handling 1 (2 pts), loops 1, ternaries 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/cli/state.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1165bbc47e106ed97c851a152a399caee49a52faf7ff77636bf795823b224e3c"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.commandConfiguresNodeOptions (cognitive 39): codex-native-hook.commandConfiguresNodeOptions has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 8, loops 4 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12670}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb1ff4af64d806e0e331d1f91b29dadedf8477e614345c6a52185551262664f"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectConductorSafeReferenceControlTargets (cognitive 39): codex-native-hook.collectConductorSafeReferenceControlTargets has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 9, error handling 1 (2 pts), loops 2, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7323bd802849a916a5ed166be3bcfba9c08e66007cbc3a554177a6223c867c2"}},{"ruleId":"D2","level":"warning","message":{"text":"suite.validateRunRecords (cognitive 39): suite.validateRunRecords has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 9, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/evals/astra-defaults/suite.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6991799d6d6c2a17f53b31e08aaaca604d7e4aa1a56436952bd4499ade9cc1"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeEngine::load (cognitive 39): RuntimeEngine::load has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 4 (7 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime-core/src/engine.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82ddf615e291feb723eef9b835adf8764c2765f991240b86870701a983d8d5b"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.tokenizePowerShellCommand (cognitive 38): codex-hooks.tokenizePowerShellCommand has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 4, loops 1, ternaries 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/config/codex-hooks.ts"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"345a20d826324e0167df648454a670a95006f4e84eed5463e67cdbf346afae5b"}},{"ruleId":"D2","level":"warning","message":{"text":"policy.validateNativeReleaseManifest (cognitive 38): policy.validateNativeReleaseManifest has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 12, error handling 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/native-assets/policy.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e383f68bd6144d7cc1f2861419e137ea38d3e1be4582ecde6bfa766d9599b21a"}},{"ruleId":"D2","level":"warning","message":{"text":"tasks.transitionTaskStatus (cognitive 38): tasks.transitionTaskStatus has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14, ternaries 10 (13 pts), boolean chains 9, error handling 1 (2 pts) (nesting depth added 4). Most of this is not in the body itself: 6 of the 38 points are its own statements and the rest belongs to one function literal inside it that branches (line 205). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/tasks.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3530a20008d6ac06e37f40b8927fa83be94615ad746f012720f7801e6ced33f7"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-hook-engine.evaluateInjectionGuards (cognitive 38): tmux-hook-engine.evaluateInjectionGuards has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 9 (17 pts), if/else 9 (11 pts), boolean chains 10 (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/scripts/tmux-hook-engine.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"633c4c7b94a373a4472ac496d98aadc9de3f3e197c1f4d3f77c1bb4f85f7d108"}},{"ruleId":"D2","level":"warning","message":{"text":"team.resolveApprovedTeamFollowupContext (cognitive 38): team.resolveApprovedTeamFollowupContext has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 12 (18 pts), if/else 11 (17 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":"src/cli/team.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a7295b5be5873c84dfa00e68870ef10f3b1e17c2800aa92375175eecaa11a1"}},{"ruleId":"D2","level":"warning","message":{"text":"question.questionCommand (cognitive 38): question.questionCommand has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (19 pts), ternaries 4 (8 pts), error handling 4 (6 pts), boolean chains 5 (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/cli/question.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"213f3b481281094c4b4b61043c3ee9cae529821eab08b5af39a34e10d77acd29"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-pre-post.commandInvokesOmxQuestion (cognitive 38): codex-native-pre-post.commandInvokesOmxQuestion has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (20 pts), boolean chains 10, loops 4 (8 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-pre-post.ts"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22bb19032eae80bc96e7d19bea9af7c63cdebaf074712cf02e5ba59b1f22dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.extractEnvSplitStringCommand (cognitive 38): codex-native-hook.extractEnvSplitStringCommand has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 3 (9 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6967}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e0e94bbcff60d0f0e2206a594ca2b4470899357b88f233e7aaa43abfd45aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.splitStateScanSegments (cognitive 38): codex-native-hook.splitStateScanSegments has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 14). Of this number, 37 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7874}}}],"partialFingerprints":{"codehealthFindingId/v1":"66633bcad9acb763b9b4aa639728c5a98f7cea88748963bde067e520a6bfa36f"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isStructuredUltragoalSteeringShellCommand (cognitive 38): codex-native-hook.isStructuredUltragoalSteeringShellCommand has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (28 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2df2522b5c47496b684ee808f74f6300d0ba5e9d607e5c2c127f104b837453"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.tokenizeConductorShellWords (cognitive 38): codex-native-hook.tokenizeConductorShellWords has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 13, loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16022}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edf867abdf43323070da1acf959d5fe35ca1e4df072d5522b821d9bdb650560"}},{"ruleId":"D2","level":"warning","message":{"text":"session.writeSessionEnd (cognitive 37): session.writeSessionEnd has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 11 (12 pts), boolean chains 7, error handling 5 (6 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":3808}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8513f30ece6238382e0460ea3ee6dec513e433c27dad5f21adb8a95e47ed76d"}},{"ruleId":"D2","level":"warning","message":{"text":"session-search.parseSessionFrictionArgs (cognitive 37): session-search.parseSessionFrictionArgs has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (34 pts), boolean chains 2, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/session-search.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be5087aedb2817415f151a7af834a32f85864d29fc2a6ca504278d731df0a65"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.downloaderHasUnsafeTlsKeyLogEnvironment (cognitive 37): codex-native-hook.downloaderHasUnsafeTlsKeyLogEnvironment has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 4 (14 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14458}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3a6b5e4efbf8539329de37710118ae68066cae87ecd08d91b03d6e490408d3"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorResolvedPackageCliCandidateIsTrusted (cognitive 37): codex-native-hook.conductorResolvedPackageCliCandidateIsTrusted has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (20 pts), error handling 4 (10 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17994}}}],"partialFingerprints":{"codehealthFindingId/v1":"635089ef83e7d9a9273cb2735c40da5fc63909d284888535217da4324a6c1886"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectProcessSubstitutionExpansionPrefix (cognitive 37): codex-native-hook.collectProcessSubstitutionExpansionPrefix has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 11, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19444}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e3f0ad9620653ec503cb370192926b16aca8f4fae9af668b0908ef30e0b092"}},{"ruleId":"D2","level":"warning","message":{"text":"smoke-packed-install.assertInstalledPluginSurface (cognitive 37): smoke-packed-install.assertInstalledPluginSurface has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 6 (9 pts), boolean chains 7 (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/scripts/smoke-packed-install.ts"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74d03a19f87f20ecdc6fcee4f1f750b86221fe7dee4874c867fa04232a36533"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.extractCustomizedTuiSectionsFromOmxBlocks (cognitive 36): generator.extractCustomizedTuiSectionsFromOmxBlocks has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":3573}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffd0d5a392d99956f1ee45543c0b82b5db72e5705f10ff65cfe34c60437e020"}},{"ruleId":"D2","level":"warning","message":{"text":"artifacts.validateQualityGate (cognitive 36): artifacts.validateQualityGate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 12, error handling 1 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ultragoal/artifacts.ts"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebf83ade36b2bf537051a2034bdc875e6254f525acf2ab43904bb4f8f106aef"}},{"ruleId":"D2","level":"warning","message":{"text":"sparkshell.parseSparkShellFallbackInvocation (cognitive 36): sparkshell.parseSparkShellFallbackInvocation has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (31 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 14). Of this number, 35 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/cli/sparkshell.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"149db9ad0901fef675f937433c9142c599c420adcb6195a0e351fcb207762968"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.directCandidateIndexes (cognitive 36): keyword-detector.directCandidateIndexes has cognitive complexity 36 (threshold 15). Drivers by points: if/else 31 (57 pts), boolean chains 18, loops 8 (12 pts), ternaries 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (keyword-detector.directCandidateIndexes::addBlock) 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":"src/hooks/keyword-detector.ts"},"region":{"startLine":2790}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d5ee5d29f4650f87732285f8f283dc8be129a93042c3599c31fcca2954cb72"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-pre-post.tokenizeShellCommand (cognitive 36): codex-native-pre-post.tokenizeShellCommand has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 2, loops 1, ternaries 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/scripts/codex-native-pre-post.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a210a299dcbafbcf130ac0ed4021eb19e13897794d2bb0f965dfaaaa5b280b"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-pre-post.findGitCommandTokenIndex (cognitive 36): codex-native-pre-post.findGitCommandTokenIndex has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 5 (11 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/scripts/codex-native-pre-post.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed1bb278f4f40db4c738c94d0f400f34cbd267b24f4d364fbcbb8b13d5cfc79"}},{"ruleId":"D2","level":"warning","message":{"text":"worktree.ensureWorktree (cognitive 35): worktree.ensureWorktree has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 8, ternaries 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worktree.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e437632cd1e02642288843c88c8cfbf7d2e5bd79eeb8d3000016fb65b01d584"}},{"ruleId":"D2","level":"warning","message":{"text":"worktree.rollbackProvisionedWorktrees (cognitive 35): worktree.rollbackProvisionedWorktrees has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 3 (8 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 16). 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":"src/team/worktree.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc1fcdb4ec682b705393ba5f9a915ff6d10c1a08ed0b3511650a66c4b8e9df3"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.inventoryProjectTrustPayload (cognitive 35): generator.inventoryProjectTrustPayload has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 8, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"789c0e26447654e7d3c7535142cd7c7edb6afc1936282199ff2891557bba18d4"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.deliverPendingMailboxMessages (cognitive 35): runtime.deliverPendingMailboxMessages has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 7 (10 pts), boolean chains 5 (nesting depth added 13). Most of this is not in the body itself: 8 of the 35 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 6927, 6959). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6911}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0c278d76fb71f69ab4fc09e3bf9892e277d69b7a68924bcbe73b4931e5dd05"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.removeChild (cognitive 35): plugin-marketplace.removeChild has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 7, error handling 2 (3 pts) (nesting depth added 12). Of this number, 28 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"972f5a081efe645c74a3cfa1ad590b0cc44952b6237d7ff611bff38233afdbbe"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.getPinnedLauncherIncompatibilityReason (cognitive 35): plugin-marketplace.getPinnedLauncherIncompatibilityReason has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 8, error handling 4 (5 pts), ternaries 1 (2 pts) (nesting depth added 6). 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: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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/cli/plugin-marketplace.ts"},"region":{"startLine":3576}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab708ab5c49a3d91d0b7846bb214efa120cc1a910b21e60ffc1c78f6f250542a"}},{"ruleId":"D2","level":"warning","message":{"text":"managed-tmux.resolveManagedSessionContext (cognitive 35): managed-tmux.resolveManagedSessionContext has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 12, ternaries 4 (6 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/managed-tmux.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdee1b0e9222b82f083fc4fdce9aaca29b33cc5d366658e677c03b5124e13c7"}},{"ruleId":"D2","level":"warning","message":{"text":"auto-nudge.resolveNudgePaneTarget (cognitive 35): auto-nudge.resolveNudgePaneTarget has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (20 pts), ternaries 4 (6 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2afb13c7c98ae82e2ad9be00ce6261206b35ca8792342c1dca7de05124b3f9"}},{"ruleId":"D2","level":"warning","message":{"text":"team-worker.maybeNotifyLeaderAllWorkersIdle (cognitive 35): team-worker.maybeNotifyLeaderAllWorkersIdle has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 13, ternaries 4 (5 pts), error handling 2 (nesting depth added 3). Of this number, 33 points are the body\u0027s own statements and 2 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":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"1221ebf9b0e75a0fdf4d5d6d1ab08166d4fe7bb34bc640bf0d86121597ef5c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.pythonCommandHasOnlySafeOptions (cognitive 35): codex-native-hook.pythonCommandHasOnlySafeOptions has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 5, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6241}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b923367e73ea8daa8199e9c2d5d00ad5110a314aa382a791a9dd2fd7d45ecf"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.maskShellNonCommandExpansionsForConductorScan (cognitive 35): codex-native-hook.maskShellNonCommandExpansionsForConductorScan has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 5 (13 pts), boolean chains 7, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8933}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c75c7e4c1e0f9172b212502c89e747b2f45b3aa4dce29a253245bf1d3e1d7a6"}},{"ruleId":"D2","level":"warning","message":{"text":"report.renderReport (cognitive 35): report.renderReport has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 9 (12 pts), ternaries 4 (8 pts), boolean chains 2 (nesting depth added 10). 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":"src/evals/astra-defaults/report.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"31911c6dc314e7b96114edb4a35099d10ecdfc82bb76af13a5e99bd6f030bb42"}},{"ruleId":"D2","level":"warning","message":{"text":"hasLivePinForDelegate (cognitive 35): hasLivePinForDelegate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 8, error handling 4 (6 pts), ternaries 1 (2 pts), loops 1, other 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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c17ac8e22c1d9d7f026682a0fd960dd049b612b62b7810327bddd4263501ce"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.repairPersistedRootIdentityInState (cognitive 34): tracker.repairPersistedRootIdentityInState has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (25 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b8322990eb6626a2a199704d146d79a8f3542b20d1794a97e658b8f2a2d447"}},{"ruleId":"D2","level":"warning","message":{"text":"renderer.launchQuestionRenderer (cognitive 34): renderer.launchQuestionRenderer has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 10 (13 pts), boolean chains 7 (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/question/renderer.ts"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd25fed08a1c75596b0c1250feb31bb5be5e139d80d2f4f1102d580159996a9f"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-session.waitForWorkerReadyDetailedAsync (cognitive 34): tmux-session.waitForWorkerReadyDetailedAsync has cognitive complexity 34 (threshold 15). Drivers by points: if/else 23 (32 pts), boolean chains 1, loops 1 (nesting depth added 9). Of this number, 20 points are the body\u0027s own statements and 14 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":"src/team/tmux-session.ts"},"region":{"startLine":3653}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a82defef0719344926565672e215655a2df94116c7ec6f5c87a99b9f8b726c4"}},{"ruleId":"D2","level":"warning","message":{"text":"role-router.routeTaskToRole (cognitive 34): role-router.routeTaskToRole has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (26 pts), ternaries 2 (4 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/team/role-router.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c089143f16c5c28a8bb63a9f50a0f7de74772fb231eadc8d9a9fff5d162acf9"}},{"ruleId":"D2","level":"warning","message":{"text":"wiki-server.handleWikiToolCallWithOptions (cognitive 34): wiki-server.handleWikiToolCallWithOptions has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 8 (16 pts), boolean chains 8, if/else 4 (8 pts), error handling 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/wiki-server.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"828dd6058f7884ae63f6d906054b0ddabf8b276ee7b2247976d7ce63da85372e"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.repairStateProjections (cognitive 34): doctor.repairStateProjections has cognitive complexity 34 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 4 (9 pts), error handling 3 (6 pts), loops 3 (4 pts), boolean chains 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":"src/cli/doctor.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc89275dfd7d6036b27f5b4f9edfbcdae020293008c54da91ebd7e8608be6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.assertManagedDestination (cognitive 34): setup.assertManagedDestination has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (4 pts), error handling 1 (3 pts), boolean chains 2, ternaries 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/cli/setup.ts"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aba480d9ce50eed90f2dd316d880895e0d9301dede60ec425008081defb8bc1"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.findRootTomlKeyRange (cognitive 34): setup.findRootTomlKeyRange has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (20 pts), ternaries 2 (9 pts), boolean chains 4, loops 1 (nesting depth added 19). 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/cli/setup.ts"},"region":{"startLine":3664}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68da2f4a092a13695fd94615f1874f19ada0fff2d75d37c2d0df8869ca0aee4"}},{"ruleId":"D2","level":"warning","message":{"text":"team.parseTeamApiArgs (cognitive 34): team.parseTeamApiArgs has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 2 (8 pts), error handling 2 (6 pts), boolean chains 3, 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/cli/team.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9b80f2d4ebc3929af9807b3fa0b3b89db5c537d5e1ef13045227d68bdd36af"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.collectQuoteRanges (cognitive 34): keyword-detector.collectQuoteRanges has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 9, 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/hooks/keyword-detector.ts"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d31117f1cf31b0b72b36954563bc05dc0771b08aee2920817997b1588eb060"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.recoverStaleDeadStopTranscriptSession (cognitive 34): codex-native-hook.recoverStaleDeadStopTranscriptSession has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 8, error handling 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":4493}}}],"partialFingerprints":{"codehealthFindingId/v1":"23148c3fe3c53a3bf0cd335424ded6d01ab1fade3a72f65ea930f34a8360ed8c"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.extractPackageManagerExecCommand (cognitive 34): codex-native-hook.extractPackageManagerExecCommand has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 9, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6998}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfd889eb2559d005abbd2b3c4e96bafa050dc5759d91e7af86d3c3fa7d668b0"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.hasUnsafeConductorArithmeticCommand (cognitive 34): codex-native-hook.hasUnsafeConductorArithmeticCommand has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 8, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8781}}}],"partialFingerprints":{"codehealthFindingId/v1":"4431f2a5294f615c389cbbf2b213b5b2150e66d443336644451179b27b581fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.applyNestedShellEnvironment (cognitive 34): codex-native-hook.applyNestedShellEnvironment has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (19 pts), ternaries 3 (9 pts), boolean chains 5, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18572}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1020e9a95d40d7389c9638d3c7cf055afef2aa83dfee7c905c149e99e20844"}},{"ruleId":"D2","level":"warning","message":{"text":"index.main (cognitive 34): index.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (18 pts), ternaries 3 (7 pts), boolean chains 5, error handling 2 (3 pts), match/switch 1 (nesting depth added 10). Of this number, 32 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":"src/cli/index.ts"},"region":{"startLine":5072}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28ef8386218e4d489726a5f51e0e33e32bdc89ee9a0226608d47ba5359e8623"}},{"ruleId":"D2","level":"warning","message":{"text":"index.showStatus (cognitive 34): index.showStatus has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 5, error handling 3 (5 pts), loops 2, ternaries 1 (2 pts) (nesting depth added 11). Of this number, 27 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":5423}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea9a31480fd07b2ec1a386e7cf472a92a77676572876a43a61175cc2528044d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.runCodex::launchDetachedSession::bootstrapLeader (cognitive 34): index.runCodex::launchDetachedSession::bootstrapLeader has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 3 (5 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (index.runCodex) 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":"src/cli/index.ts"},"region":{"startLine":8418}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f6fd76d68f1b2acf47468037d6ebe9b06bcc2cec57c636efb5563ad78bac40"}},{"ruleId":"D2","level":"warning","message":{"text":"omx_runtime::run (cognitive 34): omx_runtime::run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime/src/main.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f92a9f9adfa6db55f8a1f3f450f21ab53e51e324673ceb31aa81bce1f96a05"}},{"ruleId":"D2","level":"warning","message":{"text":"artifacts.readApprovedExecutionLaunchHintOutcome (cognitive 33): artifacts.readApprovedExecutionLaunchHintOutcome has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 5 (9 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/planning/artifacts.ts"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7141ac17d0e1cfef4bd2166c6677021092219df149a0f10505f0afe76d392c9"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.tokenizeWindowsDirectCommand (cognitive 33): codex-hooks.tokenizeWindowsDirectCommand has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 4, loops 2 (4 pts), ternaries 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/config/codex-hooks.ts"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"f425817079d98a120c8c91e9c1d22046df637b77e4103138a76b879d02afaccf"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt-session-provenance.evaluateResolvedPromptTurn (cognitive 33): prompt-session-provenance.evaluateResolvedPromptTurn has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 7, ternaries 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/prompt-session-provenance.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9672dec9d3071e0c894bd1d4bf84454c3640532ac18d6a580a463589c315a15"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.migrateManagedCodexHookTrustStateCoordinates (cognitive 33): generator.migrateManagedCodexHookTrustStateCoordinates has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 6, loops 3, ternaries 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/config/generator.ts"},"region":{"startLine":2520}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee18b432f259691d989a0be983c0f1924c6decb0e224bf5192edeb9cfd301557"}},{"ruleId":"D2","level":"warning","message":{"text":"documented-leader-preflight.darwinPinned (cognitive 33): documented-leader-preflight.darwinPinned has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 10, ternaries 4 (5 pts), error handling 1 (2 pts), loops 2 (nesting depth added 4). None of this is in the body itself: all 33 points belong to 7 function literals inside it that branch (lines 128, 115, 104, \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":"src/ralplan/documented-leader-preflight.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"941b57b04ecd86f631e35334a3b77e1f130bfefb1bd72dcbbe923cf3a9ee3f77"}},{"ruleId":"D2","level":"warning","message":{"text":"session-status.readRelevantSkillState (cognitive 33): session-status.readRelevantSkillState has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 7 (14 pts), boolean chains 12, if/else 3 (6 pts), loops 1 (nesting depth added 10). Of this number, 30 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/session-status.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4088169aa7acdf4a5ed27d325c1d59a0292c2748813da93599bb6568f3bd5e91"}},{"ruleId":"D2","level":"warning","message":{"text":"quality-gates.validateAllQualityGates (cognitive 33): quality-gates.validateAllQualityGates has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/quality-gates.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a38e04b8788f26f7f7b020d50c9b4bb0634248d32485e0e88ca0363f5c5c311"}},{"ruleId":"D2","level":"warning","message":{"text":"leader-activity.tryReadGitValue (cognitive 33): leader-activity.tryReadGitValue has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (26 pts), error handling 2 (6 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/team/leader-activity.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd210d31d96bcb106b5694d30991308b994368156de9c332e574f07e723de006"}},{"ruleId":"D2","level":"warning","message":{"text":"team.parseTeamArgs (cognitive 33): team.parseTeamArgs has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 9 (12 pts), boolean chains 9 (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/cli/team.ts"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3671b3c086010424107d76b16e6274adf61f1963814bf74841ef3034e2ff03"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.sliceShellWordsTailPreservingQuoting (cognitive 33): codex-native-hook.sliceShellWordsTailPreservingQuoting has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 4, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7221}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a0c857621599abdbf15d4ec7884dc59aba9889c04be19f99ca3b8814c76f32"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isPositivelyClassifiedUniqCommand (cognitive 33): codex-native-hook.isPositivelyClassifiedUniqCommand has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 7, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12529}}}],"partialFingerprints":{"codehealthFindingId/v1":"8285fa1f8fdc02ad664d8611f7439e7010a72030934d40139ff51fe58bbdbad1"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isPositivelyClassifiedSedCommand (cognitive 33): codex-native-hook.isPositivelyClassifiedSedCommand has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 8, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12632}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af5a9a57c4cf8634e77de24b573cb204032323742ba64eceb8b1188eb7be113"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.commandMayPopulateSensitiveRuntimeEnvironment (cognitive 33): codex-native-hook.commandMayPopulateSensitiveRuntimeEnvironment has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (26 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 18). Of this number, 31 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12867}}}],"partialFingerprints":{"codehealthFindingId/v1":"793c7254c9c79de734fa90a57bb7f04158eff20810907955b36da00f9d0a2742"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectConductorBoundedDdTargets (cognitive 33): codex-native-hook.collectConductorBoundedDdTargets has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15656}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42650100bb968d46dd3b7c9ca81331f08bddaaad017efc09e8840029a63b226"}},{"ruleId":"D2","level":"warning","message":{"text":"native-assets.validateDescendant (cognitive 32): native-assets.validateDescendant has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 6, error handling 3 (6 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/native-assets.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"72623ee3f7b79c98d842be9947d880e9da6f1c60da612822bf89ca226144a0cc"}},{"ruleId":"D2","level":"warning","message":{"text":"mailbox.readLegacyMailboxMessageIds (cognitive 32): mailbox.readLegacyMailboxMessageIds has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 5 (7 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 12). Of this number, 31 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/team/state/mailbox.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"706cfca7f4937b9cdf869b88d7866e2669d2edf2fe1c0859d1cf30416721a841"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatch.normalizeDispatchRequest (cognitive 32): dispatch.normalizeDispatchRequest has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 16, boolean chains 13, if/else 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/dispatch.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d686a0aac73bcb09e2d3c1706496ef882b3d26a8bd567f7e5e7ab53f4a97905d"}},{"ruleId":"D2","level":"warning","message":{"text":"state.commitTeamMembershipTaskTransaction (cognitive 32): state.commitTeamMembershipTaskTransaction has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 5 (9 pts), error handling 3 (6 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9bc31a22d3a695f8432421b50d5ed6bdd1cd76e504a1b690e844af270dad20"}},{"ruleId":"D2","level":"warning","message":{"text":"contract.validateAndNormalizeRalphState (cognitive 32): contract.validateAndNormalizeRalphState has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 5 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralph/contract.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c6f1ac7ba953e8645159f5f63939c81f1d424cc5e22d28d11803b46b210569"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux.createHudWatchPane (cognitive 32): tmux.createHudWatchPane has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (18 pts), ternaries 7, boolean chains 6, error handling 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/hud/tmux.ts"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bdc016abf3b65f26bcd8d11e70e2cb5bc39d029ad1e9e2df64327fa52e15b2"}},{"ruleId":"D2","level":"warning","message":{"text":"state.validateAnswerAgainstQuestion (cognitive 32): state.validateAnswerAgainstQuestion has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 5, ternaries 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/question/state.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a5a299a179affab8ba84a74c4dfb0c29d6e1b8ed8166b7d3193f88d646f70b"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap.autoStartStdioMcpServer (cognitive 32): bootstrap.autoStartStdioMcpServer has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (20 pts), ternaries 6 (8 pts), boolean chains 2, error handling 2 (nesting depth added 4). Most of this is not in the body itself: 6 of the 32 points are its own statements and the rest belongs to 6 function items inside it that branch (runDuplicateSiblingWatchdog, stopDuplicateSiblingWatchdog, logLifecycle, \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/mcp/bootstrap.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ca4af2c04b1706396b6c5ba4d356a2492ecc360279de8407ec90a26750102e"}},{"ruleId":"D2","level":"warning","message":{"text":"model-contract.tokenizeWorkerLaunchArgs (cognitive 32): model-contract.tokenizeWorkerLaunchArgs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/model-contract.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3ad1ca9a9c0af537f147ac830b65ed1ec12043d99db0487f9f180e6576f830"}},{"ruleId":"D2","level":"warning","message":{"text":"render.renderTeamWorkers (cognitive 32): render.renderTeamWorkers has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 9, ternaries 7 (8 pts), loops 2 (5 pts) (nesting depth added 8). Most of this is not in the body itself: 15 of the 32 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 215, 252, 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":"src/hud/render.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf189a66b07b10b3ee53186134e576c062e5bcf8aedbcc6508fd9ba59640b6a"}},{"ruleId":"D2","level":"warning","message":{"text":"agents-init.agentsInit (cognitive 32): agents-init.agentsInit has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 8 (21 pts), boolean chains 5, if/else 4 (5 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/agents-init.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5d50a995a7b148ab99d698b2807e9c491d3cd77e3d76567094685089424403"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.checkSparkRouting (cognitive 32): doctor.checkSparkRouting has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 3 (9 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":4030}}}],"partialFingerprints":{"codehealthFindingId/v1":"918c0b094bba7059103190d1d83c3bfbb8ec6609b5210747cadf0e62c21ec4e9"}},{"ruleId":"D2","level":"warning","message":{"text":"ralplan.parseRoleIntentWriteArgs (cognitive 32): ralplan.parseRoleIntentWriteArgs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 2, ternaries 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/ralplan.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9fc488a545f32116b930607ebd8fc675637174c2462d90b30bdfe01fe030cc"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.classifyKeywordInput (cognitive 32): keyword-detector.classifyKeywordInput has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 6 (10 pts), boolean chains 3, loops 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":3474}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbaa0db2d3c8e31872ee517d87ad0b7d7d6449a328e347fbbe3ca2408fb0774"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.resolveTeamWorkerStopDecision (cognitive 32): codex-native-hook.resolveTeamWorkerStopDecision has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 3 (4 pts), boolean chains 3, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2963}}}],"partialFingerprints":{"codehealthFindingId/v1":"0535b398e36f0300ce94c568de849325251962a498c4bccdcb4ccf6e3e52750f"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.maskQuotedRedirectMetacharsForCommandScan (cognitive 32): codex-native-hook.maskQuotedRedirectMetacharsForCommandScan has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 6, ternaries 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5064}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ec38535b30205d9f25e723f8788f76627103a3c5068e4e11f616241976ce88"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.resolveStateWriteInputFileCwd (cognitive 32): codex-native-hook.resolveStateWriteInputFileCwd has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 9, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5917}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a5b3904162431219b1f83787b93b6dcadbb187a03106ce70b673ca353dbe99"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findCaseArmCommandIndex (cognitive 32): codex-native-hook.findCaseArmCommandIndex has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7640}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f014ca6388824027b187eabe069d7cbd6b4c8422412cf068bdfd3539878f6c8"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isAllowedOmxSessionLockInspectCommand (cognitive 32): codex-native-hook.isAllowedOmxSessionLockInspectCommand has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 4, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10059}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1a65f576b1ef407a954e5b919d338404849b1fc49d67a35708778053a29cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.gitConfigTextHasExecutableStatusSurface (cognitive 32): codex-native-hook.gitConfigTextHasExecutableStatusSurface has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 6, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12015}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc0b1bdfd2c1078d2657236f6696ace05d32b28c71500f0f84a7aab972962f3"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorCommandPrefixPreservesInheritedResolution (cognitive 32): codex-native-hook.conductorCommandPrefixPreservesInheritedResolution has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (20 pts), error handling 3 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17702}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3c7f6a2c7cccbe89e26d1aa3a47e11ee19b246ca89ab37227adbe037dc199c"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findConductorIsolatedFunctionDefinitionRegion (cognitive 32): codex-native-hook.findConductorIsolatedFunctionDefinitionRegion has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 6, ternaries 2 (5 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca5c40901c5b716b3f6a1807865d90640aa88f6736872d717a6661d663d77ab"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectLexicalProcessSubstitutions (cognitive 32): codex-native-hook.collectLexicalProcessSubstitutions has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 7, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19549}}}],"partialFingerprints":{"codehealthFindingId/v1":"f121307f574c8e50ce39d7da275b7a12e7ab13591ca2084c7b2a8ebf1c68c77e"}},{"ruleId":"D2","level":"warning","message":{"text":"artifacts.selectLaunchHintMatch (cognitive 31): artifacts.selectLaunchHintMatch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 3 (5 pts), boolean chains 4 (nesting depth added 10). Most of this is not in the body itself: 12 of the 31 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 503, 471, 488). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/planning/artifacts.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3499a5f6cba5cde4f2acc80c97ba9bca9815c518fb5de9427b4e05ad85352d7"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.pruneRemovedManagedEventProperties (cognitive 31): codex-hooks.pruneRemovedManagedEventProperties has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 3 (10 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":2382}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2904035ece4553f9bcfb16ecb8a732bae48750c2bc819443fab283724b3897d"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.planManagedCodexHooksMerge (cognitive 31): codex-hooks.planManagedCodexHooksMerge has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 4, loops 3 (4 pts), error handling 2, ternaries 1 (2 pts) (nesting depth added 6). Of this number, 28 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":2713}}}],"partialFingerprints":{"codehealthFindingId/v1":"488e5116b6971678dc92843e0133194cdd6f3ff90e7125b0eaa8b364252eb182"}},{"ruleId":"D2","level":"warning","message":{"text":"operations.listStateStatuses (cognitive 31): operations.listStateStatuses has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 7, error handling 1 (3 pts), loops 2 (3 pts), ternaries 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/state/operations.ts"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"6645cb04d69341f2a4705a1269be5d980770078c64aa08b708d6058b15daadc0"}},{"ruleId":"D2","level":"warning","message":{"text":"lifecycle.feedProjectMemory (cognitive 31): lifecycle.feedProjectMemory has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (7 pts), boolean chains 6, loops 3 (5 pts), error handling 1 (nesting depth added 11). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lifecycle.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c03bf7d33a6f6f4e1e2a34572e0dcd28f18befd912b38749742f78160c356c"}},{"ruleId":"D2","level":"warning","message":{"text":"session-export.parseSessionExportArgs (cognitive 31): session-export.parseSessionExportArgs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/session-export.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"22531096ab87fd1652065673287c7ada611e51b08716b9a97dffd97fdf58afca"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.commandHasDestructiveGitSubcommand (cognitive 31): codex-native-hook.commandHasDestructiveGitSubcommand has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0eda8563aed842bcf1b829168b00aabee6876fc62b42cc232fcb405a647a520"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findShellFunctionBodyEnd (cognitive 31): codex-native-hook.findShellFunctionBodyEnd has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 6, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6004}}}],"partialFingerprints":{"codehealthFindingId/v1":"354dc8af28129da16cff69286603323f8d346224f70b3ecd3877a2f38029a1a8"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectConductorCoprocCompoundBodies (cognitive 31): codex-native-hook.collectConductorCoprocCompoundBodies has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (9 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12949}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad54d19edc7d677287e735de566cd4d16153591ee0ca5663d9924b9fd2dcb627"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorMutationOptionValueWordCount (cognitive 31): codex-native-hook.conductorMutationOptionValueWordCount has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 8, boolean chains 7 (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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15539}}}],"partialFingerprints":{"codehealthFindingId/v1":"574eeecb24904745735fe5802d96818fb3c3f36ed82e8abad6b4b2732bb8db52"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectConductorBoundedTruncateTargets (cognitive 31): codex-native-hook.collectConductorBoundedTruncateTargets has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 10, loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15688}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bb492553d5a0c2f43b6290077fd0a44c6a507ca5582c02cb6921c57232343a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorPackageCliHasTrustedNodeInterpreter (cognitive 31): codex-native-hook.conductorPackageCliHasTrustedNodeInterpreter has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (20 pts), error handling 3 (6 pts), loops 2 (3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17956}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf499ba740c22ddcfe51bb0b1fee6015ff946e8f5a5a981bd3cb06aff9a14773"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.extractConductorEditorWriteTargets (cognitive 31): codex-native-hook.extractConductorEditorWriteTargets has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":20485}}}],"partialFingerprints":{"codehealthFindingId/v1":"a381aec80b35113969c628858e1f9959ef34d7b9bb98e0bc4f90392b19011e04"}},{"ruleId":"D2","level":"warning","message":{"text":"index.materializeProjectLaunchRuntimeHistoryEntries (cognitive 31): index.materializeProjectLaunchRuntimeHistoryEntries has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 3 (9 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"0912a72034a14c9a73820d045a875ccc2df12dc7e1a7b28893927d334d8d1633"}},{"ruleId":"D2","level":"warning","message":{"text":"index.postLaunch (cognitive 31): index.postLaunch has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 10 (13 pts), error handling 12, if/else 5, 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":"src/cli/index.ts"},"region":{"startLine":9250}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a396bd6fff467db6fb1e1f4fe12c6f9eaf133e0ac700781042d5e658af4429"}},{"ruleId":"D2","level":"warning","message":{"text":"notify-fallback-delivery.compactNotifyFallbackDeliveries (cognitive 31): notify-fallback-delivery.compactNotifyFallbackDeliveries has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2 (7 pts), ternaries 2 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 16). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd55c64d7698b4c38976114ac6f89636b43140801788ffcb39d3322f7b07f11"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.hasExecutableForeignHandlerInUnknownEvent (cognitive 30): codex-hooks.hasExecutableForeignHandlerInUnknownEvent has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":2630}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8b6f68d6d963ab6a06aa79b3b55dde27fbbd0fc72cc925931161109933c51f"}},{"ruleId":"D2","level":"warning","message":{"text":"state.isTeamManifestV2 (cognitive 30): state.isTeamManifestV2 has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19, boolean chains 11. 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/team/state.ts"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dc9c572a81656ab9484d20a4625e57fb0d8fbf220ce342fd74a078779c6909"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.advancePastInlineTomlValue (cognitive 30): generator.advancePastInlineTomlValue has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (24 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/config/generator.ts"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"78add7b09694a1f413985fad2eec14da401c1ed6e3c47c4f8d04a2a4bdfc9392"}},{"ruleId":"D2","level":"warning","message":{"text":"temp-contract.parseNotifyTempContractFromArgs (cognitive 30): temp-contract.parseNotifyTempContractFromArgs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/temp-contract.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3304c6833375163bd491143ed61b5e8b97dd0bb49f280a57f74ac1121094ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"reply-listener.pollTelegramOnce (cognitive 30): reply-listener.pollTelegramOnce has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), error handling 3 (5 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 9). Of this number, 25 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/reply-listener.ts"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de277774de0a4794f8501e3223e94eba71ba6745a00714a1cf74f9c44f2dc2e"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-session.waitForWorkerReady (cognitive 30): tmux-session.waitForWorkerReady has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 1, loops 1 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 13 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":"src/team/tmux-session.ts"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"5292026c0ab78a765c8312820121487c2a252931213b15d09a21aa7c2c041a3f"}},{"ruleId":"D2","level":"warning","message":{"text":"native-hook-claim-journal.recoverNativeHookClaimJournal (cognitive 30): native-hook-claim-journal.recoverNativeHookClaimJournal has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 8, error handling 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/cli/native-hook-claim-journal.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbb993e583069c9a815ca874933d3e19aa5637963a7c6dbf90437efb008f60e"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.checkPluginScopedNativeHooks (cognitive 30): doctor.checkPluginScopedNativeHooks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (25 pts), ternaries 2, boolean chains 1, error handling 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b20ea73b53dfd30e82526834d9e8ea513dbed249057e879adfa5131a815bd2e"}},{"ruleId":"D2","level":"warning","message":{"text":"team.renderTeamPaneStatus (cognitive 30): team.renderTeamPaneStatus has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 7 (15 pts), if/else 7 (8 pts), boolean chains 4, loops 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb32af9256f39eec0019b9eed96e68c53dcd6855c16f25b014e8ff826509436c"}},{"ruleId":"D2","level":"warning","message":{"text":"continuation.parseImagegenContinuationArgs (cognitive 30): continuation.parseImagegenContinuationArgs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 22 (24 pts), boolean chains 5, loops 1 (nesting depth added 2). 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":"src/imagegen/continuation.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ab97e3da3e99b7be1043ddcd735d9f6b99e256773d3e9101f754395afe2f12"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.collectPostposedExplicitNegationIndex (cognitive 30): keyword-detector.collectPostposedExplicitNegationIndex has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 6 (12 pts), boolean chains 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":"src/hooks/keyword-detector.ts"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"015ad6f44f46ec3ca20644aefbe95a8528ef4e62801810be0971de86cffa43da"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.markdownDocumentationRange (cognitive 30): keyword-detector.markdownDocumentationRange has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 8, ternaries 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be3091e45f41b081e00f7902c3a7c924992898e1b61b18ab69523b3f28f1eba"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.collectImplicitDocumentationLineRanges (cognitive 30): keyword-detector.collectImplicitDocumentationLineRanges has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (16 pts), ternaries 2 (8 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbbb9c8b6c7686428cc75bccc55277f5509340c751ba3338200dbcfc0a11e0c"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.collectImplicitClauseIndex (cognitive 30): keyword-detector.collectImplicitClauseIndex has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 5 (6 pts), 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/hooks/keyword-detector.ts"},"region":{"startLine":3088}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b0ebe3002811915fb11d6f4bd8a32514ca827f0c9a184d6658ecd77bcdf012"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isPositivelyModeledPythonSource (cognitive 30): codex-native-hook.isPositivelyModeledPythonSource has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 5 (6 pts), boolean chains 2, ternaries 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13820}}}],"partialFingerprints":{"codehealthFindingId/v1":"335617354f1d9dad77d23944ab12eefbee2f68333f4e9521d5531637abbbe2c3"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.stripShellCommentsForConductorScan (cognitive 30): codex-native-hook.stripShellCommentsForConductorScan has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 10, loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19316}}}],"partialFingerprints":{"codehealthFindingId/v1":"4850659ead6dc56962e42570b5418aef08263713ddf72becce902b8d746defaf"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectLexicalCommandSubstitutions (cognitive 30): codex-native-hook.collectLexicalCommandSubstitutions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 8, ternaries 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19587}}}],"partialFingerprints":{"codehealthFindingId/v1":"631d44df51555edaf58cd6a0104646189d683f03026dc417732944832925b7bf"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.runCodexNativeHookCli (cognitive 30): codex-native-hook.runCodexNativeHookCli has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 5, error handling 2 (4 pts), ternaries 1 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":23189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8fc2a3ef5bb5f43fada89c7cd6f844ccfbae57151d1a9a330419deba7237eb"}},{"ruleId":"D2","level":"warning","message":{"text":"notify-fallback-delivery.terminalGraph (cognitive 30): notify-fallback-delivery.terminalGraph has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 10 (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/scripts/notify-fallback-delivery.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ac37f2d780405cd6aeb78474cee5ec1e68cdc30dccd9bd7dea9fb028b7c8db"}},{"ruleId":"D2","level":"warning","message":{"text":"smoke-packed-install.assertNativeHookAdvisoryPreToolUse (cognitive 30): smoke-packed-install.assertNativeHookAdvisoryPreToolUse has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 8, ternaries 2 (3 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":2367}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e97424511291cd162fbbe3d678e4a467e26b52564f89c877560ef73bced7769"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.acquireLivePinMutationLock (cognitive 29): codex-native-hook.acquireLivePinMutationLock has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (22 pts), error handling 2 (4 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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5278a901276c55a42261910f61f443042e6ba83404369b7c5710a36fec193a3"}},{"ruleId":"D2","level":"warning","message":{"text":"state-root.resolveWorkerTeamStateRootWithOptions (cognitive 29): state-root.resolveWorkerTeamStateRootWithOptions has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 7 (8 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state-root.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2acb178458c22a64c696bd2da6b67c8d79d603cdde55eba5496fd6049b856e"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt-session-provenance.preflightSelectedTargetOwner (cognitive 29): prompt-session-provenance.preflightSelectedTargetOwner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, ternaries 3 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/prompt-session-provenance.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"900c05f48f1b19a5f7de2858959fdfbe59160374beeb522040be105b6fe7baaf"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.reconcileProjectScopeTrustState (cognitive 29): generator.reconcileProjectScopeTrustState has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 8, ternaries 3, loops 1 (nesting depth added 3). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2c32b849a8b4e9aba8cc2dd64a5835406939f3dd1ea8c2697f7b73251ece74"}},{"ruleId":"D2","level":"warning","message":{"text":"advisory.observeRalplanAdvisoryPrompt (cognitive 29): advisory.observeRalplanAdvisoryPrompt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 9, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory.ts"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f135701c0cfeb4139c16d7c47223be2c27f63674f542c51b6100413a7f96503"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-session.buildWorkerProcessLaunchSpecForMode (cognitive 29): tmux-session.buildWorkerProcessLaunchSpecForMode has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 14 (15 pts), boolean chains 8, if/else 3 (5 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/tmux-session.ts"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"532f775739ca0315b26f2f8a3e1a9aadb424cd6bfaace7b47117896424b96706"}},{"ruleId":"D2","level":"warning","message":{"text":"trace-server.handleTraceToolCall (cognitive 29): trace-server.handleTraceToolCall has cognitive complexity 29 (threshold 15). Drivers by points: if/else 4 (11 pts), ternaries 4 (8 pts), boolean chains 6, loops 1 (2 pts), error handling 1, match/switch 1 (nesting depth added 12). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/trace-server.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db1c3fd1e4a2de98978694f87233abfa286390b51a84f7510da74e47c913a22"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.ensureSnapshotBackup (cognitive 29): setup.ensureSnapshotBackup has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, error handling 1 (3 pts), loops 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":"src/cli/setup.ts"},"region":{"startLine":2042}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf6b9b902ed7c278f9c530dac61bed409c9fea6a6fcad128735e8d0e5ed60ed"}},{"ruleId":"D2","level":"warning","message":{"text":"search.searchRolloutFile (cognitive 29): search.searchRolloutFile has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (20 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/search.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb47092e575c2acdb50b9d767f18a7db2f853500b14409f9b95b88365499bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"package-manager-ownership.validatePackageManagerOwnership (cognitive 29): package-manager-ownership.validatePackageManagerOwnership has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 12, if/else 9 (12 pts), ternaries 3 (4 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/package-manager-ownership.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"324297d97e5383f0d5cd5523fa724c0d55c102e98cff9b1b42c048b7ce5e5b1e"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.readActiveRalphState (cognitive 29): codex-native-hook.readActiveRalphState has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 6, ternaries 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8054e591b5adc61aa9fe1c713cdbb2d50fa104df6ca8091d30b8f2b06b3fc6"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectShellCasePhases (cognitive 29): codex-native-hook.collectShellCasePhases has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 7, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7678}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdeca87dfee6f34bcf557a3cd8ccee19c7d668941a99c7a7982e54d5bc67542"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.extractNestedShellCommandStringsForStateScan (cognitive 29): codex-native-hook.extractNestedShellCommandStringsForStateScan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 1 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8091}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8ee166978b377fc3b6d4dee2ce597e287f17e7ffa53921b885da7ce31e6c04"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.extractNestedCommandSubstitutionStringsForStateScan (cognitive 29): codex-native-hook.extractNestedCommandSubstitutionStringsForStateScan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 2 (6 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e995383f4124308b4048d095a863781f831a37caf8f29d5ce539e167a546e7"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isConductorFinalPipelineMember (cognitive 29): codex-native-hook.isConductorFinalPipelineMember has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 9, loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab870feec117504063000bf22a08c765f4dd047c54d493b551f51e6316918f14"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.readBlockingSkillForStop (cognitive 29): codex-native-hook.readBlockingSkillForStop has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 10, ternaries 2, loops 1 (nesting depth added 8). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":20621}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9158d09097d88688ccf6f744951cbf1173fe0d0c5686ca9c50446d0dfc23c52"}},{"ruleId":"D2","level":"warning","message":{"text":"index.readPostLaunchModeStateFile (cognitive 29): index.readPostLaunchModeStateFile has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), ternaries 2 (6 pts), error handling 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":7605}}}],"partialFingerprints":{"codehealthFindingId/v1":"0954dac1021351b4deb3d8553cc7d97a6089ff65c0cc7373e2f777e4d3dfe808"}},{"ruleId":"D2","level":"warning","message":{"text":"collector.collectRecord (cognitive 29): collector.collectRecord has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (16 pts), error handling 4 (5 pts), boolean chains 4, loops 2, ternaries 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/evals/astra-defaults/collector.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7dd5ef25038098713f14491d9570d11058b775135cf416354911a5f42d34ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"team-dispatch.updateMailboxNotified (cognitive 29): team-dispatch.updateMailboxNotified has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 11, ternaries 2 (5 pts) (nesting depth added 7). None of this is in the body itself: all 29 points belong to 4 function literals inside it that branch (lines 1043, 1049, 1046, \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":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c081c585356137d580bdf6ae5545d1c933fbfc3b965f62a87989b28658ea059"}},{"ruleId":"D2","level":"warning","message":{"text":"session.createSessionState (cognitive 28): session.createSessionState has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 18 (22 pts), boolean chains 6 (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/hooks/session.ts"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a68a638771b046151ac0133772facb46d3e34d088dae9f54187df350685999"}},{"ruleId":"D2","level":"warning","message":{"text":"state.removeDispatchRequestsForWorkers (cognitive 28): state.removeDispatchRequestsForWorkers has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 7, ternaries 3 (6 pts) (nesting depth added 10). None of this is in the body itself: all 28 points belong to 2 function literals inside it that branch (lines 2278, 2309). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e10cb3a25f12e9b0efa973d412de250c8e183bd0c40fe7016963250102347d"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.parseTomlSourceTableHeader (cognitive 28): generator.parseTomlSourceTableHeader has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"4144c248706836b4af68e37b9b4258b5acbfa86eda27b513ba2664edf5dbe016"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.extractSharedMcpRegistryServersFromConfig (cognitive 28): generator.extractSharedMcpRegistryServersFromConfig has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 5 (15 pts), if/else 2 (5 pts), boolean chains 3, loops 2 (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/config/generator.ts"},"region":{"startLine":3956}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b72b1602a05be00b0a309d4aff24c8709508ea9e4222d42c5aee15c736a301d"}},{"ruleId":"D2","level":"warning","message":{"text":"completion-gate.validateAutopilotCompletionTransition (cognitive 28): completion-gate.validateAutopilotCompletionTransition has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 12, if/else 12, ternaries 2 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/autopilot/completion-gate.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a554bea5ed38cf754993860fc7eaa789c50675853e70b4f719e2485079760e82"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-goal-snapshot.unwrapNativeGoalResponse (cognitive 28): codex-goal-snapshot.unwrapNativeGoalResponse has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 2 (5 pts), boolean chains 2, loops 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":"src/goal-workflows/codex-goal-snapshot.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa679e3b280c2a97d65ffd417a5ff0142febb9313b1d2f26a72e49c8d94d41d"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.recordNativeSubagentAuthorityObservation (cognitive 28): tracker.recordNativeSubagentAuthorityObservation has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 9, loops 3 (6 pts) (nesting depth added 9). None of this is in the body itself: all 28 points belong to 2 function literals inside it that branch (lines 1127, 1132). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9abdd7dd70e6ab5217dcbc7c8a391dfe46458b335d8f3393704958a130cd79d"}},{"ruleId":"D2","level":"warning","message":{"text":"state.readAllState (cognitive 28): state.readAllState has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 19 (27 pts), if/else 1 (nesting depth added 8). Of this number, 22 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/state.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9804be9b1ae7ff76cbfb8f65e83238ac78238357722deb113feabd4790c746"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-hook.detectInitialTarget (cognitive 28): tmux-hook.detectInitialTarget has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 4 (9 pts), boolean chains 8 (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/cli/tmux-hook.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7e397d491fdc1552a186cbf8307e91cb82e3251e6fbd203a06f94dfd2c7ef5"}},{"ruleId":"D2","level":"warning","message":{"text":"formatter.parseTmuxTail (cognitive 28): formatter.parseTmuxTail has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 4, 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/notifications/formatter.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad226f11ea6e48879dd9ee474c50a5f1116815b9380669e3227fb33b407e96c"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.prepareShutdownMergeReport (cognitive 28): runtime.prepareShutdownMergeReport has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 7, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ba6da9e5913d88deab4972d554dfceda428f25d0f3c83bc951c2e953e25fff"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.persistDeepInterviewModeState (cognitive 28): keyword-detector.persistDeepInterviewModeState has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 12 (18 pts), boolean chains 8, if/else 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/hooks/keyword-detector.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24aa436a1ffbc0ac94975b774533e00054e3ef7467158632de4619d74ea15c9"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.resolveEnvWrappedCommandCwd (cognitive 28): codex-native-hook.resolveEnvWrappedCommandCwd has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 6, error handling 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5834}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a005abeb80f6f69252aeaf223df288b86ced44e3b201503e548e33b4c0f67d"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorXargsOptionValueWordCount (cognitive 28): codex-native-hook.conductorXargsOptionValueWordCount has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15510}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c94fcc0b3a9f2b67d651ba51b5f1810106bf5baca91dfc02008c4de87694a3f"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.applyShellCwdStateEffect (cognitive 28): codex-native-hook.applyShellCwdStateEffect has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 9 (nesting depth added 6). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d32afd5470cfc5591a8b48094d09d903cc96b5267114392073a4db9bb9b5fff"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.applyPersistentFunctionEffects (cognitive 28): codex-native-hook.applyPersistentFunctionEffects has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, loops 3, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18390}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8cd4b1470aa0372a885f962aca6559de208ee5abdab4c95491a0825132a63c"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectInPlaceEditorWriteTargets (cognitive 28): codex-native-hook.collectInPlaceEditorWriteTargets has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (23 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":20438}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf32ec9bd078a91d8cd4a83ca1d4a1da915459391420626a79893bfefc3d444"}},{"ruleId":"D2","level":"warning","message":{"text":"hook-derived-watcher.processLine (cognitive 28): hook-derived-watcher.processLine has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 3 (9 pts), 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/scripts/hook-derived-watcher.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"624c2a36130a510afea65022e5656a6c92a7b92b8fa969bdeb0663ea930422a6"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.prepareLegacyState (cognitive 27): codex-hooks.prepareLegacyState has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, loops 2 (3 pts), ternaries 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/config/codex-hooks.ts"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"76489d0d946fe94ea8e3988d9a9bd3b81d32450f273f418950d091d40a8a3038"}},{"ruleId":"D2","level":"warning","message":{"text":"session.parseProcessIdentityOutput (cognitive 27): session.parseProcessIdentityOutput has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 5, error handling 1, ternaries 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/hooks/session.ts"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"66951e20d01dc6224cdab341402240b05e86338ddb3a8158c5982fa6bc2b4b37"}},{"ruleId":"D2","level":"warning","message":{"text":"session.reconcileNativeTransition.\u003Creturned closure\u003E (cognitive 27): session.reconcileNativeTransition.\u003Creturned closure\u003E has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 8, ternaries 7 (8 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":3646}}}],"partialFingerprints":{"codehealthFindingId/v1":"65659569f5d5d7e99dfcf4679e44d44db7d3c25deb06743d8538b6c54d5de54f"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.findLauncherTimeoutRepairTargets (cognitive 27): generator.findLauncherTimeoutRepairTargets has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 7, loops 3 (5 pts), ternaries 2 (4 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":4041}}}],"partialFingerprints":{"codehealthFindingId/v1":"b932a91b2a624465acc0d191ebbfc294440d536be73750ccda656b2ba16849b2"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-hook.parseConfig (cognitive 27): tmux-hook.parseConfig has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 13, if/else 13, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tmux-hook.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"921c5f16d41fa36a316714996e0ec1c3d5928c25b9c9aa1dee83b03333ada683"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-session.requireFrozenWindowTopologySync (cognitive 27): tmux-session.requireFrozenWindowTopologySync has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 3, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/tmux-session.ts"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac75ea3f181ae52e0f90e4b0d423fe4bfe3ef896ba8766d3906415c34e19e87"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.waitForExactPaneTrackedPidsExit (cognitive 27): runtime.waitForExactPaneTrackedPidsExit has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":2950}}}],"partialFingerprints":{"codehealthFindingId/v1":"7507335c17b3ba9ea208f7edc3fe6cb135e31e8d3605a4d21274d68ec30a8aed"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.emitMonitorDerivedEvents (cognitive 27): runtime.emitMonitorDerivedEvents has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 11, 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/team/runtime.ts"},"region":{"startLine":6097}}}],"partialFingerprints":{"codehealthFindingId/v1":"323ad31f7d44f70b2ed84b37aa04db7a499ccba7574c6aba547a6907baffea64"}},{"ruleId":"D2","level":"warning","message":{"text":"auth.authCommand (cognitive 27): auth.authCommand has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 3 (10 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/auth.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"29eb7063d27155bdb8a42937d2dc2bdeaaab4e7d9acbe51ec44ac713a6f5c7dd"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.referencedWindowsNativeHookShimPaths (cognitive 27): doctor.referencedWindowsNativeHookShimPaths has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 15). Of this number, 26 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/cli/doctor.ts"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"db80c143e6476df448372de4ab38abdc36bbebf5e459cd8328be3003c99c49ed"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.syncManagedAgentsContent (cognitive 27): setup.syncManagedAgentsContent has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 3 (8 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/cli/setup.ts"},"region":{"startLine":5948}}}],"partialFingerprints":{"codehealthFindingId/v1":"02df5a53b65312e430acd18c149fcc9e0e85b40e744b09add495f6e76b689c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"usage.inspectTranscript (cognitive 27): usage.inspectTranscript has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 11). Of this number, 26 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/session-history/usage.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"992817bdef1b7da8a22614ef7bd156d311f410c014bb228295f070b6647b8051"}},{"ruleId":"D2","level":"warning","message":{"text":"managed-tmux.verifyManagedPaneTarget (cognitive 27): managed-tmux.verifyManagedPaneTarget has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 8, ternaries 3 (5 pts), error handling 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/scripts/notify-hook/managed-tmux.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e9bcfa5db1696156c008072348bc9c68cb6b834956b8b8aac8b6488c5e098a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-pre-post.readInlineEnvironmentAssignments (cognitive 27): codex-native-pre-post.readInlineEnvironmentAssignments has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (6 pts), boolean chains 5 (nesting depth added 12). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-pre-post.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3abe20b249bedae07d6067ee058be528cf2314e6d2020d35e1f9ca6e9d617d4"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectSloppyFallbackFindingsFromUntracked (cognitive 27): codex-native-hook.collectSloppyFallbackFindingsFromUntracked has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 3 (9 pts), boolean chains 3, loops 1 (nesting depth added 14). Of this number, 22 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"06faee9ee7ebb594ed7ee5d27365a24d95ec18b7a7fe7393d240a2225e9fd53d"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findActiveGoalWorkflowReconciliationRequirement (cognitive 27): codex-native-hook.findActiveGoalWorkflowReconciliationRequirement has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 9, loops 2, ternaries 2 (nesting depth added 6). Of this number, 26 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":3410}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25c0433246bbb4f7be58a1fd4ec5a97df35cacb79e4794736cc885388c0a259"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.staticExpansionAssignmentMarker (cognitive 27): codex-native-hook.staticExpansionAssignmentMarker has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 4 (7 pts), boolean chains 5, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8901}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41eb515313d5576f2a2a7c79a1f20982fec936616a7fde916b0fb9d7ef1e828"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.evaluateDeepInterviewRalplanHandoffCommand (cognitive 27): codex-native-hook.evaluateDeepInterviewRalplanHandoffCommand has cognitive complexity 27 (threshold 15). Drivers by points: if/else 20 (21 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9396}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c983febf0d7421cf6a42ae63afb8a91354460f28f65538a4668957fb4b6a997"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.gitStatusInvocationHasSafeEnvironment (cognitive 27): codex-native-hook.gitStatusInvocationHasSafeEnvironment has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, loops 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12760}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9e1ce87d05f57b0888fea122e3bc8f4b51617f9740cf7434411d32c561c1cf"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.nodeCommandHasUnsafeRuntimeOutput (cognitive 27): codex-native-hook.nodeCommandHasUnsafeRuntimeOutput has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 7, loops 2, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12901}}}],"partialFingerprints":{"codehealthFindingId/v1":"07688e40aad9e28695061d94651ecbe3d2f300a1ccb9840a93f8875c44112387"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isPositivelyModeledPythonMetadataWriteSource (cognitive 27): codex-native-hook.isPositivelyModeledPythonMetadataWriteSource has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 3, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14007}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f421a0755ca7d6cb66e37262160c2732c53fee92a0bf7e1ace91f2b1b41019"}},{"ruleId":"D2","level":"warning","message":{"text":"index.withTmuxExtendedKeysLeaseLock (cognitive 27): index.withTmuxExtendedKeysLeaseLock has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (14 pts), error handling 2 (6 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":6550}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd42c18f2003f78065747cceab505717b0a2f1a688fb9dc8a912b222193a536"}},{"ruleId":"D2","level":"warning","message":{"text":"collect-astra-defaults.main (cognitive 27): collect-astra-defaults.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 5 (8 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/eval/collect-astra-defaults.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2091297bf7f357b421ff0a5f2f3cf65744eccf6fb8ab92a1785cf302a3608ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"smoke-packed-install.smokeInstalledLaunchArgumentBoundary (cognitive 27): smoke-packed-install.smokeInstalledLaunchArgumentBoundary has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 3, loops 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/scripts/smoke-packed-install.ts"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"4546a944ec2a078e775115de8c6f2c7523a624b3797a91e9af391a1e2d612c4c"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-native-agents.verifyNativeAgents (cognitive 27): verify-native-agents.verifyNativeAgents has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 5 (6 pts), ternaries 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/verify-native-agents.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff4d72e940026ec717d6bebb5b53793c1c9a575deac65cb2eeaa5c6550c5052"}},{"ruleId":"D2","level":"warning","message":{"text":"pinned-atomic-file-darwin-helper.main (cognitive 27): pinned-atomic-file-darwin-helper.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/pinned-atomic-file-darwin-helper.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"495f394cdcebc167d1e5f2ea1becf33a4655429c9b00669311807e70fafc4a74"}},{"ruleId":"D2","level":"warning","message":{"text":"native-assets.hydrateNativeBinary (cognitive 26): native-assets.hydrateNativeBinary has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, error handling 2 (3 pts), loops 2, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/native-assets.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"8934482a618bc83ec9ffccd910e2e58c5c86d233a08669dde06e2d6c46607e35"}},{"ruleId":"D2","level":"warning","message":{"text":"session.parseLockOwner (cognitive 26): session.parseLockOwner has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 10, error handling 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/hooks/session.ts"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebe6c04893618d07dc40c5205af82501a1733e01f7e495ca2a5cce4834fa0e3"}},{"ruleId":"D2","level":"warning","message":{"text":"session.recoverSessionPointerLock (cognitive 26): session.recoverSessionPointerLock has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 7, ternaries 4 (5 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f19df1ff492a2c633700a447f73ec7312f8b79c5274160ec833cf729c11256"}},{"ruleId":"D2","level":"warning","message":{"text":"tasks.claimTask (cognitive 26): tasks.claimTask has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 5 (nesting depth added 6). Most of this is not in the body itself: 3 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 72). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/tasks.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d021828efca085f9bf035c1fa4aa1e5959367695c3ff39b03883845bd34151d"}},{"ruleId":"D2","level":"warning","message":{"text":"mailbox.executeBridgeCommand (cognitive 26): mailbox.executeBridgeCommand has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 14, if/else 7 (11 pts), error handling 1 (nesting depth added 4). Of this number, 22 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/mailbox.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d218047f35b254c0861845485c24dd46812e5867dc5908dc188243ac69ba0133"}},{"ruleId":"D2","level":"warning","message":{"text":"state.validateMembershipTransactionFiles (cognitive 26): state.validateMembershipTransactionFiles has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 6, 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/team/state.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff08160cfc64104b09f5fa52e9c7313bd1f813583fef0488ead6cf40f955bf8c"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.removeManagedHookTrustStateFences (cognitive 26): generator.removeManagedHookTrustStateFences has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 12). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":2711}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b770ae3949046373edeb26466fffb9f3845ad65789e6886e408081856988ebe"}},{"ruleId":"D2","level":"warning","message":{"text":"mode-binding-lease.pinCanonicalNamespaceMarker (cognitive 26): mode-binding-lease.pinCanonicalNamespaceMarker has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 5, error handling 2 (4 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/mode-binding-lease.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e326e3c084584a51e312b438d5bc4cb96bdce86269356b01785b44561749f0"}},{"ruleId":"D2","level":"warning","message":{"text":"operations.completeRalplanSession (cognitive 26): operations.completeRalplanSession has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 7, ternaries 2 (5 pts) (nesting depth added 6). Of this number, 24 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":"src/state/operations.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69d3affb5bc12f2c3eece7c290d900a3314b5cd152dbcb7586c38f340c25a60"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-session.teardownWorkerPanes (cognitive 26): tmux-session.teardownWorkerPanes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 2, loops 1, ternaries 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/team/tmux-session.ts"},"region":{"startLine":4518}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae055377166ce691d3b605e2f85fb5f9db976ec0f77b3be9e7725ef107ab081"}},{"ruleId":"D2","level":"warning","message":{"text":"scaling.validateScaleDownCleanupResources (cognitive 26): scaling.validateScaleDownCleanupResources has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 13, if/else 6 (12 pts), loops 1 (nesting depth added 6). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"068b0374099c5b984beef6ba6f8b02bbe80ed2d6aa971bcafee5c17d07a55129"}},{"ruleId":"D2","level":"warning","message":{"text":"cleanup.cleanupOmxMcpProcesses (cognitive 26): cleanup.cleanupOmxMcpProcesses has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2 (5 pts), loops 3 (5 pts), ternaries 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/cli/cleanup.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"95332d96ad41150f273d493dd11731cfe6385d91739de9219335e6bd4ef56d48"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.reconcileStartupCleanupPanes (cognitive 26): runtime.reconcileStartupCleanupPanes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). Of this number, 23 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":"src/team/runtime.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"af493b976885bb32706ed98a8a3d3c00b4afe3c31e3e9f7de08e0f94619e3d65"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.removeGeneratedShutdownReport (cognitive 26): runtime.removeGeneratedShutdownReport has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 7, error handling 1 (3 pts), ternaries 2 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 6 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"539cd07c46e008f70be035dd97033c5d6c8f30f222ff93153f97d3c668116e3d"}},{"ruleId":"D2","level":"warning","message":{"text":"team.splitTaskString (cognitive 26): team.splitTaskString has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 7 (10 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). Of this number, 23 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":"src/cli/team.ts"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9aae667cbb4d504b4649713736677cbf834167c1b1791f2a961a4af5901e05b"}},{"ruleId":"D2","level":"warning","message":{"text":"artifacts.applySteeringMutation (cognitive 26): artifacts.applySteeringMutation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ultragoal/artifacts.ts"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"815e0785f0dc9880dc6adb5a05a95d4786fe788e70dd8b045b7f5608aad6767f"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorMetadataRedirectsHaveBoundedProducers (cognitive 26): codex-native-hook.conductorMetadataRedirectsHaveBoundedProducers has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8782bd22c9d3f4a286ee7801a9c23d6bddbcd1fcf902cc7a5748f966d0e20d28"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.hasUnresolvedShellArithmeticExpansion (cognitive 26): codex-native-hook.hasUnresolvedShellArithmeticExpansion has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8815}}}],"partialFingerprints":{"codehealthFindingId/v1":"656f23ca367a6bd33d3cd5a395af5224193d6c9e85efa8e1da684250644e4879"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.extractShellHeredocOpeners (cognitive 26): codex-native-hook.extractShellHeredocOpeners has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 2 (4 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8992}}}],"partialFingerprints":{"codehealthFindingId/v1":"a643d3054df4c38208f358e897668ce4d30b0768772b3f3b9ec0c2934a0084af"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.readActiveRalplanStateForPreToolUse (cognitive 26): codex-native-hook.readActiveRalplanStateForPreToolUse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 7, ternaries 4 (nesting depth added 3). Of this number, 23 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f541bb06e01cad8f74c5514de769ea197808e699176957954c60f4a02b4460b3"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isInvocationIsolated (cognitive 26): codex-native-hook.isInvocationIsolated has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 8, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61ae96bf962b602cb36ba321b00838ba8208e86e6de445c471572671f566f86"}},{"ruleId":"D2","level":"warning","message":{"text":"index.execWithOverlay (cognitive 26): index.execWithOverlay has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 6 (7 pts), error handling 4, boolean chains 1 (nesting depth added 7). Of this number, 24 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":"src/cli/index.ts"},"region":{"startLine":5855}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00b7007737f0f5f6b3edbbed184b8ae66c949d78f25eed9dfb91037aa108214"}},{"ruleId":"D2","level":"warning","message":{"text":"update-worker.main (cognitive 26): update-worker.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 8, ternaries 2 (4 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update-worker.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6599616e5aa0cfffc61aab7b6e0e4f1bf9f4b1378b30cc9369faf635fb1ae316"}},{"ruleId":"D2","level":"warning","message":{"text":"team-dispatch.resolveDispatchTarget (cognitive 26): team-dispatch.resolveDispatchTarget has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (26 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/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5de60f572795ab64402380f7d574327a16ebfb4d172e63d3bd22880cd4e05d8"}},{"ruleId":"D2","level":"warning","message":{"text":"livePinDirectory (cognitive 26): livePinDirectory has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, error handling 4, ternaries 2, loops 1 (nesting depth added 3). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5e5692fb285114c22d762032c851d92f57380efb0bad3b3631ededb46378ee"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.writePendingSessionPin (cognitive 25): codex-native-hook.writePendingSessionPin has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 5 (6 pts), boolean chains 5, ternaries 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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b98ada47ae001bf38a54d05660c87985dc9b9d95aa232a04f34cd60eed28840"}},{"ruleId":"D2","level":"warning","message":{"text":"state-root.validateWorkerNotifyStateRoot (cognitive 25): state-root.validateWorkerNotifyStateRoot has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 8, loops 2 (nesting depth added 5). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state-root.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"e976656d32da2dac92c43190e2ebbb93df381b6682d192ae91d19bb769ba631d"}},{"ruleId":"D2","level":"warning","message":{"text":"monitor.readTeamPhase (cognitive 25): monitor.readTeamPhase has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 14 (20 pts), boolean chains 2, if/else 2, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/monitor.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"629ccec8f4f3fc444859c232e778223d4ff873ea59d9b89730c8758c0a40b158"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-hook-engine.normalizeTmuxHookConfig (cognitive 25): tmux-hook-engine.normalizeTmuxHookConfig has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 13 (15 pts), boolean chains 9, if/else 1 (nesting depth added 2). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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/scripts/tmux-hook-engine.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c81ec40a1032b28e91d09c354a0f2d0a91881a7c158dd7a920013e2d12737e"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.selectReusableSubagentEntry (cognitive 25): tracker.selectReusableSubagentEntry has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17, boolean chains 8. None of this is in the body itself: all 25 points belong to 3 function literals inside it that branch (lines 1898, 1888, 1914). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fad06bc9f735cd50eff0c93ad1f906e236603c7c7ba1cbd4bf885adba11c5d7"}},{"ruleId":"D2","level":"warning","message":{"text":"session-registry.acquireRegistryLock (cognitive 25): session-registry.acquireRegistryLock has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (18 pts), error handling 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/session-registry.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5656bdcbebea0ae89ee0a88d5c15afcedd617459d2e607247c89100f2f67523d"}},{"ruleId":"D2","level":"warning","message":{"text":"config.getNotificationConfig (cognitive 25): config.getNotificationConfig has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 2 (7 pts) (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/notifications/config.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7d2e9c99553ab7d6ed7c1aedb0e6a869373c778d0a59fdb8a6db35aba9afde"}},{"ruleId":"D2","level":"warning","message":{"text":"ask.parseAskArgs (cognitive 25): ask.parseAskArgs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/ask.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb11d4099ec90df4a5157a0a5acd0c7e524882e62f3a20bd85f3cc3a4010496"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.checkAgentsMd (cognitive 25): doctor.checkAgentsMd has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (24 pts), ternaries 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":4186}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b213a8c8acba9bd910f9af748e4baa679147dc4b927c063381c5ca197ca8a3"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.cleanupLegacyManagedSkills (cognitive 25): setup.cleanupLegacyManagedSkills has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":6573}}}],"partialFingerprints":{"codehealthFindingId/v1":"7576df88103fe51e722fa4b928b87776cecab574eff29f90956170e20a0db0ef"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.stageAndRemoveFile (cognitive 25): uninstall.stageAndRemoveFile has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 2 (6 pts), error handling 3 (4 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/cli/uninstall.ts"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d878e8c72431dcfa72c52437d1a8293530b23461b97487ff097f33ef3daafa8d"}},{"ruleId":"D2","level":"warning","message":{"text":"team.buildTeamExecutionPlan (cognitive 25): team.buildTeamExecutionPlan has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 8 (12 pts), boolean chains 11, if/else 2 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a125b223fb788b99c6d311e42581c6f3a48411a7234d6756e635323b7dc73c6"}},{"ruleId":"D2","level":"warning","message":{"text":"AdvisoryLifecycleHandler.activate (cognitive 25): AdvisoryLifecycleHandler.activate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 8, ternaries 1 (2 pts) (nesting depth added 7). 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/runtime-advisory-lifecycle.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54841138cf61820644a8878cc7118a19d42ed46dca4ff480f6c4f4cd3a14f5a"}},{"ruleId":"D2","level":"warning","message":{"text":"auto-nudge.syncSkillStateFromTurn (cognitive 25): auto-nudge.syncSkillStateFromTurn has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 10, ternaries 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb929fc76b39d3258bea922ec78a8e0b11b2d8042643abbeb5d144a75a68ec03"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.shellTokenizeLiteralCommand (cognitive 25): codex-native-hook.shellTokenizeLiteralCommand has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":4794}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b2756de759a5f956278c9f930bd690d59da53c4e2340d9f5cda94b3d9f9d10"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.commandHasPackageInstallIntent (cognitive 25): codex-native-hook.commandHasPackageInstallIntent has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f719827795c81a078a260dcb80f48e8cbbbaeaf5c9999643f4d83ece662937"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.extractStateWriteOperationPayload (cognitive 25): codex-native-hook.extractStateWriteOperationPayload has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8, ternaries 6 (8 pts), boolean chains 6, error handling 2 (3 pts) (nesting depth added 3). Of this number, 19 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6645}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7d89b45fc6b73cc3151de0885503d33a9db6bc072d8c67307d5a26fb13dea7"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isAllowedOmxReadOnlyCommand (cognitive 25): codex-native-hook.isAllowedOmxReadOnlyCommand has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 10 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10098}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed766539fad0eb486b4108b79120f2094879470b291ccd2dd8de98d9d196cb35"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isAllowedRalplanBashWrite (cognitive 25): codex-native-hook.isAllowedRalplanBashWrite has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15, boolean chains 10. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10536}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5269893f4b19a22399f81a9b346fe9664a6b455836bbe2861035ced25c28cd"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.readActiveConductorStateForPreToolUse (cognitive 25): codex-native-hook.readActiveConductorStateForPreToolUse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 8). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10937}}}],"partialFingerprints":{"codehealthFindingId/v1":"939e825e418b9d372d6279f0efa2267e4dc0562607c23c9cf21ddc5fbb648f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isPositivelyClassifiedPerlCommand (cognitive 25): codex-native-hook.isPositivelyClassifiedPerlCommand has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 6, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11573}}}],"partialFingerprints":{"codehealthFindingId/v1":"8367bcf3125ae8ce12c8aa3dd1d4baa47bc4358eee54ec8e4e6d8a57c14e4192"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.gitStatusTrackedSurfaceIsSafe (cognitive 25): codex-native-hook.gitStatusTrackedSurfaceIsSafe has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (5 pts), boolean chains 4, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12069}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d6d91e432096111b1ee5b5969763b37d21e471d7948421cda4a404ec68c73a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.maskPythonStringsAndComments (cognitive 25): codex-native-hook.maskPythonStringsAndComments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13789}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad82b59ea1fe3cdf549dd9a7b715e0159fab91fbf937e4dada6950c1dea3a0a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.parseConductorWgetShortOptionCluster (cognitive 25): codex-native-hook.parseConductorWgetShortOptionCluster has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 4 (7 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14517}}}],"partialFingerprints":{"codehealthFindingId/v1":"92eb9421ab583d7af64bca410e8e50590818b14f22acb855e23167b95f2d91b3"}},{"ruleId":"D2","level":"warning","message":{"text":"index.copyProjectLaunchRuntimeHistoryDirectory (cognitive 25): index.copyProjectLaunchRuntimeHistoryDirectory has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 9, ternaries 2, loops 1 (nesting depth added 4). Of this number, 22 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":"src/cli/index.ts"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75553dfd8c1b4d3a8d0bccbab7f183a0f2491fff21117dac450aa7bc66abc91"}},{"ruleId":"D2","level":"warning","message":{"text":"notify-fallback-watcher.resolveActiveModeState (cognitive 25): notify-fallback-watcher.resolveActiveModeState has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6b7da77b3a05e4c39b074beb5603113194140507da4bb92b1a6d5f0cfd4e31"}},{"ruleId":"D2","level":"warning","message":{"text":"smoke-packed-install.smokeInstalledNativeHookDist::runPackedTransportRegressions (cognitive 25): smoke-packed-install.smokeInstalledNativeHookDist::runPackedTransportRegressions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 7, loops 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. This shape REPEATS in the file: one other method here (smoke-packed-install.smokeInstalledNativeHookDist) 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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcf0f2388cf4a9a4e1edcd064ea7480037bfb90149fba5e7c9e3b17c0e57ae1"}},{"ruleId":"D2","level":"warning","message":{"text":"NudgeTracker.checkAndNudge (cognitive 25): NudgeTracker.checkAndNudge has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 3 (6 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/team/idle-nudge.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"53590f79836ccea6329bbb2c1ebcd78d37fde7251cac899d49d8dbc1609bab06"}},{"ruleId":"D2","level":"warning","message":{"text":"DispatchLog::recover_pending_hook_attempts (cognitive 25): DispatchLog::recover_pending_hook_attempts has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime-core/src/dispatch.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51c75294b0767cc4428697ec7bcfca4cd932f77228159c11db7b9908983c362"}},{"ruleId":"D2","level":"warning","message":{"text":"hasKnownLiveSessionPin (cognitive 25): hasKnownLiveSessionPin has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, error handling 3 (4 pts), ternaries 1 (2 pts), loops 1, other 1 (nesting depth added 6). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc053ad1467bced61255c030219c49141c2f984c706b7d7c777f844d932d1f8d"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.foreignHookCoordinateMoves (cognitive 24): codex-hooks.foreignHookCoordinateMoves has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (7 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 14). Of this number, 23 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/config/codex-hooks.ts"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e06aefefc1e3e370e66292309a4021a7106330d2b6ac2c57f623f76e9917f28"}},{"ruleId":"D2","level":"warning","message":{"text":"session.malformedRecoveryPointerReason (cognitive 24): session.malformedRecoveryPointerReason has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 11, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"c081feaa296f8f4bf8da2fb26296f32e979f4cc86d968afe160c26afd55f15c2"}},{"ruleId":"D2","level":"warning","message":{"text":"session.writePointerTransaction (cognitive 24): session.writePointerTransaction has cognitive complexity 24 (threshold 15). Drivers by points: error handling 9 (10 pts), if/else 7 (10 pts), ternaries 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/hooks/session.ts"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd65636580e0c4bbd85e7797c25e3b5b4990dd428842eb93b43aa128c18307cc"}},{"ruleId":"D2","level":"warning","message":{"text":"session.readNativeSessionOwnerEvidence (cognitive 24): session.readNativeSessionOwnerEvidence has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, error handling 2, loops 2, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":3556}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac0d96236222344ba2754e59ace680133b04b572c3f11c286e099a20a90cff6"}},{"ruleId":"D2","level":"warning","message":{"text":"base.startModeUnderCanonicalLock (cognitive 24): base.startModeUnderCanonicalLock has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, ternaries 4 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/modes/base.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb82baa3e63848656ac06f17e12e6e4babcfdcd80999823bf6b28e27419ac82"}},{"ruleId":"D2","level":"warning","message":{"text":"render.sliceAnsiVisible (cognitive 24): render.sliceAnsiVisible has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, loops 1, ternaries 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/hud/render.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffd04604cfa73680d5fcfc3bf3783c409eac932744172bb2c24f3006039a0e9"}},{"ruleId":"D2","level":"warning","message":{"text":"autopilot.autopilotCommand (cognitive 24): autopilot.autopilotCommand has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/autopilot.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c58f63faf88c4a910955e7094a9447dcd10f5042af1794d0749c37e5e387a30"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.ensureProjectGitignore (cognitive 24): setup.ensureProjectGitignore has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 10 (18 pts), if/else 4, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":3473}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba343ae53f6c240775ddb3d5dfbf80b63cba3f32582b31bb398675dada9d8f2"}},{"ruleId":"D2","level":"warning","message":{"text":"index.isSafeIpv4 (cognitive 24): index.isSafeIpv4 has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 13, if/else 11. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/url-reader/index.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eed6ec04b9bdf4511e192c26d6d56f2e2bcfd812551aeef3a9da81058c52dde"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.collectFencedCodeRanges (cognitive 24): keyword-detector.collectFencedCodeRanges has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce1fcde5043e4c1f57ed04f30bc3d73ea9afe3a2daab9992c9249528db7cf04"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findTimeoutDispatchOperandIndex (cognitive 24): codex-native-hook.findTimeoutDispatchOperandIndex has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (19 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7525}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6da1b5cbfcab3df85d3b173ff96e72a708769047a02d96212cf4905d52401ef"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isPositivelyReadOnlyGitCommand (cognitive 24): codex-native-hook.isPositivelyReadOnlyGitCommand has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12134}}}],"partialFingerprints":{"codehealthFindingId/v1":"825dc2cda3baada5a9b2d100675b5b823b2f965d4e412b4d4d3caffaf9dd6280"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.classifyConductorExecutableRuntime (cognitive 24): codex-native-hook.classifyConductorExecutableRuntime has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13879}}}],"partialFingerprints":{"codehealthFindingId/v1":"4340d259561ad2e680a13f78fe48429724719a990c6095476d6223c2267f6428"}},{"ruleId":"D2","level":"warning","message":{"text":"index.buildDetachedLaunchControlPlane (cognitive 24): index.buildDetachedLaunchControlPlane has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":7088}}}],"partialFingerprints":{"codehealthFindingId/v1":"3190febb56b919247c407ba3e1ed8259cc6c2cf93f3cdbb9a400601857ac31d8"}},{"ruleId":"D2","level":"warning","message":{"text":"index.assertCompatibleNestedSkillOwners (cognitive 24): index.assertCompatibleNestedSkillOwners has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":10450}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faaf66d83c78c90ec4cbce89a751b8721a916ca39be67c35e4f690178b62619"}},{"ruleId":"D2","level":"warning","message":{"text":"suite.validateConfigs (cognitive 24): suite.validateConfigs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/evals/astra-defaults/suite.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"19af87885bde954c5ea3c500ea4381ef9a89d6f9055bdc1b95293eec314a99e2"}},{"ruleId":"D2","level":"warning","message":{"text":"omx_explore_harness::validate_direct_command (cognitive 24): omx_explore_harness::validate_direct_command has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-explore/src/main.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf0c8cc0a7417e162122babbeec018eaec982e1b3066e3f0af7ce0fb404359d"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge.resolveRuntimeBinaryPath (cognitive 23): bridge.resolveRuntimeBinaryPath has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4 (6 pts), error handling 2 (4 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime/bridge.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b04e6f8555b965c7cf141c0b4ce223ee604134a124e22a2eac019885902392"}},{"ruleId":"D2","level":"warning","message":{"text":"session.inspectSessionPointerLockAtContext (cognitive 23): session.inspectSessionPointerLockAtContext has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7, ternaries 5 (7 pts), boolean chains 6, error handling 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e46c9750a968dfea9bfc852161251f558166ab761f88bec32e7375d3578a69"}},{"ruleId":"D2","level":"warning","message":{"text":"state.normalizeTeamLeaderAttentionState (cognitive 23): state.normalizeTeamLeaderAttentionState has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 11 (12 pts), boolean chains 10, if/else 1 (nesting depth added 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, 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/team/state.ts"},"region":{"startLine":2848}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c76fab5207ffef3dda661a2bafe3f28d71d2abadf888250d55c2744a6d0321"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.stripProofManagedCodexHookTrustStateTables (cognitive 23): generator.stripProofManagedCodexHookTrustStateTables has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 5 (7 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 6). Of this number, 19 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":2758}}}],"partialFingerprints":{"codehealthFindingId/v1":"94143d4f949e5e205b7a2330044f313cbef7d62e98c8f9e4a7d7f81f7e49ec04"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.upsertPluginModeRuntimeFeatureFlags (cognitive 23): generator.upsertPluginModeRuntimeFeatureFlags has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3, ternaries 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":3063}}}],"partialFingerprints":{"codehealthFindingId/v1":"81820b74da47525fe8bb52ddba8c12f81411718c7ab8fde9587e1e920ef83c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"native-config.installNativeAgentConfigs (cognitive 23): native-config.installNativeAgentConfigs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/native-config.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"783aed59ee2bc56e992853afb2dfbdfb49b742d14aa5fb6a7b956cc89cd4157a"}},{"ruleId":"D2","level":"warning","message":{"text":"contract.supportEvidenceFromBlocker (cognitive 23): contract.supportEvidenceFromBlocker has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 6 (8 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/leader/contract.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2dd33c9e026b35f96cd9d729d33780fc4eadef08640a11177d56d9c9d713c0f"}},{"ruleId":"D2","level":"warning","message":{"text":"state.readUltragoalState (cognitive 23): state.readUltragoalState has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 14, ternaries 6 (7 pts), if/else 2 (nesting depth added 1). Of this number, 17 points are the body\u0027s own statements and 6 belong to 6 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/state.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8274650de16ddffc398155c9c2da91c838f04f6f3934077000bb39b03215f18"}},{"ruleId":"D2","level":"warning","message":{"text":"mode-binding-lease.withModeBindingOwnerTransaction (cognitive 23): mode-binding-lease.withModeBindingOwnerTransaction has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 8, error handling 1 (nesting depth added 4). Of this number, 15 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":"src/state/mode-binding-lease.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8319201c20629125752c3500a9735ac6058d2df15fd874d906cdbace2c0bfea"}},{"ruleId":"D2","level":"warning","message":{"text":"events.normalizeSubmittedAnswers (cognitive 23): events.normalizeSubmittedAnswers has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 8, if/else 8, ternaries 4 (7 pts) (nesting depth added 3). Most of this is not in the body itself: 10 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 215). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/events.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3f023ba079f931097e2916ff7da14dc26d479de9efbc338de81e29128dde1a"}},{"ruleId":"D2","level":"warning","message":{"text":"cleanup.cleanupStaleTmpDirectories (cognitive 23): cleanup.cleanupStaleTmpDirectories has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2 (4 pts), loops 3 (4 pts), ternaries 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/cli/cleanup.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefeac58dab9701d3b1fe30c669d8ddd4206abe23e8a5352d6348d42fbf6df61"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.applyCreatedInteractiveSessionToConfig (cognitive 23): runtime.applyCreatedInteractiveSessionToConfig has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dbec3e53e47e3f05076b4ea77b7761bb397d1e433b437684bc950622b6e0d9"}},{"ruleId":"D2","level":"warning","message":{"text":"code-intel-server.searchWorkspaceSymbols::walk (cognitive 23): code-intel-server.searchWorkspaceSymbols::walk has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/code-intel-server.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"8faac1a62d73f2405a49e2fc902e7753e9fc912ed3d7cc63046abd1b9bcc9b2e"}},{"ruleId":"D2","level":"warning","message":{"text":"lint.lintWiki (cognitive 23): lint.lintWiki has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (6 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/wiki/lint.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b60067da2715823461b844142b017c163cfa9014f144508e7181223668eaa3"}},{"ruleId":"D2","level":"warning","message":{"text":"lint.detectStructuralContradictions (cognitive 23): lint.detectStructuralContradictions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lint.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad61df2431cea13ed0ec3ddbcc63b8c4eb7593ac919fbe2355ab60721440b34d"}},{"ruleId":"D2","level":"warning","message":{"text":"autoresearch-guided.parseInitArgs (cognitive 23): autoresearch-guided.parseInitArgs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 6, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/autoresearch-guided.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fa893cf4f55ef372fa7f9bddc787310a9fc726b7d8756bd5a37480ac5dd9a1"}},{"ruleId":"D2","level":"warning","message":{"text":"autoresearch-guided.runAutoresearchNoviceBridge (cognitive 23): autoresearch-guided.runAutoresearchNoviceBridge has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, ternaries 2 (5 pts), error handling 1, loops 1 (nesting depth added 7). Of this number, 14 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/autoresearch-guided.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"3725dd8f5c37b9874933879ff3887096085ba21a26b83735f30631d800b9b925"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.acquireOmxPluginCacheLivePinMutationLock (cognitive 23): plugin-marketplace.acquireOmxPluginCacheLivePinMutationLock has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2, error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"4872a7d4d23850696c15287c2245248808b7308d175039dedd0e4c537117f273"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.checkExternalCodexProcessGuards (cognitive 23): doctor.checkExternalCodexProcessGuards has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (3 pts), boolean chains 1, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"19749d4dc667a6f9ada0d8f1cb9c5d6ce397d17d7ba28d9609b27fb4926376a0"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.checkPluginMarketplaceRegistration (cognitive 23): doctor.checkPluginMarketplaceRegistration has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 2 (5 pts), boolean chains 4, error handling 1 (nesting depth added 4). Of this number, 21 points are the body\u0027s own statements and 2 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":"src/cli/doctor.ts"},"region":{"startLine":3606}}}],"partialFingerprints":{"codehealthFindingId/v1":"4309d290f3ca643a7f209854d8f8ab6d326e744fbed25a4f3109d05747e1d598"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.cleanupNativeHookTransactionStagedDeletions (cognitive 23): setup.cleanupNativeHookTransactionStagedDeletions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (8 pts), error handling 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdf66a00850d13117a7e19959b6a4fe6c64048a12e3bc8935992daad1b547f8"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.cleanupGeneratedNonInstallableNativeAgents (cognitive 23): setup.cleanupGeneratedNonInstallableNativeAgents has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 1 (3 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":6118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccd2f004c62fc3bc441ff65ab5d38e133ed50cafebf5f5ae26f924e0c679ecc"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.cleanupObsoleteNativeAgents (cognitive 23): setup.cleanupObsoleteNativeAgents has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 1 (3 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":6307}}}],"partialFingerprints":{"codehealthFindingId/v1":"8386d9efbcd441c911ed9f4c08957f8238933b32816b5a313aec49179fb1ce48"}},{"ruleId":"D2","level":"warning","message":{"text":"advisory-activation.activateOrResumeRalplanAdvisoryUnderCanonicalLock (cognitive 23): advisory-activation.activateOrResumeRalplanAdvisoryUnderCanonicalLock has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 6, ternaries 1 (nesting depth added 7). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory-activation.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b5f0797d4c2780e87dc59371da2caeee34c3c2847fc03e1666e511781fd8ae"}},{"ruleId":"D2","level":"warning","message":{"text":"artifacts.validateArchitectureInvariantGate (cognitive 23): artifacts.validateArchitectureInvariantGate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ultragoal/artifacts.ts"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"f117fb678d2dbba9e365a633d1adcbea3a64a9f26dfd2971eea587de4ada8b70"}},{"ruleId":"D2","level":"warning","message":{"text":"export.renderSessionMarkdown (cognitive 23): export.renderSessionMarkdown has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 4 (9 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/export.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b47af78d0eb5569e53e2884eadaf0167947d34d10703cc36ef1ce1c474c716"}},{"ruleId":"D2","level":"warning","message":{"text":"session-usage.parseSessionUsageArgs (cognitive 23): session-usage.parseSessionUsageArgs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, ternaries 2 (4 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/session-usage.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2a386302e5e94315dd2b4da17d6d3c5af2b1d4910a55e55069e4fe0364c21f"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.collectMarkdownTableRanges (cognitive 23): keyword-detector.collectMarkdownTableRanges has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), ternaries 3 (7 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"62aabaa44b4f322ef23ff6f050967b4354216fa80d27188f6f5e510b29b7764d"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.implicitClauseRange (cognitive 23): keyword-detector.implicitClauseRange has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":3180}}}],"partialFingerprints":{"codehealthFindingId/v1":"17953eec107e281ca6aa7dae5233252fbed91059c2900f24f4c4f707d73a804b"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectSloppyFallbackFindingsFromPatch (cognitive 23): codex-native-hook.collectSloppyFallbackFindingsFromPatch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffba4a5629ba1ce39ffe120620f3249c4451656c240196058870e72b41f0a04"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorStaticTruncateSize (cognitive 23): codex-native-hook.conductorStaticTruncateSize has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 4 (8 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1750a24c03eb591742a260c06b5ac7539b1cdf99e0d35d2f8a6705ff713ad0"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.classifyPreToolUseMutationTransport (cognitive 23): codex-native-hook.classifyPreToolUseMutationTransport has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, ternaries 2 (5 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5653}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b3eb421408f509d0f108923ff5ff241dab4b8034f4dbdc65ad79cab59606a6"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findEnvDispatchOperandIndex (cognitive 23): codex-native-hook.findEnvDispatchOperandIndex has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 6, 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7413}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1efb8a113f6035bf41698e846207f924bd26c85ab0907861a6d6207f30555ae"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findShellArithmeticExpansionEnd (cognitive 23): codex-native-hook.findShellArithmeticExpansionEnd has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8705}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f5a3afe72a386b4af757f8d23deaf324efa87ba6c37343710977f7140830d9"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.readActiveDeepInterviewStateForPreToolUse (cognitive 23): codex-native-hook.readActiveDeepInterviewStateForPreToolUse has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 9, ternaries 3 (nesting depth added 1). Of this number, 20 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10433}}}],"partialFingerprints":{"codehealthFindingId/v1":"066f908003a587da5101b7e1febf0758e8709d611bcde206d703f256eb1b3ad1"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.parseConductorWgetStartupOptions (cognitive 23): codex-native-hook.parseConductorWgetStartupOptions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14315}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dad1ac0f7f0098423072c3afc3203dfd1b8f662ac4ee62f03ff41fa4ab7c89"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.stripCommandSubstitutionBodiesForConductorScan (cognitive 23): codex-native-hook.stripCommandSubstitutionBodiesForConductorScan has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19401}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ee418007bfeb7d807e448243cd4a0b606352d0dc390e3026304271e52a21fb"}},{"ruleId":"D2","level":"warning","message":{"text":"index.resolveSetupInstallModeArg (cognitive 23): index.resolveSetupInstallModeArg has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, loops 1 (nesting depth added 10). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc54bf78b175fa70e52d3ac7d4defaa517eeeae061005520c42c4046fdc299f"}},{"ruleId":"D2","level":"warning","message":{"text":"notify-dispatcher.acquireTurnDispatchGuard (cognitive 23): notify-dispatcher.acquireTurnDispatchGuard has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (7 pts), error handling 6, if/else 5 (6 pts), boolean chains 4 (nesting depth added 4). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-dispatcher.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"400cb66be16026057e83f4172ef2c624efe40c0baa9ea6150c69bcc366b909dc"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-native-agents.assertTomlStructure (cognitive 23): verify-native-agents.assertTomlStructure has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/verify-native-agents.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7210f121f8d65cf75f8b6151f7eaaad26a8291b7a1d4be879b7e20a6829f93aa"}},{"ruleId":"D2","level":"warning","message":{"text":"omx_api::redact_key_value_secret_fragments (cognitive 23): omx_api::redact_key_value_secret_fragments has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts), 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":"crates/omx-api/src/lib.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2aee47339b7f1e036effd30c62affa490070c659d6043c0466892b2822870d8"}},{"ruleId":"D2","level":"warning","message":{"text":"omx_explore_harness::run_command_with_timeout (cognitive 23): omx_explore_harness::run_command_with_timeout has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-explore/src/main.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"9051d3df174bed11f3a2fdfc417c2fce9ed6460c7e4e2d9e6563420c76e4b38e"}},{"ruleId":"D2","level":"warning","message":{"text":"omx_sparkshell::redaction::redact_key_value_secrets (cognitive 23): omx_sparkshell::redaction::redact_key_value_secrets has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts), 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":"crates/omx-sparkshell/src/redaction.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc367da4055aa0c2cdace2ba2a32b2f75b6c3d9021a7edb1b94fc632279caf9"}},{"ruleId":"D2","level":"warning","message":{"text":"hermes.buildHermesCapabilityOverrides (cognitive 22): hermes.buildHermesCapabilityOverrides has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8 (20 pts), if/else 2 (nesting depth added 12). None of this is in the body itself: all 22 points belong to one function literal inside it that branches (line 323). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/hermes.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"13af7a545c21424dd3bd657f2a7f3c9e2506659ad18d03c4b94e911be4970a01"}},{"ruleId":"D2","level":"warning","message":{"text":"session.isAuthorizedBoundPointer (cognitive 22): session.isAuthorizedBoundPointer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 9, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9becfd70e4bee09481e994da4ae4e404f41ba509da27e2357ff1575123906b"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.stripOrphanedOmxSections (cognitive 22): generator.stripOrphanedOmxSections has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (9 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/config/generator.ts"},"region":{"startLine":3471}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb4ce5609828e077e6d92c6bcca93ec48f9fc3afe80d3b8f1c2966ad9ac174c"}},{"ruleId":"D2","level":"warning","message":{"text":"config.readAuthConfig (cognitive 22): config.readAuthConfig has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 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/auth/config.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdd3a7dfdb8dc5e831c2abd9ee4c964826da8768e373285864591337e04f6e3"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux.parsePosixHudEnvAssignments.inspect (cognitive 22): tmux.parsePosixHudEnvAssignments.inspect has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 8, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4ab45568f6ed8dc3a67d0862f1e59f20780908f7ef12e72496c77745d663be"}},{"ruleId":"D2","level":"warning","message":{"text":"scaling.asScaleDownDebtPanes (cognitive 22): scaling.asScaleDownDebtPanes has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (8 pts), ternaries 3, loops 2 (nesting depth added 2). Of this number, 14 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":"src/team/scaling.ts"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"666f999fb0c65c83643d925dc372769fc42e759bdbf938598eff12154b55a240"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.isValidGonePaneDescendantCleanupDebt (cognitive 22): runtime.isValidGonePaneDescendantCleanupDebt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 9 (nesting depth added 3). Most of this is not in the body itself: 5 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 3203). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":3198}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a260c4559a50473f04c9ef25e75673bd7c7930454b33570c50819fa040f456"}},{"ruleId":"D2","level":"warning","message":{"text":"followup.parseExecInjectArgs (cognitive 22): followup.parseExecInjectArgs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (20 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/exec/followup.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"c096e56e50df3129209f450dbfd21759b0c87950578409361e0bebad109456f9"}},{"ruleId":"D2","level":"warning","message":{"text":"toml.upsertTopLevelTomlString (cognitive 22): toml.upsertTopLevelTomlString has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 6). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/toml.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"20967ce0572decd9b480c25f94799ebba622f059235ef50fc1a35b7f69aca311"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.collectRepoArtifactOwnershipIssues::visit (cognitive 22): doctor.collectRepoArtifactOwnershipIssues::visit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), error handling 3 (4 pts), ternaries 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows 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/cli/doctor.ts"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af411c0d949d777ca92cfb610998d6fad497f83a98cb2831f6795837d053433"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.checkWindowsNativeHookShims (cognitive 22): doctor.checkWindowsNativeHookShims has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (6 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":2468}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e25205270f60933ee087a11f76f73fa0e30eac2d2de3134678d8f599d88963"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.checkNativeHooks (cognitive 22): doctor.checkNativeHooks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":2965}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5c2c11dd38d94042dc75aa89ca7ebf8c1b219b4fde2a8baaf9be60785cf254"}},{"ruleId":"D2","level":"warning","message":{"text":"index.launchTmuxPane (cognitive 22): index.launchTmuxPane has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 4 (5 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 6). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/index.ts"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb344bf7966a7e8b1a0cebc7e19ea1d4a9297e4f7220743e8ac0faad45612aa6"}},{"ruleId":"D2","level":"warning","message":{"text":"session-timeline.formatSessionTimeline (cognitive 22): session-timeline.formatSessionTimeline has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 8 (9 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/session-timeline.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78f2c96834fa4129594d3312015cff1bfc1baff1c82e8b772731e0f4f178b9c"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.envCommandHasCwdChangingOption (cognitive 22): codex-native-hook.envCommandHasCwdChangingOption has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6738}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c154f488a049b1c9f539df2e81e39c71cc62d99023a784e81b19b32ed28359"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findPackageManagerExecSubcommandIndex (cognitive 22): codex-native-hook.findPackageManagerExecSubcommandIndex has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 7, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7034}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2010fb6147e3c434d617043284242e3232e4efaa79b2494106fb5b63f287f45"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.extractDispatchBuiltinOperand (cognitive 22): codex-native-hook.extractDispatchBuiltinOperand has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da7a78781b01bcdf11aab9536b0285e8fbf20353e4fd9cd11168d81958bed80"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findConductorBareArithmeticCommandEnd (cognitive 22): codex-native-hook.findConductorBareArithmeticCommandEnd has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8753}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3c737db99f6fbd57c329824eb584fa2a97b6f393a0d76d3ec38dc3ffebcc1f"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findShellParameterExpansionEnd (cognitive 22): codex-native-hook.findShellParameterExpansionEnd has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8872}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ec6bb8c96e810f24da718e35db17ceffc27cbb1eab3aee4fef08230facccdc"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.hasUnquotedShellSubstitution (cognitive 22): codex-native-hook.hasUnquotedShellSubstitution has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9088}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d976b68daf99b64868b461956e4f9440a4fb44687cb11a2637d51305eb9c090"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isAllowedDeepInterviewTerminalStateWriteCommand (cognitive 22): codex-native-hook.isAllowedDeepInterviewTerminalStateWriteCommand has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, boolean chains 7, error handling 1. Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9551}}}],"partialFingerprints":{"codehealthFindingId/v1":"d168b778277b5ccd9d43373c499d1ad36e69c50c3252dca23f7f7d2ddb3d3bf2"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorWrapperLayersAreTrusted (cognitive 22): codex-native-hook.conductorWrapperLayersAreTrusted has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48b1b3a98e712a40922802b4d3c25c4bf8cd9abec4df668cdacd215d03e97b1"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorMutationUsesUnsafeOption (cognitive 22): codex-native-hook.conductorMutationUsesUnsafeOption has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 4 (6 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14256}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0e002c6514941048b2fdf7042560443bb67fbb2667ff2399105e66e82122b1"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.parseConductorCurlShortOptionCluster (cognitive 22): codex-native-hook.parseConductorCurlShortOptionCluster has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (6 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14817}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcea10e811a9e53eb7eed6542766186cf22e08f7f24aaa7ae16bc6e032c8f77"}},{"ruleId":"D2","level":"warning","message":{"text":"index.wakeOpenClaw (cognitive 22): index.wakeOpenClaw has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 6 (7 pts), boolean chains 6, error handling 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/openclaw/index.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc65ad533bfa582fcded049223df8898f42e13764d34fa0a9d7b28b945d5213"}},{"ruleId":"D2","level":"warning","message":{"text":"index.copyFilePreservingTimestamps (cognitive 22): index.copyFilePreservingTimestamps has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 3 (4 pts), ternaries 3, boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27de2ba46e3b98904cf714a3e4f7afad775c0cb10edcedfe11e7fb693d5d10c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.normalizeCodexLaunchArgs (cognitive 22): index.normalizeCodexLaunchArgs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":5991}}}],"partialFingerprints":{"codehealthFindingId/v1":"169a8383542e029a61be8cbca9c547c78c2b19157f3cc9e105d3050c4936f98e"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-injection.handleTmuxInjection::scanActiveModeStateDirs (cognitive 22): tmux-injection.handleTmuxInjection::scanActiveModeStateDirs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (tmux-injection.handleTmuxInjection) 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":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b90bc38502c2d530d8626b76806c014c80d25b6fff4ce5fcd25abac5d6b1b18"}},{"ruleId":"D2","level":"warning","message":{"text":"notify-fallback-watcher.processLine (cognitive 22): notify-fallback-watcher.processLine has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 8, boolean chains 4, error handling 1 (nesting depth added 4). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"caddf4539917c2338e5c710fe98b68719ab79591af6e6d272fd99f7b3cfbde0c"}},{"ruleId":"D2","level":"warning","message":{"text":"pinned-atomic-file-darwin-janitor.recover (cognitive 22): pinned-atomic-file-darwin-janitor.recover has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/pinned-atomic-file-darwin-janitor.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8da818ea29dde17fa63994d5c25039de82dcb796fe3d11f6bfd6b0eb67fd4a"}},{"ruleId":"D2","level":"warning","message":{"text":"omx_api::extract_backend_text_response (cognitive 22): omx_api::extract_backend_text_response has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-api/src/lib.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b27f89c4242331b9d4f1be2e5d17124ca4c5bb333423ec42951d3236ce24c17"}},{"ruleId":"D2","level":"warning","message":{"text":"isChildRoutingSessionStart (cognitive 22): isChildRoutingSessionStart has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, ternaries 5, if/else 3, error handling 2, other 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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"28093ceaefb4e19c0133be2fc8a1e295da0a86941932f1ec1c2c3e5c44ec4550"}},{"ruleId":"D2","level":"warning","message":{"text":"config.normalizeFromCustomAliases (cognitive 21): config.normalizeFromCustomAliases has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (6 pts), ternaries 3 (6 pts), loops 1 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/openclaw/config.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a456b16abdf015491973661d1241e1d6ec4e0da2f60f5694f9309839213c33c"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.discoverCodexHookConfigPaths (cognitive 21): codex-hooks.discoverCodexHookConfigPaths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (16 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/config/codex-hooks.ts"},"region":{"startLine":3025}}}],"partialFingerprints":{"codehealthFindingId/v1":"517c4f1d93c3edf17e5d3bb3b5aea3620c8a5f34ad5e915d79d01eafb2d6f0f4"}},{"ruleId":"D2","level":"warning","message":{"text":"native-assets.acquireCacheLock (cognitive 21): native-assets.acquireCacheLock has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 1 (4 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/native-assets.ts"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb28b2449954c0a1c35782215a9872fd0e39a3fa79055c0c8c6d24b5aa4ae70"}},{"ruleId":"D2","level":"warning","message":{"text":"session.startPointerTransition.\u003Creturned closure\u003E (cognitive 21): session.startPointerTransition.\u003Creturned closure\u003E has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (6 pts), ternaries 4 (5 pts), error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":2866}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acc98679b11d52b1fe27d3249a88339682cae947a3f07f0f9934ce46764939f"}},{"ruleId":"D2","level":"warning","message":{"text":"session.establishLaunchSessionBinding (cognitive 21): session.establishLaunchSessionBinding has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, error handling 2, ternaries 2 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":3099}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c01d15ceb975a9b0ac2e3e81a475128e4a33c8f5313af8959f4a2cbdcc0cff"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatch.executeBridgeCommand (cognitive 21): dispatch.executeBridgeCommand has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 7, 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":"src/team/state/dispatch.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c40242c315698db678413ee801a5e1c2c99d27673c1f5d4bf09647853de7efa"}},{"ruleId":"D2","level":"warning","message":{"text":"hotswap.buildResumeArgsWithPreservedFlags (cognitive 21): hotswap.buildResumeArgsWithPreservedFlags has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts), ternaries 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/hotswap.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65c92022ef7a9d3585e573741676abfe9f0583bc798ba812cc39535bade8266"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux.hudPaneMatchesOwner (cognitive 21): tmux.hudPaneMatchesOwner has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (8 pts), ternaries 4 (nesting depth added 1). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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/hud/tmux.ts"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bfb2482c48e4c8af68e1024219c0ef1b0e850a752796633ed4953c71332959"}},{"ruleId":"D2","level":"warning","message":{"text":"notice-ledger.normalizeLedger (cognitive 21): notice-ledger.normalizeLedger has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 9, 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/team/notice-ledger.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3a924a337eda081c7fe46642166cabe2b28d103dfd16f1eb583c605a69a25c"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.findActiveTeams (cognitive 21): runtime.findActiveTeams has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":5982}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d27a9058d67d3919535d74cab9fda9ba81f102370e704c21b4e1e338c1467fa"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.finalizeHookPreferredMailboxDispatch (cognitive 21): runtime.finalizeHookPreferredMailboxDispatch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6737}}}],"partialFingerprints":{"codehealthFindingId/v1":"14696968cf7f40865a7aa2615315ba986c898eb6da08e4f676e3da779f210f49"}},{"ruleId":"D2","level":"warning","message":{"text":"events.readTeamEvents (cognitive 21): events.readTeamEvents has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/events.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a845440ec139ac4b7fe63e92129c908bd34436a993e0f490256f36325ea709eb"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.validateStagedPluginSnapshot (cognitive 21): plugin-marketplace.validateStagedPluginSnapshot has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), error handling 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2613f1db8dc43f459df642fdf1683c653fa130ed0e8698e572c923c3a59f26bc"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.checkNativePostCompactHookRuntime (cognitive 21): doctor.checkNativePostCompactHookRuntime has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, error handling 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":3296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0782251901c6193c26c57a876ff96c54fffd2096760f5789a05f6bf268f31a6"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.cleanupStagedDeletions (cognitive 21): uninstall.cleanupStagedDeletions has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 2 (8 pts), if/else 3 (6 pts), error handling 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.ts"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"f706288664b4d68a2a42fb72f1b071d9035ecb86dc8365f61e4c3575c6b0e377"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.printSummary (cognitive 21): uninstall.printSummary has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (20 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.ts"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac8ff90ebdaca2d24989570bab9d15be4397aebe6d8beefb8807aca5313e063"}},{"ruleId":"D2","level":"warning","message":{"text":"sparkshell.sparkshellCommand (cognitive 21): sparkshell.sparkshellCommand has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/sparkshell.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f4806249fc9ac83f1b7cd11bb936a633ad8db1f5673df954bf203b1eed3c15"}},{"ruleId":"D2","level":"warning","message":{"text":"update.runDeferredGlobalUpdate (cognitive 21): update.runDeferredGlobalUpdate has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 6, error handling 4 (6 pts), if/else 5 (6 pts), ternaries 2 (3 pts) (nesting depth added 4). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f68a6c4823d9035ef1287042ff8fc0f8405585a8c5aa5634b9b1ee924ea327"}},{"ruleId":"D2","level":"warning","message":{"text":"enforcer.findFreshLocalPlanningTargets (cognitive 21): enforcer.findFreshLocalPlanningTargets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts), error handling 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document-refresh/enforcer.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be487ccce034d425dc5d3464c576cab4f231c74ae7f72f5c41d288f84d9aae8"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.decodeStaticRedirectShellWord (cognitive 21): codex-native-hook.decodeStaticRedirectShellWord has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 7, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be792c24aa7f4abef95c33a24d9170aab4e443c3b05bbb0489b6cac68dc6bbb"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.extractNestedProcessSubstitutionStringsForStateScan (cognitive 21): codex-native-hook.extractNestedProcessSubstitutionStringsForStateScan has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e165aa0377924f4b834b98ee7b2ad87cad33fb22409bc2fd8adb202135be0727"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findCommandSubstitutionEnd (cognitive 21): codex-native-hook.findCommandSubstitutionEnd has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8530}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccabeae08cda654f7351937ef45e13bf0952ee41fe2335dd35c294c913ed12c"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isAllowedTrustedAbsoluteOmxReadOnlyCommand (cognitive 21): codex-native-hook.isAllowedTrustedAbsoluteOmxReadOnlyCommand has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, boolean chains 10. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10128}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cd0310579e1658699959a955358242a2c2712ff2e0a1319939ded59ac79601"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.resolvePreToolUseWriteActor (cognitive 21): codex-native-hook.resolvePreToolUseWriteActor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, boolean chains 8, ternaries 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10893}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08bd0b2e5bd91dcd31dee9764afe3999bd04cb655ccb816742bec93c8ef014c"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.commandConfiguresRuntimeEnvironment (cognitive 21): codex-native-hook.commandConfiguresRuntimeEnvironment has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11783}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8520625f9807747028e34c6d8f2b8cf74650d1b86bb66efcb6309c6beb988a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.nodeCommandHasPreloadExecution (cognitive 21): codex-native-hook.nodeCommandHasPreloadExecution has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12707}}}],"partialFingerprints":{"codehealthFindingId/v1":"258e5580be1fb43045d1a204cebb61040ca0a8518c407c976303eecf35ee86d1"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectConductorSedTargets (cognitive 21): codex-native-hook.collectConductorSedTargets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15397}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dd903c7c83dfb20ebb977f29c37d2b2ec1b359123ff5e04d949505e5567477"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.declarationExportMode (cognitive 21): codex-native-hook.declarationExportMode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, loops 1, ternaries 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16996}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae650812c82873fcf0536fb59c9b3bb306906305c9cd993450b4a52dddc2d51e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.materializeUserGlobalAgentsFile (cognitive 21): index.materializeUserGlobalAgentsFile has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (6 pts), error handling 2 (4 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/cli/index.ts"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc9c05ace4da4485811d5d2fcd54fb909364142558f8f0fee36d06cbeae71cc"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime-state.readHudState (cognitive 21): runtime-state.readHudState has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/extensibility/sdk/runtime-state.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5feb9bc016d6567073c9bb034e890e5b44bd789f7d4489b740bb8a808b26b492"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux.sendTmuxKeys (cognitive 21): tmux.sendTmuxKeys has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 9, ternaries 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/hooks/extensibility/sdk/tmux.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e1ac99b418cadc962e4f03fc893fc31c88751b7e32b122027e0797ca6a4959"}},{"ruleId":"D2","level":"warning","message":{"text":"operational-events.buildOperationalContext (cognitive 21): operational-events.buildOperationalContext has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 13 (17 pts), error handling 1 (2 pts), boolean chains 1, if/else 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/operational-events.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de7c7c6daf9c7113869c4190a7bcdf478a72b85103de8db479f82a261da3c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"omx_explore_harness::validate_repo_paths (cognitive 21): omx_explore_harness::validate_repo_paths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-explore/src/main.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc922b05dad0db46d32b7aa4106f66b4f86cc1aec6bb8a06d715a6ed7a78a8ac"}},{"ruleId":"D2","level":"warning","message":{"text":"readLivePinMutationLock (cognitive 21): readLivePinMutationLock has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (8 pts), error handling 2 (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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"9282d0f795ce4c6539cd1d1249c67acc4faff053f659ea5cd4b98880c82877cc"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.isValidRustRegexEscape (cognitive 20): codex-hooks.isValidRustRegexEscape has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7, ternaries 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/config/codex-hooks.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9291fdeb5d7beea56550be63ab37666893551b09ec65d67dbf19f9bc52636a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.knownFieldPatches (cognitive 20): codex-hooks.knownFieldPatches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). Of this number, 15 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"701053dd6d6e50ac3541fe145f1f9411f9cc1a1bcb10ab513fc23071e9665b62"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.applyCoordinateSafeRemovals (cognitive 20): codex-hooks.applyCoordinateSafeRemovals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 2, ternaries 1 (nesting depth added 6). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0d85c3ac4c1e30a95a41f1690c3548b0fbc284d8ffd506aab4df307d7c99f8"}},{"ruleId":"D2","level":"warning","message":{"text":"native-assets.publishManagedNativeBinary (cognitive 20): native-assets.publishManagedNativeBinary has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 2 (5 pts), error handling 3 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/native-assets.ts"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3fb7d3ab96d2e2fe575225ace28bef7255adc662b8ff9a32c62528e6642841"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatch-lock.withDispatchLock (cognitive 20): dispatch-lock.withDispatchLock has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 4 (8 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/dispatch-lock.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c02a28f9688c0dd777c51ee3f042b7bb6a34180769af03f3e23a68a3b5828b"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.stripOmxFeatureFlags (cognitive 20): generator.stripOmxFeatureFlags has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts), boolean chains 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"da31680094e972d0ce7c66999bab4a4ef79beb176c133c2f106d2eefec805c1c"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.buildMergedConfig (cognitive 20): generator.buildMergedConfig has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 7, boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":4287}}}],"partialFingerprints":{"codehealthFindingId/v1":"1615c92c9e804376df800cbe87a49c3c1c7189b35539a4fc9cd35d8b94d19b13"}},{"ruleId":"D2","level":"warning","message":{"text":"exact-pane.parseExactPaneProof (cognitive 20): exact-pane.parseExactPaneProof has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/exact-pane.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a949ec8830a760cffd3c34090c4930af7d1fbda0293a6d1b7facb37f588ef374"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.quarantinePersistedRootAuthority (cognitive 20): tracker.quarantinePersistedRootAuthority has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, 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 one function literal inside it that branches (line 1580). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7eebb4000192e04cbeaedd5c45c21b688f0d703a2dc33dad50f0a5ad3bf69da"}},{"ruleId":"D2","level":"warning","message":{"text":"config.mergeEnvIntoFileConfig (cognitive 20): config.mergeEnvIntoFileConfig has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, if/else 9. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/config.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"653845fc84d91e299a0fd0dc2f2fa56a677531b247f2d52c3784146dab2f881d"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux.detectTmuxSessionByPid (cognitive 20): tmux.detectTmuxSessionByPid has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, error handling 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. This shape REPEATS in the file: one other method here (tmux.detectTmuxPaneByPid) 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":"src/notifications/tmux.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23bc6edf4848192445db609c9eb596b5603a2accd93c7de4af9c80ced0156b2"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux.detectTmuxPaneByPid (cognitive 20): tmux.detectTmuxPaneByPid has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, error handling 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. This shape REPEATS in the file: one other method here (tmux.detectTmuxSessionByPid) 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":"src/notifications/tmux.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"4691a4ec9f36afc643284ec9c3f48f3df1fa30a3148d0c553d3544c6d5869f74"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-session.sendToWorker (cognitive 20): tmux-session.sendToWorker has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/tmux-session.ts"},"region":{"startLine":3852}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afc89b69479fa55864e4fe29d4ac9317686a6e452792687e26ed619171883b7"}},{"ruleId":"D2","level":"warning","message":{"text":"worker-bootstrap.generateInitialInbox (cognitive 20): worker-bootstrap.generateInitialInbox has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 7, boolean chains 4 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-bootstrap.ts"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c8bbe8c37cff71e28df220fbb1b7caa9a93bf6ebf2b33ca9f8355e4d83f39c"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.collectAuthorizedSharedSessionWorkerPaneIds (cognitive 20): runtime.collectAuthorizedSharedSessionWorkerPaneIds has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"572feda3eb881db439287657b7bbf7d7d02c7f12f2966637024811f06ca65a06"}},{"ruleId":"D2","level":"warning","message":{"text":"api-interop.resolveTeamWorkingDirectory (cognitive 20): api-interop.resolveTeamWorkingDirectory has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/api-interop.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c63aeaf6b72d4cb0b9477a6e05d1369b2c41e25ccf220ba294924b11756331"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.writePendingOmxPluginCacheLivePinRegistration (cognitive 20): plugin-marketplace.writePendingOmxPluginCacheLivePinRegistration has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 4 (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/cli/plugin-marketplace.ts"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed35db239491cb008fcb1d66a6de49bfbd87cc5d83e04425374785ba037ebd9f"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.omxPluginCacheSkillsProvenanceReason (cognitive 20): plugin-marketplace.omxPluginCacheSkillsProvenanceReason has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 4 (6 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2887}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22d52c7372ef659d327712a94f94337e1c19cade7aa1196b64470c8e7a1a206"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.upsertTomlTableBooleanKey (cognitive 20): plugin-marketplace.upsertTomlTableBooleanKey has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (6 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":4587}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62b49080734c90416741cbf5b25e941b018dae4d8a07ee2534bd0c15702cea5"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.selectorEvaluation (cognitive 20): doctor.selectorEvaluation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, ternaries 3 (6 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/cli/doctor.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb2d99ddaf7fbe3b3951b652e1ffb1c8b528f2b0f4ea8a3c8f5fa0bcc2674ef"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.syncNativeAgentToml (cognitive 20): setup.syncNativeAgentToml has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":5877}}}],"partialFingerprints":{"codehealthFindingId/v1":"4798590baf54ffde05b831f137be7cc85393de6ce5a0c6f84f0688599278e5fe"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.removeAgentConfigs (cognitive 20): uninstall.removeAgentConfigs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (3 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.ts"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dae42c2f648bbad700f6c7d7a47e36e29702670f1d0e01c5e6923efdcee850"}},{"ruleId":"D2","level":"warning","message":{"text":"update.runDevGlobalUpdate (cognitive 20): update.runDevGlobalUpdate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, boolean chains 4, error handling 2, ternaries 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7939d270a601bdeb7a9edd66eeb9127a1fea43c85b9da7353d2f929c4924f692"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.scanExplicitCandidates (cognitive 20): keyword-detector.scanExplicitCandidates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 3 (6 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":2505}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc129a20925b80b53c3b06cc3e9430022d5391a7f2c551d66939dfd09df4e600"}},{"ruleId":"D2","level":"warning","message":{"text":"pre-tool-use-advisory.toAdvisoryOrCancelPreToolUseOutput (cognitive 20): pre-tool-use-advisory.toAdvisoryOrCancelPreToolUseOutput has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/native/pre-tool-use-advisory.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b8b2288a0bc38b35c292ec7b21f2c670bd9f0601a58d8bdbff84cabdc13943"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.shouldRetireShadowedRalphStartingSeed (cognitive 20): codex-native-hook.shouldRetireShadowedRalphStartingSeed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ee8698c10fdacf640de9f74ce00863ef372ebd6e50da77cb2507e1ee4c8fcf"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.listRawActiveSkillEntries (cognitive 20): codex-native-hook.listRawActiveSkillEntries has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (9 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":3174}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a038f8c5df467874e1e776fc7b84277c606ad00f82b2168ba2750d9bffc3ed"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorHeredocRedirectHasBoundedProducer (cognitive 20): codex-native-hook.conductorHeredocRedirectHasBoundedProducer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5209}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cf50599aa925957e234babd48f6a6380bbfa1ac9d6127303ccf710014c9933"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findOmxCliWrapperRuntimeScriptIndex (cognitive 20): codex-native-hook.findOmxCliWrapperRuntimeScriptIndex has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a57abd3de67fe391091a5ce558a5a7f3d09d7627a8405dd5da66bf46d9cef7a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findProcessSubstitutionEnd (cognitive 20): codex-native-hook.findProcessSubstitutionEnd has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8573}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcd0f1fc9583bd4f94d0547d2f6de8a461c90585fe793f17fcd4e0462f9f3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isStandaloneParsedOmxStateWriteTransport (cognitive 20): codex-native-hook.isStandaloneParsedOmxStateWriteTransport has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddd749f50c7a4b4775203300c164beaf4026de9cfb705a60da5d76a408dbee4"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.deepInterviewRalplanHandoffPayloadHasExactSchema (cognitive 20): codex-native-hook.deepInterviewRalplanHandoffPayloadHasExactSchema has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9351}}}],"partialFingerprints":{"codehealthFindingId/v1":"928341bd715a77f107d1cdd1eae64cb667ac179eb214e7957098da4dbe375ab9"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.handleDirectOmxCancel (cognitive 20): codex-native-hook.handleDirectOmxCancel has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, boolean chains 6, ternaries 3 (4 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9721}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9e4555d3ecb576ce1936f072a13630490d4698b7ea43fb6257731343d0d5c6"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.parseConductorSingleSubstitutionProgram (cognitive 20): codex-native-hook.parseConductorSingleSubstitutionProgram 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). To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11534}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4fcd72893017cdd974cb0c665f594f21d51f23e6e324196d12988fa9f567ae"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.ghReadOnlyCommandHasStaticRemoteArguments (cognitive 20): codex-native-hook.ghReadOnlyCommandHasStaticRemoteArguments has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12381}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7ad25ad817a665c8b4936edd28c19ef6e73e49afb18cc745266e92c689b10d"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.applyShellFunctionBindingEffect (cognitive 20): codex-native-hook.applyShellFunctionBindingEffect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, loops 1 (nesting depth added 5). 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, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18797}}}],"partialFingerprints":{"codehealthFindingId/v1":"47645020385f632ea7c293a9ad7a0db5a1be839ddc04d29fad1ba5801e858416"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.stripProcessSubstitutionBodiesForConductorScan (cognitive 20): codex-native-hook.stripProcessSubstitutionBodiesForConductorScan 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19365}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfee7332706a84339c90e89618d70b7f1c5ae5c80bbb6f2f17b885910113204"}},{"ruleId":"D2","level":"warning","message":{"text":"index.decodeDetachedLeaderPayload (cognitive 20): index.decodeDetachedLeaderPayload has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, ternaries 6, if/else 5, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":8879}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a537d82b2e35c2421becc363f0e5168cabdf5e3f2d28f0b2a228da2f4a5f312"}},{"ruleId":"D2","level":"warning","message":{"text":"mode-binding-lease-helper.sameOwnerState (cognitive 20): mode-binding-lease-helper.sameOwnerState has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 14, if/else 6. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/mode-binding-lease-helper.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97e8a0dbd1edf924bb9c7acfe4ad8739ae68d679fad72cdcf431bb92083482c"}},{"ruleId":"D2","level":"warning","message":{"text":"omx_runtime_core::engine::mailbox_acknowledgement_is_reflected (cognitive 20): omx_runtime_core::engine::mailbox_acknowledgement_is_reflected has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime-core/src/engine.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ab40e890f02f1a99d156188e8c6c8258b8327cf8a6ae99319b31401b607795"}},{"ruleId":"D2","level":"warning","message":{"text":"isTrackedSubagentInSessionTree (cognitive 20): isTrackedSubagentInSessionTree has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"154ef59c200b02b317066103bbac5362715a4c4fcda8787653be2fe23c030350"}},{"ruleId":"D2","level":"warning","message":{"text":"native-assets.readOpenedFile (cognitive 19): native-assets.readOpenedFile has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, ternaries 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/native-assets.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"48550cd8780e66c9291379899a9a33350e664e7333f847c74d09065f7533d1db"}},{"ruleId":"D2","level":"warning","message":{"text":"worktree.parseWorktreeMode (cognitive 19): worktree.parseWorktreeMode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worktree.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1be99665ecb4288ac29af3796830248d20c89e9e0f7875da076833b4febc42"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatch.transitionDispatchRequest (cognitive 19): dispatch.transitionDispatchRequest has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 3 (4 pts), boolean chains 3 (nesting depth added 9). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 368). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/dispatch.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d76cae4dbf46bcc1dc9c0be18a066a00a1936d2c2e3a49a55c73994b4c8fca"}},{"ruleId":"D2","level":"warning","message":{"text":"monitor.getTeamSummary (cognitive 19): monitor.getTeamSummary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, ternaries 2 (4 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/team/state/monitor.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe51193135f6af09e13d7adbb284da4f3e1295500701bcc0fa09138ebf1401c"}},{"ruleId":"D2","level":"warning","message":{"text":"redact.createAuthStderrRedactor.accept (cognitive 19): redact.createAuthStderrRedactor.accept has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/redact.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f331ef4eb9206a8593d4ddf796156d59693b262ff6d2aa83c17bfabaeb34281"}},{"ruleId":"D2","level":"warning","message":{"text":"mode-state-context.withModeRuntimeContext (cognitive 19): mode-state-context.withModeRuntimeContext has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/mode-state-context.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db85ac022616a4c1ca1a4fe9c63b027d9818ea18678b5cb192d78cd5af420bd"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.withCrossProcessFileLockSync (cognitive 19): tracker.withCrossProcessFileLockSync has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, error handling 2, ternaries 2, loops 1 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bc66a4444516ecab644880476ee7d99b13df1ec0ff6bc4874def4ee38a8af7"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonChildClient.consume (cognitive 19): JsonChildClient.consume has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/pinned-atomic-file-darwin-client.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"92affe71a6ba23e613f3da5458712478115022d4edfffb10bf2eb47cc0e9a4e9"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-active.listActiveSkills (cognitive 19): skill-active.listActiveSkills has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (7 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/skill-active.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6b0a48ae92f51e75c51138c76dbb034f4729ab8fd03deb12e5d2267dfc6cd6"}},{"ruleId":"D2","level":"warning","message":{"text":"ui.applyInteractiveSelectionKey (cognitive 19): ui.applyInteractiveSelectionKey has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/ui.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"665ffa8a8e9a1ff2eb278715e46344d92ae11dc9097d7e31ae2e44f7ad06373f"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-normalization.normalizeTerminalWorkflowState (cognitive 19): terminal-normalization.normalizeTerminalWorkflowState has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/terminal-normalization.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8863f107c2f02e8d68bae3084384e6710fa160ea07d875b7ea8b18ca45fb18d0"}},{"ruleId":"D2","level":"warning","message":{"text":"render.renderUltragoal (cognitive 19): render.renderUltragoal has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11, boolean chains 5, if/else 3. Of this number, 13 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, 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/hud/render.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2620923a206bf691ad440ebb35b3454c4221066620ce9add49c921f17a68129"}},{"ruleId":"D2","level":"warning","message":{"text":"reconcile.assessOwnedHudLayout (cognitive 19): reconcile.assessOwnedHudLayout has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 7. 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, 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/hud/reconcile.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"385956729cdeee1e74ea318ed4754cd6409f3eb38ed17da27ef756bb33529d20"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-session.isWorkerAlive (cognitive 19): tmux-session.isWorkerAlive has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/tmux-session.ts"},"region":{"startLine":4009}}}],"partialFingerprints":{"codehealthFindingId/v1":"446d0b927dda7fd7a5c2dc939a3ce96f505bc01ee9903a8c7557ab271fca8292"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.persistGonePaneDescendantCleanupDebt (cognitive 19): runtime.persistGonePaneDescendantCleanupDebt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (6 pts), loops 1 (2 pts), boolean chains 1, 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":"src/team/runtime.ts"},"region":{"startLine":3116}}}],"partialFingerprints":{"codehealthFindingId/v1":"937ef96a43da6cc02f72b488cbc49cf3ebd7b8527e192a57646d81619de6529e"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.reconcileGonePaneDescendantCleanupDebt (cognitive 19): runtime.reconcileGonePaneDescendantCleanupDebt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (7 pts), error handling 1, loops 1 (nesting depth added 9). Of this number, 12 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":3238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6566307844e591809522fffd46c2c2c463ce4defc76f15ae2dea28c68bdab6ba"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.resolveEffectiveWorkerCliForStartupLog (cognitive 19): runtime.resolveEffectiveWorkerCliForStartupLog has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 1 (nesting depth added 11). Of this number, 12 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":3432}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1a23748320c13bfc315ae638faafb5743665f2985792f116a8e1d0ab955ca1"}},{"ruleId":"D2","level":"warning","message":{"text":"api-interop.buildStallState (cognitive 19): api-interop.buildStallState has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 6, ternaries 4 (5 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/api-interop.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3e3d1d3494a78b7a1a0d811ecaefe0d1562af06c59901d5971287a3fcdca25"}},{"ruleId":"D2","level":"warning","message":{"text":"followup.withQueueLock (cognitive 19): followup.withQueueLock has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), error handling 2 (5 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/exec/followup.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3147b827f4f730f246a07d2f1a8b8e01586e5aad0fd614c29c677e3849552883"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.cleanupPluginModeLegacyPrompts (cognitive 19): setup.cleanupPluginModeLegacyPrompts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (3 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/cli/setup.ts"},"region":{"startLine":3556}}}],"partialFingerprints":{"codehealthFindingId/v1":"594ec39670c30f9ddbc561e23cb8f182adf1a731e02e566911d156b8a19cabb7"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.removeAgentsMd (cognitive 19): uninstall.removeAgentsMd has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 1 (2 pts), boolean chains 1, 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":"src/cli/uninstall.ts"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"176574c375514f33b03dcffa2910c89f05ec3b78dac67fa454d952987c8977bb"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.latestCompatibleRoleLane (cognitive 19): runtime.latestCompatibleRoleLane has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/runtime.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"011fa2472e461a7f26e2c8721b30def79c86c9b95487df58054d2c9b013bc664"}},{"ruleId":"D2","level":"warning","message":{"text":"agents-overlay.readActiveModes (cognitive 19): agents-overlay.readActiveModes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 5, ternaries 3 (4 pts), error handling 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/hooks/agents-overlay.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2274657a28cb717f7e85f5affb3e569c4dcd2319750a610e98bd377c6b0271"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.detectImplicitKeywords (cognitive 19): keyword-detector.detectImplicitKeywords has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":3416}}}],"partialFingerprints":{"codehealthFindingId/v1":"432d3ba404dcf0edc60b40984dd913570b9f0cad5a7b477487d41d399c0db800"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-pre-post.parseGitCommitCommand (cognitive 19): codex-native-pre-post.parseGitCommitCommand has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, ternaries 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-pre-post.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba82a5ea4927135af9d615e590ce89ed71afca7f7e9dfceec772f203ea4e4ae6"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.classifyRalplanBeadsMetadataCommand (cognitive 19): codex-native-hook.classifyRalplanBeadsMetadataCommand has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 3 (4 pts), loops 1 (nesting depth added 3). 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, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":4865}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccdc90dfbf13bdaf43cad19702f85a096f559c8c8b1a3436bb619a63f1c10de"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.extractCommandLiteralAssignments (cognitive 19): codex-native-hook.extractCommandLiteralAssignments has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":4999}}}],"partialFingerprints":{"codehealthFindingId/v1":"183fb4ec17cb3541fdb42282e46dde99510ce7718140d4697511b74eb0473308"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.extractInvokedShellFunctionBodiesForStateScan (cognitive 19): codex-native-hook.extractInvokedShellFunctionBodiesForStateScan 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8056}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95f5c9314333139551f1f9f420e954c35b8ed1b8636bb0bf04256ff1ae1dc94"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.hasExistingDurableDeepInterviewHandoffEvidence (cognitive 19): codex-native-hook.hasExistingDurableDeepInterviewHandoffEvidence has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0085771eb5abe6a9fb1e3e0f0ea93fdbac292e36c2249b47ebf0b6a0d6ed5874"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.parseConductorWgetExecuteTargets (cognitive 19): codex-native-hook.parseConductorWgetExecuteTargets has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 7, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14499}}}],"partialFingerprints":{"codehealthFindingId/v1":"d320725d9be5c8e65031dab96f9e26dd3834cada05f32ee0b0f8b55c60318138"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.resolveConductorCommandIndex (cognitive 19): codex-native-hook.resolveConductorCommandIndex has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16956}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c1ba7d00cc8d7c62b48818ac57ffb2f060f7308acfc3b48a00cf198e7e3121"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.createNestedExecChildFunctions (cognitive 19): codex-native-hook.createNestedExecChildFunctions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (5 pts), boolean chains 3, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":18765}}}],"partialFingerprints":{"codehealthFindingId/v1":"f438120269eeaf7d5c2f5ba072faa5c9af718dfb4d6f2a67c82e212997aa5e55"}},{"ruleId":"D2","level":"warning","message":{"text":"http-client.noProxyMatches (cognitive 19): http-client.noProxyMatches has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/http-client.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"472f3942ae115b33256ddc0f08370e6db68652c608553acb6c185768f69e91f3"}},{"ruleId":"D2","level":"warning","message":{"text":"template-engine.computeTemplateVariables (cognitive 19): template-engine.computeTemplateVariables has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 19. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/template-engine.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2b3ed9f499249ff0eab9ec914e58113d41e2e8b391b9c86479defb70c6f550"}},{"ruleId":"D2","level":"warning","message":{"text":"process-tree.runProcessTreeWithTimeout (cognitive 19): process-tree.runProcessTreeWithTimeout has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 1). None of this is in the body itself: all 19 points belong to 10 function literals inside it that branch (lines 129, 175, 185, \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":"src/runtime/process-tree.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f704973ae9b79631d397030f5914ce383c113d31c2708cffa05e234e5b22e88"}},{"ruleId":"D2","level":"warning","message":{"text":"index.resolveSetupAgentsMergePolicyArg (cognitive 19): index.resolveSetupAgentsMergePolicyArg has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, loops 1 (nesting depth added 5). 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/cli/index.ts"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b239db0fcc7c42302a13eb75d9dfbc25a7e02410d0197e7ab1407f979200da"}},{"ruleId":"D2","level":"warning","message":{"text":"index.persistProjectLaunchRuntimeJsonlArtifact (cognitive 19): index.persistProjectLaunchRuntimeJsonlArtifact has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (6 pts), ternaries 3 (6 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/cli/index.ts"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"f679c34ee48b77868ef14ea67e257072d4ca3cd02cf4eb8a2fd31345c8401ee6"}},{"ruleId":"D2","level":"warning","message":{"text":"hook-derived-watcher.pollFiles (cognitive 19): hook-derived-watcher.pollFiles has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"226353104cc34d5de85a02291c212a0526b0662718dd30cc7dc09ffe36950f93"}},{"ruleId":"D2","level":"warning","message":{"text":"team-dispatch.withLockDirectory (cognitive 19): team-dispatch.withLockDirectory has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 4 (8 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"d523141018dca3f66abb4db140ebeb3bf5a7f56c9e5e1255e9b0a4bad6413121"}},{"ruleId":"D2","level":"warning","message":{"text":"omx_api::extract_backend_image_response (cognitive 19): omx_api::extract_backend_image_response has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-api/src/lib.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"c863bd629fe849d37d4bf7082083f7f048e09a634115f3a7978692d92ff68511"}},{"ruleId":"D2","level":"warning","message":{"text":"omx_sparkshell::codex_bridge::normalize_summary (cognitive 19): omx_sparkshell::codex_bridge::normalize_summary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-sparkshell/src/codex_bridge.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8815b10dabf20b380ee98fcd5491681d79d29c0bc7de0eb2815256e5567782"}},{"ruleId":"D2","level":"warning","message":{"text":"state-paths.normalizeSessionMetadata (cognitive 18): state-paths.normalizeSessionMetadata has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 12, boolean chains 5, if/else 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/state-paths.ts"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d20da2eda512437d43e29cb6105ee0172a198390cd3b661d300ff62ce578be"}},{"ruleId":"D2","level":"warning","message":{"text":"session.classifySessionProcessForRecovery (cognitive 18): session.classifySessionProcessForRecovery has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 4, ternaries 2 (4 pts), error handling 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb0c7dff94f5b8badd09a5d1fe1e75cd12a13080329cb0aac3472bf9d9eddb1"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatch.normalizeBridgeDispatchRecord (cognitive 18): dispatch.normalizeBridgeDispatchRecord has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10, boolean chains 7, if/else 1. 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: 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/team/state/dispatch.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"155c58fce74b945f3587fb5d5ba87f44331bb3af07e6bac2fd63eb2992b1f0e0"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.parseTomlSourceKeySegment (cognitive 18): generator.parseTomlSourceKeySegment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (4 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/config/generator.ts"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2cf572c1f47c6493ba88e99a6d3f7ff6f755208233ae14b6b3cc22459c31c1"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.managedMarkerTrustStateConflicts (cognitive 18): generator.managedMarkerTrustStateConflicts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 5, loops 2 (3 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":"src/config/generator.ts"},"region":{"startLine":2663}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50f70da46402545fc74dacf08f7072d9fbc922211e93890fbef26fa11e3e180"}},{"ruleId":"D2","level":"warning","message":{"text":"contracts.parseSimpleYamlFrontmatter (cognitive 18): contracts.parseSimpleYamlFrontmatter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/autoresearch/contracts.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6aa90e217c6148b407889481dd2bbc240ecaa856484826e913f4b7cc7b0e5db"}},{"ruleId":"D2","level":"warning","message":{"text":"documented-leader-preflight.neutralizeOwnedRoutingRalplan (cognitive 18): documented-leader-preflight.neutralizeOwnedRoutingRalplan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, error handling 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/documented-leader-preflight.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d90dea66236390667026645f981195e614ae39ad447b837462ce6ad411d403"}},{"ruleId":"D2","level":"warning","message":{"text":"mode-binding-lease.resolveValidatedCanonicalModeBinding (cognitive 18): mode-binding-lease.resolveValidatedCanonicalModeBinding has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, ternaries 2, error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/mode-binding-lease.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c57394264bbaa797c782c72f96ba156513dc081d866fc4357edc2e49c31771"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux.recoverHudSplitPaneId (cognitive 18): tmux.recoverHudSplitPaneId has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3545677e31236348ea38de6eed7cfa7ebd6a4218b5e8857806567cacd042eff"}},{"ruleId":"D2","level":"warning","message":{"text":"quality-gates.normalizeGateEntry (cognitive 18): quality-gates.normalizeGateEntry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/quality-gates.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f351fac71c3b4eae32316bc79c91d3f5f5c49c0a050fd9d6decbfde8b466f777"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.readOmxPluginCacheLivePinMutationLock (cognitive 18): plugin-marketplace.readOmxPluginCacheLivePinMutationLock has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, error handling 2 (nesting depth added 3). 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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36c410c671d5a72d6ab5a6cea4357cd660ff49b061a1521b6f3b0b684124209"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.computeOmxPluginCacheClaimDigest::visit (cognitive 18): plugin-marketplace.computeOmxPluginCacheClaimDigest::visit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, ternaries 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/cli/plugin-marketplace.ts"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"73beb6318819993853f106d8f172c600300fd1bceec90e403ffd2daf399ed33a"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.checkProcessIdentityReadiness (cognitive 18): doctor.checkProcessIdentityReadiness has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (13 pts), boolean chains 2, if/else 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e6f98f4683608904d43d38c3a668687b1c32959338acc0b61f809c23292b81"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.checkPluginVersionDiagnostics (cognitive 18): doctor.checkPluginVersionDiagnostics has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 4 (8 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/cli/doctor.ts"},"region":{"startLine":3784}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fb66accd91ee3ad11eeff9b4af92e54102de5d72f38668af7fd755e981d189"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.stripLocalOmxPluginEnablementForDisable (cognitive 18): setup.stripLocalOmxPluginEnablementForDisable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":3953}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ef80c3f95261e3aa876939cea842eaf35d2e6623e6678c467d364dc7747898"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.assertControlledTopologyCurrent (cognitive 18): uninstall.assertControlledTopologyCurrent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1a2e306248bd515826abb88b3ee84765c6ae58a25b99db2ef9122a8ebcbabe"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.parseNotifyMetadata (cognitive 18): uninstall.parseNotifyMetadata has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 7, ternaries 2 (3 pts), error handling 1 (nesting depth added 1). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc5fec579e505a3ed74464ac2e44fd63fa734d3f23833e1ecbf8dff91244b3f"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.restoreFileSnapshot (cognitive 18): uninstall.restoreFileSnapshot has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 2 (8 pts), error handling 2 (5 pts), if/else 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.ts"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e1f6d092fb5cfcc002969783f72b71b4d3cbffcad2d70d990726a8298e3b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"authority.validateAuthorityState (cognitive 18): authority.validateAuthorityState has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/authority.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f392ed99e83dd965925dfc48a948072886a909a48e2e6647274a3063b993b7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.hudCommand (cognitive 18): index.hudCommand has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 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/hud/index.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"211b2c717f3a89ddd9097f2b646c6c795338d609c9eb45dc847b89623984725d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.parseSidecarArgs (cognitive 18): index.parseSidecarArgs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sidecar/index.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a451f9c2cea2feb71a37cfa37488161b65962b01d91c0417e235177639d673"}},{"ruleId":"D2","level":"warning","message":{"text":"followup-planner.pickSpecialistRole (cognitive 18): followup-planner.pickSpecialistRole has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 7, ternaries 2 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/followup-planner.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a393670a3737946eac2e4daf5c5d066ade28cb0a200c531e46a37fbab8a9ee00"}},{"ruleId":"D2","level":"warning","message":{"text":"artifacts.hasProtectedSteeringPayload (cognitive 18): artifacts.hasProtectedSteeringPayload has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ultragoal/artifacts.ts"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69aa91d1c996c02ce81c1ee4ce045cbe5b4c063c34a8a45176f3facd9f2b8d9"}},{"ruleId":"D2","level":"warning","message":{"text":"transcript.resolveSessionTranscript (cognitive 18): transcript.resolveSessionTranscript has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (6 pts), ternaries 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/session-history/transcript.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e5fc137a45d0c3f3a185cbe61628fc5e8859fd546de009c986fc76fdf54010"}},{"ruleId":"D2","level":"warning","message":{"text":"timeline.summarize (cognitive 18): timeline.summarize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/timeline.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd58504bf74848c222ce18249313d9dc687fad7c711b1f65a24be12fe47e9546"}},{"ruleId":"D2","level":"warning","message":{"text":"agents-overlay.generateOverlay (cognitive 18): agents-overlay.generateOverlay has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/agents-overlay.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbc67894d701ed223ead0d8e9178b9da9243d0ddd2bfe77a907593600440847"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.collectInlineCodeRanges (cognitive 18): keyword-detector.collectInlineCodeRanges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be5582b89dc2498197ae499767b28a189c401cbcf7365987d36dd0e35a6f1b7"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.balancedMarkdownLinkRange (cognitive 18): keyword-detector.balancedMarkdownLinkRange has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b872ade46588d8a56c025a91a40530acf202a5911b9568071dc783d0f4d2e514"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-detector.boundedPredecessorRanges (cognitive 18): keyword-detector.boundedPredecessorRanges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 3 (6 pts), boolean chains 5, loops 1 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"64db7cc1dffee0191790cc7670e45e3b7506d1e49a01307bfc76ad12d85d04d6"}},{"ruleId":"D2","level":"warning","message":{"text":"team-worker.readTeamWorkersForIdleCheck (cognitive 18): team-worker.readTeamWorkersForIdleCheck has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c3bb5015f5bf3cb0a0d27a0e7b206eccb7a533e466de9aaabe5fd23619e94d"}},{"ruleId":"D2","level":"warning","message":{"text":"team-worker-stop.ensureDirectoryUnderExistingTeam (cognitive 18): team-worker-stop.ensureDirectoryUnderExistingTeam has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"648098ce91472ce707e7976e9ba7d7512da9784b441147132348517da48897d0"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.parseUserPromptUltragoalSteeringDirective (cognitive 18): codex-native-hook.parseUserPromptUltragoalSteeringDirective has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), error handling 3 (7 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61b42ec1a6c5beb3560564d381ff2bfbdc17ff42519b5c72dc3c2f4549b2890"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.firstShellScriptOperands (cognitive 18): codex-native-hook.firstShellScriptOperands has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6115}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9dbf85e90088e80c710a9bc7ba7c68c0dd9ce88d2d6497067741be18207fea"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.pythonInvocationHomeHasLoadableStartupCandidate (cognitive 18): codex-native-hook.pythonInvocationHomeHasLoadableStartupCandidate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 2, error handling 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d022519530ab87c270b0f51f6e8e207d748bb50471eb957ed2cbdf7e48dad703"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.normalizeShellLineContinuations (cognitive 18): codex-native-hook.normalizeShellLineContinuations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8591487c0ed27f4b7f93fce24c5154697a1c41523c024aa71a8ac91b90b22a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.hasConductorPromptParameterTransform (cognitive 18): codex-native-hook.hasConductorPromptParameterTransform has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8850}}}],"partialFingerprints":{"codehealthFindingId/v1":"4679ffa3600c6f295ddd1bd45852cf693dc5e70fde49a797b63f8e142f73e9b5"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.parseStaticJavaScriptString (cognitive 18): codex-native-hook.parseStaticJavaScriptString has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11420}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f92dc193ff52052f653188c6cf758272148f6e2cb22d2141cde1f11ab959c9"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectConductorDownloaderOutputTargets::finalizeCurlTransfer (cognitive 18): codex-native-hook.collectConductorDownloaderOutputTargets::finalizeCurlTransfer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (codex-native-hook.collectConductorDownloaderOutputTargets) 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14913}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6da74c59f1aa6026a04d5abc10691b6d7c0b17d8108bcd6fd5490b760a82c9a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.commandHasUnsafeConductorOrchestrationPrefixEnvironment (cognitive 18): codex-native-hook.commandHasUnsafeConductorOrchestrationPrefixEnvironment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, loops 1 (nesting depth added 5). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 16385). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16380}}}],"partialFingerprints":{"codehealthFindingId/v1":"92233e72e856d53b718dc1ff243e99f4e1f745f5c0fc25cb13e03f852d4b9be2"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findConductorIsolatedInvocationBoundary (cognitive 18): codex-native-hook.findConductorIsolatedInvocationBoundary has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16636}}}],"partialFingerprints":{"codehealthFindingId/v1":"69655eeed54ec394851c8846b9303aec0b7463e31f55c875e6e89248526951bb"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorExecutableHasTrustedSystemIdentity (cognitive 18): codex-native-hook.conductorExecutableHasTrustedSystemIdentity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 2, 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17620}}}],"partialFingerprints":{"codehealthFindingId/v1":"2495655a0363ce6b9c4dcd8b7013aa5571ac75a09dbc5b83f69a3145f8007a48"}},{"ruleId":"D2","level":"warning","message":{"text":"index.resolveSetupTeamModeArg (cognitive 18): index.resolveSetupTeamModeArg has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 1 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ec769e349b3452f27dddac30fc005be6f3d42fef887bd0734a5e10ffcc5af0"}},{"ruleId":"D2","level":"warning","message":{"text":"index.completePreLaunchSetup (cognitive 18): index.completePreLaunchSetup has cognitive complexity 18 (threshold 15). Drivers by points: error handling 8, if/else 4, loops 2 (4 pts), ternaries 2 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":8032}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fe171ab39f5e4e59410872c8fc69b97d41a07c6374587dfb9010ce7e398135"}},{"ruleId":"D2","level":"warning","message":{"text":"team-dispatch.runtimeExec (cognitive 18): team-dispatch.runtimeExec has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (7 pts), error handling 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fc8d2fcb4d2aa3443dbe7845c42bbb0c6635f55ae5b16bd1007abf911a3c76"}},{"ruleId":"D2","level":"warning","message":{"text":"notify-fallback-watcher.withRalphSteerLock (cognitive 18): notify-fallback-watcher.withRalphSteerLock has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, ternaries 1 (3 pts), error handling 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":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca52379d31600799db9a78fda04c922b4d3650cf6770b4f7c8f26caa93540b7"}},{"ruleId":"D2","level":"warning","message":{"text":"notify-fallback-watcher.enforceLifecycleGuards (cognitive 18): notify-fallback-watcher.enforceLifecycleGuards has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"165f60bea8a5e9b5e34c69cfafa1e8b86e93db7f6e2608066b9b7a7fd4394538"}},{"ruleId":"D2","level":"warning","message":{"text":"notify-fallback-watcher.pollFiles (cognitive 18): notify-fallback-watcher.pollFiles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"02abbc43a20e677d628b19e065ad498d917bb5bfa8347ac6c764df3318b1b2f4"}},{"ruleId":"D2","level":"warning","message":{"text":"processStartHashForPid (cognitive 18): processStartHashForPid has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, error handling 1, other 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf25a3ce1318d92da4e9155f3754e3694fa64698eb0a590d20c35b152b751558"}},{"ruleId":"D2","level":"warning","message":{"text":"config.inspectOpenClawConfig (cognitive 17): config.inspectOpenClawConfig has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 4 (6 pts), boolean chains 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/openclaw/config.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3755fccef438678be87d9796e5cc74c8c3946bebefbe3f9156ce88a41e68898"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.decodeGeneratedWindowsProcessArgument (cognitive 17): codex-hooks.decodeGeneratedWindowsProcessArgument has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03b3e6d1f93d47466e70cdc067a7812ae185db2090eaef868dcd81710e834e9"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.containsRustUnsupportedJavaScriptMatcherSyntax (cognitive 17): codex-hooks.containsRustUnsupportedJavaScriptMatcherSyntax has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-hooks.ts"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84ca3576963e353ef62fdda7f1adc4d3acd185c0686914bc6eb616657eb90b6"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-hooks.exactLegacyState (cognitive 17): codex-hooks.exactLegacyState has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, ternaries 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/config/codex-hooks.ts"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d07344d2917bf4d84c5f00d66c1b2cd8a34113b7e2f329ec877f386e968e85"}},{"ruleId":"D2","level":"warning","message":{"text":"archive.zipEntryType (cognitive 17): archive.zipEntryType has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native-assets/archive.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0581fe5aca6a65d5d8d756d4c3a5f0b3ec144306d6eb072b8a841e0071f334e"}},{"ruleId":"D2","level":"warning","message":{"text":"native-assets.inspectLock (cognitive 17): native-assets.inspectLock has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 2 (3 pts), boolean chains 2, error handling 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/cli/native-assets.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb523eb0db80bac7d2bde2b5a4e4488d38ea8fc285fc2ab262734260e90e6e4"}},{"ruleId":"D2","level":"warning","message":{"text":"session.observeLinuxProcess (cognitive 17): session.observeLinuxProcess has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef030324edff642120168e335ac7cf8481e441cdf7362b1d51d2af62efe5738"}},{"ruleId":"D2","level":"warning","message":{"text":"session.updateDetachedSessionMetadata (cognitive 17): session.updateDetachedSessionMetadata has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), ternaries 3, error handling 2 (nesting depth added 2). Of this number, 10 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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/hooks/session.ts"},"region":{"startLine":3186}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dfbd8c7a25769fa804750230c23124e913797348909dae53537f1506e069d9"}},{"ruleId":"D2","level":"warning","message":{"text":"completion-evidence.validateCompletionEvidence (cognitive 17): completion-evidence.validateCompletionEvidence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/completion-evidence.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08e1891b3fb7829f90997ab97a70a89432ffa4ac7a73c80eff83967a39aab1a"}},{"ruleId":"D2","level":"warning","message":{"text":"mailbox.needsLegacyMailboxEvidence (cognitive 17): mailbox.needsLegacyMailboxEvidence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/mailbox.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c359f2f8533ce397974b741efa2687401cd21435f3cefb382a681e3837ddb51"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatch.enqueueDispatchRequest (cognitive 17): dispatch.enqueueDispatchRequest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4 (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 one function literal inside it that branches (line 274). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/dispatch.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"96cb7bbb500cec0f71e8868f14ce6bbedb469a340ef15ff1a60dd6d749a3e5d9"}},{"ruleId":"D2","level":"warning","message":{"text":"monitor.normalizeWorkerIntegrationState (cognitive 17): monitor.normalizeWorkerIntegrationState has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, ternaries 8, if/else 1. Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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/team/state/monitor.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a9fbac98a93d9540a0e6c6e647d293b5171730e5a0d2c949af1bd7faee05d8"}},{"ruleId":"D2","level":"warning","message":{"text":"locks.withMailboxLock (cognitive 17): locks.withMailboxLock has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 3 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/locks.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89dca03ee5d877622c1836da7113be3209ad8cea6e9a95f958d339edc9cc346"}},{"ruleId":"D2","level":"warning","message":{"text":"coordination-protocol.normalizeTeamTaskCoordinationPlanForStorage (cognitive 17): coordination-protocol.normalizeTeamTaskCoordinationPlanForStorage has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (7 pts), boolean chains 5, if/else 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/coordination-protocol.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1557ed51442a6dd0b78e4d7a4a62fc1be95712094ba1c43b169e8293e82a006"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.projectTrustCandidateIsSafe (cognitive 17): generator.projectTrustCandidateIsSafe has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 1 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe46d236bf36bb9e86fc3c5dd09d2a133c53b15cd210c22ee91be0b01dd7572"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-hook-engine.resolveCodexPane (cognitive 17): tmux-hook-engine.resolveCodexPane has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, error handling 2, loops 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/tmux-hook-engine.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c502300fde9f0e0b92c3e8ee5c09343e216d1dc69e61eb9f2ae4aed5b947ac"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.readCrossProcessLockState (cognitive 17): tracker.readCrossProcessLockState has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 5, if/else 2 (3 pts), error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96f34458ce5f45ffcb8fdbb6bf5e275e42e56d64c4df6f4c9e9215590ae2416"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-active.inspectLockOwner (cognitive 17): skill-active.inspectLockOwner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, ternaries 1 (3 pts), error handling 1 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/skill-active.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d42637ad5a8f26ae001e41dff15a41bbde99434c56666377252ab4feed003d"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-active.updateSkillActiveStateCopiesForExactSessionTransaction (cognitive 17): skill-active.updateSkillActiveStateCopiesForExactSessionTransaction has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3 (5 pts), ternaries 2 (nesting depth added 6). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 756). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/skill-active.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7b61c3f11fedffbe5881f5cd04f386ecd0e37dd23cfe67bbc933b82643ae83"}},{"ruleId":"D2","level":"warning","message":{"text":"state.normalizeHudConfig (cognitive 17): state.normalizeHudConfig has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/state.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1c4bc2d6d1a00d10c46e6ce2ed4474f4b48867a14396c91a78972e024a91bb"}},{"ruleId":"D2","level":"warning","message":{"text":"advisory.commitBoundActivationIntent (cognitive 17): advisory.commitBoundActivationIntent has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 6, boolean chains 4 (nesting depth added 3). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 138). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1111762d74af9c64c58d12fcbec42ec8b4b080f2d172725373c5dac58976a6ee"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-hook.showTmuxHookStatus (cognitive 17): tmux-hook.showTmuxHookStatus has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (12 pts), if/else 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tmux-hook.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"10598cfb90b874fbc223f11654548def885ab18e98b09b3d492a138a7fd534c5"}},{"ruleId":"D2","level":"warning","message":{"text":"scaling.recoverCreatedWorktreeAfterEnsureFailure (cognitive 17): scaling.recoverCreatedWorktreeAfterEnsureFailure has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (8 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":"src/team/scaling.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27a9b210dabda496af5765b1a9138501a110fff26ab9bd9a8fb92159fab18e7"}},{"ruleId":"D2","level":"warning","message":{"text":"events.normalizeRawTeamEvent (cognitive 17): events.normalizeRawTeamEvent has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 11, boolean chains 3, if/else 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/events.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67763a2733f7d82b255f315224b6114a4d29aeb7dc1c41800041ae581eb6668"}},{"ruleId":"D2","level":"warning","message":{"text":"active-team.listNotifyCanonicalActiveTeams (cognitive 17): active-team.listNotifyCanonicalActiveTeams has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 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":"src/scripts/notify-hook/active-team.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"479ea661cabb1a83ca870694874215bc13f9c7bb1a9e445a23437dd25cb4a61c"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.copyStagedTreeNoReplace (cognitive 17): plugin-marketplace.copyStagedTreeNoReplace has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 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/cli/plugin-marketplace.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bbec9f73b4780927897284e8f9efca43839fc07a6d602a99213a5ee711626d"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.hasLiveSessionPinRecord (cognitive 17): plugin-marketplace.hasLiveSessionPinRecord has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, error handling 2 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5fa1d850082f6931104c9eec8d704cd1b8431cc93b9c372d71ec147a4f0e05"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.readOmxPluginCacheState (cognitive 17): plugin-marketplace.readOmxPluginCacheState has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, ternaries 5, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3352}}}],"partialFingerprints":{"codehealthFindingId/v1":"e385feff8494d7beb53a0f520e0c6b76983fd3e358c77d8bdb5f2fa90204e708"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.configEnablesPluginScopedHooks (cognitive 17): doctor.configEnablesPluginScopedHooks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, error handling 1, ternaries 1 (nesting depth added 3). 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d4573b9b7e55a8b5d200b93f62f11c8c73cbb1d465c995cfe639f77e550c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.restoreNativeHookTransactionArtifact (cognitive 17): setup.restoreNativeHookTransactionArtifact has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 2 (8 pts), error handling 2 (5 pts), if/else 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"6151ef7be19dc2b192fb7283baf21e14434b9706dde065d2a52e05e2bde3bd5d"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.parseSkillFrontmatter (cognitive 17): setup.parseSkillFrontmatter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8d178e951aa948e21f84fdd87738e999a8eba99f9a5656c827609aa1842c7d"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.resolveSetupInstallMode (cognitive 17): setup.resolveSetupInstallMode has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 5 (6 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":3370}}}],"partialFingerprints":{"codehealthFindingId/v1":"360c9af2876f0aeb8caefa912091fba80e952bc931a4a63b341708439335eb9d"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.stripHookFeatureFlagsForDisable (cognitive 17): setup.stripHookFeatureFlagsForDisable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":3984}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0a9228621b3dcef19dfc0a2e92d6866083982b1af7dfe78cdb572536b8ea28"}},{"ruleId":"D2","level":"warning","message":{"text":"authority.runHudAuthorityTick (cognitive 17): authority.runHudAuthorityTick has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), error handling 3, ternaries 2 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/authority.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dde179b79dff3785180831223c3518ab45143ea49cd8409767222fa247e318a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.ipv6ToBigInt (cognitive 17): index.ipv6ToBigInt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, ternaries 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/url-reader/index.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"b798ee880749de5c9260ee2cc80e77f71e408dac2c2e7061d8e29b2b5e6c88d7"}},{"ruleId":"D2","level":"warning","message":{"text":"package-manager-ownership.resolvePackageManagerOwnership (cognitive 17): package-manager-ownership.resolvePackageManagerOwnership has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 1 (2 pts), ternaries 2, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/package-manager-ownership.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eaa9833f045f7ce66544e8aad7102bbf6764867a94cd92d8e828eda02d9a1b6"}},{"ruleId":"D2","level":"warning","message":{"text":"team-tmux-guard.queuePaneInput (cognitive 17): team-tmux-guard.queuePaneInput has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 2 (3 pts), error handling 1 (nesting depth added 1). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, 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/scripts/notify-hook/team-tmux-guard.ts"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"9175fe51a50ba39c475f6cd8990333edd5626fac0b2f821a0b24ad95f75f8a83"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.parseWindowsProcessLineage (cognitive 17): codex-native-hook.parseWindowsProcessLineage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 5, loops 2, ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7736c614b385da8d8a8e517d5d1c4b92693d3a4c7217f606636933b327d2b6"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.resolveSessionOwnerPidFromAncestry (cognitive 17): codex-native-hook.resolveSessionOwnerPidFromAncestry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a1d29c85fa0f1f08ccaa893cea663817ccf70dbaff022d36eafd2fbf858275"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findPackageInstallSubcommandIndex (cognitive 17): codex-native-hook.findPackageInstallSubcommandIndex has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5410}}}],"partialFingerprints":{"codehealthFindingId/v1":"145905ba24ae8394c93d9771698126d9c03ad2ef467a8ba1e5030483df5051d2"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isShellFunctionInvokedFromWords (cognitive 17): codex-native-hook.isShellFunctionInvokedFromWords has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6051}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d89837b6e54b7e6e0d6f4bcc25f43d544c3d63e65ff38c28b99146422d83d2a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.containsUnquotedProcessSubstitution (cognitive 17): codex-native-hook.containsUnquotedProcessSubstitution has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8603}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3e4a46d2dd54130dd07fab04217c4fa87beefc6a8d722d5b7c0b85bbc6e35a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectShellCliInvocations (cognitive 17): codex-native-hook.collectShellCliInvocations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12457}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c82056962f7e35ec09112f6fa715d06c1ae5450587f768e1fe70839b076144"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectConductorPerlTargets (cognitive 17): codex-native-hook.collectConductorPerlTargets has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15437}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e58cf1da1c6915ff677c1919fd036284e3a13cafb4b39923940910d23b2b85"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.applyStaticExpansionStateEffects (cognitive 17): codex-native-hook.applyStaticExpansionStateEffects has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 2 (5 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17311}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf632494435022e4ffa60ba2926f76d5e855dc616e500d99344e047ca5542472"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorResolvePathInterpreter (cognitive 17): codex-native-hook.conductorResolvePathInterpreter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17763}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5933a2e4eee28975ee376ae65a2dc0698a3258a4c9c24c204774bea75a7f01"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.conductorTrustedScriptInterpreterIsSafe (cognitive 17): codex-native-hook.conductorTrustedScriptInterpreterIsSafe has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17783}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce676a2d4db3a29c4498fd17f1a3d95780a5016f056bd6edf99f950f9d271f5"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.collectStaticNestedShellTargetAliases (cognitive 17): codex-native-hook.collectStaticNestedShellTargetAliases has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":20083}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c591d0aac503a08be2248bb724433b1cde2f8cc0b420048122e2f7a7f5bf7b"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findCanonicalActiveTeamForSession (cognitive 17): codex-native-hook.findCanonicalActiveTeamForSession has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":21281}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13882c7d1350281772b8b47448aa40f20f49a6943d0a4602d3e47903cb15408"}},{"ruleId":"D2","level":"warning","message":{"text":"index.isResumeCodexLaunch (cognitive 17): index.isResumeCodexLaunch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":2406}}}],"partialFingerprints":{"codehealthFindingId/v1":"218b1e85753f6e086ed478ffef10c92e89ef015ef9124a48d80c2d9d57eaffec"}},{"ruleId":"D2","level":"warning","message":{"text":"index.readMadmaxDetachedActiveRecord (cognitive 17): index.readMadmaxDetachedActiveRecord has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 11, boolean chains 3, if/else 2, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":4243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d284fc0acdc9eef7852bdb32314f033585f0bccf1895c92bd75d97d10f9423a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.startHookDerivedWatcher (cognitive 17): index.startHookDerivedWatcher has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 5 (6 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":9843}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c51131ad514bca0eb1495883cfe5849fa8661c0cba4eefd871935096ac671f8"}},{"ruleId":"D2","level":"warning","message":{"text":"smoke-packed-install.appendForeignHookGroups (cognitive 17): smoke-packed-install.appendForeignHookGroups has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 6). Of this number, 14 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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f000619b751bc7920f4a3c2ae4a2a5163f3082328685bfc5f3a3a1408ed90e8"}},{"ruleId":"D2","level":"warning","message":{"text":"smoke-packed-install.appendDisplayOrderStableForeignHookGroups (cognitive 17): smoke-packed-install.appendDisplayOrderStableForeignHookGroups has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 5). Of this number, 15 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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"303f9b379b72d09545a6838e5a2b9f76019d031ee1ad28c68a936b1b429c0407"}},{"ruleId":"D2","level":"warning","message":{"text":"sync-prompt-guidance-fragments.main (cognitive 17): sync-prompt-guidance-fragments.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/sync-prompt-guidance-fragments.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d6c93a2cdd908765d3a52233245e49f00f116fd699778b886bec7969d2146b"}},{"ruleId":"D2","level":"warning","message":{"text":"omx_runtime::lease_mutex::run_protocol (cognitive 17): omx_runtime::lease_mutex::run_protocol has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime/src/lease_mutex.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bd1a80cb67d36d06994f30fb82a75523097ecbd29f97cb60e5031ccbc7ea84"}},{"ruleId":"D2","level":"warning","message":{"text":"transport.ndjsonExchange (cognitive 16): transport.ndjsonExchange has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 5). None of this is in the body itself: all 16 points belong to 3 function literals inside it that branch (lines 353, 335, 349). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/herdr/transport.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c66cb76fc0ecbbb9341c8548329e541be5ca002d76f687ab549a2f0085821b"}},{"ruleId":"D2","level":"warning","message":{"text":"sanitize.sanitizeMetadata (cognitive 16): sanitize.sanitizeMetadata has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/herdr/sanitize.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c5cf4f73a7e70e898d0afde9b564010e2d3f897c00f01fe4dea8dababd816d"}},{"ruleId":"D2","level":"warning","message":{"text":"seq-store.acquireLock (cognitive 16): seq-store.acquireLock has cognitive complexity 16 (threshold 15). Drivers by points: error handling 3 (9 pts), if/else 2 (6 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/herdr/seq-store.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb23d51d62b58a5388897cc35e0809b118345485435fc1705116685dda68551"}},{"ruleId":"D2","level":"warning","message":{"text":"platform-command.resolveWindowsCommandPath (cognitive 16): platform-command.resolveWindowsCommandPath has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (8 pts) (nesting depth added 8). Of this number, 12 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/utils/platform-command.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1980c1a6fe969a252c687fe7ef590bcd45f1b8060a84de69b92b3b24caffcef0"}},{"ruleId":"D2","level":"warning","message":{"text":"locks.withScalingLock (cognitive 16): locks.withScalingLock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 3 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (locks.withTeamLock) 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":"src/team/state/locks.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5940c4b4738c200dad962c0f44922a1f2739208d0f8ce5bc4995cd313cd05db2"}},{"ruleId":"D2","level":"warning","message":{"text":"locks.withTeamLock (cognitive 16): locks.withTeamLock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 3 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (locks.withScalingLock) 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":"src/team/state/locks.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5705662fca15cd0ccb2d1505335070fb29c3edeb00a0912e6ab39f70ee07b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"coordination-protocol.normalizeTeamTaskCoordinationPlanForRender (cognitive 16): coordination-protocol.normalizeTeamTaskCoordinationPlanForRender has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/coordination-protocol.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a00b7d8e1301cb7d5b2e2b6c3ca2ffd16d95e7c9bf4d176836d2479a5063d4"}},{"ruleId":"D2","level":"warning","message":{"text":"state.writeMailbox (cognitive 16): state.writeMailbox has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (6 pts), boolean chains 5, if/else 2 (3 pts), loops 2 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a23311d0c0191fd60b51e4449ca5cc695d825fd83ce1d16ff7fd5cfa4a7df6"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.stripLegacyOmxTeamRunTable (cognitive 16): generator.stripLegacyOmxTeamRunTable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7216733993050f5237d58af2e6426a23052f8695893ca1e9b21e3ca4371f85"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.upsertFeatureFlagLineInSection (cognitive 16): generator.upsertFeatureFlagLineInSection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab67dd24cea33a21301f97724f66b9fef51793d641bc7a386bf3fd40a36d4723"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.dedupeTuiTables (cognitive 16): generator.dedupeTuiTables has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":3768}}}],"partialFingerprints":{"codehealthFindingId/v1":"3513049aa33b80fd77273a0c106d573dd1f471a04d003ceb7e31b042b49bb13d"}},{"ruleId":"D2","level":"warning","message":{"text":"run-outcome.applyRunOutcomeContract (cognitive 16): run-outcome.applyRunOutcomeContract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime/run-outcome.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ecf3ab2b09ea435335a3e76a7e0334774efc8606b0c62cd4c79580d338cb5a"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-active.normalizeSkillActiveState (cognitive 16): skill-active.normalizeSkillActiveState has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 11, ternaries 3, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/skill-active.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"638477a416ce563cd4eea3203a3802b209c1fb5cfc2698812b2c199858abc871"}},{"ruleId":"D2","level":"warning","message":{"text":"advisory-evidence.canonicalArtifactPath (cognitive 16): advisory-evidence.canonicalArtifactPath has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory-evidence.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e53345d306d3c2b74f990fceb0208ea77f390fa67090ab66fa5fc15c9b68d5"}},{"ruleId":"D2","level":"warning","message":{"text":"advisory-evidence.digestAdvisoryArtifacts (cognitive 16): advisory-evidence.digestAdvisoryArtifacts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory-evidence.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"545bf94c0451ff489e22d5a0ddc46ffe1ecbe809d9b2b9734ee91c83fef98fb0"}},{"ruleId":"D2","level":"warning","message":{"text":"events.withQuestionEventLock (cognitive 16): events.withQuestionEventLock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 3 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/events.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7f2162e593275b25e60b2976aaba0dc5572413ec389c4bb9c048828a980da3"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux.reapDeadHudPanes (cognitive 16): tmux.reapDeadHudPanes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a21a96a729756ea170b70be5f3e4192d9e6df9d58446960e9d77e18bbee098"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux.readHudResizeHookPaneIncarnations (cognitive 16): tmux.readHudResizeHookPaneIncarnations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (3 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7f0911be6d9fd501256a15b1697ea8d010eb48d9da79c47e651aee6527b993"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux.unregisterHudResizeHook (cognitive 16): tmux.unregisterHudResizeHook has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (5 pts), error handling 3 (4 pts), boolean chains 3, ternaries 3, loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3024e7fec16d01454e11bcc5cfd35dfc265ec1568989efb344d86751d0f44c70"}},{"ruleId":"D2","level":"warning","message":{"text":"hook-config.getHookConfig (cognitive 16): hook-config.getHookConfig has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 3, error handling 2 (3 pts), ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/hook-config.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f569db64d6bd0172c4764b42c4e3af7b5e6007dea9ba53a463908688753f809"}},{"ruleId":"D2","level":"warning","message":{"text":"ui.applyQuestionWizardKey (cognitive 16): ui.applyQuestionWizardKey has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, ternaries 2 (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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/question/ui.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dcb70a64e944c554c839060f5fbc6ea2cecb3eae6fc96168e6ccbb1c97c70a"}},{"ruleId":"D2","level":"warning","message":{"text":"renderer.readPersistedQuestionReturnTarget (cognitive 16): renderer.readPersistedQuestionReturnTarget has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 2 (5 pts), loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/renderer.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"447b93171e03c32f5cebc39b6a5dc0b0ca310dae44cb94b4bd6266e12eea243d"}},{"ruleId":"D2","level":"warning","message":{"text":"state.withQuestionSubmitLock (cognitive 16): state.withQuestionSubmitLock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 3 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/state.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a9c6ed8a04e3ecf749a96a57096e92073a648a51bfbff5dea063c93146660f"}},{"ruleId":"D2","level":"warning","message":{"text":"autopilot-wait.withAutopilotQuestionWaitLock (cognitive 16): autopilot-wait.withAutopilotQuestionWaitLock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 3 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/autopilot-wait.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c8ff8a0e08fa0c3fd0c7e65d4af1d57f621077f05a42dd3bb4bbb1479d96d4"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-validation.assessAutoresearchCompletionState (cognitive 16): skill-validation.assessAutoresearchCompletionState has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/autoresearch/skill-validation.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d268aef6bda36849f871a7a20465a5de3a34f3e56cc2a2f3c31a17cd65289a7"}},{"ruleId":"D2","level":"warning","message":{"text":"render.wrapHudParts (cognitive 16): render.wrapHudParts has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/render.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd735be96d8356030e3f67ad6e02fa075337d030aa6692967e9b7f72d3667652"}},{"ruleId":"D2","level":"warning","message":{"text":"reconcile.acquireHudReconcileLock (cognitive 16): reconcile.acquireHudReconcileLock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 4 (5 pts), boolean chains 3, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/reconcile.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"1930c492ee9c455bd26177e601ab17d9fb8c2abab811214aac2983caed39c4f7"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-session.captureSourcePaneAuthority (cognitive 16): tmux-session.captureSourcePaneAuthority has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/tmux-session.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f89d46d5ced0cb3e93e98a4a87f67009c490bf5a4faa9ae867ff60d0774edbb"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-session.killWorker (cognitive 16): tmux-session.killWorker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 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/team/tmux-session.ts"},"region":{"startLine":4087}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aad77863cdfb78f10cbdd82ee6008b79bef0237d5b01ceae19d4abe94f21498"}},{"ruleId":"D2","level":"warning","message":{"text":"ultragoal-context.resolveLeaderOwnedUltragoalContextOutcome (cognitive 16): ultragoal-context.resolveLeaderOwnedUltragoalContextOutcome has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 5 (6 pts), boolean chains 2, error handling 1 (nesting depth added 2). 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: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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/team/ultragoal-context.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"448dc16f7ec20343f46a78a80d7ab39ed8ecdf710dbb8182fba8141245d7f1c1"}},{"ruleId":"D2","level":"warning","message":{"text":"hermes-bridge.hermesSendPrompt (cognitive 16): hermes-bridge.hermesSendPrompt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (4 pts), error handling 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/hermes-bridge.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eabb0722afac5fb3f1fd5fc75466770b5b86782df9a1e6ca776d76a476b84d1"}},{"ruleId":"D2","level":"warning","message":{"text":"api.resolveApiBinaryPathWithHydration (cognitive 16): api.resolveApiBinaryPathWithHydration has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (4 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/api.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2138e901d85226989f76edbdb3d01ce528b17ebadd7587fac00ba6ddb3820b"}},{"ruleId":"D2","level":"warning","message":{"text":"autoresearch-intake.resolveAutoresearchDeepInterviewResult (cognitive 16): autoresearch-intake.resolveAutoresearchDeepInterviewResult has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/autoresearch-intake.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ead2d6826e04a2f26a56d68c19300a67b8326a8a0f73bf61248ea20ebf6da5"}},{"ruleId":"D2","level":"warning","message":{"text":"autoresearch-guided.promptAction (cognitive 16): autoresearch-guided.promptAction has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (7 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/autoresearch-guided.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d659a68833a6d2d30702682476855bb05982222b6ceee6fdeca0712617577cb6"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.createLivePinRetirementGate (cognitive 16): plugin-marketplace.createLivePinRetirementGate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 3 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95a12b3060a55247bd6d2432f0d0ab7b62eb72e486cb4edb93a9c20a44fa1f4"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.reclaimStalePublicationLock (cognitive 16): plugin-marketplace.reclaimStalePublicationLock has cognitive complexity 16 (threshold 15). Drivers by points: error handling 3 (6 pts), if/else 3 (4 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2648}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbff8877458fd846e55e0227ff8ed2944d01a701547504f01e0d966942795b1"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.omxPluginCacheManifestProvenanceReason (cognitive 16): plugin-marketplace.omxPluginCacheManifestProvenanceReason has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 4, error handling 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2804}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ccc7804826397cc415cc6cb5e47c535398b5d82fe4f852e49ba980b141ba1d"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-marketplace.inspectCacheRoot (cognitive 16): plugin-marketplace.inspectCacheRoot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), error handling 2 (3 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e6f3b41c00981bfaaa6c0f9a5f763294eedfbf2d96388a22217a1a09f2123e"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.canonicalizePathToRealForm (cognitive 16): setup.canonicalizePathToRealForm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 2 (4 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/cli/setup.ts"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbc984150c2132850d2c7b0a41bfff2cc704a010b57f876155835be1aabe36e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.resolveHudWatchCwd (cognitive 16): index.resolveHudWatchCwd has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/index.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"616d8352a43a9f6c532904aa40df046060ed9bb67deabe82cb484884116c31fb"}},{"ruleId":"D2","level":"warning","message":{"text":"collector.buildHighlights (cognitive 16): collector.buildHighlights has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sidecar/collector.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3e2d1cc7006208736abdccec0f535b3a758939cad2ca5c08252c20b4dece8a"}},{"ruleId":"D2","level":"warning","message":{"text":"team.persistTeamShutdownModeState (cognitive 16): team.persistTeamShutdownModeState has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 2, error handling 1 (2 pts), ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"16786d4c8f54537246ab4579d0e456fa0289174d7d23adff376339bc9abf73d9"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime-advisory-lifecycle.terminalizeAdvisory (cognitive 16): runtime-advisory-lifecycle.terminalizeAdvisory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, ternaries 4 (5 pts) (nesting depth added 2). Of this number, 8 points are the body\u0027s own statements and 8 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":"src/ralplan/runtime-advisory-lifecycle.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6975ca08a1868b6aa7bcf3309b3242d6d9ef39e96f50ef79107d7d060b00eca"}},{"ruleId":"D2","level":"warning","message":{"text":"artifacts.extractArchitectureInvariantsFromArtifact (cognitive 16): artifacts.extractArchitectureInvariantsFromArtifact 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":"src/ultragoal/artifacts.ts"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e13e4adb2dd6097d758080aa93e079335e8edfabf4b5be3232c0e4c20fcb16"}},{"ruleId":"D2","level":"warning","message":{"text":"sparkshell.resolveSparkShellBinaryPathWithHydration (cognitive 16): sparkshell.resolveSparkShellBinaryPathWithHydration has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (4 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/sparkshell.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b62e7587359f971f09dbd008302d3b98ff29e70a6746348f14984f73fe2e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"project-runtime-codex-homes.discoverAssociatedMadmaxRunDirs (cognitive 16): project-runtime-codex-homes.discoverAssociatedMadmaxRunDirs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), error handling 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 5 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/cli/project-runtime-codex-homes.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab71bd5868fc975d5a5d3b37cca7c361123955941dfa5fa8207c0afb5b1e11f"}},{"ruleId":"D2","level":"warning","message":{"text":"search.listRolloutFiles (cognitive 16): search.listRolloutFiles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/search.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dbc71179a99cf00eb579ef0322002a3b359a045b35c66bf654811457d1839d"}},{"ruleId":"D2","level":"warning","message":{"text":"session-search.parseSessionLockArgs (cognitive 16): session-search.parseSessionLockArgs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 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/cli/session-search.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b553168d0c9ec57e51830096f1213b1738b94a6d04ecd662b5ec6a0e133847f3"}},{"ruleId":"D2","level":"warning","message":{"text":"auto-nudge.normalizeAutoNudgeConfig (cognitive 16): auto-nudge.normalizeAutoNudgeConfig has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, ternaries 6 (7 pts), if/else 1 (nesting depth added 1). 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":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f77d8b6078666fa671f6fa0f09fd55862ed90c84e1681047abd4e77d4ee526"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-pre-post.skipEnvWrapper (cognitive 16): codex-native-pre-post.skipEnvWrapper has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, 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/scripts/codex-native-pre-post.ts"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c13f4d8181d315846eb6a1fa6729d2262a488b0fbdd3b2d51dd10240304f995"}},{"ruleId":"D2","level":"warning","message":{"text":"team-worker-posttooluse.checkpointIfEligible (cognitive 16): team-worker-posttooluse.checkpointIfEligible has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 7, boolean chains 1 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-posttooluse.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7a0d0e36c905a2daaf482ee63124845590720fb9b5851daf03e73834c0c5f5"}},{"ruleId":"D2","level":"warning","message":{"text":"team-worker-posttooluse.handleTeamWorkerPostToolUseSuccess (cognitive 16): team-worker-posttooluse.handleTeamWorkerPostToolUseSuccess has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 4, ternaries 2 (3 pts), error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-posttooluse.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65629299b711ffbf31edc4590c45220ed1a43343d8473f6d57656beddf38db2"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isNativeSubagentHook (cognitive 16): codex-native-hook.isNativeSubagentHook has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a82e3ef6504d9d2777db71037345be33e1bb45e378dd924df2c0d9de826aa47"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.extractBalancedJsonObject (cognitive 16): codex-native-hook.extractBalancedJsonObject has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"73db71fa777fa7cad9e539663eb38aa00ffd00ce90041fa26f0570cf223b3229"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.buildModeBasedStopOutput (cognitive 16): codex-native-hook.buildModeBasedStopOutput has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (6 pts), boolean chains 5, if/else 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":3204}}}],"partialFingerprints":{"codehealthFindingId/v1":"29010b9b89ebbaf49df791db9cce2d04998b74c3d8362cb7b455a653922721ff"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.findCompletedGoalWorkflowCleanupNotice (cognitive 16): codex-native-hook.findCompletedGoalWorkflowCleanupNotice has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":3349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0368a6abc8a65685719e29368c1704e6cef166feec9eb87c9d250b32896eb52c"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.omxOrGjcReadOnlyShapeMatches (cognitive 16): codex-native-hook.omxOrGjcReadOnlyShapeMatches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10041}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23a5483e622b5037afa8ed03de7efdd344c80f3555d8588afdf92f81db1f140"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isConductorPipelineMember (cognitive 16): codex-native-hook.isConductorPipelineMember has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 6, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9419fa63559a1e461405b9774e936d1b08094f4f5e88cb823042529b8a1208a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isInsideCertainlySkippedConductorIfBranch (cognitive 16): codex-native-hook.isInsideCertainlySkippedConductorIfBranch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e441e1652a5fbbb63e5a70cd23f5823dbc83a052010c08ed6a1677fb4d368c30"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-native-hook.isConductorSafeRsyncMetadataControl (cognitive 16): codex-native-hook.isConductorSafeRsyncMetadataControl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, error handling 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/scripts/codex-native-hook.ts holds 212 of the 856 methods over the threshold \u2014 including the worst \u2014 and 6154 of the 20370 points over it (30%), 5.8\u00D7 the next-largest file (src/team/runtime.ts at 1062). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19955}}}],"partialFingerprints":{"codehealthFindingId/v1":"583b61a57f1cfc13d4e0b9f73b57ac87c0a4eb1b03c1d2d1a4ed6abcd646965c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.resolveSetupMcpModeArg (cognitive 16): index.resolveSetupMcpModeArg has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). Of this number, 13 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":"src/cli/index.ts"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95801e7f7666e36e03b3db2d19afae1d1b8af0f70852482bfc9980c0f88fc86"}},{"ruleId":"D2","level":"warning","message":{"text":"index.readDetachedLeaderReport (cognitive 16): index.readDetachedLeaderReport has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 6, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":6833}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fe060501c13c18897a39ce6b76b2b1b132622f807e237d7c1fbf57428250c0"}},{"ruleId":"D2","level":"warning","message":{"text":"index.parseDetachedHudAuthorityProof (cognitive 16): index.parseDetachedHudAuthorityProof has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":8914}}}],"partialFingerprints":{"codehealthFindingId/v1":"5606bb7bdcef9a5ee0e43c11b038283b9bd7960341529905b23dfc7c31d8b5d1"}},{"ruleId":"D2","level":"warning","message":{"text":"suite.validateFixture (cognitive 16): suite.validateFixture has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/evals/astra-defaults/suite.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"653f14e4217fd65e4fdbc14975aa93881913d67337622e8afea5f56e48a09667"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-release-body.normalizeContributors (cognitive 16): generate-release-body.normalizeContributors has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (6 pts), boolean chains 5, if/else 2 (4 pts), loops 1 (nesting depth added 6). 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":"src/scripts/generate-release-body.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"520a46b2f657d21c563b301047585c9da613a9d716c9ee7d18576459c69059fd"}},{"ruleId":"D2","level":"warning","message":{"text":"team-leader-nudge.maybeNudgeTeamLeader::persistLeaderNudgeBookkeeping (cognitive 16): team-leader-nudge.maybeNudgeTeamLeader::persistLeaderNudgeBookkeeping has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (6 pts), error handling 2, ternaries 1 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (team-leader-nudge.maybeNudgeTeamLeader) 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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"528b2fb4574a0dc70ecb394e1820628b2c953dc2fd17b4216f0dbcb5eba2dd33"}},{"ruleId":"D2","level":"warning","message":{"text":"mode-binding-lease-helper.ownerIsDead (cognitive 16): mode-binding-lease-helper.ownerIsDead has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (5 pts), ternaries 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/mode-binding-lease-helper.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcf5a48134f8860e4a40003e7e997e11159bee69dda5ecca5ac1c8196517e56"}},{"ruleId":"D2","level":"warning","message":{"text":"hasPendingSessionRegistration (cognitive 16): hasPendingSessionRegistration has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, error handling 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfca3815f91ba1c661d9af21e5f53d4cd067a1edae96df8cb1cd5e2c4a847b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/codex-native-hook.ts: FileTooLong \u2014 17880 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 17380 over it, 35.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"417d387ebcc9309c9fb899be498f98ab2d9b6fc752b1db789563f8c0d3f61be9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/index.ts: FileTooLong \u2014 8296 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7796 over it, 16.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/cli/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e80d3928e06c970aa1bb4b654a0d943275a6d56c8ad65257c4ec404bea9e6db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: team/runtime.ts: FileTooLong \u2014 5749 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5249 over it, 11.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a9dbe3beee4804eec0c10fb9ac76ab2adabddc874c22743bc97b4e70e3a75b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/setup.ts: FileTooLong \u2014 5055 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4555 over it, 10.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bee2cdaf7f8210f146ab30bc8141ed265e627df31242a53d38edb68afba7ab9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: setup.setup: FunctionTooLong \u2014 setup runs 933 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 833 over it, 9.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/cli/setup.ts"},"region":{"startLine":4449}}}],"partialFingerprints":{"codehealthFindingId/v1":"820135d346ffa2215dbd3f1b6cc26bcfc52c1bcdaf9a81513266edd7e8b80fc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/smoke-packed-install.ts: FileTooLong \u2014 4018 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3518 over it, 8.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/scripts/smoke-packed-install.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdc67e372278c361b6d47e92b40f4a40c8ed5e52679c28375293aa8e4d656a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/plugin-marketplace.ts: FileTooLong \u2014 3582 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3082 over it, 7.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/cli/plugin-marketplace.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb743966a6d4982c3bbdcabce2d2de332729c708e1e7718cb392df911f203fa9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: team/tmux-session.ts: FileTooLong \u2014 3485 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2985 over it, 6.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/tmux-session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bb3e6a35458213f61432cbab7b81721e9701c7eed271b598e911e404a10f17"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scaling.scaleUp: FunctionTooLong \u2014 scaleUp runs 697 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 597 over it, 6.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c134fd0633543a229c3e34ff93bddc5d002e3ec54940fff1555f63b2c64b06"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pane-status.readTeamPaneStatus: FunctionTooLong \u2014 readTeamPaneStatus runs 694 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 594 over it, 6.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/team/pane-status.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1718c32d48675ebfbca4ecdb885a2b340b1d360efc4bca3b9aacd8330ba274ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hooks/keyword-detector.ts: FileTooLong \u2014 3391 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2891 over it, 6.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55095811d964bc960ce219b19677267cb1b5d60219f91cf41c741991ec3dda90"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/doctor.ts: FileTooLong \u2014 3243 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2743 over it, 6.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/cli/doctor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5762cd26e60adf7bbc96545d451bcd9a53abae0833f006fbb798769976c53ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/generator.ts: FileTooLong \u2014 3190 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2690 over it, 6.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"385f9935fc3e1b8c8a3746be1919c1d63acb2810a133314def7068f7cca23bf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: runtime.shutdownTeam: FunctionTooLong \u2014 shutdownTeam runs 610 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 510 over it, 6.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/team/runtime.ts"},"region":{"startLine":5068}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfc5748a499603c8b7b72c2fc46cb83163d42dc3687d89069d562c5a1505431"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hooks/session.ts: FileTooLong \u2014 3036 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2536 over it, 6.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/hooks/session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"753d7d9f803dd63fae002358db0c2c0ae5bdb05b751625ed276ceb25a1188874"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: team-leader-nudge.maybeNudgeTeamLeader: FunctionTooLong \u2014 maybeNudgeTeamLeader runs 560 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 460 over it, 5.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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"348ee82aa3090b426e4a9e81aedb5b339f037bb84486c6d0cec70bbb139c5b05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: api-interop.executeTeamApiOperation: FunctionTooLong \u2014 executeTeamApiOperation runs 517 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 417 over it, 5.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/api-interop.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb2e4e179d900f916783c298acf74d53e98f3fd3328e9fc276a02b937dd80fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: team/state.ts: FileTooLong \u2014 2369 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1869 over it, 4.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffab2e40a9236327abc8d4db8f9cc59e5ad3ca77ba99babc82d3a8a20ba12a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/codex-hooks.ts: FileTooLong \u2014 2305 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1805 over it, 4.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/config/codex-hooks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a588f2c53f3c12c20f1a54057016bb96c3fdbea59d07b812258bf0772c5a5ab2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: notify-hook.main: FunctionTooLong \u2014 main runs 398 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 298 over it, 3.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd1881e73750520cc2987586bb6e00c2626004de79373eae9c2d8fd5e3f52d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: runtime.runRalplanConsensus: FunctionTooLong \u2014 runRalplanConsensus runs 386 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 286 over it, 3.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/ralplan/runtime.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e24677a86bac8929f16625b81e4eb33bad8ac5cebf308d6b46c586cce95c1eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hud/tmux.ts: FileTooLong \u2014 1790 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1290 over it, 3.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e618bf9e3eb09b668d479335b636e6f48371a1497ab62f9214bfb65fad2d91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ultragoal/artifacts.ts: FileTooLong \u2014 1779 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1279 over it, 3.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ultragoal/artifacts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05fce611b91f946867e2e2e6168a1fe4ea509e0d3e93eddf4fe875eed602bf3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: team/scaling.ts: FileTooLong \u2014 1763 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1263 over it, 3.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e917a5761b7dd26fc5a2d784fbb8b92394b28bc209db3fdf060a6f09db10b9d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1695 significant 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 1195 over it, 3.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-api/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a109bc17ec1f2eba09111140ab5e1fa51031f18f9485422995792bf5c823a8fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/notify-fallback-watcher.ts: FileTooLong \u2014 1624 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1124 over it, 3.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce96a13bc5344e5c520e15ce6674f9e33744c7335a02d5f4dd428ab8ccb75c2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: team.teamCommand: FunctionTooLong \u2014 teamCommand runs 314 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 214 over it, 3.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd06983e16dc098b4db27965f0911d871f7876d9cd6bce3fc11903623c2b627"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/uninstall.ts: FileTooLong \u2014 1557 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1057 over it, 3.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66256c26a44f40801d247483d0d6d4720423874dc924ddaf8ddc661132ef3e83"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: runtime.integrateWorkerCommitsIntoLeader: FunctionTooLong \u2014 integrateWorkerCommitsIntoLeader runs 309 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 209 over it, 3.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cce02503515b181f22e50a7f6eb7fa6827ad71815a6818862e71fd6a3ec5dc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hooks/codex-native-hook.mjs: FileTooLong \u2014 1499 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 999 over it, 3.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a63bfb6094757d2838603a01717208bdfb018a41a981c32478bc8414cae5c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tmux-injection.handleTmuxInjection: FunctionTooLong \u2014 handleTmuxInjection runs 297 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 197 over it, 2.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5404c53fb0ed6dee98147d148e27686ceb67a385597907f146b975ad9f3c96"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/team.ts: FileTooLong \u2014 1416 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 916 over it, 2.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2aa8977a297dda490d1b7e9691a18be54a9cef13cc62ff32ee28404ba1dcf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: subagents/tracker.ts: FileTooLong \u2014 1394 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 894 over it, 2.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e6369e894287a0fb65d0352ce6cdb4d92bef0062d2b31b7e2596ff3cf03b74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: setup.planNativeHookSetupTransaction: FunctionTooLong \u2014 planNativeHookSetupTransaction runs 272 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 172 over it, 2.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":4113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea93aaf95f3667bdf3a7e58b824590d219bab9e7430a5bfbbb2ba49c9d085c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: runtime.dispatchCriticalInboxInstruction: FunctionTooLong \u2014 dispatchCriticalInboxInstruction runs 265 significant lines (blank, comment-only and punctuation-only lines excluded) 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/team/runtime.ts"},"region":{"startLine":6392}}}],"partialFingerprints":{"codehealthFindingId/v1":"86745e8a6d52302c97a72e6e12c467f0ed1759aa4d81782cca3b7e72ff8e856f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codex-native-hook.main: FunctionTooLong \u2014 main 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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"59eaf4297f0826a5a3392b0d06fd28dba4510f526496456397b0590fe5456f47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: plugin-marketplace.removeChildIfIdentity: FunctionTooLong \u2014 removeChildIfIdentity 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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e522f8a36aa55857618e8f49810b8ad77c91687764135e6a43eeec3287245cec"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: setup: ClassTooLong \u2014 933 significant lines (blank, comment-only and punctuation-only lines excluded), 176 methods. The bar is 400 significant lines; this is 533 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a7f1c7129df7e816d34ebd4a6e250d16175c4304d43e389ed0fc6a317ef29c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 1069 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 74 free functions. The bar is 500 significant lines; this is 569 over it, 2.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-explore/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd59128c370df25e3b83e5465feb9f2a0e8c8fc0e8e0459cb0f210764faef3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/codex-native-pre-post.ts: FileTooLong \u2014 1063 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 563 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-pre-post.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"315ffa05bd76d150b67d5dfee9b14184678366b601a32960b406029b4e44a3f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: autoresearch/runtime.ts: FileTooLong \u2014 1049 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 549 over it, 2.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/autoresearch/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8994c1a8e12432ba7dcdc5e1913e1e90b3c5366889b13a6e7fd3fc8f7863f6f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: uninstall.uninstall: FunctionTooLong \u2014 uninstall runs 207 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 107 over it, 2.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/cli/uninstall.ts"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78bfdf412142fcddee92499351143e5ad7f0d287df8e6ee76dd26d7eb58439b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notify-hook/team-leader-nudge.ts: FileTooLong \u2014 1034 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 534 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af548a505e764a8b4cc89f91fd9c96a45f7857998c801f7210674582cfcbc41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: session.recoverDeadSessionPointer: FunctionTooLong \u2014 recoverDeadSessionPointer runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"663712be3eeacf3f2e8042a2f4bf6a6c9761caf354d5c54c3c9fa048f3ba8b59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notify-hook/team-dispatch.ts: FileTooLong \u2014 1023 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 523 over it, 2.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbc73ed915055e13c1663d68d4cf46c26bad4268be730fabf1defcd68bba609"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: team-dispatch.injectDispatchRequest: FunctionTooLong \u2014 injectDispatchRequest 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":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"c394dbf62393463d452a3f49f1c82f3edb50d2fb97d6a11a39051731600296a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: team/api-interop.ts: FileTooLong \u2014 995 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 495 over it, 1.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/api-interop.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19e5bf4f402c922051cc905c8dd396a7c4e9b913d4fea455e36e4f33f9e40f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: state-paths.readCanonicalSessionBindingSnapshot: FunctionTooLong \u2014 readCanonicalSessionBindingSnapshot runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/state-paths.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"24de690c4f9d8bfcde1837485100fa0b4104932a4bd40ecbf23539ce5cb492af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/state-paths.ts: FileTooLong \u2014 975 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 475 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/state-paths.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d71db675d181115aa54bba0e60ff15449bdf9fc994f81a0fbfe243901e01af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: team-worker-stop.maybeNudgeLeaderForAllowedWorkerStop: FunctionTooLong \u2014 maybeNudgeLeaderForAllowedWorkerStop runs 194 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9392f9ff93e6877cb6227770794556be78cf12390af8098b3731b5688402dafb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: memory-server.handleMemoryToolCall: FunctionTooLong \u2014 handleMemoryToolCall runs 191 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/memory-server.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c709791d66855124cee3f31a3e0ab40dd3ae27d3b103622b38f0231c71e355c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bootstrap.autoStartStdioMcpServer: FunctionTooLong \u2014 autoStartStdioMcpServer runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/bootstrap.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc04a9861174342f1d425b8dad77828fed061dbe4b552c6c69ce520d9937ff0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: doctor.collectTeamDoctorIssues: FunctionTooLong \u2014 collectTeamDoctorIssues runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values 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/cli/doctor.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"e443d202b5958b8ed40701fc1574c9747845ca03f4e2604ae134658b6f152c5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: question.questionCommand: FunctionTooLong \u2014 questionCommand runs 186 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/question.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"686867b867f4f76d206a43f62a2c5bd7f72d3df8f6ff3cce4d7ad0bdb87a9c4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: team-worker.maybeNotifyLeaderWorkerIdle: FunctionTooLong \u2014 maybeNotifyLeaderWorkerIdle runs 186 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b66b4e4000d0407dcf8217a713410ee838abc5bb8a9edd266bf8c519b0605d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: team-dispatch.finalizeClaimedDispatchRequest: FunctionTooLong \u2014 finalizeClaimedDispatchRequest runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a81bf83c946dd770d037665012b8aab36da963d2b5001f8c98e334055ccaf03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/notify-hook.ts: FileTooLong \u2014 892 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 392 over it, 1.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"831dbf8b09abf8032b39bcb77ef8098bd407598900763b6be4727a2a3d544f3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: plugin-marketplace.registerOmxPluginCacheLivePin: FunctionTooLong \u2014 registerOmxPluginCacheLivePin runs 178 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42ea49398182f68027fbadc02527eb3a13e236ddbe10130cf9007d2a8b5a692"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/operations.ts: FileTooLong \u2014 878 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 378 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/operations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc0857ce536f8a135c3854714ee343b5fa68b956990521968aa392ed432971d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: code-intel-server.handleCodeIntelToolCall: FunctionTooLong \u2014 handleCodeIntelToolCall runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/code-intel-server.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1994d67fc06e9c73de5758b2f781292a5100e0499bc02750d30721fae009e2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ralplan.ralplanCommand: FunctionTooLong \u2014 ralplanCommand runs 172 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/ralplan.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c68c38c28613b1762bb9f841ecd7afd21702a5290a06e61780ade2c2ffe1eaf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: setup.applyNativeHookTransactionArtifact: FunctionTooLong \u2014 applyNativeHookTransactionArtifact runs 172 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ae7b474af59c90f0e3dd5716b762cad86ba4edce3ba0bb65efbabb89492790"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/skill-active.ts: FileTooLong \u2014 858 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 358 over it, 1.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/skill-active.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e83ad589f0a7d6204d408b7a5b528b2c4d0a36e42ac700e635faf038afed41e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: team/worker-bootstrap.ts: FileTooLong \u2014 857 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 357 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/team/worker-bootstrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5cbe903c9117d74677c6f6f01bf47463bd00749ed7a70c4b56315ab72e978fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: config.inspectOpenClawConfig: FunctionTooLong \u2014 inspectOpenClawConfig runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/openclaw/config.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d83a80a3e47f8ba30b7e66da1ff8410c688a59bedbe15442b2a1bdd6cdfd5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: setup.atomicWriteNativeHookTransactionArtifact: FunctionTooLong \u2014 atomicWriteNativeHookTransactionArtifact runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"517ffab6afea01c769903f27f32f76584101928ce52829f38f0111fbc7b67cce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: team-tmux-guard.sendPaneInput: FunctionTooLong \u2014 sendPaneInput runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-tmux-guard.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3c6643f343943f4f85d9491f5af4f2c925be55ee9afc1120e41f5be0dddd95"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: timeline.buildSessionTimeline: FunctionTooLong \u2014 buildSessionTimeline runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/timeline.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e2c9ebd84cc4c50b647ff21d8a44484b4e79adb21ec495ab167bfb6b811925"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: omx_sparkshell::parse_input: FunctionTooLong \u2014 omx_sparkshell::parse_input runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-sparkshell/src/main.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"327ce18abfb445a6e93c8927c106c0a9e885dd05f44a0b4055c9657c2e2062d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: team-dispatch.drainPendingTeamDispatch: FunctionTooLong \u2014 drainPendingTeamDispatch runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae33c736eebc0e11a9a5e9da1b145cbd9566546a3db9712f05eaf4026ea35764"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: skill-active.syncCanonicalSkillStateForModeUnlocked: FunctionTooLong \u2014 syncCanonicalSkillStateForModeUnlocked runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/skill-active.ts"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e452c6f15424f7b534811b65313dd960c21683a1eeebf803ec09605e8369fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ralplan/advisory.ts: FileTooLong \u2014 804 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 304 over it, 1.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72c4f1c0854b94b99f1dae92d5120ccc36153064cbd336c68eff108b68a2cbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ultragoal.ultragoalCommand: FunctionTooLong \u2014 ultragoalCommand runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/ultragoal.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"169285b9fe22f8b395c2978daca52fe86c0af158c450601bf0f21cea311ec39e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: question/renderer.ts: FileTooLong \u2014 783 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 283 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":"src/question/renderer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea98db7cd84446942f568f111869a703d3b561951968fc9acea315c28c26f96e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: model-contract.canonicalizeConfigStringOverride: FunctionTooLong \u2014 canonicalizeConfigStringOverride 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":"src/team/model-contract.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e49f4176633c3717b07b36596abacf36b7396fdf16a0a0ea434764e6246ef5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: team-worker.maybeNotifyLeaderAllWorkersIdle: FunctionTooLong \u2014 maybeNotifyLeaderAllWorkersIdle 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":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad2fa652181e8c2f8790dc9a24b336d1bda76cb577aa003bf4772501c625a67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notifications/reply-listener.ts: FileTooLong \u2014 756 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 256 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/reply-listener.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b4c8d9997b743c8cbf4d62b18970e12d5542c95cb0e3c118020ac7d9711a9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 254 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-sparkshell/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"970e3b9acaeabfe5f9501656514d1a64a9c77a7d562c5b9b9b00b57a217c9e0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hud/state.ts: FileTooLong \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 252 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1128feec747bb7b3f275631d0c13d999f4acd956f45ee8b27f84910b40b7e09e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: doctor.doctor: FunctionTooLong \u2014 doctor runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"a973e61c2cd5c405de749b1673f16538e4a23301fe44166266e0f714efa721df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/update.ts: FileTooLong \u2014 733 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 233 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"598c6aa61c6f0576306c549126d24d7ad828df7144d03a6c78309cfb20e611dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: team-tmux-guard.evaluatePaneInjectionReadiness: FunctionTooLong \u2014 evaluatePaneInjectionReadiness 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":"src/scripts/notify-hook/team-tmux-guard.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ea8fe9be3a93403c67ba6325c698a06a4a5ae5a588915549219822caf4b23f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: doctor.formatStateRootSessionBindingDiagnostic: FunctionTooLong \u2014 formatStateRootSessionBindingDiagnostic runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa946512897598031ca760d7381fa3c98476d829461891ca53b4913ad8048007"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: runtime-cli.main: FunctionTooLong \u2014 main runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime-cli.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2c952c734d7f4a1fc7d85c9e3546f9b2332251ad2b1a57b3aff52c04cc2d00"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: generator.collectManagedHookTrustStateSourceRepresentations: FunctionTooLong \u2014 collectManagedHookTrustStateSourceRepresentations runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":2305}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d82100a8a62c2d4f1c3de9962c65e15ce4eb8a6fb62627a2850bdf73232b26"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: runtime.finalizeHookPreferredMailboxDispatch: FunctionTooLong \u2014 finalizeHookPreferredMailboxDispatch runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6737}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7923a1d1f9e7e6ddf9d8cc1a68c321d88b43841eafd394562d755dc72e02410"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: team/pane-status.ts: FileTooLong \u2014 700 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: readTeamPaneStatus (9-847). The bar is 500 significant lines; this is 200 over it, 1.40\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/pane-status.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5560b1efadcbe074c63b9377d2c3b605b50404fd9352fa3ac3a068e7d6ea24d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ralplan/runtime.ts: FileTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 188 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce28bedca240bab18a40977340a1b98a78602ceafb7c4a1e94590c2640b1ae3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: doctor.checkPluginScopedNativeHooks: FunctionTooLong \u2014 checkPluginScopedNativeHooks runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d1fe1ea29773ff83019e8cbfe066fc1077997d7d0339ec67e8d162a28ecf70"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: session.writePointerTransaction: FunctionTooLong \u2014 writePointerTransaction 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":"src/hooks/session.ts"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"492f60cac1ac1c03cd99f979920334d2dc1b58a29b3912ac5ebd69cf168a0fe3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notify-hook/auto-nudge.ts: FileTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded). 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/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78572833ab554c111b10ceb4a1b94672f0fb437e20e3f00248ff8aa13038ba70"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: setup.installSkills: FunctionTooLong \u2014 installSkills runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":6363}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cfac7b67d41b16c253f0c9cf357b30ab0e3e34f77a3d1a393b0a0adede6ead"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: advisory.reconcileRalplanAdvisoryUnlocked: FunctionTooLong \u2014 reconcileRalplanAdvisoryUnlocked 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":"src/ralplan/advisory.ts"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9922fe0c97a475b09712d74acb719efb98df027eb6fba438176a0f567c2f705"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/native-assets.ts: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 126 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/native-assets.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba1e575223be260538c28fdb169a1270f5a0362cebeaa9171ffb6293b2d8286"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: advisory.terminalizeRalplanAdvisoryUnlocked: FunctionTooLong \u2014 terminalizeRalplanAdvisoryUnlocked runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c815f3344a8e89eba82017ee8055641095adc3b7bdb5f20f4fba1ac6d1ba38b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mailbox.sendDirectMessage: FunctionTooLong \u2014 sendDirectMessage runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/mailbox.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea89d95cc46d62f2bafd777fdb6209c542e81f3b604f5b0116387bc5d830da4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: report.renderReport: FunctionTooLong \u2014 renderReport runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/evals/astra-defaults/report.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b22f29ebbc9fea1f1b910100fe6e3406bdf68d6e15081f3e950b438b187aa67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notify-hook/tmux-injection.ts: FileTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded). 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/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef598a65cdd3991fcffdec1a3881f9fa4777fb123e98bf67a0dc1551f4285f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tracker.recordSubagentTurn: FunctionTooLong \u2014 recordSubagentTurn runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26e26fe15e7951f3993553c2117f48b7e2bed767a5c56094162b52986bdc211"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scaling.reconcileScaleDownCleanupDebt: FunctionTooLong \u2014 reconcileScaleDownCleanupDebt 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":"src/team/scaling.ts"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86999711d3011a3cc3b5269b718e6f801f4692b874302879c80197d42897fd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: uninstall.atomicReplaceFile: FunctionTooLong \u2014 atomicReplaceFile 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":"src/cli/uninstall.ts"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabe92e61ed314aaacd33b36e00451f95a5ec3b6f7df8347091f2a15fac499fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notify-hook/team-worker.ts: FileTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 94 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b987c1006e1ab9690995c887435b41961147aabf273b97d66ee63f490434932"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hud/index.ts: FileTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 92 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0a12e9ed8cb4d06fc6ca42cd07081706f84d2dcad14fc61c71592584056c07"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: planning/artifacts.ts: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 88 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/planning/artifacts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f969b5d740a5d92911692f1bb2f6580ee590c14a7d1e9c916747e905cacc26d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tracker.consumeDirectChildReopenContext: FunctionTooLong \u2014 consumeDirectChildReopenContext runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f1ef684c2d5b40bfc000f924c708c23ded7d8669344612a5359da12f2a31a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/engine.rs: FileTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 82 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime-core/src/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3359ef19b2ec357cae6068b35787015473c7b045784ede26808b97d8076bebc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: doctor.checkPluginMarketplaceRegistration: FunctionTooLong \u2014 checkPluginMarketplaceRegistration 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":"src/cli/doctor.ts"},"region":{"startLine":3606}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe37c3fce4e097388df85b2e151dec508a2334f8f43cca2ca5d173aa7ac809d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: team-worker-posttooluse.handleTeamWorkerPostToolUseSuccess: FunctionTooLong \u2014 handleTeamWorkerPostToolUseSuccess 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":"src/scripts/notify-hook/team-worker-posttooluse.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0f1f066d86b52b498c729b84bb85029d9eec3e877beca519ad3f21cab72f37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hud/reconcile.ts: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/reconcile.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3c88de662b08db5230cd2fef079a28e936198460d5f3dc41ede412d532d8f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notifications/config.ts: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb59659394d0543c5e77e232f81baab272341a64b5e20360360097a8dce8e49"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeEngine.process: MethodTooLong \u2014 process runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime-core/src/engine.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"171f826bcb1091bd76265922aab0d86f0db6921a1599937ac8feb45d44fb60bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: chatView.renderChatHtml: FunctionTooLong \u2014 renderChatHtml 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":"packages/vscode-extension/src/chatView.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a291867bf6a537ed69cfbca934f2b735315e2bcbc792b5d0e7816eb3c4db9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mission.missionCommand: FunctionTooLong \u2014 missionCommand runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mission.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7d312ea43f3318a5496619dcee8a5bbe1ee074a3843c7f5c533f6225e5cb75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: doctor.checkExistingNativeHooks: FunctionTooLong \u2014 checkExistingNativeHooks 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":"src/cli/doctor.ts"},"region":{"startLine":2817}}}],"partialFingerprints":{"codehealthFindingId/v1":"1247fff97fb6103d3b8a89785041ead0fefa0976c30b408899b891c8bc0dcfe2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: runtime.assignTask: FunctionTooLong \u2014 assignTask runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":4893}}}],"partialFingerprints":{"codehealthFindingId/v1":"899a5935016b32a503b5a9460975aea33978f96dfeebc7d78b15f5bed6faf52e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/bootstrap.ts: FileTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 41 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/bootstrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c04138365616a3229d17dfdf92f7ea9fd54926974b65ca3106aa9302908bad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hotswap.runAuthHotswap: FunctionTooLong \u2014 runAuthHotswap runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/hotswap.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"73db1e67b7abfc747b2b02681c1ed61712066c3f1b095369e416aeeca55c79bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: state.retireTeamMailboxMessages: FunctionTooLong \u2014 retireTeamMailboxMessages runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":2547}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3935c222e0dc7a9462fe1d997c5c379785c7bd13efabc424491eb41868a141"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/hermes-bridge.ts: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/hermes-bridge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51043bf60850d8e1c2bab62d43aa4d06c5548af68cde068c74908c0be440d163"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notify-hook/managed-tmux.ts: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/managed-tmux.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79bba0a1ebccee980f7f51c47b558fb8f080c44642352998f285e171fe586be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: role-router.routeTaskToRole: FunctionTooLong \u2014 routeTaskToRole runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/role-router.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2e33c330ccb2099dabbf71d4c226ab3476345b40713d874c7bef9f01346c5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: team/worktree.ts: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 24 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worktree.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f361ae8af402bca29c2bea879b87f8b907ebf66f4cd8ec9c7e68e1d652470c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: state.readAllState: FunctionTooLong \u2014 readAllState 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":"src/hud/state.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9f6dced7d3e50cd20e7edbae344e53f9b8e29254c3b44be767fc83692a3549"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: omx_runtime::run: FunctionTooLong \u2014 omx_runtime::run runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime/src/main.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b25c7909e4c5b1ca9e5a6bbd28b31f869c95e2e5a448468efb3dbb741fc8afc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notify-hook/team-tmux-guard.ts: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-tmux-guard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66aad2aa4a54e21c2a3683160bc442f1e5031d85b8c11e9914a1f5413907c0dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: team/model-contract.ts: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 12 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/model-contract.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d6544ca36ade97186405cb1b3282fdd375b227aac62a9169a6fe2dc28f0017"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/omx-api/src/lib.rs:1250-1287 | crates/omx-api/src/lib.rs:1289-1326 | crates/omx-api/src/lib.rs:1332-1383 | crates/omx-api/src/lib.rs:1858-1876 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-api/src/lib.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73774d9bb399cf6f24b725398e909b008c096d012b973268db269d6b69d9665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/scripts/eval/eval-noisy-bayesopt-highdim.py:13-31 | src/scripts/eval/eval-noisy-latent-subspace-discovery.py:13-31 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/eval/eval-noisy-bayesopt-highdim.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77aebfb31b52569cacf4320e989e6881aedacc57e791a21a0e7f0d2b4230a2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/scripts/eval/eval-noisy-bayesopt-highdim.py:35-39 | src/scripts/eval/eval-noisy-latent-subspace-discovery.py:35-39 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/eval/eval-noisy-bayesopt-highdim.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b651bbc690282e68a49f5f5d5618ae4027cc7e31854100c422b6d6caba9ac23b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53\u201354 lines \u00D7 2): crates/omx-api/src/lib.rs:311-364 | crates/omx-sparkshell/src/redaction.rs:75-127 \u2014 before extracting anything, compare \u0060crates/omx-api/src/lib.rs\u0060 and \u0060crates/omx-sparkshell/src/redaction.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-api/src/lib.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce0ab28d89db5d4b54676505edbd88108d7438874a0e91580fb9c4bb2fdeeaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/omx-runtime-core/src/dispatch.rs:297-331 | crates/omx-runtime-core/src/mailbox.rs:197-231 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime-core/src/dispatch.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6065707c3fcbee50b60d37901f11f3b64f626831b78584792d13ccc86957e559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 3): crates/omx-api/src/lib.rs:1255-1284 | crates/omx-api/src/lib.rs:1294-1323 | crates/omx-api/src/lib.rs:1351-1380 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-api/src/lib.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1a295969f2e891f47deda3f4c12058ce69ec2f07e6311e1866e2d42b4b1027"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/omx-api/src/lib.rs:368-388 | crates/omx-sparkshell/src/redaction.rs:131-151 \u2014 before extracting anything, compare \u0060crates/omx-api/src/lib.rs\u0060 and \u0060crates/omx-sparkshell/src/redaction.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-api/src/lib.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"933a4281198f54c038b22541c56221836eb3222a196bbf36c4084f181df1fb76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/omx-runtime-core/src/dispatch.rs:277-293 | crates/omx-runtime-core/src/mailbox.rs:181-194 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime-core/src/dispatch.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"70673bba262245f0d81de70c00d73c1b6769a6073a2c90bd74e66e1d46285392"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/omx-runtime/src/main.rs:202-215 | crates/omx-runtime/src/main.rs:239-252 \u2014 both copies are in the same file, so extract the block into one function there 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/omx-runtime/src/main.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d129937e48fb3cbf2c920aec71fa4221dec8c994bbcd0a9317428f0582b0faa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/omx-api/src/lib.rs:817-828 | crates/omx-api/src/lib.rs:830-841 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-api/src/lib.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aacae89ca11a7a5d2cf02ba949835fe126d0f034db1c482bbf4db9932ef0253"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/omx-api/src/lib.rs:406-416 | crates/omx-sparkshell/src/redaction.rs:171-181 \u2014 before extracting anything, compare \u0060crates/omx-api/src/lib.rs\u0060 and \u0060crates/omx-sparkshell/src/redaction.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-api/src/lib.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35de9b471231b7519dedfd1ec9baf59046cf1acce3043902aeddce3e7b71fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): crates/omx-runtime/src/main.rs:207-216 | crates/omx-runtime/src/main.rs:244-253 | crates/omx-runtime/src/main.rs:267-274 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime/src/main.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6be7697672862db87aeea1705fa3a348c333c822f9265b13f331b7c1ee217e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/omx-api/src/lib.rs:1451-1458 | crates/omx-api/src/lib.rs:1508-1515 \u2014 both copies are in the same file, so extract the block into one function there 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/omx-api/src/lib.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc177aeebc545b7de4e312ec011f06b2ca023806ed2b1557bf0fc00a3236fa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/omx-api/src/lib.rs:1274-1279 | crates/omx-api/src/lib.rs:1313-1318 | crates/omx-api/src/lib.rs:1370-1375 | crates/omx-api/src/lib.rs:1864-1869 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-api/src/lib.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"17121e2e0ebee067926ce8f8eb99dcedf711f19c9cf7e9f7a3f1533314158eed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/omx-explore/src/main.rs:477-482 | crates/omx-explore/src/main.rs:492-497 \u2014 both copies are in the same file, so extract the block into one function there 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/omx-explore/src/main.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0215ba7e7f25195f491c3f4c5b1cf00a780f58b4c965e1191636a562a84944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/omx-runtime/src/main.rs:217-222 | crates/omx-runtime/src/main.rs:254-259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime/src/main.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd2dbb5d38721b0213e8405a9d8bb2702c416f45fa57d8d3ddc6d3b724a7d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/omx-api/src/lib.rs:1593-1602 | crates/omx-sparkshell/src/codex_bridge.rs:319-328 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-api/src/lib.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55b6e7bba3d783a55b8aa976ecf9580dfcdcb91fefe35c5720b4db905aff1d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/omx-sparkshell/src/main.rs:236-244 | crates/omx-sparkshell/src/main.rs:289-297 | crates/omx-sparkshell/src/main.rs:309-317 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-sparkshell/src/main.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"be44171f9ff2b92154df4e746496d17b4841d67f85ae5ab860165cb4387c916b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/omx-api/src/lib.rs:1095-1100 | crates/omx-api/src/lib.rs:1200-1205 \u2014 both copies are in the same file, so extract the block into one function there 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/omx-api/src/lib.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"1099b572ae4369e199e59db78bad158d414f5ed14180a7d8d3a7a4e922d18ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/omx-sparkshell/src/codex_bridge.rs:498-502 | crates/omx-sparkshell/src/codex_bridge.rs:503-507 \u2014 both copies are in the same file, so extract the block into one function there 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/omx-sparkshell/src/codex_bridge.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5a45232fe0c565757f68531f1f55ea3d8106a586fbeddf8a2437f24e3cd61c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (28 shared lines): playground/bayesopt_highdim_demo/optimizer.py:90-153 | playground/bayesopt_latent_discovery_demo/optimizer.py:141-214 \u2014 These two members are variants of one another: 28 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":"playground/bayesopt_highdim_demo/optimizer.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef500903b18ecc34ff5b4226300827d24bb66e2f4569f02f0c3678fb7df4eed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): playground/bayesopt_highdim_demo/optimizer.py:67-86 | playground/bayesopt_latent_discovery_demo/optimizer.py:72-91 \u2014 \u0060playground/bayesopt_highdim_demo/optimizer.py\u0060 and \u0060playground/bayesopt_latent_discovery_demo/optimizer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 63 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"playground/bayesopt_highdim_demo/optimizer.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f423a9a974168ae96651a5e9de40b5e7772cdf0f615d8e38cb997e127ccbc387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): playground/bayesopt_highdim_demo/optimizer.py:49-62 | playground/bayesopt_latent_discovery_demo/optimizer.py:38-51 \u2014 \u0060playground/bayesopt_highdim_demo/optimizer.py\u0060 and \u0060playground/bayesopt_latent_discovery_demo/optimizer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 63 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060length_scale\u0060 to \u0060float = 0.18\u0060 in one and \u0060float = 0.22\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":"playground/bayesopt_highdim_demo/optimizer.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1114b1b3ce0b58ba19e96c40fa9ba7924d27df81f69f6a4818eb0a1e7309116d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): playground/bayesopt_highdim_demo/optimizer.py:142-153 | playground/bayesopt_latent_discovery_demo/optimizer.py:202-214 \u2014 \u0060playground/bayesopt_highdim_demo/optimizer.py\u0060 and \u0060playground/bayesopt_latent_discovery_demo/optimizer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 63 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"playground/bayesopt_highdim_demo/optimizer.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10fa59c47cbf0073d1195186e8146fcaa48609cd7f1293e036354deadfd75c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): playground/bayesopt_highdim_demo/optimizer.py:122-131 | playground/bayesopt_latent_discovery_demo/optimizer.py:182-190 \u2014 \u0060playground/bayesopt_highdim_demo/optimizer.py\u0060 and \u0060playground/bayesopt_latent_discovery_demo/optimizer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 63 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/bayesopt_highdim_demo/optimizer.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f902b42618d38989ea0ccdd8775d1ec198804dba8380d8ebc1bda38f3b9cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): playground/bayesopt_highdim_demo/optimizer.py:92-97 | playground/bayesopt_latent_discovery_demo/optimizer.py:95-98 | playground/bayesopt_latent_discovery_demo/optimizer.py:143-148 \u2014 \u0060playground/bayesopt_highdim_demo/optimizer.py\u0060 and \u0060playground/bayesopt_latent_discovery_demo/optimizer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 63 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060playground/bayesopt_latent_discovery_demo/optimizer.py:149\u0060 calls \u0060get\u0060 and \u0060playground/bayesopt_highdim_demo/optimizer.py:98\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/bayesopt_highdim_demo/optimizer.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"91408e35b691246cb7f686848600b2bc97677a2f9e4cf1383e7c204f21b41651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): playground/bayesopt_highdim_demo/run_search.py:10-16 | playground/bayesopt_latent_discovery_demo/run_search.py:10-16 \u2014 \u0060playground/bayesopt_highdim_demo/run_search.py\u0060 and \u0060playground/bayesopt_latent_discovery_demo/run_search.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 7 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/bayesopt_highdim_demo/run_search.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fac1e576859840b5bd6c01d4ab278c631af93913ab0c64e7c7dfa331ab323f8"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: omx-runtime-core: omx-runtime-core: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5ba6622690d0af83309c29e3eb6334c7bda21ee83ac60344038783e3fcf6ae93"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: omx-mux: omx-mux: abstractness 0.14, instability 0.00, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"597a9db07585b57260b0e49ccca031b4756a3411694204e522ddc5bf9d0478c7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: ADR 3194: Documented leader proof for exact reviewed Codex releases: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/3194-codex-01445-documented-leader-proof.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5077daf8e35a8eb75b3464e2bf44c32a74dd419d1a9adfc80db0ac88a92cf7a7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: ADR 3212: Same-user native-child authentication boundary: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/3212-same-user-native-child-auth-boundary.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fab151011d9a5970a420001ef673b96612ceb37e5e8fe1b71fc2ff49eea71d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: ADR 3459: Preserve the Team source-authority tmux argv separator boundary: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/3459-team-tmux-argv-separator-boundary.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"271ae4febb86016750b429a81665abd1c695b5a123897dd92ee66bd07dc770e8"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the node:test suite in packages/vscode-extension/ ran and not one test passed (\u003E oh-my-codex-vscode@0.5.7 test), so the coverage would describe the failed run, not the code. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: removeTeamWorkerInstructionsFile is safe to call when file does not exist: 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":"src/team/__tests__/worker-bootstrap.test.ts"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"41de68931ab7d98936449d21ca43826e094f9d4090501ef2a2d8bd0166e2b634"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: assertNativeHookAdvisoryPreToolUse accepts the two documented advisory shapes: 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":"src/scripts/__tests__/smoke-packed-install.test.ts"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d76e50c0be133e5089326dc01d06f79a8bac55f3e1968df82f064f305b390e2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: lets a detached excluded writer acquire a fresh reentrant lease after activation releases: 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":"src/ralplan/__tests__/advisory-activation.test.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4d83da265595be8b5721e4ae5b6b3d3053111b292fe2a197398e7d8efc9750"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does nothing when config is null: 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":"src/notifications/__tests__/notifier.test.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2210485141db200328255652271cf61e2b4b481daef54c44b3dd731fe87cfb11"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does nothing when all channels are disabled: 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":"src/notifications/__tests__/notifier.test.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34bfdf80f5d313a272291db410a685e89785c2363e2e81a7703028613114953"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: accepts all notification types: 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":"src/notifications/__tests__/notifier.test.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5f972bda0bd82a8f3d0381d3c68026bb0ff88cf1aa718edad89747cc8a270d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: resolves for 2xx responses: 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":"src/notifications/__tests__/notifier.test.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2192b370f0efb701cb847b46f382c26da8c82e53e98e05f511df74f1b2dbb3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: exposes info, warn, error methods: 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":"src/hooks/extensibility/__tests__/sdk.test.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf3651a768798860680b89a43d8212dd2d6da9b712006dec04bbc68e7c1b825"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does not throw when files do not exist: 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":"src/hooks/extensibility/__tests__/sdk.test.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdd7d67a306cb5ca20b313d2b2b1f34aae937f19763e801abe003dc3ec81e1b"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): backs off idle polling and resets to the base cadence after fresh rollout activity: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/__tests__/notify-fallback-watcher.test.ts"},"region":{"startLine":4374}}}],"partialFingerprints":{"codehealthFindingId/v1":"6772f36cf10c07c144583bea44c81ca0dd950927f3451f2d2726653ed6391010"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: requires a four-valued reasoning default on every AgentDefinition: 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":"src/agents/__tests__/definitions.test.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a07031261602ca7156ba8b1dff1da13996c64c22fc483fd8341e1d5c211d25"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: backs off identical failed detached repair attempts: This test starts work it did not wait for (\u0060promise\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 1_050))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/__tests__/watch-detached.test.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cf46212eb77986f1d2da1c47c1b11f6f5cd1b94967c9be371ce4813dea2e0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/index.ts: src/cli/index.ts changed 70 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 212 in index.cancelModes at line 10503. 60 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/cli/index.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":"src/cli/index.ts"},"region":{"startLine":10503}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c77a6330835a7d13f557b8ab4d420bc5e90424319e96e1e02da78422bbdecee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/setup.ts: src/cli/setup.ts changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 231 in setup.setup at line 4449. 41 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/cli/setup.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":"src/cli/setup.ts"},"region":{"startLine":4449}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ff07fc7ee27c809f46b11334988a98586970dc00b6e52a1d7fe4b03f24e88b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scripts/codex-native-hook.ts: src/scripts/codex-native-hook.ts changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 290 in codex-native-hook.dispatchCodexNativeHook at line 21948. 28 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/scripts/codex-native-hook.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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":21948}}}],"partialFingerprints":{"codehealthFindingId/v1":"0570d495e5d0225a0975de3dc97076cc6889908a3ce1b7d4fb681d5df812c38c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/plugin-marketplace.ts: src/cli/plugin-marketplace.ts changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in plugin-marketplace.materializePackagedOmxPluginCacheImpl at line 3876. 38 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/cli/plugin-marketplace.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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3876}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ab912c0fb1487522fd60d75d006728aa9acec2254ff531c5dced53013bd967"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/team/runtime.ts: src/team/runtime.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 232 in runtime.shutdownTeam at line 5068. 13 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/team/runtime.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":"src/team/runtime.ts"},"region":{"startLine":5068}}}],"partialFingerprints":{"codehealthFindingId/v1":"228ed2e6aaf050377154346835ec9b165be24abaec800b200987850e8bd6b73d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/keyword-detector.ts: src/hooks/keyword-detector.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 133 in keyword-detector.recordSkillActivation at line 3883. 11 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/hooks/keyword-detector.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":"src/hooks/keyword-detector.ts"},"region":{"startLine":3883}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c61ad03d7a6f913774b9a2e8e40ff906df819e296822f713d32df088a3d59c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/oh-my-codex/hooks/codex-native-hook.mjs: plugins/oh-my-codex/hooks/codex-native-hook.mjs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 92 in codex-native-hook.main at line 1609. 21 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- plugins/oh-my-codex/hooks/codex-native-hook.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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"b343594ae8eb2767befdaec9502b2879527d33a069073498a424d53fc7c70be6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/team/tmux-session.ts: src/team/tmux-session.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 125 in tmux-session.createTeamSession at line 2403. 12 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/team/tmux-session.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":"src/team/tmux-session.ts"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d3a6a47610bdf9310e8071ad724159347811656f0bb6feb9be2a1a959f7785"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scripts/smoke-packed-install.ts: src/scripts/smoke-packed-install.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 200 in smoke-packed-install.smokeInstalledNativeHookDist at line 2449. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/scripts/smoke-packed-install.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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6d4b3fa1a7f98e0539a092d74185a99b23a1d819f79734dd9bad40a396d58f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/doctor.ts: src/cli/doctor.ts changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in doctor.formatStateRootSessionBindingDiagnostic at line 440. 24 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/cli/doctor.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":"src/cli/doctor.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5846db7988dbd4fd6b9239e4c43610ce74d34dfd8d6e3a9411558ad2607580c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/state/operations.ts: src/state/operations.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in operations.executeStateOperation at line 743. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/state/operations.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":"src/state/operations.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"463c1dec5bd27de9563eb492f409a2a1bebf6958d169b69c33f5fb212b6ffce3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ralplan/advisory.ts: src/ralplan/advisory.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in advisory.readProjectionForGeneration at line 229. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/ralplan/advisory.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":"src/ralplan/advisory.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f3a730c4912d7f96712456a9d5de8c6e0330d9ebdf575dc4555e7ab8a62e3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hud/index.ts: src/hud/index.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 104 in index.runWatchMode at line 222. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/hud/index.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":"src/hud/index.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c154c5c7ab7e22134e9c35e86c7475838419216634ad434ae405afe0cd56f570"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/session.ts: src/hooks/session.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in session.recoverDeadSessionPointer at line 2043. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/hooks/session.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":"src/hooks/session.ts"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6772c330f3edb5f62decf73017c72b35e38099302a45591d9f519f1a676e889"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/team/scaling.ts: src/team/scaling.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 169 in scaling.scaleUp 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/team/scaling.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":"src/team/scaling.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c520be4238c3c4f08ff059d64ad00a69118b5eb1fb99ad56392ef07c57b11b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/team/api-interop.ts: src/team/api-interop.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 275 in api-interop.executeTeamApiOperation at line 612. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/team/api-interop.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":"src/team/api-interop.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63c8664385e04adb8f88264370fbbfd85ad5699a6840af7012a580ce133dc94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ralplan/runtime.ts: src/ralplan/runtime.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in runtime.runRalplanConsensus at line 308. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/ralplan/runtime.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":"src/ralplan/runtime.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da85723df5d365d6bd34baae89c1dca2af8555ec0b99a0edbf6125ea97bf87f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/team/state.ts: src/team/state.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in state.retireTeamMailboxMessages at line 2547. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/team/state.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":"src/team/state.ts"},"region":{"startLine":2547}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1bb011f9ff936618c5038a88adff79a986415912ffc142fdc939467ea46ef7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/ralplan.ts: src/cli/ralplan.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in ralplan.ralplanCommand at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/cli/ralplan.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":"src/cli/ralplan.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bb056592bc73f2facf67a94f1ad04c211aa791a0f60dc4939cd9f38fbe7b23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hud/reconcile.ts: src/hud/reconcile.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in reconcile.reconcileHudForPromptSubmit 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/hud/reconcile.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":"src/hud/reconcile.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"068d1c0b1c9d890647df00f0453dd83098437527ca09c081f6086622c3610d9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hud/tmux.ts: src/hud/tmux.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in tmux.registerHudResizeHook at line 2124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/hud/tmux.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":"src/hud/tmux.ts"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c204b2cbf38a3eaf64de19bd5c862bfe976dd0d3c26c1baebb89cfd9b149eb38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/modes/base.ts: src/modes/base.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in base.updateModeStateUnderCanonicalLock at line 427. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/modes/base.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":"src/modes/base.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"898abd8aec3d07ee4d3ae9d53387ff8e5d056af912f8d6f9964e51b2b315428b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/team.ts: src/cli/team.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in team.teamCommand at line 1424. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/cli/team.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":"src/cli/team.ts"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6019e8c697439f1053bd5861af032f148ec23fad1a07b52f70e62ece5dc423e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scripts/notify-hook.ts: src/scripts/notify-hook.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 197 in notify-hook.main at line 612. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/scripts/notify-hook.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":"src/scripts/notify-hook.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bf68224932b28c844436ec98e380553c489220f2b3ada07e4afa59fe44f49f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/config/generator.ts: src/config/generator.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in generator.collectManagedHookTrustStateSourceRepresentations at line 2305. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/config/generator.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":"src/config/generator.ts"},"region":{"startLine":2305}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb53fd32032215c778e44e42eee62ffb5b0ed6e8fbb18adf583039b0169b9cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ralplan/advisory-evidence.ts: src/ralplan/advisory-evidence.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in advisory-evidence.projectAdvisoryReviewLifecycle at line 381. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/ralplan/advisory-evidence.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":"src/ralplan/advisory-evidence.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ad490043648cf711fe83f4fe209e53d9dbb127d898d5644295b86c397e9816"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scripts/notify-hook/team-dispatch.ts: src/scripts/notify-hook/team-dispatch.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in team-dispatch.injectDispatchRequest at line 759. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/scripts/notify-hook/team-dispatch.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":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6c52d0d1d2518521e600fc8eed7387674dc199ffb27df854d4395983ea69b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/state/mode-binding-lease-helper.ts: src/state/mode-binding-lease-helper.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in mode-binding-lease-helper.readPinnedOwner at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/state/mode-binding-lease-helper.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":"src/state/mode-binding-lease-helper.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04add61c5af5af1b9ae4010e8dde836c339014f449f80c1fced1489d751f6e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ultragoal/artifacts.ts: src/ultragoal/artifacts.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in artifacts.checkpointUltragoal at line 1796. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/ultragoal/artifacts.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":"src/ultragoal/artifacts.ts"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2519bff573f1a49a4ff7547beaec844865d3872c94689e032ceb04606d6859b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/autopilot/completion-gate.ts: src/autopilot/completion-gate.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in completion-gate.validateAutopilotCompletionTransition at line 367. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/autopilot/completion-gate.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":"src/autopilot/completion-gate.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f22b250f71b1771b9e87086df7b7ba3db028e6a60f32963491c8d2b35db0a9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hud/render.ts: src/hud/render.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in render.renderTeamWorkers at line 214. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/hud/render.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":"src/hud/render.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"590f4d46cf9ce219ce710cfff5ccc105edc462e8a13165e7a42d759a7b3b10a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/evals/astra-defaults/collector.ts: src/evals/astra-defaults/collector.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in collector.collectRecord at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/evals/astra-defaults/collector.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":"src/evals/astra-defaults/collector.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b89139135210955bbfbb59da3b866366f3c3dc53169dc6a496171e8be9e0856"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ralplan/advisory-activation.ts: src/ralplan/advisory-activation.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in advisory-activation.activateOrResumeRalplanAdvisoryUnderCanonicalLock at line 202. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/ralplan/advisory-activation.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":"src/ralplan/advisory-activation.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0015269d67ca414e41e58fcd59fb69edf99b22a6bc7206fa3bddaffc2eb166d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/update.ts: src/cli/update.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in update.executeUpdate at line 776. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/cli/update.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":"src/cli/update.ts"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df023b0f905c2d6ce58959d4919075255fd690b49f7d17f10171b69600d3022"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hud/state.ts: src/hud/state.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in state.readAllState at line 932. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/hud/state.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":"src/hud/state.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6309ca440b107cf118d394675d5fc6d1807d34deceb7dba9189dd8454397fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/team/worktree.ts: src/team/worktree.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in worktree.replaySubmoduleRecovery at line 595. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/team/worktree.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":"src/team/worktree.ts"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"2304a41c5864ab52533364848a52019ad78c228d9cc5a828f71e2b5f6a0376bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/team/state/mailbox.ts: src/team/state/mailbox.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in mailbox.sendDirectMessage at line 208. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/team/state/mailbox.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":"src/team/state/mailbox.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"384e1b2aca4742522dd5f884972ddc7ef539d668084d463ecbbfba41bc59de26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/ultragoal.ts: src/cli/ultragoal.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in ultragoal.ultragoalCommand at line 364. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/cli/ultragoal.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":"src/cli/ultragoal.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc8adb500950c2805d6a168ca4a86e14349e0f64152e578a44d060a0e2d3319"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/auth/hotswap.ts: src/auth/hotswap.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in hotswap.runAuthHotswap at line 265. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/auth/hotswap.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":"src/auth/hotswap.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c44dc8e07969135c49af1e73b8f93f9b8308ea417e2d1a12ee6fba4b40abbbb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/utils/toml.ts: src/utils/toml.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in toml.upsertTopLevelTomlString 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/utils/toml.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":"src/utils/toml.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c33c66c3e2fb6c7f0b38563758506b9b446a65724beb5aa3ad1eb004c1cf81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/native-assets.ts: src/cli/native-assets.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in native-assets.hydrateNativeBinary at line 728. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/cli/native-assets.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":"src/cli/native-assets.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc5996efb62b7785e713aa7b7d1953891a8a13b7857a50d5dd8c9f2a66cbcca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scripts/eval/collect-astra-defaults.ts: src/scripts/eval/collect-astra-defaults.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in collect-astra-defaults.main 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/scripts/eval/collect-astra-defaults.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":"src/scripts/eval/collect-astra-defaults.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc86252c7e30437c2c40eb674848a2f898f95ed961472b4bf8c4a436a85a0f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/team/state/dispatch.ts: src/team/state/dispatch.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in dispatch.executeBridgeCommand at line 179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/team/state/dispatch.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":"src/team/state/dispatch.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a17fd5236aeeb351e01989b17acaab5fcbeb0ec4beb4a4598a1520ee380e36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/omx-runtime/src/main.rs: crates/omx-runtime/src/main.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in omx_runtime::run at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- crates/omx-runtime/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-runtime/src/main.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe0f82502a03c8cb74fd7eaa7beb7a544b274a7dca5eeed729f7689f83fa9d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/team/mcp-comm.ts: src/team/mcp-comm.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is mcp-comm.queueDirectMailboxMessage at line 240), 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(team): isolate mailbox messages by team (#3810)\u201D; \u201Cfix: prevent duplicate Team wakes and retire terminal projections (#3608)\u201D; \u201Cfix(team): retain bridge dispatch failure state\u201D; \u201Cfix(team): isolate mailbox dispatch receipts\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/team/mcp-comm.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":"src/team/mcp-comm.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01bc7e695a0544a1e845aa14f76532daee8d30dbeb213abda5eae84488080b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/scripts/sync-plugin-mirror.ts: src/scripts/sync-plugin-mirror.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is sync-plugin-mirror.comparePluginTemplate at line 192), 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(#3707): check that templates dir contains exactly AGENTS.md in check mode\u201D; \u201Cfix(3707): validate templates directory and AGENTS.md with lstat\u201D; \u201Cfix(plugin): address bot review findings on template sync\u201D; \u201Cfix(plugin): make plugin skill contract links resolve inside the plugin snapshot\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/scripts/sync-plugin-mirror.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":"src/scripts/sync-plugin-mirror.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"519bd871ff871993f6e1f396f1f81b238ca45f79484d8939151dc79e28c46a2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/auth/redact.ts: src/auth/redact.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is redact.createAuthStderrRedactor.accept at line 63), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(auth): stop oversized stderr suppression from eating the next record (#3676)\u201D; \u201Cfix(auth): resume stderr redaction after an oversized record\u201D; \u201Cfix: keep stderr suppressed after redaction buffer overflow\u201D; \u201Cfix: preserve auth secrets, resume identities, and multiline TOML values\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/auth/redact.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":"src/auth/redact.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1604aefb0f2d87478e46f52e94d92c5bf3e155d4458dd850b374d97bef5a0f2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/state/handoff-carrier.ts: src/state/handoff-carrier.ts changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is handoff-carrier.isValidHandoffCarrier at line 15), 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: close advisory evidence and Darwin authority gaps\u201D; \u201Cfix(keyword): reject a corrupt parent carrier before reconciling child state\u201D; \u201Cfix(state): make the handoff-carrier invariant total across writers and representations\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/state/handoff-carrier.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":"src/state/handoff-carrier.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"beeed40d678674e5bd34ebb9d995a06b2b864370ade9a48fc0293cdb20ca39e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/utils/platform-command.ts: src/utils/platform-command.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is platform-command.resolveWindowsCommandPath at line 119), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: preserve auth accounts and resolve config and CLI paths correctly\u201D; \u201Cfix(platform): POSIX PATH edge cases in command discovery\u201D; \u201Cfix(team): make startup checks side-effect free and errors actionable (#3643)\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 17:16:47 \u002B00:00\u0027 --until=\u00272026-11-07 17:16:47 \u002B00:00\u0027 --full-history --no-merges -- src/utils/platform-command.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":"src/utils/platform-command.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e8bedcd7a55a47655020d7d2013eb4358173547538e98e8d2843d7d0876b80"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context section: docs/adr/3194-codex-01445-documented-leader-proof.md has no Context section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/3194-codex-01445-documented-leader-proof.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af882aadcf5415c5079cfd565866f60351e77b26279199e2ec9e076a5da77940"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context section: docs/adr/3212-same-user-native-child-auth-boundary.md has no Context section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/3212-same-user-native-child-auth-boundary.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e527d00a74c94dac474046f9e0a300024ae2564a1870a6e33f2ee7f6d62959d4"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context section: docs/adr/3459-team-tmux-argv-separator-boundary.md has no Context section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/3459-team-tmux-argv-separator-boundary.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44c9577ca5c767afc633a52dd7a7af5750d27ff8c121eb0ff1c3e9782558d42"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Register a live pin\u0022 repeats the code it sits on: 3 of its 3 words (register, live, pin) are already in \u0060await registerOmxPluginCacheLivePin(cacheDir, \u0022dry-run-live-session\u0022, process.pid);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/__tests__/setup-install-mode.test.ts"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cf05ff2119aed5765d97e368d1d9104773fb10bb102d19a882df12bc6ba0c8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Verify config was created in custom CODEX_HOME\u0022 repeats the code it sits on: 5 of its 6 words (config, created, custom, codex, home) are already in \u0060assert(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/__tests__/setup-symlink-destinations.test.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c5524f2d3d8d8baa4e483560530dbe5a8f5dcd35f40298e9649954f35606ae"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Strip feature flags\u0022 repeats the code it sits on: 3 of its 3 words (strip, feature, flags) are already in \u0060config = stripOmxFeatureFlags(config, { preserveMultiAgent: true });\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.ts"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"4693aa672f7476cd7828fa8b330c8abd73753513e8e1f05f1578df7313a5e3e8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Code-review (from CODEX_HOME only)\u0022 repeats the code it sits on: 4 of its 5 words (code, review, codex, home) are already in \u0060const reviewGates = getGatesForStage(\u0027code-review\u0027, codexHomeDir, projectDir);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/__tests__/quality-gates.test.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9196cb0ad8bd4f4ca0d7b905f844b4250917126c44de79f44502d0644275290"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check reserved names\u0022 repeats the code it sits on: 3 of its 3 words (check, reserved, names) are already in \u0060if (RESERVED_SKILL_NAMES.has(normalized))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/quality-gates.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9a806ece1300a5892fbce6cd13a5e60d40e160b80d4745210ca01f3ab1addb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Validate skill name\u0022 repeats the code it sits on: 3 of its 3 words (validate, skill, name) are already in \u0060const validation = validateSkillName(skill);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/quality-gates.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cf288fef83c694cde8806823553fc2630a389be2bd5ac4abd34592656e0ffe"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Agent: includes ask-user-question\u0022 repeats the code it sits on: 4 of its 5 words (agent, ask, user, question) are already in \u0060it(\u0027agent allows ask-user-question\u0027, () =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/__tests__/verbosity.test.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d036daed109142b06cd565f4e910bc5cc544ecd862defe43bc63bf2bdd09bb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Write an active ralplan skill state for this native session\u0022 repeats the code it sits on: 6 of its 7 words (write, active, skill, state, native, session) are already in \u0060await writeJson(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/codex-native-hook.test.ts"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddafae22ec206fbbd2ece611af9f90753ce1d2c6175e058dc7a3e99d3b78ef49"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Write an active ralplan skill state\u0022 repeats the code it sits on: 4 of its 5 words (write, active, skill, state) are already in \u0060await writeJson(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/codex-native-hook.test.ts"},"region":{"startLine":2957}}}],"partialFingerprints":{"codehealthFindingId/v1":"43948fb3484478ac2e8cfce8ce86a7a82181d822590edbbfc0ba46676598322f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Documented advisory context with the PreToolUse event name.\u0022 repeats the code it sits on: 7 of its 8 words (advisory, context, pre, tool, use, event, name) are already in \u0060assertNativeHookAdvisoryPreToolUse(\u0027advisory-context\u0027, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/smoke-packed-install.test.ts"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc474ca7acc67e842c4d343da8f4940e4425514ddf603c19194627f7af978f5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022A file handle write through the suffix constant.\u0022 repeats the code it sits on: 4 of its 5 words (file, handle, write, suffix) are already in \u0060assert.equal(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/__tests__/single-writer-invariant.test.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f740fe62a6b4e5d5c9b3287471478ea6af8807daa33feaa15972f3b401815bf8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Write working status for both workers\u0022 repeats the code it sits on: 4 of its 4 words (write, working, status, workers) are already in \u0060await writeWorkerStatus(\u0027busy-test\u0027, \u0027worker-1\u0027, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/__tests__/scaling.test.ts"},"region":{"startLine":3370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26169cbdb303bbe5ce1401ee0cf8c0ca873d53e622e5272a9e51c697d427d76"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Verify via resolveTeamWorkerCliPlan\u0022 repeats the code it sits on: 5 of its 6 words (resolve, team, worker, cli, plan) are already in \u0060const plan = resolveTeamWorkerCliPlan(workerCount, [], {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/__tests__/tmux-claude-workers-demo.test.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6abd63a43904442453a38f7d9488b59b10ee90a4245a1e17740daba3859565"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Call removeWorkerWorktreeRootAgentsFile\u0022 repeats the code it sits on: 7 of its 7 words (call, remove, worker, worktree, root, agents, file) are already in \u0060await removeWorkerWorktreeRootAgentsFile(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/__tests__/worker-bootstrap.test.ts"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd298213ca0c7209f45f0c16e44292d03300d4594b6b5db77616e9d045ffcbb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Collect enqueued requests: request ID =\u003E { workerName, workerInfo, messageId }\u0022 repeats the code it sits on: 8 of its 9 words (enqueued, requests, request, id, worker, name, info, message) are already in \u0060const enqueuedRequests: Array\u003C{ workerName: string; workerInfo: WorkerInfo; messageId: string; requestId: string }\u003E = [] \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6921}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f6f43f742ad214d285826171a4adbb4547c44c3323a4ac519b8b7969f8f1f4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Read team config\u0022 repeats the code it sits on: 3 of its 3 words (read, team, config) are already in \u0060async function readTeamConfigRaw(teamName: string, cwd: string): Promise\u003CTeamConfig | null\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"1549488ec84e9ee77b150a7f2ec8647d1084b37eecdb1e71d124c4308f3001d2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Merge into existing page\u0022 repeats the code it sits on: 3 of its 3 words (merge, existing, page) are already in \u0060const merged = mergePage(existing, input, now);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/ingest.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c1a8afe3d57ca9e0f12421863b554112f9544773c11c33f785f98050ab6ea3"}},{"ruleId":"D25","level":"note","message":{"text":"ADR not followed: ADR 3194: Documented leader proof for exact reviewed Codex releases: docs/adr/3194-codex-01445-documented-leader-proof.md:7 rules out \u0060PreToolUse\u0060, but production code uses it: src/scripts/codex-native-hook.ts:23009, src/scripts/smoke-packed-install.ts:4901, src/config/codex-hooks.ts:76, src/config/codex-hooks.ts:449, src/cli/doctor.ts:2538. Remove the use, or supersede the record if the decision changed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/3194-codex-01445-documented-leader-proof.md"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"09061332cffa3d473c4ceca6dd1c6c64886244cfb7b2fc4525440c23171024f7"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 8 project(s) overshoot their size bounds, lowering Project Cohesion to 7.5/10. The most over is \u0060(repository root)\u0060 (195510 LoC, 1525 module-visible types across 58 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"560bb9173a4b5f23c7df48690b14cc99d77cba35c4c41612de73d8c66c12a760"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82a1893f62fe8dee3fcdaad2e3da3e94b86729172346ee8d336b86cb9d8780c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e06a7db65d3b16345f728573a902516c73b5ced12d41a9aa984f1a56a7de140"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5b557c9b51a27c6ffffd4bcd786f5205fdb6c8cc92ed5b989bd7a7805fb9511"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b562a86ba4fad32d6ccdcd6ca2d4c34c2236a59e5d8276adbfb83a1790cdee0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c5172532770706bb594e28c36323b9158ff84884f9e5553d665b160ef872838"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d386d80d7b5b673a2aaa813bd7442fbee8a3a75cf2e38e645815765daa16a5a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3fa0aef8e85a3c5d2110f5ff11e7bc6c29e92b1159643c33d95dede42cadde4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab979ab2dc46515c14a5a4f004fc991e04e40404eedb88f91aeaa5242f0df4a2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3189b92aaa584f9eb09252c1f9370d3dcbc5654e62d9334a0f65a19d38e940c1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4df0d759d3a205a786baefb26032cad8cd4fbbc4793b66e961d8f851fd7fbbd6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4014e7719155abad9ee780737c6a29d8c31bcf1e70b94286734d74edc799576"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58641f39641baab83ff7fe7c0502ed59df6220353375a4fce7d92fd58fc9bf10"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"465cc30edab2d79b19280fd699c1954098364dd591aabef818ad0941bf6c1e1b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ba1bd8cd7cc00ffea37dae7b5e07643f624b23874e3cb0759fc3e4878f73406"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3c5d3262642571eb86fb6dc739cbea7d01bb98f44e21f0cc3f4e745944454d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fe915542e9ef9e0e2030d13e5e967c9edc93ad44e0043112709e63c307bce8b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9fdace52517967069682f4d541cf1db103d249850b9ff9e28bca1b7ce09cb58b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e9323362030c11a89ee75d7211b2720333c55d8869ae68ed4aebea060c08384"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6a6d49203805cdb679d421a8043ac39e7b032144f8312d45a17e6946daaafca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8381cdd9539330ccdf5f2819fb2f0ec8e0d20d645b1467a3e5e48700a37b69b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbb3016e08588da0295feed2d3c1aabf07e14aa98db895f7d8608ac6dac5e7fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"48f9294e4f60d594a0a1d94a727f9120e7fc2e235658b56c64c762ad064230eb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d20d5484e3d8277d58c5e682057bd6b1904f0e084c9ee1d8b57c31e441c0f02f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7493bb85aa2303f31804b6ff88c48fe50f76a3545417f12a1295f805c1a6f8d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad92db393bbcf561f82ac30c23fba49df937de01e239c73062475f2edf40e3fd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54641d69f9fd310e1e6e109eb8c8c7bbf100e9cca02deb9ddcf89f516439975c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e8a627e7020ac8119c8ec6c60ce9a9f6a161d947c9dd66552a2bad9e055ffb9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c178da23d5dfc12a928a90f7d5596cf295aa8c66dc6c666d793acf3eed7c78ff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f716a87483fb3f919d01a2f6ee876ad3cac7f9134e64e33fda52e74d7a281f8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3fa03dd5c6754319f00472b439d942249818b769fc19844a54ae6a1ada7702aa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e80dc921a2fdc5ac55935de1a07d97d3b67da674418a9239d069b16881d400e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80cf37189b78a2c2c3212ef91138a4614528ec1454942cc43581a269af040c25"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f57d1d312afdbea5e586f5c4277469ac5784f32d5ade2a108c78d246b6a0be52"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ebac61d292e4757946ff83f15293e2fa751db1ae0044345ec1ca160a7804b230"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79b1f05e5e0fc760b813df5563155e75e80e97eb4a6a74b128d6ee16a9b98bf7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a772131f8c59faa280eebfb6e94ddfc026c59b33c7a0f8f3d28a29986f454eec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c773cf0e5b68b1194a973d709036ce6562c350b566fbc78e3166b5f9ea2be830"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8e8b172cf327825d1cf42b544ee79199814e271b1cab65813357983ba6a8730"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0964660517e2fb4aa579fd4644350b7882ba94beded2bc7ffb3cedf7f3e6faf6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ba49f1659782b32bd3f9a49251ae33e91324108dbd97403ef38eaf37d465059"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4af17c2699f15d319f250a9e3015d66b6ddba774fbe1c98f445c426bc7efa3b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6666f77d8f07f5ad4e7321b52465aafc6cae03e7c8e17ae3ccb503ba48aac37"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f913d6f4a4f07df59c35c90cd373b9cea19958ea8ec157342d1f6da8595e059"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6d1002a41e05a73a1c568859ee63877435e9110ee7016910b3eb4f6465bdfc4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0789e5eb3a01cb11c16bf4e86f551c69db0a1db7b11b095649607f5888cb65eb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75a453b3669e7eccf96e1c1132e7a5954f24f5d079b0c29c4868e4537437f325"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"613343d1b752f35745826fe8d15b453cf20383607c0f92f58d6658c1e8f77558"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45f48d53039c901a38bd1673c28c127ba2f62bba609cc2baf7bec2c6f721ea26"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8ba3704c890222c8ea1f7dbfa9ad1e19ec649c9a078aa1e9dd84726ba4e37e6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34999ac3833107b1712a23832d7ea1d520759593df31210f93e509f2ee12d3fd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf2111db48edec4141426f45c5c18dcc33cdabf54e39da52e3064eccb7ef14f2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"281bbefce5d4fa7fe029ce628ff018399ac639a1cd47392cf549522bba5c95b5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3526ae158dac3f4206fcf9b7a1edf762bedebdc242d662fb1b513f3a6d60d2f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f4ca73cb111fac5decfda2cbf08e1d37aaeb3d005a7ae925a7c208f62d737c9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6819b36024d45f5f0e1d43e74427f1e72c7d8dae5d09101e0f966a51bf6829ab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7aea5ad354bb944fe749ff0e5f574830ccdd11e2edd1cb16678dd3d93b52205"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d46bdcf42c1c606bdd786623bb0af01ceec881af0d3bbc48f063beab9197add"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4fa3a3025b7a9052cbd7b0d8a17b7d24287898600c95850a4b97997b4072afa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07bbe295decdd4e2dbf1dae707c08d0f6847c929efa6b8dd50cc50e95f369642"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae59d5e9dd2c30e110a21be3f2f3e4339df91ffb4154cfcf5f17bedb858ec684"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"957b150e90b8de065e3fab913d6db8aa84cc38085b4826b482eaabde0c4cf347"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb4a23173542d7a1718b502d857067e50a3ab2bcd9e6cbc8252c0d9b2bd57371"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9317c6bff8cff2e4a88424157c1618dbad988ca014793c84ac07ed03b4dc6dca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc817651145b3746bc99495e7fbc5498d41cc1b481fe483113715158512ae9c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2542699b904854fe2d3bb29c559aae2c03652694d5ce26390e798fe91bdf8a8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3952b5018533b78fae2659c2a1971db7d3fc9c1ad3bd2a694c50e31033553841"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01c1a248ecff5cb0ed0ea7ed64ab1bc3ac091ebb75caa9e0622a9a8e22a26a74"},"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":"d9cb49d0650bd29ef57c0e31050c63fe3d568c563e7ddf28077a438056563f34"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63778fa624412affc09bbae17ed4e235deee47c1e8fbbd49594e08c2f223c987"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","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":"e6790f47092b3d0481018c6e93a66886cb82ef8c327b22114f7747d22cd53881"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"d747cb8bf3b2da5fa230c9399a44a1f94cdb31b1986f66955af8e9a8aa7e428d"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"0bbd5d809144b6a655347e54fcbc5cf4cd49c3e43f5fb60e65fd39639f40bcde"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"c2b1324ed907a0dc38b20300bec482ad41f8ffc13c46141d2b0bdf00d1a6bbe0"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"5548f555f3cd47301358c370783848ca15cd52d24928d70b90fbb291b60320f7"},"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":"ede6fa72b44a89e536acaafbdff90704cd25e9db0a520c62bd59f20a69bfdfe3"},"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":"3365964cb215434e1b280957a8a0371c330b16326e51cd8b02ee0c1548bf6c0f"},"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":"fcdfa082c4f8b7ea4400adfe1332b16f95df84ca37fbb5928f1ae79581f670ce"},"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":"e24f4852a575300b387333d2a04bdba9f68d5171a49d63fefcc94f97f5585c39"},"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":"bc206e3c1d2b785029375e6a92259873c44107861d4c9817a4a30950c10055c4"},"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":"881ffe913dff88aeb46019541c64daebd2f534bc266ec2c62855cb2055a6ce89"},"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":"d22f6fbaa86e8fb02ecc86f8d1d1709364ea3afac3d8ff7c614f390027e8dd96"},"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":"065ce98c44efd0864b50c8daf235f81b63eaa15c5b09cfe361aca559840cf813"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91a91e8ed5aa63f721a700aa2238272f64651a27f9ecfed2424392fd7b96b5f1"},"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":"bec47f1bb98d267ee70c44e22aa1cff5f7e50d2636a993809726d43639e38aa6"},"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":"669ae2d4b806a63e6a003df584e42b04ee8f2495c8e6413fd80235b718f2548f"},"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":"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":"ba831e8008f54eef34c69d23d60a7349db4fe946ad38a09b1fb71d5742e890f1"},"properties":{"dependency":{"package":"proxy-addr","version":"2.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"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":"9eabe50e921d2c2a306c1659895f52c11083f6a9b5afd9baccfb22db496e06e7"},"properties":{"dependency":{"package":"body-parser","version":"2.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"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":"56d7c0542bcbbd8d8c61f07327aa2080292f8d213e8f982f1a0933ffecde0a9c"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"2567ea2f56ae79977dadd3bf380bcb8e0d5204997d0db598b3e49e1891ff5525"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"59e28f0fc3ceb219b9638eae73d38b2bcb54c3283507449da6396114e6cfcf26"},"properties":{"dependency":{"package":"ip-address","version":"10.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"0d45aa06fb6527e50e0f3b2f14f846509924dca7972497fc0ea9d442af95cfa4"},"properties":{"dependency":{"package":"@modelcontextprotocol/sdk","version":"1.30.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"019740c5e9bdf54434de42bdbf17673ced1342eeaad54fc976407c0d634c038e"},"properties":{"dependency":{"package":"zod","version":"4.5.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"001ad3525c46f220718563e23b19592fc804dd9bde0f853922c82e5332bf600f"},"properties":{"dependency":{"package":"@hono/node-server","version":"1.19.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"254e159535de5a467ea5671a4a81fbc3bf399623b11dcd1fc4071f2230ac5cd0"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"112b84fc785af3113eafeddf92a935023776df038193f6b6b991fdf808dc9011"},"properties":{"dependency":{"package":"hono","version":"4.12.26","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b57bd94a9054ab1a78280337953ab23bcb5d2500ea7f4b4abe8dc82a1ef1d633"},"properties":{"dependency":{"package":"minimatch","version":"10.2.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"98645b36f3d8a19e1462b10ae8d23a6853b810993981c4fc4065e762fff2771b"},"properties":{"dependency":{"package":"qs","version":"6.15.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ffe4ba45196af14beaa83c505708db8b94ca3acd287cbbf73cbe89df5fc243b"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e11ab595ec7b218a19e633ec2878807f1e66c7e7406eac640acc17a7f2da917"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"002a725fc70ecb71ea7302cc67d3602138d47df36897358d23746fc6defeefe8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 7 of 358 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 358 of the 464 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: src/team/dag-schema.ts, src/planning/artifact-names.ts, src/scripts/team-hardening-benchmark.ts, src/team/delegation-policy.ts, src/visual/verdict.ts, src/team/rebalance-policy.ts, packages/vscode-extension/src/core.ts. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/dag-schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3dd025a681e1fc5660d735f5256ed6449322f43d3137eee1501899fe0fc4bd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/planning/artifact-names.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3107cfca5301b1731b3ac05122e9556fd91b2cbc62b78159be1a78c41220330f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/team-hardening-benchmark.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"590983651b51de564118fb8fd810f22aa26f6a7041a52ad3d88023a9a3e77ff3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/delegation-policy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c8c82b68a049416fae16cf16c3a92d5213f3c6266a8d83678a64dda4def6e0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/visual/verdict.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a605bbc454ede784826edb3ac50b24281c1e02e5841d1dfeec77f545b3f323"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/rebalance-policy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d167ddf4caf8f88e98a142025c7c927e1dc3b5f6e8b92e3afdc570ef40799b8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/vscode-extension/src/core.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ee9808ba5fba6f53e024010c8d7cc2525d986e494dd455b133b33b7855479f"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: session.ts \u2194 state-io.ts: \u0060src/hooks/session.ts\u0060 (context hooks) and \u0060src/scripts/notify-hook/state-io.ts\u0060 (context scripts) 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 \u00602a633a39\u0060 fix: keep Ralplan terminal state on the canonical session (#3158); \u0060d7641a56\u0060 Make session-scoped runtime state the active authority (#2141); \u006041c5a132\u0060 Keep HUD state anchored to one OMX session scope \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b23b09d0cff69c9b8ab274569b6ce4eb5832d794f3e53dca332bd1f063f169a"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: runtime.ts \u2194 autoresearch.ts: \u0060src/autoresearch/runtime.ts\u0060 (context autoresearch) and \u0060src/cli/autoresearch.ts\u0060 (context cli) 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 \u006051579ce8\u0060 fix: comprehensive windowsHide for all child process spawns on Window\u2026; \u0060e8513e75\u0060 feat: launch autoresearch from interview via split-pane run path (#933); \u0060bd4b7157\u0060 fix(autoresearch): finalize noop exhaustion runs \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/autoresearch/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6b237e54044b2dcb52d159472ceb15418006431eb3bbed3dbbbd5060c7741b"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: team-tmux-guard.ts \u2194 tmux-session.ts: \u0060src/scripts/notify-hook/team-tmux-guard.ts\u0060 (context scripts) and \u0060src/team/tmux-session.ts\u0060 (context team) sit in DIFFERENT parts of the tree yet change together 52% of the time (11 of the 21 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 11 shared commits counted here, the most recent 3 are \u006071029cdf\u0060 fix(team): recover dispatch state and guard startup input (#3876); \u00600ec1003a\u0060 fix(team): submit worker triggers with tmux named Enter and detect Cl\u2026; \u00605e62305f\u0060 fix(team): preserve exact authority through recovery \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-tmux-guard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a83bde616555e9e1cb435b0b12f3435fbbdd68e880470a27095c658f136a890"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: ultragoal.ts \u2194 codex-native-hook.ts: \u0060src/cli/ultragoal.ts\u0060 (context cli) and \u0060src/scripts/codex-native-hook.ts\u0060 (context scripts) sit in DIFFERENT parts of the tree yet change together 50% of the time (8 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060875851f4\u0060 feat(ultragoal): ordinary/strict modes with advisory cohort gate (#3500); \u006077a5a740\u0060 fix(state): recover exact stale session binding and revalidate durabl\u2026; \u0060732605db\u0060 Make completed Codex goal cleanup explicit (#2894) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/ultragoal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce8dfc59076c97112d13f80c0d20caf877d1503f69b2fd6cff84a7bdce61fb3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: contracts.ts \u2194 runtime.ts: \u0060src/team/contracts.ts\u0060 and \u0060src/team/runtime.ts\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00608a823af7\u0060 Prevent false team integration success when leader HEAD is unchanged \u2026; \u0060038c5321\u0060 feat(team): add incremental worktree merge tracking; \u00607cc422ea\u0060 feat: enforce team worktrees by default (#804) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/contracts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0ef15ff4dab1cfd74a089c21429ea3c98ec47246e013207120ec5ee10b39d1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: codex_bridge.rs \u2194 sparkshell.ts: \u0060crates/omx-sparkshell/src/codex_bridge.rs\u0060 and \u0060src/cli/sparkshell.ts\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 5 shared commits counted here, the most recent 3 are \u00601cfe395a\u0060 Support local real generation compatibility; \u00601ba0e932\u0060 Support local real generation compatibility; \u0060530fb9a7\u0060 Keep explore and sparkshell on lean fallback lanes \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-sparkshell/src/codex_bridge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0230988d782176926aac08a4d723ceba7b2087f14c50fd7d0a826e3172bf7e5d"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21701099ae0a11cde8e3a75494b8f868e483d91de39993b8a1d3d14c03fbcadb"}},{"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":"19d4cbb252a3e4997007fe629a8fde65a6a24e745494155b47ed43cbf523f1eb"},"taxa":[{"id":"CICD-SEC-4","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":"c6eb5a94052c328a9f9d4f3228923a5f2d4d56700f96d3ddbb1b358415402983"},"taxa":[{"id":"CICD-SEC-5","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":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return true;\u0060 also returns \u0060true\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f94cdda8f52405f662c908dca0011be84bc99d2aa182effa68ef68cbe3261a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060autoresearchCommand\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/autoresearch.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"882fe894726acd648ed88834febb76dc43ccd7cf4607870e820b96fe2319dce5"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return false;\u0060 also returns \u0060false\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"006022d4912c192983f2ee2acaa154e826a71e4d272477dc7a784e4c428f23a1"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060exploreCommand\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/explore.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac20c05657ed6c833571a8b6c47e120b22443e83e918a18b4bb7d495a87b95a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060listCommand\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/list.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae358dacc6d0862ebcbe011b1b3e4e00ed2c3c8ece74507073feafafefa4b05"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return true;\u0060 also returns \u0060true\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8115a195a6d667ece1f70c973eaf723b4b17643726793d487c7540527552b0"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060setupNotifyHook\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":6933}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82e9b719965c3a1fdb687baf3453921e6568447e32e5e69fc5f4659546fa646"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060defaultRunProcess\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/authority.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6b1ebe608b45144c220595a806d5037cac91162a1e75c9df6c9facdc6d7c61"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060assertModeStartAllowed\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/modes/base.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01ce8465b2100442e894b5f978e4da49914bedf911fcb4192355cc30ae981a0"}},{"ruleId":"IC1","level":"warning","message":{"text":"Both branches are identical \u2014 the condition decides nothing: Both arms of this conditional expression are the same, so no input can make the condition matter. Implement the distinction that was intended, or drop the condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/formatter.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4e5a233e41addee0ae5be17566ffc72f49b8a64b8bf0879774c6c1990db572"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060buildNativeOutsideTmuxUltragoalPromptBlockState\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2707}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a100a2c39ae3add738a2b5accd0ce97b20bd7566dd44faeee180e001d2a971"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060buildRalplanPreToolUseBoundaryOutput\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10785}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f1d877abc19d2b196f4a01d879a5012c6f7be413da4dbd78c0a1aec3242da1"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060buildDeepInterviewPreToolUseBoundaryOutput\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10806}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0879d12d4d0bb6b23e53b14651f53e8df986e4df57069ec3571a62fdbdd761"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060buildPlanningRootPointerConflictPreToolUseOutput\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10868}}}],"partialFingerprints":{"codehealthFindingId/v1":"870b95f372c1994b347a68ab3f4f5f99e9c970b9c9d1349b7567bde566fa2970"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060buildUltragoalNoOwnerActivationGuardOutput\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11051}}}],"partialFingerprints":{"codehealthFindingId/v1":"733e214f186023f52ea6780575895a49722b4792ccc15491f4cfe070edd90860"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060buildConductorPreToolUseWriteGuardOutput\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":20422}}}],"partialFingerprints":{"codehealthFindingId/v1":"721e004e5a782eb93acb162ade69ee41666390430e62ff4badc48fdf0c1d07b3"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060buildOversizedStopInactiveWorkflowOutput\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/scripts/codex-native-hook.ts"},"region":{"startLine":23079}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb5cf210f611ec01d1885e275c292d7d23e3e64e6ee68b992aeac8b7ecee0d0"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return \u0027still_actionable\u0027;\u0060 also returns \u0060\u0027still_actionable\u0027\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/orchestration-intent.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"92853d2003b9a353114ae305bf061613c17a1a8f928cff4e0ddef6b64fce7ab0"}},{"ruleId":"IC1","level":"warning","message":{"text":"Both branches are identical \u2014 the condition decides nothing: Both arms of this conditional expression are the same, so no input can make the condition matter. Implement the distinction that was intended, or drop the condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-posttooluse.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"021919bf6ab70c007cee69f9746e6d47cc97e2f09aa5debc8aaaa9b9565e5688"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060isReportTrackedInIndex\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"0466aaf3c5ae0e93eae20485f12b644376ea64aa8e0329e06487dccf72202253"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060probeProcessIdentity\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":2654}}}],"partialFingerprints":{"codehealthFindingId/v1":"027affe4d0375f9b0755c2439936f91a7d0e7de15c3b35dbc488007276e1cb0e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return \u0027auto\u0027;\u0060 also returns \u0060\u0027auto\u0027\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9edff4fb7c5c7a1ee3debed3c413dde343cabea13b828163cb56bc9bb31000"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return null;\u0060 also returns \u0060null\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"0662dd1264a9149c3bf8de7cfe1331da5cae1f8e5724e37daab5c37922b87193"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return unknownStatus;\u0060 also returns \u0060unknownStatus\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c6c78a055921b82ef08361cead14079fd2d5de3799ff0929ac3ad145402565"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return null;\u0060 also returns \u0060null\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":2761}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbe2eda8ebbb10c45570f84ca421d315f9a17691fc00a8871a1e9cad3b86f80"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return false;\u0060 also returns \u0060false\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/tmux-session.ts"},"region":{"startLine":3645}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaeb03250592fd267627bc42e14e22fd453331d155fce2f80c787aec11c1de8"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return false;\u0060 also returns \u0060false\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/tmux-session.ts"},"region":{"startLine":3767}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3efac57d524403b4344a738149acab3fe037fc39537661510597cf954f5ec3c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return \u0027direct\u0027;\u0060 also returns \u0060\u0027direct\u0027\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/platform-command.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5cede5a84b1df37e10841cb2ba802604eb27c2a0d12911682441c1e7775e2d"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/__tests__/tmux.test.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c13093589b5deca1b61b78256fceb71082623e403be13ba5e6c1c2e31524845"}},{"ruleId":"IC1","level":"note","message":{"text":"Blanket warning suppression: A bare \u0060eslint-disable\u0060 or \u0060@ts-nocheck\u0060 with no rule list switches every lint rule or the whole type checker off for the rest of the file \u2014 hidden debt. Disable the specific rule on the specific line, with a justification, instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/check-runtime-syntax.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f35709c7c4e1acc5821a3ca219a70a26422aa85c14bf097152cdee1cd1b8b2a"}},{"ruleId":"IC1","level":"note","message":{"text":"Blanket warning suppression: A bare \u0060eslint-disable\u0060 or \u0060@ts-nocheck\u0060 with no rule list switches every lint rule or the whole type checker off for the rest of the file \u2014 hidden debt. Disable the specific rule on the specific line, with a justification, instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfce18709d70d408d616140b4d4cfe6fc945b119dbd08af0b3ce650f31b8b88"}},{"ruleId":"IC1","level":"note","message":{"text":"Blanket warning suppression: A bare \u0060eslint-disable\u0060 or \u0060@ts-nocheck\u0060 with no rule list switches every lint rule or the whole type checker off for the rest of the file \u2014 hidden debt. Disable the specific rule on the specific line, with a justification, instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/orchestration-intent.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"301d037d0d9cdc6929a8885b9524066819d430aa045a0b2344c26e10fac6927e"}},{"ruleId":"IC1","level":"note","message":{"text":"Blanket warning suppression: A bare \u0060eslint-disable\u0060 or \u0060@ts-nocheck\u0060 with no rule list switches every lint rule or the whole type checker off for the rest of the file \u2014 hidden debt. Disable the specific rule on the specific line, with a justification, instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afc91f4626d45f1d229e75e1a5362c4df287b5a46afb4acece33ffa894caadb"}},{"ruleId":"IC1","level":"note","message":{"text":"Blanket warning suppression: A bare \u0060eslint-disable\u0060 or \u0060@ts-nocheck\u0060 with no rule list switches every lint rule or the whole type checker off for the rest of the file \u2014 hidden debt. Disable the specific rule on the specific line, with a justification, instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1d0c24760a5dcb7f9df1e9bd8274013e9f7df690f4c59940fc95bbf134c274"}},{"ruleId":"IC1","level":"note","message":{"text":"Blanket warning suppression: A bare \u0060eslint-disable\u0060 or \u0060@ts-nocheck\u0060 with no rule list switches every lint rule or the whole type checker off for the rest of the file \u2014 hidden debt. Disable the specific rule on the specific line, with a justification, instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d0ca2931f6edfa5851b1c5ddfbe04aeeef76187654fd56ddfb5b05b0f415ba"}},{"ruleId":"IC1","level":"note","message":{"text":"Blanket warning suppression: A bare \u0060eslint-disable\u0060 or \u0060@ts-nocheck\u0060 with no rule list switches every lint rule or the whole type checker off for the rest of the file \u2014 hidden debt. Disable the specific rule on the specific line, with a justification, instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab78b4094f27a0ddc268f3c3872a9eaf2914863ac1d8b40675c7efe16150e6a"}},{"ruleId":"IC1","level":"note","message":{"text":"Blanket warning suppression: A bare \u0060eslint-disable\u0060 or \u0060@ts-nocheck\u0060 with no rule list switches every lint rule or the whole type checker off for the rest of the file \u2014 hidden debt. Disable the specific rule on the specific line, with a justification, instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae01759398a50f0d312cdc015a72fa34c0d5421b63a6c20059798910b2c3b1b"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/6 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060crates/omx-api\u0060, \u0060crates/omx-explore\u0060, \u0060crates/omx-runtime\u0060, \u0060crates/omx-sparkshell\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/team/runtime.ts\u0060 reports through \u0060console.*\u0060 at line 3422 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":3422}}}],"partialFingerprints":{"codehealthFindingId/v1":"e904c2f8d10fd31989e957f5b41cdf509dd7caaef38ccc148b601aee6d989fdb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/team/runtime.ts\u0060 reports through \u0060console.*\u0060 at line 3424 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":3424}}}],"partialFingerprints":{"codehealthFindingId/v1":"28630ead24a9115b5039df06e5790088bc579961f681676213d5d8d33a625085"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/team/runtime.ts\u0060 reports through \u0060console.*\u0060 at line 3426 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":3426}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4bf216e6c608d5f10410359173253739f3ae7b67028c61f69c0f10a668a56d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/team/runtime.ts\u0060 reports through \u0060console.*\u0060 at line 4181 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":4181}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce38537024c5dd3cb15bdb072b29585ce156aa859755471acf0953ded40f049"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/team/runtime.ts\u0060 reports through \u0060console.*\u0060 at line 5322 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":5322}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abaef07af1c656cb7f35031a0528d8f14a1ae65d75ad4d041d0eeac27700144"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/team/runtime.ts\u0060 reports through \u0060console.*\u0060 at line 5646 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":5646}}}],"partialFingerprints":{"codehealthFindingId/v1":"22512b6f6fda1d870de30d8b4c05cbd7315e275045035f2c73b22f7f2af5604d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/team/runtime.ts\u0060 reports through \u0060console.*\u0060 at line 5683 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":5683}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a0754ec45b0852c1f80a4c4d8375386fdda7d3e8a061367e3a777f6f4da084"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/team/scaling.ts\u0060 reports through \u0060console.*\u0060 at line 1095 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1873fb7bc291a50b958efccbc305c9080eae13300cb14b2cc10048beb78158"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/team/scaling.ts\u0060 reports through \u0060console.*\u0060 at line 1304 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9155e0ad2e9fe3dec14aae61d41903937c56d9b554b141bcd27488182546243b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/team/worktree.ts\u0060 reports through \u0060console.*\u0060 at line 751 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worktree.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48355b8ace99ec9fed6d4ffafc1ace9cede7582d63284b1e69fda4656c4bc29"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/openclaw/config.ts\u0060 reports through \u0060console.*\u0060 at line 115 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/openclaw/config.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"92da18ac12afb91b3d367ede9294a9bd91da571ba18e2ea1716aed6fb6cc0d08"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/openclaw/config.ts\u0060 reports through \u0060console.*\u0060 at line 475 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/openclaw/config.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c6a780b0a1976066a6080a8c2fddb6729b127e573b2f3ce00e00892b2af729"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/notifications/config.ts\u0060 reports through \u0060console.*\u0060 at line 328 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/config.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b903dda6d4255a76c15035d6536bcf57d4b095887c6ac0a47a03e129885a8d6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/notifications/config.ts\u0060 reports through \u0060console.*\u0060 at line 822 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/config.ts"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"600849f09b8afd60c4cb98f6058085c9d27dcf71eb565b80ddd386fedb61293a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/notifications/reply-listener.ts\u0060 reports through \u0060console.*\u0060 at line 983 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/reply-listener.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c2dfe028537217ef362826e529975242b3f6f369701c6b79527c3b395dcb46"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/notifications/session-registry.ts\u0060 reports through \u0060console.*\u0060 at line 258 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/session-registry.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"727d962098e69a21b04f850a7524606b28bede32cd9f2e3ebb62db8fdc820f64"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/imagegen/continuation.ts\u0060 reports through \u0060console.*\u0060 at line 233 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/imagegen/continuation.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"328d04ce8b1987b4ae662656178c780ae51e3a21c11dd9445d92bba63c07386d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/imagegen/continuation.ts\u0060 reports through \u0060console.*\u0060 at line 249 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/imagegen/continuation.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cca9f0fabfce15b59eb2faee3733556c49df99341e162869db9035e3f496aa"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/imagegen/continuation.ts\u0060 reports through \u0060console.*\u0060 at line 259 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/imagegen/continuation.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"90612ffe33c4cf719b2b915e8722d15c4786577069e4a6cf2f97353560aaa96f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/hooks/keyword-detector.ts\u0060 reports through \u0060console.*\u0060 at line 4008 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":4008}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbd512ea28b7bfa5e38c4588452e9141a6c8b8bb4654a6a660ff0b1b51d9c7a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/hooks/keyword-detector.ts\u0060 reports through \u0060console.*\u0060 at line 4302 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":4302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e974eb4aa840880a3224d803d7cd066e05ef130debf4990b794421077e6deac"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/hooks/keyword-detector.ts\u0060 reports through \u0060console.*\u0060 at line 4362 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":4362}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a4538c1f19a180a561afd8920fd52d5f6d01d2950836fd3bf275def6a99c7b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/hooks/extensibility/dispatcher.ts\u0060 reports through \u0060console.*\u0060 at line 54 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/extensibility/dispatcher.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3663ed11d4574227c59f95ef3acd5962a4512830852f0c9dd0002afdb3e3380"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/hooks/extensibility/logging.ts\u0060 reports through \u0060console.*\u0060 at line 19 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/extensibility/logging.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85474c5aee778c33096e34cb97a55b2e55434991391cf311df112d6719890db"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/exec/followup.ts\u0060 reports through \u0060console.*\u0060 at line 418 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/exec/followup.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"48706e2c0a37d2aa323b4438fa3bd0717ce86e98d22dfdbf1042acfc42b0845d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/exec/followup.ts\u0060 reports through \u0060console.*\u0060 at line 424 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/exec/followup.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84afee10f3d157848cfd5dae1725990d200f27584a8743e60a48a264764dc51"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/config/deep-interview.ts\u0060 reports through \u0060console.*\u0060 at line 106 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/deep-interview.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8459d6fb86d0ff2262b605c1372a9da1be057762a8b674dff7e73c74298467e5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/config/generator.ts\u0060 reports through \u0060console.*\u0060 at line 4494 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":4494}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ea1ffde201c8e3877b3924f738a9b7f18e567bfb690b8a9bf6b88c8cf03e98"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/agents/native-config.ts\u0060 reports through \u0060console.*\u0060 at line 496 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/native-config.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"660c2ced1aa6b9cdabf261555d4749e1613a18fca7fbf88be72d3f0a824a3c08"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/agents/native-config.ts\u0060 reports through \u0060console.*\u0060 at line 501 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/native-config.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"929c65a6539ed2439f28d7abc4993b256f8c34b9ae84d7a9e64305fe544cd350"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/agents/native-config.ts\u0060 reports through \u0060console.*\u0060 at line 507 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/native-config.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb06710a71eecf25685e99abe12a0d2a132ad4f204d5e9e1fe8cc0ff12f1c719"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/agents/native-config.ts\u0060 reports through \u0060console.*\u0060 at line 517 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/native-config.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd075ae5f24057555be8505fff3f39ddb5f3ee736ecdc63300530464dfcd9f8"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060loadOmxCore\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":"packages/vscode-extension/src/core.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bead08a10b758a4d53ddd76084d8d4ed31eb28b608752a908b6094cfcc14fcce"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060sqliteHasTable\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/adapt/hermes.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48677d3b562f48fa8c9635d6a15ccbecdab3cab76e86d11143f574fe1b895f7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectHermesEvidence\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/adapt/hermes.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"8068aeaeba60fcb1900a28cbecbe8bb85a9dc2891275f714e3307e25163c126e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectHermesEvidence\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/adapt/hermes.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"40021ae8423bfa1b28d01c5ed316e44fb63a3c796661981c82175c776e223d97"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectHermesEvidence\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/adapt/hermes.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd401f7d12ff0e5c8faf03c8bb982c90954d708d14e913ecc87f41554f11f030"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectHermesEvidence\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/adapt/hermes.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf78dce8a0808a1fc56b83ceb280563252162f7269e1a0f0b22d947815280bd0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060initAdaptFoundationForTarget\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/adapt/index.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bca9f1af8834330f73aded3789f0c33df1e0a19f5363cf2ccc49902d07293f5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060initAdaptFoundationForTarget\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/adapt/index.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e903d1dd8a45cb83f8b1120f754f859269ef040b3c6b74099edfbd014a02c5a8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installNativeAgentConfigs\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/agents/native-config.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33e46036b9334f05a0d2675ce9ec7225f32e38cafe9c868e368cce154de1250"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installNativeAgentConfigs\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/agents/native-config.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"395205a7b96dafc06a5cd664c0968bdaa782ee2299915238477b7898dd74e27d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readAuthConfig\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/auth/config.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae59a4d5eea1845d10775f2a4b09726db24dd8724439e04f3fda294477e1b45"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectRollouts\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/auth/sessions.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bb3bb699a2ba93414b0f334ff7b468b2abc209efaaa51d2f256ae3a5fa0f7d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readAuthMetadata\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/auth/storage.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b14e55597352162a160a7c424bce636b4cb5c8db0f8d20608a743dd9dc76e76"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to slots.filter\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/storage.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"57257a1f3aa04b7e041bb38ceefc5f045668da82d1fd371ef82682245b1ae191"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060loadAutoresearchMissionContract\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/autoresearch/contracts.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ecbc159b6236db0d7f9ee40a4e27686fc4f3ecb428062035afa60700e1cad1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060loadAutoresearchMissionContract\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/autoresearch/contracts.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cae85d49d70f73fb5e15f119d7369e1dab4a7dfaf92f9558feda7ab73548de"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060loadAutoresearchMissionContract\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/autoresearch/contracts.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ca71f4a0e57260e645f5860f6958c4c3825cfa379c7d3e5fece55692bfe10e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060createAutoresearchGoal\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/autoresearch/goal.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"93db1753b7df93cdbe5ce009b4fbe5acc8db92cde5368ba6ea9fbbab5ea3f75f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readAutoresearchGoalCompletion\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/autoresearch/goal.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"728a602a35c4158a1139b57db5c314c1e2b42bdeffc4d879e7cfaf05e9730da6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060writeGitInfoExclude\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/autoresearch/runtime.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1575c7dc40a6424fb0f3ff966b300d2db2dae4de2f60106209b845f68edbe597"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureAutoresearchWorktreeDependencies\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/autoresearch/runtime.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f9d110efc3062102dbda971d3eee93417638e8332d0efd37f265247372317c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readActiveRunState\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/autoresearch/runtime.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a0f8d4acaf0e4374deba8f946691966d485f847fc3bac04ab51f7bfdc32431"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060initializeAutoresearchResultsFile\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/autoresearch/runtime.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40911014b0a7cbdf9432c8d03191fbf52f2373ccdbb9165b4abc3130895df2f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060appendAutoresearchResultsRow\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/autoresearch/runtime.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff4867032a6334605cf147bbfaee028e6805aac0ebe94ac8f94c924de48b4a3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060appendAutoresearchLedgerEntry\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/autoresearch/runtime.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd6e61acaedaf99d93ef1e2ada5a227074dcc674f44f3f0e0b4cb1d3e03d7e5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readAutoresearchLedgerEntries\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/autoresearch/runtime.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dedea78d69ee79a67e1dd2b2492baeb5f23f7e2afb77a60f2c3ffec1b075c0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060runAutoresearchEvaluator\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/autoresearch/runtime.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de5e11a11971df2bdde37bbe404a1d7bece15d7a00aba3a617990fe5accedfa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060materializeAutoresearchMissionToWorktree\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/autoresearch/runtime.ts"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"a524f3d70a8367ecc4f684666c9aaf704e3074db52613b8899e9199b1c77f514"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060materializeAutoresearchMissionToWorktree\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/autoresearch/runtime.ts"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"034a6bdae4bc37d8dce7ea2b4c4f33446b295a610c3bf423a1ac336f5c79affb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060loadAutoresearchRunManifest\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/autoresearch/runtime.ts"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f78389c6b5ac23c7ec074be2961587b3dc2ffdcdb98341aab36706f151b6ec"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resumeAutoresearchRuntime\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/autoresearch/runtime.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd341809371c1de49560505bc425e99749b55889949d742c7f8959bc4dd2a07"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readCandidateArtifact\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/autoresearch/runtime.ts"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26bf5f74e25c2f402c99113d360069eb7ef0e8f6b263433a65eb5831dba0fc0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060assessAutoresearchCompletionState\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/autoresearch/skill-validation.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"24baed4dba4ad7637a35c105d5c72d4fded1a4e7b76dcf6662c390ae77ba2386"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectExternalMcpServers\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/capabilities/lockfile.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c46a69cc986f8914de2dcfa069071a404f294fd17db96c7d48800819f3d6bc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060compareDirectoryMirror\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/catalog/skill-mirror.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cf3e2b91faa209017da4299e6028ba63def8381db232409a9f5d16a7107c8e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060compareSkillMirror\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/catalog/skill-mirror.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb951b6e4a93da8f502770a5ac3916a2e57dc9899e4e4f8ae715d772c1ffb349"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureBackup\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/cli/agents-init.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cae9de02bbb597e505803b88b665bd3b658ec60d215b95fa3ae5cca39082253"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060syncManagedAgentsFile\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/cli/agents-init.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e225dc3287ee5924841a9464ad6c59887e6d510f8313bac2968b253c5a6f9e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060agentsInit\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/cli/agents-init.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd5d6a016f962f4643b143bf260dac39c02221675edf24ca58b2cb0dae950e4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060agentsInit\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/cli/agents-init.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fedf771c1e444f4db251a78c68960c6f47ae54c6583ea3df9ff4b2d84552e64"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readScopeAgents\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/cli/agents.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a2de632bd82e50f2c747551853a3a4bcaf0bcffbd60744d6b3176e101efcfd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060addNativeAgent\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/cli/agents.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ff4353807f166374ad5e35e8e7ac23b5300bb56c04eeb44fe45b9f9b7d71ed"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060editNativeAgent\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/cli/agents.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aaae82b734f8986b8b96954a70ed033c27fa1e2b5fd76326c7fbc005d4cea0b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolveAgentPromptContent\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/cli/ask.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15fc5092d4a8568764c1e8da313af37d342cdaacb04b0a98bb81b717aedfda6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolveAgentPromptContent\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/cli/ask.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecb9c7147eb01cfafbdcfdbdabdef6f3f259b885d0c923437d71010f1d28843"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060askCommand\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/cli/ask.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"721d8745026a0e9910a9c2813f01bdbba7e04c52fb9463804331b8cdc46971a8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060askCommand\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/cli/ask.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"02544eaaf6444974a10bce47abf7801901e9fef03f992d17fd4aa7722ea14d69"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060listAutoresearchDeepInterviewDraftPaths\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/cli/autoresearch-intake.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f52396b4e10af95f8f04ac527935c0047bfb7ff09a96607f9cac43c54243204"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060listAutoresearchDeepInterviewResultPaths\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/cli/autoresearch-intake.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59082344a3319677ee7392ba7f9d4070ec16d5689c15457db01146244f83421"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to filter\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/autoresearch-intake.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afadfed9e3ddbcca76c0055c09a7e6b49a73e2386a5c4b883cca315717c7ed9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolveAutoresearchDeepInterviewResult\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/cli/autoresearch-intake.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"0394bd75d5aa596f04e4852ad15181bcba3efd9ba782c325b4ba4dfe74f98608"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolveAutoresearchDeepInterviewResult\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/cli/autoresearch-intake.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ceabedddddb051620efe63209125569777de4798e193b7a7146021e12d5bc2c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060inferPluginInstallModeFromConfigForScope\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/cli/doctor.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0396b4acb22f69a64306cfd19a0bfb5cb069ce0623262b61ac58b4b097a1baf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collisionSafeArchivePath\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/cli/doctor.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cfc831e6cb0a0920fcb98e08313068eacfa645da9e8a34ac47842486206761"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collisionSafeArchivePath\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/cli/doctor.ts"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"34215d3cab31ff84795e7311c97d41a00c6a6f1b6b10edc3f7236c7a839cecee"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectTeamDoctorIssues\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/cli/doctor.ts"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eca0f0a89576a803601d7672643611d96e2033bb55f4a699e339a332288521a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectTeamDoctorIssues\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/cli/doctor.ts"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1af76c3268c28d4db42690645ae0cddf23f782ca63935404dc8f1955e7ea24"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectTeamDoctorIssues\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/cli/doctor.ts"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"1486a4b342214ec0901f8e232bb2763946682ad4efe1d0cb4fc8b8c100045542"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectTeamDoctorIssues\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/cli/doctor.ts"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"66210859f59a7edd46deb8e4bd40d0c10cf12c7bba4f77624bf75616c29da880"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectTeamDoctorIssues\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/cli/doctor.ts"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad3261e03fd6df197f7de686b11c6ddcdf009d24e5890e5897010f0954bbdad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectTeamDoctorIssues\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/cli/doctor.ts"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"76aa885de25f0592e3109b5324c27c7a888b5012b486f8703c17baebe2656978"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectTeamDoctorIssues\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/cli/doctor.ts"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b168d45afe02ff856a789e177820a866f45c6cec881073df149e6ba8b245a91"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectTeamDoctorIssues\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/cli/doctor.ts"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f51a7e92c6a62ccd02972599aea5891c4d0147f5823bf762d7885e6e7d5f80"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectTeamDoctorIssues\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/cli/doctor.ts"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24f39f20f2a62be1b0a9d00a24a6caabff9dc7079d178fb48dc24b888808a50"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectRepoArtifactOwnershipIssues\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/cli/doctor.ts"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe7a72b945810e079490226d80d31c3e083376792f689bc031bb770cfcca1c3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkLegacyMultiAgentCompatibility\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/cli/doctor.ts"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b05593da656f37cd20bf73cee87e4e213db28b6c1281e789014cd8a06aa4a40"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkConfig\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/cli/doctor.ts"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c5c254fdd1ce405d58ce007eccf0d5c2cfb1842388ed988340a5d72f2dd7d7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkSeededContextDefaults\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/cli/doctor.ts"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce0a8ab2034b79a74da76341cd84668bc10d8c103088ac3ae437e14066b7e4c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolveExploreRoutingState\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/cli/doctor.ts"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdeafd64a660c7d9f810175ab888cc8362a16efd6ec848b1d0555a865f5c561f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkLoreCommitGuard\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/cli/doctor.ts"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab8cb5570cca62291a338f6130f222930c14475721492fe3bdedfc1bdc02676"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkExternalCodexProcessGuards\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/cli/doctor.ts"},"region":{"startLine":2204}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a0cf41b0a0f49bce3b086b9c8a59ea3a907d468d060d9c5a8feb7fafc2828e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkExternalCodexProcessGuards\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/cli/doctor.ts"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a4b7a90256b7aa07d03f2a5641b9abf762dbe3e56bdbad3d0cffdf9801e975"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkPluginScopedNativeHooks\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/cli/doctor.ts"},"region":{"startLine":2601}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b7f95432a905055d7518c537c771b4efe8fc5d702b6b180b61f16053ab81ad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkPluginScopedNativeHooks\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/cli/doctor.ts"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19e1214c1c35f1059ff1ad66afa25a08c125d0aa76be6595b354889756d315c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkPluginScopedNativeHooks\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/cli/doctor.ts"},"region":{"startLine":2661}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec914e337ab9e489012b355f6690ddb251497326b157eb3fe5962b1caebfd66"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060checkPluginScopedNativeHooks\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/cli/doctor.ts"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a35f304b99da83d282109f5e3a7402be2d6f6e672383bb02b0d53a70f78a74a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkExistingNativeHooks\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/cli/doctor.ts"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"482cb6376abe7b02388a673ffcf77538cf153a5093dd080dbbabced1d975f4d4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkNativeHooks\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/cli/doctor.ts"},"region":{"startLine":2970}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f76336846acffa1648271a8074ee6e5511536b8eee89ce72c293d96ce79ec8f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkNativeHooks\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/cli/doctor.ts"},"region":{"startLine":2974}}}],"partialFingerprints":{"codehealthFindingId/v1":"1708c26d8201a14e8eedc306df2aa90acaba0ffbe4b95774ec223c6984967f42"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkNativeHooks\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/cli/doctor.ts"},"region":{"startLine":2988}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cd12bac6db057ec16ecd5c6cb91d6aafbcff91b41d62330e3bc5bdddad5083"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkNativeHooks\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/cli/doctor.ts"},"region":{"startLine":2989}}}],"partialFingerprints":{"codehealthFindingId/v1":"657bfe23827f60a890eec76d72caf8a98aca1615a4fccbdb7119f32a21993aa1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkNativeHookDistSmoke\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/cli/doctor.ts"},"region":{"startLine":3033}}}],"partialFingerprints":{"codehealthFindingId/v1":"634417907f130b23f5532fdadfd02816b2634bb1087e584652afdea4df8ea7ce"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkNativePostCompactHookRuntime\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/cli/doctor.ts"},"region":{"startLine":3302}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b5f37877b00c88d1ff0554863ec5fb4612e561bfc3f5f908e465647f84fffc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkNativeHookRuntimeMirrors\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/cli/doctor.ts"},"region":{"startLine":3494}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5b3962684784a045d0930eace7a576fdc07e73fd175ad41d140e5e93e199cc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkPrompts\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/cli/doctor.ts"},"region":{"startLine":3524}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe0ef8d3135f683d391785bd0ef7b2a41e83a85d26cc6d40415e4f90fec7747"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkPluginMarketplaceRegistration\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/cli/doctor.ts"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec252b4ab392e6ce3501397eb98884213fd27e85f6fdefc0f33d43af40643c7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkPluginMarketplaceRegistration\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/cli/doctor.ts"},"region":{"startLine":3698}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d64f95f73e577dfa45c140eea43d3fdff959bb8d40e800cf3a35cbc186b40a0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkPluginVersionDiagnostics\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/cli/doctor.ts"},"region":{"startLine":3824}}}],"partialFingerprints":{"codehealthFindingId/v1":"139009a3e70e7620b33b15c4bdf361f087a06ca66329d67f22ffe76d894b8095"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkSkills\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/cli/doctor.ts"},"region":{"startLine":4155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0374304ea4534fea59a96770a1a42e7222bd143c6fbcaabb698c36361d1d9b1d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkMcpServers\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/cli/doctor.ts"},"region":{"startLine":4399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bef7e330835443789ef76b2a8454205dfa2274f48737702e4df81a6a31eca1a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060initHooks\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/cli/hooks.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8639c7e986f604ac0a9251bb6c1aea5152f94e97934bc9cadb45f8a0249ce42e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060testHooks\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/cli/hooks.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8da19c007b23d35fc03a0ddb429ac50c3b46c5ceec4d7941b4ea660b3804fa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060persistProjectLaunchRuntimeHistoryArtifacts\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/cli/index.ts"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a648b266facfb30121239c022a55604f87705d74e2f8790ee36c37f5cd0be0f4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureProjectLaunchRuntimeHistoryLinks\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/cli/index.ts"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb13f9249c720e0bd43df94d939d99505e6302440f038efebca19e64ea72611"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureProjectLaunchRuntimeHistoryLinks\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/cli/index.ts"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb681cc5f4ce983b0b8a611977b026613cdfb4d2c19c163d85813f52948315a9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060persistProjectLaunchRuntimeAuthState\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/cli/index.ts"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"078e235768c3757bdf9aac37c6dcddc24cd8616c71e54d288503a1031f83d3af"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060prepareRuntimeCodexHomeForProjectLaunch\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/cli/index.ts"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"33714fc4c4aaca878103d2089a9fb37ec3b9b07e51e4e767995542ad3df9c92f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060preflightResumeOmxPluginState\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/cli/index.ts"},"region":{"startLine":2370}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a8b630fd2f50cbb5f0a194134d9bdedfa2a0da1d6c82f7da190739a37fe427"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060persistProjectLaunchRuntimeProjectTrustState\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/cli/index.ts"},"region":{"startLine":2503}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2775ba066501a24215a751521921fb617df52ab06fc9f8e74910d06eb2f956"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060persistProjectLaunchRuntimeProjectTrustState\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/cli/index.ts"},"region":{"startLine":2506}}}],"partialFingerprints":{"codehealthFindingId/v1":"8716f35477d1416492c7cfd8535314fd4d7e1fca9bbf4cb89b38d7000f7e76b9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readConfig\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/cli/index.ts"},"region":{"startLine":3607}}}],"partialFingerprints":{"codehealthFindingId/v1":"875bbe2c8b339df173acaeb34ae5e2433ded1a42f7fab131d85d80f221f47fdc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060reasoningCommand\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/cli/index.ts"},"region":{"startLine":5507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53ecabade2954fe6e831309039d7ddf0fb288874caba61608d0f0fb05060480"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060reasoningCommand\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/cli/index.ts"},"region":{"startLine":5545}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c8a6fd5c5bac6da065c513c7b5984d59fd7d287332daf233b2f9dcc96a983d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readLaunchAppendInstructions\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/cli/index.ts"},"region":{"startLine":7365}}}],"partialFingerprints":{"codehealthFindingId/v1":"954dc2a6ecb54688e97a880a942fcbc2f0d0a8b14cd41b438d5694ad82176df2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060publishActiveRecord\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/cli/index.ts"},"region":{"startLine":8571}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ee2c31bd69e45c3019f1b82b4c46d390411ab336a5f383de7c2c56b7e465ce"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060removeReleaseMarkers\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/cli/index.ts"},"region":{"startLine":8631}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adfbc06b4bf2ae6bac71d96bdda1f47f5df4461c4cebb8f4cc8fafe736a5795"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060removeReleaseMarkers\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/cli/index.ts"},"region":{"startLine":8632}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c3638272971ceac54294759e3d125953800b53fe220e96ab1dd564eaf17cd4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060removeReleaseMarkers\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/cli/index.ts"},"region":{"startLine":8633}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4c693b0ec82efab818114e677df869923dff964eca2ab1acfed7f58a71ba78"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060runDetachedSessionLeader\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/cli/index.ts"},"region":{"startLine":9128}}}],"partialFingerprints":{"codehealthFindingId/v1":"81276eb3911f02f6b1c4ae22e4b11768cb0c379724754c11a459de9343cadd00"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060runDetachedSessionLeader\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/cli/index.ts"},"region":{"startLine":9129}}}],"partialFingerprints":{"codehealthFindingId/v1":"613f56289eb5c1abf7ed2dd7c8b0270b7e88c54598219c5116c49f59838ee192"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060signalChildTree\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/cli/index.ts"},"region":{"startLine":9140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f44ba0ac57066b2ab87f57370640bdde73ab4ada4dda7470587aade8bf5c17d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to postLaunch\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/cli/index.ts"},"region":{"startLine":9199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a59ebf26868af8dad21cb2cfb8a85de32945a052775a787f2fed18da48c2e68"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060callback to postLaunch\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/cli/index.ts"},"region":{"startLine":9201}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf9dd129ccccd60f506a16b17dd1f13ff44995c042e4b9fd7af96a1de824357"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060runDetachedSessionLeader\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/cli/index.ts"},"region":{"startLine":9228}}}],"partialFingerprints":{"codehealthFindingId/v1":"098243beda933130145bdbf1677ca951ddecfb2543c54d11cf3b3714a1e0ae95"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060runDetachedSessionLeader\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/cli/index.ts"},"region":{"startLine":9230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c587fd03cf9cae677d6192668bba135fb8c037cffcfeb089819d37fe38c6c9f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060launchBackgroundHelper\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/cli/index.ts"},"region":{"startLine":9552}}}],"partialFingerprints":{"codehealthFindingId/v1":"610d02c9a5065addf61a3bcdc78a42afd2df5f4ffd43b11eba66daac99b44858"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060startNotifyFallbackWatcher\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/cli/index.ts"},"region":{"startLine":9771}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa64292bc3da89f2e64cb501700f509e927ae04e4e4ca5d7f5dd486eb2d22fb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060startHookDerivedWatcher\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/cli/index.ts"},"region":{"startLine":9850}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7895fc3064bec1a93f3e38ba40bb18e4bd1f94f5048acd85705ed37804666c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060startHookDerivedWatcher\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/cli/index.ts"},"region":{"startLine":9852}}}],"partialFingerprints":{"codehealthFindingId/v1":"b971a46f12f762059b9b293acc68ff05a319647bb7e874d0b3954c6b3e85fbd9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060stopNotifyFallbackWatcher\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/cli/index.ts"},"region":{"startLine":9916}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d357c5a07a47654094bb683d2592b329aca32d6d8a554416f556fc6c1226804"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060stopHookDerivedWatcher\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/cli/index.ts"},"region":{"startLine":9949}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bea222104fa1b69a56a2b49b8804ed105a5765400c328dbd7d6c44fbccd97f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060flushNotifyFallbackOnce\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/cli/index.ts"},"region":{"startLine":9985}}}],"partialFingerprints":{"codehealthFindingId/v1":"80610a4a161a1d36c4543f7ad1aa5bbf9e540f645a04c020ba23c347e43b3d1f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060flushNotifyFallbackOnce\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/cli/index.ts"},"region":{"startLine":9986}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38eba7def5efe3b96e08ba25d3a4b8a3d5b7f2bc9c06d96aa21fe64cee443f5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060flushHookDerivedWatcherOnce\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/cli/index.ts"},"region":{"startLine":10008}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08082765ea0c7084d4161d519cb6c37ce551103bbd97459a07781edf6c1524e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060flushHookDerivedWatcherOnce\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/cli/index.ts"},"region":{"startLine":10009}}}],"partialFingerprints":{"codehealthFindingId/v1":"896b4111e3c892ded1e13af675e53adbee610552c7a09a6533aa6300aff914f9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060selectAuthorizedHookVisibleRunDirState\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/cli/index.ts"},"region":{"startLine":10223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b7f2bf8cd05ef0e7cc4ed007b65b326d9a6768fe386f9237a1382f1679ae3b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060selectAuthorizedHookVisibleRunDirState\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/cli/index.ts"},"region":{"startLine":10243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a222350b6806af37500abe537f71cee9291e8a46ab0169cf108d2d271a59b7e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060lstatSync\u0060 in \u0060loadStates\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/cli/index.ts"},"region":{"startLine":10550}}}],"partialFingerprints":{"codehealthFindingId/v1":"c545298c9356012d7e9503c330ef4fae742f0bdac9b2b3689058b516fc53d269"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060loadStates\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/cli/index.ts"},"region":{"startLine":10554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7887a85c231a28f66e8ccb76cf0742b4f8019c494df7673c2d16d1d909da3a0c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060loadStates\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/cli/index.ts"},"region":{"startLine":10555}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf47ed5deb0e8e7bdd067ec99cc8b0b2f8de6223c054fd7ff177d019155d0f3d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolveUserCredentialSource\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/cli/launch-credential-provenance.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2738dce80fcd7ff9f88f1db53485c424147e21b341356a632ebe2c023602e05c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060seedCredentialIntoRuntimeHome\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/cli/launch-credential-provenance.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53e46011a1b52410d52254b0c86b7d997b515586dc01b216969f69700cabfbd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84c42e0adbba5f008c1dc76c97d9a3c01ec2624a3f823a206250b939c4c1686"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eab1cfcd50024340c39800f1c899e129f8284e7c104928d70ec8db90efc4cee"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"687d03f5ad88ac108bc4411dc80ff003b29f96065c2a305fce29067e9ba9add5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3fc4ba3d4769670f59ce3ef3de10322efc6717e4d9d68b7ead45dac8169b07"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66bbee8a8dcc487885af45ba50c95b77981b70cf8da7a8031f742024fddee1c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"764c9f8683483d77e781502678833e9358c0e95103e3b8e3e2498820a956b3bf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4fc3885541ad12fe88c355e034e138ec3e94f86bddedd3ec2d2e35732fefaa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bec874fe1d4bd5d314174091e4feba672d8bcb40d6c882a801d5aa8497fecb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f970d1728a13698ca47a730dbb856d4b11dc48553fea3f8bfad824def76a8456"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd59eeace1c36d2080dfd818e4296ef88e71895baaadfa2858a33fb1705ea064"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc95335e74f66501ea410a11424240b159937c6b0d7020a93a079889003ac91"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060lstatSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f41c63f6adfbd1cc221089ff2ddecaa6700fa43b712a8976967ea161b8e4df1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"63395fa2cd9a8d628a2965a54d09415dd34b7d5e20a70a21f087a2f21c2ae865"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"394ad348404389b6dd89ace10f6bfd85dc77e97aee3cf301cc5cb2ad0f0b331e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060lstatSync\u0060 in \u0060validatePackageManagerOwnership\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/cli/package-manager-ownership.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc44d5925bba0083d0ffdb5f2dc5f53a09a4325f18a5f78b0a90dccec5835fa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060realpath\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/cli/package-manager-ownership.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9baa35e8d95705e2611b731e3a3cb412990a1e2adf0654d7528d63b62e36d65d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolvePackagedOmxMarketplace\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/cli/plugin-marketplace.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f33199460c17e73e11a928d6f945d970aa5643916be19e94e9417206d386ff6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolvePackagedOmxMarketplace\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/cli/plugin-marketplace.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6033906447c4eede7b178f34686dd6898a54fb31424d9bc98d8ee8f92ab3ce3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060getPinnedLauncherIncompatibilityReason\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/cli/plugin-marketplace.ts"},"region":{"startLine":3637}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b7a53d1d611a886fde77df2d21d706d77814c49124edec73d306b2acf773d1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060getPinnedLauncherIncompatibilityReason\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/cli/plugin-marketplace.ts"},"region":{"startLine":3651}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5a29db6284e12b3c9090556e7f33ed30cefc74d03c43bd3e0568ce81de7399"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060discoverLocalProjectRuntimeCodexHomes\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/cli/project-runtime-codex-homes.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1beda67ea0ec24d32c5c79675b1f084f48c6feb4977b2fab08b1ecaf8ec73c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060discoverLocalProjectRuntimeCodexHomes\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/cli/project-runtime-codex-homes.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bbd5c81b578e67eda05c3725e8b460e4c38545011acc6c57dfcbc81b2b0680"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060discoverAssociatedMadmaxRuntimeCodexHomes\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/cli/project-runtime-codex-homes.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e7efa66ceece1f45b7c51e74c06bf205b032c4a3b6510028c2e737433ca569"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060discoverAssociatedMadmaxRuntimeCodexHomes\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/cli/project-runtime-codex-homes.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f866a0a29a7ece26a75eef48292a84159299607c068463531db427d1757b33"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060addMetadata\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/cli/project-runtime-codex-homes.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c4c6b74bd8c88f5b160651740bb8c41c89b676cd1780959cb8ca1238b6e955"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readPersistedSetupPreferences\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/cli/setup-preferences.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c39c6220a5ceace801a47333710231c6c50d9e195717ca4343ba8713948a92"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolveStatusLinePresetForSetup\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/cli/setup.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f6c93767e1066bbd1723146e2c8e24d48fd803cabe0e245ce45e32bac3cb56"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureBackup\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/cli/setup.ts"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba32c0067af5e0dd9e1ba46447b8b9003600560a7dc06294fe8c2bb5d01d61d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060moveExistingAgentsToDeterministicBackup\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/cli/setup.ts"},"region":{"startLine":2524}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dab7605c1d6f882fa9a0b017dccda24c0ac318c276b9a26ca0c10a95d8703e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060moveExistingAgentsToDeterministicBackup\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/cli/setup.ts"},"region":{"startLine":2530}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef92b5c8d0eafd2005956b44e506b73250e0b0398c6935b13a6d893ec285793"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060filesDiffer\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/cli/setup.ts"},"region":{"startLine":2544}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d60ec12a434a1e55f496df46c3319951bf6f39d128852c8c4822b6e46161e91"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060isOmxManagedInstalledSkillDir\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/cli/setup.ts"},"region":{"startLine":2825}}}],"partialFingerprints":{"codehealthFindingId/v1":"545beb93af034a92a3064e3ee177a6b8b47f7f08a3a1d21788d782105734f714"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060promptForPluginAgentsMdDefault\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/cli/setup.ts"},"region":{"startLine":3130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6a7963c0a10658a19b62c624dae72840260b9aa388555ada96970c73c53495"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureProjectGitignore\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/cli/setup.ts"},"region":{"startLine":3480}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8fea68e2dc0401d09756a633ed22df42931c3c4a3d74d5b9ff7949aa113a97"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060removeEmptyDirectoryIfPresent\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/cli/setup.ts"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0496399ee226cad2671283405c8b376245c5c4190b1cd00c7954236a2fdea06"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060cleanupPluginModeLegacyPrompts\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/cli/setup.ts"},"region":{"startLine":3563}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57126f379fefc1e1ea61f45ce600b9b9403fe4e1cec7a0b85c0d56e646c9f24"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060cleanupPluginModeLegacyPrompts\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/cli/setup.ts"},"region":{"startLine":3573}}}],"partialFingerprints":{"codehealthFindingId/v1":"83adc60aa26082dd16381edde7475463c84c2efdd1148e94b07b14dbe4bb56bd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060setup\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/cli/setup.ts"},"region":{"startLine":5052}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a5e1cc2dcdc7372e424b44d5dcccb089ff3b37e1d557f1a2a70584ed26e38a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060setup\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/cli/setup.ts"},"region":{"startLine":5053}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f4ed99f4c8984387a21e2695fdb5ac0f4d8556f728bf8d10d6d469744898d6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060setup\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/cli/setup.ts"},"region":{"startLine":5248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c26b41004da108ef440c62820d2f37f5f9b83c68e3397bbf54000241d5f8bb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060setup\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/cli/setup.ts"},"region":{"startLine":5394}}}],"partialFingerprints":{"codehealthFindingId/v1":"598d54958b201e0fdcbb80aeaf9096be42ec8f969ee2f5645e79d20edee1c3fc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060setup\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/cli/setup.ts"},"region":{"startLine":5397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada166ecd72e4596d7b9ca1164e74bbd3633ae6d63b69d9942aa8d2d3112c313"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060setup\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/cli/setup.ts"},"region":{"startLine":5574}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a76a46329d51c419df286b31a612341b4ff4708efc27fb95e2be60b3a8e0d10"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060cleanupLegacySkillPromptShims\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/cli/setup.ts"},"region":{"startLine":5683}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e430a397a26e916f66423991ec79302f56df438836ce552249a46153459012c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060syncManagedFileFromDisk\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/cli/setup.ts"},"region":{"startLine":5740}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03674186ecf50fbded03b026740830be1690cbeba992e52edfb7441785e1952"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060syncManagedContent\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/cli/setup.ts"},"region":{"startLine":5775}}}],"partialFingerprints":{"codehealthFindingId/v1":"978dde6f45143c477cbb29c999566ecd0c27d98e5ea6e630aeb58e8d6c7e2b2d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readNativeAgentInstallManifest\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/cli/setup.ts"},"region":{"startLine":5826}}}],"partialFingerprints":{"codehealthFindingId/v1":"aced4024f5eb00eaba18fb2d6c9b2d4be09bb130f1545294ad037f1f3643a41e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060syncNativeAgentToml\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/cli/setup.ts"},"region":{"startLine":5890}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de2aab297a484b8137b351f1a91a9cf1dc39c8fab30500b85329cb893a5c3a7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060syncManagedAgentsContent\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/cli/setup.ts"},"region":{"startLine":5958}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa52ac499b42af218f21e3d0f82eb8fbcc59d96bd3d2c94654add789a532e1d2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installPrompts\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/cli/setup.ts"},"region":{"startLine":6032}}}],"partialFingerprints":{"codehealthFindingId/v1":"0976a9f0aa64b80d0d8928b4c13ef8df0d4c7918d6f7cb4a8555bb604dcf07f0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installPrompts\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/cli/setup.ts"},"region":{"startLine":6076}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae749b8c852d2efb86acf0c1d6726f8d709cfd2ccc310a0813d49f2eb928d7d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installPrompts\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/cli/setup.ts"},"region":{"startLine":6087}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5d7147bf886278be6d6a85291836b706c28616a80100b0332d09baa3800a71"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060cleanupGeneratedNonInstallableNativeAgents\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/cli/setup.ts"},"region":{"startLine":6125}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f80f8c9a41c35b2de9d5d9e675de7a860871b70887c1c2ee1b6c4cd16ca409"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060refreshNativeAgentConfigs\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/cli/setup.ts"},"region":{"startLine":6225}}}],"partialFingerprints":{"codehealthFindingId/v1":"299ad7351077911dc009eea6998dc7486af35cf2690274178d142407662c13f5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060refreshNativeAgentConfigs\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/cli/setup.ts"},"region":{"startLine":6262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0827ebfba381d3ac28f83cde97e107d9e92fc4edfda397117d4a7c8a67d1325"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060refreshNativeAgentConfigs\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/cli/setup.ts"},"region":{"startLine":6278}}}],"partialFingerprints":{"codehealthFindingId/v1":"de18003652151d7e1a91484bb93f5ea2afb261b8082f546af3e561a0a3f9a678"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060cleanupObsoleteNativeAgents\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/cli/setup.ts"},"region":{"startLine":6314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0505f9257f75babf7678d54c0b92c41dfa8103f345ae7ecd0a2242c75d596a8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installSkills\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/cli/setup.ts"},"region":{"startLine":6370}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa24bf73bdb0efeec57ae368e0c514d023444d26a23c84624010d7e5eaaf2555"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installSkills\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/cli/setup.ts"},"region":{"startLine":6396}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a89c43f0835e35216ad44c37ed5819fe0905120654f72b30bb2a8ea94538ec4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installSkills\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/cli/setup.ts"},"region":{"startLine":6424}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c939cc1ef77cc8094abc7973cf1037287745b8c7f4b1defa3c0d9845cd7934"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installSkills\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/cli/setup.ts"},"region":{"startLine":6491}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d945576e0d83c7318d7fa5052864b669d78fa0be69b4de5e454d269ffc693de"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installSkills\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/cli/setup.ts"},"region":{"startLine":6498}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bbd84be42f9330e9de89495d7ccb7d2781c379a598a76dfa0fe47b21dacd84"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060removeDirectoryCopyAware\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/cli/setup.ts"},"region":{"startLine":6547}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0ff704777f0d0f53bd031bf796708fd0fffed9586dafc91bae61f0e8796f37"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060cleanupLegacyManagedSkills\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/cli/setup.ts"},"region":{"startLine":6585}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce064177f4c594db6d35d41774876704238627c5958e8eeb8e7cbe16ca6a6787"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060cleanupLegacyManagedSkills\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/cli/setup.ts"},"region":{"startLine":6597}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afed44c6b0d67184aa1c6727650f336d901b8ca351f47a35e3b1e64ed621fa8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060syncClaudeCodeMcpSettings\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/cli/setup.ts"},"region":{"startLine":6898}}}],"partialFingerprints":{"codehealthFindingId/v1":"2346ac7fb01b30a0a63893f709f3cad3023ade15e1ba92d6a215b3faf52c9480"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060setupNotifyHook\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/cli/setup.ts"},"region":{"startLine":6938}}}],"partialFingerprints":{"codehealthFindingId/v1":"821805ac5c9d8b3fa9dc7d0e206957b90c47aaf5905eaf85dfbc47f54022b1e8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060verifyTeamCliApiInterop\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/cli/setup.ts"},"region":{"startLine":6951}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61e7ae69b4ef3d6b053cb397de0cf0d3b5f1cd7752c1c191e49ef7a5c5f19f1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060hasBeenPrompted\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/cli/star-prompt.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f92342914ac39e1d2c05b7ddb995d66b239206260ce3215b50350e05e40e652"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060persistTeamShutdownModeState\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/cli/team.ts"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"5579d69c66bd119779a1c48d19e2e46bb46f690a1bd33f16ba88bdb0040af403"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060persistTeamShutdownModeState\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/cli/team.ts"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f12bde4a9b780b76fd61a1d10b61b387c2ce355e18c8adf45c396392aec413"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060persistTeamShutdownModeState\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/cli/team.ts"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14cd858664f7fb699be90e09a7128864bdbc1d8cf9f546e72cd1fb62d674c3a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060persistTeamShutdownModeState\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/cli/team.ts"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"499a03349b114947c852962f58f8192031d134125cc08eb5e3612103e11d122f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readValidatedConfig\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/cli/tmux-hook.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82cead547956246bb6b20e6fef824c9e57c9a7be8f8b622ccdad49a3a6a8fad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060loadConfigForCommand\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/cli/tmux-hook.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"640695ad772540cea6928423cda442c6f9880c0d2d06b74d72fb55ccbdf6022b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060initTmuxHookConfig\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/cli/tmux-hook.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf276b7b1c4a25bcc03216169c8fed27cf931327a639d36cdf9d4451ca1a042"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060showTmuxHookStatus\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/cli/tmux-hook.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafceca90c3872b6f547d1335006bec828b9bd5a7ba740a17b580cb6142fd621"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060showTmuxHookStatus\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/cli/tmux-hook.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a917cb1852c38817c694648936372faceada4f27f384fb2a4dca4c45711c86"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060showTmuxHookStatus\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/cli/tmux-hook.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5580587b637672c24e4600b4e7800440cae4f1147021f6c63351ad694d6a85d4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060showTmuxHookStatus\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/cli/tmux-hook.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"36481f1b56ffd7679403aa7469468e611975367f1521a9a7a51aaeb8dbca9e03"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060showTmuxHookStatus\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/cli/tmux-hook.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc57f3e3a11c344c8e2e0bb187310038df77fd99650ae03db8145727d8ed9c8b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060testTmuxHook\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/cli/tmux-hook.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa0255b2725d9f329615480ebb9139d3d85ab93cb82248ec7e64e5cc3636713"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060testTmuxHook\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/cli/tmux-hook.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d29fe365c15a1ff1d151c9cf60493b641f5f83ddfdc6e69dd1d483e9c399fb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060removeInstalledPrompts\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/cli/uninstall.ts"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ceaabfc22536a57cc75b9692a6b0466d4aa11e81015aec0141561f3dfe73328"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060removeInstalledPrompts\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/cli/uninstall.ts"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e84c4cac349689a5f3a7f077b51d7afd468a755fb8206726cd1d7374fd2a6e0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060removeInstalledSkills\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/cli/uninstall.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e01ba46cc8ebc78c935fe84194c083b89f1ca1c517ceb58f753a649c15a8ec2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060removeInstalledSkills\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/cli/uninstall.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"96400cf7835cd52a0d92f3185d32bd726db90ecbbfefc6f78829146eaafcd180"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060removeAgentConfigs\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/cli/uninstall.ts"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f641886db723a5d359b4ae6eb4175dfd49c7bd4684f0d0f1c58b2b4be8150a5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060removeAgentConfigs\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/cli/uninstall.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6afb5fd7da0c042f040a3390e7797d337f81c94697c9b3a2afa9106063a3c3f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060removeAgentConfigs\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/cli/uninstall.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca021b974d4ac22ee45d9d3b1aab59bbd9d70e27466cb715226fa12a7cfb36d9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060removeAgentsMd\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/cli/uninstall.ts"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d650787eaac0a648f25b7677c4eb5cd2beb312d2d241747204a5b4fb933208"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060removeCacheDirectory\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/cli/uninstall.ts"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfef7e03ab169dbaa855703650ec8148b9f0b449a44f7234c725b4324b185ea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060uninstall\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/cli/uninstall.ts"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b29c3fb93a7792cb33f7cdbf0fe0f3c99dae43f36216f03aefd6d26efddd036"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readUpdateState\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/cli/update.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2a58eb731356069364a37dbdc1b7464ec44097a85a0a150fa648d8527f8253"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060pluginHooksReregistered\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/compat/upgrade-from-0-20.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ccb5446f8b596e46d2ed3926cd80dd71f81d1ea3d8b20bdf62784ee33151a2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060assertVersionedPluginRoots\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/compat/upgrade-from-0-20.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9e3e7bbe0fdee8b162fbfd5fa42230311e3bee9d285229742156ee1650620b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060assertVersionedPluginRoots\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/compat/upgrade-from-0-20.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b656b6ee6b13c346b9bfde927ba1879d99229c9c6ea77cfeb1dcfaeaeee91b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060run020To021UpgradeFixture\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/compat/upgrade-from-0-20.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"228cc633306e0058a06067666ef129d000072c673b39c98fde3de7f821a2a7c7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060cleanCodexModelAvailabilityNuxIfNeeded\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/config/generator.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a0cb57afff5ef1ec0c53500d7046fafba1e72a037c512d12d4b58773cbc429"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060repairConfigIfNeeded\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/config/generator.ts"},"region":{"startLine":4441}}}],"partialFingerprints":{"codehealthFindingId/v1":"811ba14918f1256029467c9daa09f79bad46c480b38bf79f4afe42ff601c7017"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060mergeConfig\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/config/generator.ts"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"12883b572378c925c1d66dd5d886723553aaa3e93d1750a47e2731551b61c77e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to candidates.find\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mcp-registry.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c244f82aff50f27965419a80bd21cd981b85c121416ca82d6fd1b9d0f4f81c29"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060collectRecord\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/evals/astra-defaults/collector.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d507a06d75c4913fecb25f6fd8bd447ceed5f9d8549a59823f623131c1e2ed"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060collectRecord\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/evals/astra-defaults/collector.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d137a73938daf92105ce5b38f50ed3dd4050b6a14a70603de2378f6ed0752a74"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060collectRecord\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/evals/astra-defaults/collector.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"144163e7e72b257d5b997034f7b368627ed90d41c0033c98d92587da68ce2141"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060collectRecord\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/evals/astra-defaults/collector.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"894dbe32128c18837135df1229157077967bd47135b8eb6094f4eb40df47357b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060collectRecord\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/evals/astra-defaults/collector.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d5cd142fc43b5a9dc5b128c87f0ebd59ace0ace32e2c1ebb2073475c3a5343"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060collectRecord\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/evals/astra-defaults/collector.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb55a75cacdbecad37374fd66fc7988f2ed7541811a060664148ba2d8dbfcd7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readQueue\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/exec/followup.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0197e6d296a84bc1fc7b3a80dfa55097546a4ac66b0be64f167f6047feea0da1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060createGoalWorkflowRun\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/goal-workflows/artifacts.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"577dc9418805d3eb7e71ead610af5cf0cd6d914081086bbf2c0146317020c78f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readCodexGoalSnapshotInput\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/goal-workflows/codex-goal-snapshot.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a0222fe3dd9d86bcd9610938dbbfcb72790d96f918887c0883487b0169506e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readActiveModes\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/hooks/agents-overlay.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d30df44326192a5289785576cad8841f5f9125294649256435330664443f4e7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readNotepadPriority\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/hooks/agents-overlay.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"660f05e0d5c875dcfbe0631accbfadf5eea1133cb8e26a17db7ef091461dcc18"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readProjectMemorySummary\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/hooks/agents-overlay.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a36b92ce1ac0d4e1a8f741c71bf3583c488922804c002eaff239e009e80c66"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolveSessionOrchestrationMode\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/hooks/agents-overlay.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c23e01546dfd9c692416d7780b302ec0a84dc65c9d4964cc9ea2d8ff9c44b7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolveSessionOrchestrationMode\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/hooks/agents-overlay.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc834a7230f04a1d2d0a43179c0be3bfd0b230cf45a44a9c5656d2fb9a91c2a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withAgentsMdLock\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/hooks/agents-overlay.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4852c0337b8721e4776d3281f4dcce92154353abe7e13f56870b0cf7a191f73"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060stripOverlay\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/hooks/agents-overlay.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"683789a208e0f62d3085d07ad4f2dee06923f5f453e9473bd5b9d9e4b2a02c48"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060runPluginRunner\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/hooks/extensibility/dispatcher.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5993c1b37e173a2b319618d4349c8dcbef009f881d29c1b39c43480714191978"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060discoverHookPlugins\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/hooks/extensibility/loader.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed09eb076920ec0d056a0bafc6b8949338914009218d5c720a64cae0310984f2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060lstatSync\u0060 in \u0060readHudState\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/hooks/extensibility/sdk/runtime-state.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f3c563c7175b50b5352e821be40e5076808bf680af4d0609952408042ceab5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readHudState\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/hooks/extensibility/sdk/runtime-state.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fbc174dbde0ba652c98722a18f78a7397baee00bd71f880760ef4ec6a7cd55"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fstatSync\u0060 in \u0060authorizeBoundDirectoryBeforeTransaction\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/hooks/session.ts"},"region":{"startLine":3381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b43a410a0bb65a5f1385cfe5a40f63fbcf87a8e5e937a605c24406e65d28a6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060openSync\u0060 in \u0060authorizeBoundDirectoryBeforeTransaction\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/hooks/session.ts"},"region":{"startLine":3386}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de7c87624664e5ea098c8cb2f4a0baedbfbe944a62c3dc5c22a073d9c22e771"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fstatSync\u0060 in \u0060authorizeBoundDirectoryBeforeTransaction\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/hooks/session.ts"},"region":{"startLine":3389}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed803264a2418aa056f5581baa37f6dce815d027df9da73e067d4a9982968414"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060closeSync\u0060 in \u0060authorizeBoundDirectoryBeforeTransaction\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/hooks/session.ts"},"region":{"startLine":3396}}}],"partialFingerprints":{"codehealthFindingId/v1":"02248033a1abaa7fbeba8d8dd9cfd5d28365da98a3b6cb43997bd1735275965a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fstatSync\u0060 in \u0060consumeBoundDirectoryAuthorizationUnderLock\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/hooks/session.ts"},"region":{"startLine":3419}}}],"partialFingerprints":{"codehealthFindingId/v1":"327d5b6c43b3a951112627d813582b17fd1536e97431dcece10ea3589ad14980"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060openSync\u0060 in \u0060consumeBoundDirectoryAuthorizationUnderLock\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/hooks/session.ts"},"region":{"startLine":3430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdea7f2b219a51e518fb6ee77bd2d4e6bd17d3d9e2b58fc8adb5bf48c2f66a2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fstatSync\u0060 in \u0060consumeBoundDirectoryAuthorizationUnderLock\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/hooks/session.ts"},"region":{"startLine":3433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d145ef4b77d051ae7c4ee3e0e99857b7d93a36ea9ccdaa070ecb76a132ab0759"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060closeSync\u0060 in \u0060consumeBoundDirectoryAuthorizationUnderLock\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/hooks/session.ts"},"region":{"startLine":3440}}}],"partialFingerprints":{"codehealthFindingId/v1":"26799412da5e21d7d0a8efd8611bcd36a81b45c21d167e02171a027061e4f06d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060defaultRunProcess\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/hud/authority.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3246aec998fe1e5fcfe0cbf4814cdbde88f515c5b5fb2d227d61186776b0a1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060launchTmuxPane\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/hud/index.ts"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb40a0354e840b806adb87e70df3d2fb8fbaa075901c8cc744f6c52a0b43872"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060killChild\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/hud/spawn-reconcile-with-timeout.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b778c77209942f2dbeb0b9ceadd8d45760266132aad1d994c8d8a49953f013c2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060anonymous function\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/hud/watch-owner.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce944e111e6fe44fef3ad73bd2909bb6ce144a03b61e2ad3648350249222e573"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060findTsconfig\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/mcp/code-intel-server.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7ed57a325107700f808a6d293a7f7806925a3f481882da6ae08aab330a85a4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060runTscDiagnostics\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/mcp/code-intel-server.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c29db77caa3e13066a5c5885fbceb8fae9e7cf2c2a1a0950ebbfae48af3cd3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060handleCodeIntelToolCall\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/mcp/code-intel-server.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"063a8ff6a80990210a9ee26d217eb23cfa05a7e97586b166df2287528ece3a54"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060handleCodeIntelToolCall\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/mcp/code-intel-server.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"1047fc771638270f60b030ea6e22a29d426206e3a105be0c483829403590820c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060handleCodeIntelToolCall\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/mcp/code-intel-server.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"f042b2ecf699ac5a853d1dad389d85015a53b46443fb074cd2ea4f1e8f28d322"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060handleCodeIntelToolCall\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/mcp/code-intel-server.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"e135c79542002de0a75949b9645e3a20639fd3d440f4cde3ce28bce2182028f2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060handleCodeIntelToolCall\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/mcp/code-intel-server.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"668c929356d82836a5f7526c3912e34711ab947a92cdb9092b04f67cceebcc98"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060listModeNamesInStateDir\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/mcp/hermes-bridge.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f01239bd53be810c74ce25adbbdae8c9d2cc7dd8b0e1e37fb37b4bb70790e7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060hermesReadStatus\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/mcp/hermes-bridge.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f856488d6f92446be8ef2fe22d148ff22a387600cc29ce10c4253539be8ecc66"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060collectFiles\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/mcp/hermes-bridge.ts"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adc645462b0621f5fcfd8424af01b4455677cd8b4304a36e5a4b69aaca4fd73"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060hermesReadTail\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/mcp/hermes-bridge.ts"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dde76506b7a60010b4aa38607c216ce1085a158568d857a9456095d87231fb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060handleMemoryToolCall\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/mcp/memory-server.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"27334d8bdcfb9a5073f542a19f74d39f6a322875456835e8c565f9ff839ef1f3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060handleMemoryToolCall\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/mcp/memory-server.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6132a06dbbd2175ca71d7c8ebec5e554c7f42ec28654559552946115f71774c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060handleMemoryToolCall\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/mcp/memory-server.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee3d3511979ebcbdba63b74872aa8ce30994c1c9d69ddc36095b0e264adcaea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060handleMemoryToolCall\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/mcp/memory-server.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3dff95825023999a9a2005372b1694a2ddf4dbbe97b9b10b4217565827b725"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060handleMemoryToolCall\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/mcp/memory-server.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd5b1dd6205c26d830aea570066a6363d04511630bcefcd077dbf84230361cf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060handleMemoryToolCall\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/mcp/memory-server.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c18bdb061aa2a8ead2c845f6bba2e4fcad451a57e86c87119b4961301d23b5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060handleMemoryToolCall\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/mcp/memory-server.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6314ab64482cac8a4d6d88e02460d6d616fbfd03f6ea2443a106c88ce84e1c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolveWritableStateScope\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/mcp/state-paths.ts"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"af510c0d35e221a3ae91433c5f5eccdc9e5c111e260918fdd30480c1a374c3c9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060getReadScopedStateDirs\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/mcp/state-paths.ts"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd21e21a583404e71949d394e7c33ef3282cc7a2d11aa8aef7bec3166791437"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060getAllSessionScopedStateDirs\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/mcp/state-paths.ts"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dcfe878c4219c1637110ee3829b3984b981ea30c5654a85bdff2a00628922a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060listModeStateFilesInDir\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/mcp/state-paths.ts"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f2f881dae1f34c38d9bed3160384998bf62bb78964d1a43403804f984e1759"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060iterateLogEntries\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/mcp/trace-server.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f0623a2fe81e0455c2bc68b62a23acd784fceddc8e3633ef507a26b58cb404"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readMetrics\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/mcp/trace-server.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad38309353b20cde2dd004b3427398279864fb4696629df602a1134a9a9e7e5e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060assertRalplanAdvisoryStartBindingAllowed\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/modes/base.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf3b91a85f7ad1ae51632f13da8721c0754c45e7851d80e66f8057b548bad49"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readModeStateFromPaths\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/modes/base.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"164bd8550b39becaafec89e41555b1a84c9fa313c88d5e298b3a9341a104a941"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060cancelAllModes\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/modes/base.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19cd08fa1ef89f00a95df559d28007aeab6487ef5bdf93da0612e888fe6d4db"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060listActiveModes\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/modes/base.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"101862c015981d17fae985d2b79e33a08f148ead15eba0fc59d035ae9455de15"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060tarInput\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/native-assets/archive.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cb2205840ee0d1f5a7ad7e88aa36ebb6580bb1dc9d9923e35887c2f64ef2ba"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060gunzipSync\u0060 in \u0060tarInput\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/native-assets/archive.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a35d304171ad39f9560a1038932b07488b152228a43b44d2d5fff4f0bf361aa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060loadNotificationConfig\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/notifications/notifier.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0f6a26d6b4e885124efee1585240357c2925bbb992dfc82c44aa69cf20b97b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060createPerformanceGoal\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/performance-goal/artifacts.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a366f52c66dc397eade2365ab9d8f2433ed98c229686bcef66f277f96fb5ed01"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readAllQuestionEventsFromPath\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/question/events.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"adca72d84420ce595e6d189117b92492b2a556f3646b822d24f0f633322cb1a1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readQuestionRecord\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/question/state.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a27902db795f7c7be1e425ca7d5b72d47e3c6abf04f691e44e0fd2c68ebb46"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060listQuestionRecordsInDir\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/question/state.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3fa816a56aace73c36582c15e0beb41d99708765059c5b05cf4ffd02ba48d9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060listCanonicalPrdFiles\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/ralph/persistence.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f966236e9a252494505d3cbbf90ab78c2f7c5096496c525e0bc6f9bb4fbe6a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureCanonicalProgressLedgerFile\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/ralph/persistence.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1203ea79ae4995d1e878f68da64d7bbbe0080eb18bee549cd9232b96045d171"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readCanonicalProgressLedger\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/ralph/persistence.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2132dc83305fa2aab3444fd1484e7bb0dda81a0872515a8fad06db41a708a1e8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060writeMigrationMarker\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/ralph/persistence.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bd514edb4f3caab7a6473e5b5d769ca739bdf44b9fcf545a83c3f0ae1ea433"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060migrateLegacyPrdIfNeeded\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/ralph/persistence.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8773bf0e5e78d4968b153203bb4b3b91c2a1ab6d151eda7806c2fba2f06cc2d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060migrateLegacyPrdIfNeeded\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/ralph/persistence.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5f869652d9d02be4c26ea1b257e54705e8cb3974169f7c9679b751cc00496a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060migrateLegacyProgressIfNeeded\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/ralph/persistence.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb10995c7c191d7a04801b570454997fc213f214bb655e07a69555a1546601d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060migrateLegacyProgressIfNeeded\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/ralph/persistence.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5b36a125098aae4c8863c598584e5bd75c3c533058934ee85d086a9ad598fd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readRunStateAtPath\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/runtime/run-state.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a02e173665ccefa6b71fafd4d6f0f49fe90ed7380211340c4fd291dadcd6add"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060listNotifyCanonicalActiveTeams\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/scripts/notify-hook/active-team.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea453a1ff5dbccd7514a01f9a0a2b920c45738238f5db5496b4011b7348ef4e0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readBridgeDispatchRequests\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/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bf805543f8e422477ea8b900ee4bc56cd2f1f5e27563a7c6b91677ada3cf08"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060drainPendingTeamDispatch\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/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5b20c26559639572ad15e2adec739ee0426a4f7521fa5e94c3c786a5676145"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060drainPendingTeamDispatch\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/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"198fba673139f7b3dc2d1da5bc1044b8744ff0ec7eee8f3a7706edcb7903cc71"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060teamStateAllowsLeaderNudge\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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc014809cc315c44da47b17929571704e0fb641aedb7328a458dfa2b8906620d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060teamStateAllowsLeaderNudge\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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdc5cb1aef7c4bbacfed4847310a33c6be713220de7bdd97fb71cde75fdef94"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readTeamPhaseSnapshot\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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec66e86a0638e431bc7cd5eac977de4bf556c7ca63a58ce4e52b849c4edff06"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060syncScopedTeamStateFromPhase\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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5f3f0e2a92f938bd7b83d0178eb82715cb6289d9a38a9f766e6ecb6c117132"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readWorkerStatusSnapshot\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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c12a3e085aa10290ca352867d6cac739c56b28133e28633c2eeede21ef629a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readWorkerHeartbeatSnapshot\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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fb909c4ae28e2e78ac252118c9eb9e328feccabf20c5a5738e7c437324c9ab"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readTeamTaskProgressSnapshot\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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd26ac121cf7174d032df78d40b9526759472c220fcf3dacc07ff11dff5bd94"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060workerHasOwnedStartedTask\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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"9445593d2244c672ae72245a1c6fd1f6087e3a8e71a7b8776d8d4e66e0a95a0a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060maybeNudgeTeamLeader\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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26c9112e91c80a597c397a15842139b62397e7031cf93791bcc1039f7370bb5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060maybeNudgeTeamLeader\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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec029c1d52fb6ffb1a8414e6d78b7db2292dbe3772e373fc7e956552bfad3cd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060maybeNudgeTeamLeader\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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"16761660b6ebd1d2908f335c0e6e52713ee57ad993382b490385b5b335971f3e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readJsonIfExists\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/scripts/notify-hook/team-worker-posttooluse.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f700351d592c1318cf47857a968d4a418aed171b383306d30b118d1ab1860f4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060hasGitOperationInProgress\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/scripts/notify-hook/team-worker-posttooluse.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd824ae7a4141cb0d5e163bc0a23718c1c3418f5a66c144d5ef4815640d7ab0a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060teamStateAllowsWorkerStopNudge\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/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e7d796a6fc5dd6ef0b14281e3a72201ae75bc0db1db7c3e6d000dcc85c9f5a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060teamStateAllowsWorkerStopNudge\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/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7d7051de0f4758d46f7ee5e36ad0f5faea8646b27f61b980b6225aefe0397c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureDirectoryUnderExistingTeam\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/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8014a2acc986892474028ae3da8b5293530176f77b7576f0c8407b3c70d3c3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureDirectoryUnderExistingTeam\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/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c4a101ffffaec56967997f20d8241df17d3b972da76b817e843aea551581f4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureDirectoryUnderExistingTeam\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/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3548ba23de753502dbc2e7bd60b7f7dc5d63993e07936b466561adb6aaa063"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureDirectoryUnderExistingTeam\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/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0049d0795889650f7de815747ec2f102a57d2b98315d9fc20bb63ed404ee9ae"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060writeStopNudgeStateIfTeamExists\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/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d1f6bee545b9be3b600bfb5941e7de50b49099110483be00bdaaaddc853098"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060writeStopNudgeStateIfTeamExists\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/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16bc4a43a790d9950b2bb4b8e9b5dde4eff585bd35b3b6b289f8925aa9a7f83"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060appendWorkerStopEventIfTeamExists\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/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2a66957c011c03228113a05a7c00249112f644de2610e2b449c4d64b1e9f48"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060appendWorkerStopEventIfTeamExists\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/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb5b17316d6f0cf8eea507583a97febd02f515a083d54560216f2cac125cff4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readTeamPhaseSnapshot\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/scripts/notify-hook/team-worker.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"017a93bed8962f69069a8115a8d601e450afbadcd5ed64967948650217377813"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060syncScopedTeamStateFromPhase\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/scripts/notify-hook/team-worker.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca49571b20b2048c59968a36a317f5e80c70ce3033f74f67e64ef2a9bacc2de"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readWorkerStatusSnapshot\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/scripts/notify-hook/team-worker.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e8599defe7759b535336aba9dcdfa32488da9396da028e9a3a84fcba3102c8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readWorkerHeartbeatSnapshot\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/scripts/notify-hook/team-worker.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"32291313c5ebf9e608212f23bf38837b745b6658fd7b6a6e022f6119f6e9bb0c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readWorkerStatusState\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/scripts/notify-hook/team-worker.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5961dadcaf99341e6b27e930b525c0ccb8a404a48fb4a9fa2fa2d1a48878e18b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to filter\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c563676ad574a19d033d267f8fe085ed6fd317245a7d14f0c57b0be727f1e3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readTeamTaskCounts\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/scripts/notify-hook/team-worker.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eaedf21b4467f92593d559dde87c428b93b0b30f49d35358af8b08aefd9b451"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060maybeNotifyLeaderWorkerIdle\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/scripts/notify-hook/team-worker.ts"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c9086e206e90f87dd902906217074561ecbe2c9e7d0e8570e0364fb60997a7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060maybeNotifyLeaderWorkerIdle\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/scripts/notify-hook/team-worker.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"1382b4bef7f740bcdab76e7ec12e9e113c54c822f5d36ef5f3e48da9dd3515d8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060maybeNotifyLeaderWorkerIdle\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/scripts/notify-hook/team-worker.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4f1f9e4b41005e837143c294604f19673958a69a3cfdd7350d61247f5289c6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readUserInstallStamp\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/scripts/postinstall-advisory.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dcd4f6fa36e3b3ae94105578a8c957b76f547de6ff5dc46369df5b61380208"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060normalizeExistingCodexHomeDirs\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/session-history/friction.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee708dc0e609d44af4b5702cc6609ee49c4d7fbbd50998194bb2892a24bb7e3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060listRolloutFiles\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/session-history/friction.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cbe0353cb12aa27b9c61307ad8e52a918a726d6ccab9869f984cf1d465401b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060normalizeExistingCodexHomeDirs\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/session-history/search.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f10d7e98d274c42ee43efcf4e62f9c07a4597b61f417563a4bd4e083cb2a933"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060listRolloutFiles\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/session-history/search.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"47732c0ccc71ce9d8912d18f484584bffff995ef366d813cd1ee9edd3b30048a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060clearSessionNativeStopState\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/state/operations.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b4872b15509590707b463d4173dc173311f239ab8cc8611b031db563577831"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readSessionDetailTransitionModes\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/state/operations.ts"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d1009daf423ae44600d6ab192fe88aed6a03c9cb11a9b64c99f66f7466101e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readSessionDetailTransitionModes\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/state/operations.ts"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"5973635830daa8e4a48c079854c654b1536b9f71844dcbba41e51a5a997fcc44"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to paths.find\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/operations.ts"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6871d8b0a20201601151e93974fa50228c8dd134b8caa2688d67da09f85b15a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withStateFileWriteTransaction\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/state/operations.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e919561e3d3c15c039c85bf2b055eabaa8238c9e6a538f94d105921bde7d62"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withStateFileWriteTransaction\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/state/operations.ts"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3a725b007fdf7913d84c07a5d43b725bb49a04ffc09dc1916b4b7175a26e8f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to canonicalPaths.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":"src/state/operations.ts"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"8480896d4e69201b2f8e51cef8d965a1a70fdd0dfbbe1e707787afd23662a519"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withStateFileWriteTransaction\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/state/operations.ts"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b286a6d9253e2c7b59e430d7a8b0eb5c979c063d15e9d8aeb27785c6aebc1aed"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withStateFileWriteTransaction\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/state/operations.ts"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5494da6b921e5fc6b80a64d18075b7fc02f1bf0ff2e51e1b6e149af6b3736819"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withRootSkillActiveStateLock\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/state/skill-active.ts"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e62797d525e77f2f74b1275c1732b072e801dd0de8e26abb3297be6939e6646"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withRootSkillActiveStateLock\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/state/skill-active.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3f57374ba781517c4d2718ae14ef0bd4db45eaa5ac2922c049c7eba570a8b0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withRootSkillActiveStateLock\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/state/skill-active.ts"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b26ce07a76473a4289e88ea378d72228087bae284de3be64b41a7ed5be2b8e5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readVisibleSkillActiveStateFromPaths\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/state/skill-active.ts"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fe53720009b6d2737185db0f0f663d09b9a65a6836c07e2335f753e699cd25"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readVisibleSkillActiveStateFromPaths\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/state/skill-active.ts"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f78aa45520fb7b6c27b07c234de3293e57c6e86aab90044457b7cd1d0ce3ed0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060syncCanonicalSkillStateForModeUnlocked\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/state/skill-active.ts"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4822d7209e2784bcddde2fe4f8d1cfcc0b6efa4f5be777baf0f55bcf404723"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060syncCanonicalSkillStateForModeUnlocked\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/state/skill-active.ts"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"980f099b1140eb9ef37692ddd354a0523c09b98ca595be2827dfe55cb71feae0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readJsonIfExists\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/state/workflow-transition-reconcile.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0736001cb3deef0ce296763befe10d61c90af8bdc31c1499dbe71e9ef4d9375"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readActiveWorkflowModes\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/state/workflow-transition.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e85a436f34c94c6c43ab1a12c437f2cd4721d3b6ae13d724b25768253621b60"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readSubagentTrackingState\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/subagents/tracker.ts"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfac9e69eb343a5c67cb0919246e542cdc06355d81b7da258182dd86d3e63755"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withCrossProcessFileLockSync\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/subagents/tracker.ts"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c861fe4393805be15c3317b38bb5511fe6f1f434f18247c5cb597d619cd44d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to withCrossProcessFileLockSync\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/subagents/tracker.ts"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"960c4d857a269be418b1eae1237dae2cf40f258d912a771a7f92c7a0aaffd8c2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060callback to withCrossProcessFileLockSync\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/subagents/tracker.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddeb4e80b8b3f5c8d1c5b4a51fbf62367f22679188de9968a73ffcc5af9b252"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readPersistedApprovedTeamExecutionBindingState\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/team/approved-execution.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcdf0defbc976669343be85c4f74e053ea628cb4f160b0add2e86d930c53e67"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readTeamCommitHygieneLedger\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/team/commit-hygiene.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40816de35fbf86fb1badcfa5aa38ff3652c8a7ab3fce8f995f44ec7a7771679"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060appendTeamDeliveryLogForCwd\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/team/delivery-log.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"00071126fca6ddd4cd961997781e6a871ba2cdcee04dc32e781a74ff73344e77"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060tryReadGitValue\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/team/leader-activity.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"879f7f66d5c7c1e61e08fd84f311aff49977b4b77e534f30747cc8f597ddf54a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060statMsIfExists\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/team/leader-activity.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb4a08eaec7a6860dfe3ff2c3d6daf169fd25bd4e350ccfacf86b7438049a57"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readLeaderRuntimeSignalStatuses\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/team/leader-activity.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7137c6c59b14a090ef897289ded3b31d235e368e98c44b9cad2455b2e1fa49a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readLeaderRuntimeSignalStatuses\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/team/leader-activity.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a998fe98c43913ce31177cc0c6f0292cc5a071f9e87a7562288cc5eac770a3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060statMsIfExists\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/team/progress-evidence.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"15744627ef541093a91cdeef718e4ca622f5d95b5ea009c4f8f1346a0e3f5270"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readTeamWorktreePaths\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/team/progress-evidence.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93779bcefed07721c2c79009fce74ec72aaede3707d92b797a7a30170ff83a7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060syncRootTeamModeStateOnTerminalPhase\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/team/runtime.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aeaa8b44ca8e0b3112816cddce4dd12af7cb2a6d828cc6d0d75a0f291e82204"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060syncExactTeamModeStateOnShutdown\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/team/runtime.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f6c522638ff97c93c36a44924152c3dddd91a624ae8706b6ce2b2ab3ee30eb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withTeamTaskMembershipBarrier\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/team/runtime.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"6308cf9e54b2edf1ad3c1f87eede9a94f7b69c7b7191dcfb1b3a4860052de77d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readDetachedSessionDestroyReceipt\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/team/runtime.ts"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"f369600caf61a056a6e807e6072a636f316e9e089e5e34e57adc9a3f26b823a0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060removeGeneratedShutdownReport\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/team/runtime.ts"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"106773dda063e20bfedba5bd967d47e9fcf7b4ef9fd07f57b9006e50b267bc24"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060writeShutdownReport\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/team/runtime.ts"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"722f14d4830e8e568483003082b144ceb712a505b2ac3ffda6fc8c01bc6814c5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060prepareShutdownMergeReport\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/team/runtime.ts"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad040b766f90a1a9db21ed37ef74bf13f36cde49fc0911baf9dc0ab367c7fd7c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060reconcileGonePaneDescendantCleanupDebt\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/team/runtime.ts"},"region":{"startLine":3240}}}],"partialFingerprints":{"codehealthFindingId/v1":"666c8de488de264428dc3eeaa34886eb1b17ced31fd97ba1daed93ebe1e44d73"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060findActiveTeams\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/team/runtime.ts"},"region":{"startLine":5984}}}],"partialFingerprints":{"codehealthFindingId/v1":"38034640abda5f0edc0011e1653aa00326dd29ad3958bc03d1209f35f4dded9c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060detectAndCleanStaleTeam\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/team/runtime.ts"},"region":{"startLine":6024}}}],"partialFingerprints":{"codehealthFindingId/v1":"20455ab079a0965691600c0443e4c0b731a7aad3af72df912c016b2122267ed7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060detectAndCleanStaleTeam\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/team/runtime.ts"},"region":{"startLine":6031}}}],"partialFingerprints":{"codehealthFindingId/v1":"5962ec151ba9b9d1cd4037f21186c0bb3476f0a56afca65aba17f83f0ca8c003"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060detectAndCleanStaleTeam\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/team/runtime.ts"},"region":{"startLine":6040}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd5f5a183e8a3daa981964835bc2ca8879eb6e9e245dd23630081436394c518"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolveLeaderSessionId\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/team/runtime.ts"},"region":{"startLine":6080}}}],"partialFingerprints":{"codehealthFindingId/v1":"02975341da316bf7e3909d828373c080bec7c136313aaff40726c12c60f384d1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withTaskMembershipBarrier\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/team/scaling.ts"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad6c5901445602b99d176171043d163645eb919137c09ee6135eeb230899360"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withTaskMembershipBarrier\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/team/scaling.ts"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e5b4b9927662fef9a7e7f33c93553deed70bc00eb026efe5c5d74b22d8361b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withTaskMembershipBarrier\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/team/scaling.ts"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3ed8035981e31ab452febd3620709235a47859c79c2bc6dc948ef5a9f2af98"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withTaskMembershipBarrier\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/team/scaling.ts"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6b27bd44c92c18f0825f6e2cc1dce4106cc5aede1da57db0e49fca48258b80"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withTaskMembershipBarrier\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/team/scaling.ts"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"713a42c799dd7a8c73e7688316a9e931b872fa37ef8004ba7f82ccbd59106091"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060rollbackScaleUp\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/team/scaling.ts"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f6ee70f3a16b51c0823974fc4cbd55a012fb8538373f312a0f2590b6a1aeac"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060rollbackScaleUp\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/team/scaling.ts"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfb63d1afd774214aa0ee3cb9dcf48c1c7ed40568258838e54209f3d3fafa13"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withTaskMembershipBarrier\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/team/scaling.ts"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3644993959806c3dd352b94364923b2244be9cb676827cd3a815d3fa9e7af900"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060callback to withTaskMembershipBarrier\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/team/scaling.ts"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7081c517420caff1188520edb2be0e3b710c13e088234eaa840db19e1ecc68c0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060assertExistingPathParentContained\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/team/scaling.ts"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0d7094c7d2c698a606f17ed757935b7fd207a09f5aa8da02ed4000f5fde75c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060validateScaleDownCleanupResources\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/team/scaling.ts"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb1d8efaeeaea0d61169067ee89ebebef93aebe6f1c3856cc76fd99bb32a41c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060validateScaleDownCleanupResources\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/team/scaling.ts"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9bcc425d1768dbc4b6b8e210f17e20add77a8bbeb53c155f069e7cb980002f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060cleanupScaleDownResources\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/team/scaling.ts"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a25edf691d1a797d7564c208cf3be0cd07c6a7a213b66f82f78882ad36577af"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060cleanupScaleDownResources\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/team/scaling.ts"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5f4e67e134dbe7811653a2f05980bae9e0c6e335d3db2625835cbf482e2449"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withTaskMembershipBarrier\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/team/scaling.ts"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"18307a5721a549509a704388becd7b6830f0591a4d754b4c487c4f70f9500249"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withTaskClaimLocks\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/team/scaling.ts"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e9f528825b9c36e46fc4ffc08237e0317b4ca162e2b036d20bc34d4e630c55"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readJsonIfExists\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/team/state-root.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8d3dec6504c67c9aff2ccdcafd949832163b554edf9b10d76ac90c164dc515"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060writeAtomic\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/team/state.ts"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eaa99da3f7c39ba81a8e219706448efe4d7e4327f78404227b1f654f8402737"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readTeamManifestV2Raw\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/team/state.ts"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc306fab5e280ef8d682fd5fc731db0259884923b1f3d2764115a12b9ecf7c9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060migrateV1ToV2\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/team/state.ts"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c516637a6922c046c3b55c38bed5ed9657b649376b55e80fa24916f8ff849a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060computeNextTaskIdFromDisk\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/team/state.ts"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"7614345f1fe8c018a565d0a9646750e0e1e3c7035cba2ddf9287cca03b7dd12c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readTeamConfigRaw\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/team/state.ts"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac85d64ba37c0b0723126d3df12d88100302aefb4b5cb2cb3ad98f66e8f09e1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readTeamConfigSnapshot\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/team/state.ts"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"6affbc1454c040a31101db7aeafe9ad2d7deec3e7472d2b4bd59bc9ff9425a87"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readTaskRaw\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/team/state.ts"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b226ee1598ff36277cf75fdeeb88dc4916381b4002c2f2108dc29be448f5884"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withDispatchLock\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/team/state.ts"},"region":{"startLine":2295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a921bdb6989dfad5076c8c7dffda262bc9fc96fb5be20b51ac1fc15a2061de"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\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":"src/team/state.ts"},"region":{"startLine":2565}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fc741d15edb45f393b41d702833c211e94ec7ef5eec8c4016a79a00e758abd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withMailboxLock\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/team/state.ts"},"region":{"startLine":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f2a978d88a0d539f85d738351ec844ffe2246c92bcc04ff54ad02da165c10b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withMailboxLock\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/team/state.ts"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa6f70a7b4af70caf9f5ccd42de621e80983e32f2013ab1a73c03ff70945384"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readTeamLeaderAttention\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/team/state.ts"},"region":{"startLine":2935}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cded8cbcb498e2984095d95380e6cf8da261227944fe2158cf710b94ffe34d9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060markOwnedTeamsLeaderStopObserved\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/team/state.ts"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb7c6c1a4cb09e19ea90002c9a01f5f9d0ccfd08e9183cc204bb924d42127be"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readTaskApproval\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/team/state/approvals.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3687f6aea09e08bd9de0dc2e08d58fdf7c6afc26ea370cd65f5a4241bcce0f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readTeamEvents\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/team/state/events.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a7e0080f2075607b3b4e31c08a12263dc3d12f0842e1c41118dfdeea39420a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to deps.withMailboxLock\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/team/state/mailbox.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"c395f659865f5c8897d6c2e5d5b903a9cdd0e8e28452573ee95d99cfb509e2bc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readSummarySnapshot\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/team/state/monitor.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cefa4982728bde9ea19adff82ee717fe14e6bff679b0d807fedabf8d3b0e289"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readMonitorSnapshot\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/team/state/monitor.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dab130c185f330904edbef61392cac9e0669e58c28b965bc1989e421e34cd38"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readTeamPhase\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/team/state/monitor.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b685fcee5a5b114d8849c2d10937416f4c8869630d6b60d2177cec97f9ea814"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060listTasks\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/team/state/tasks.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"d008430872a071a637ddda5feb7b8ffdf185450b599e83613c38a7397b01c19f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolveLeaderOwnedUltragoalContextOutcome\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/team/ultragoal-context.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22c30e438d3cbc9c854435cd27b5d271cc90ab7d8ea4dd6edcfd4e2f39d34d1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readPersistedTeamUltragoalContext\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/team/ultragoal-context.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1b8106ae5ae4d829209192bb15a2975693e6047b612fabbe3a3137b7acbae7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060writeWorkerWorktreeRootAgentsFile\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/team/worker-bootstrap.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"92eeefc8eb23c5627def092ee1b2be1772981ae709f8f6aa975c3fe6fcc782df"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060removeWorkerWorktreeRootAgentsFile\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/team/worker-bootstrap.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1726a8f477fcf62b771f531c1b209e95cf4c89ceabda7f7481748a7bf478a28b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060prepareSubmodulesForWorktreeRemoval\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/team/worktree.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"1721dcc41b5b38ee56a9892ef647ce8dadeb0b10a1f82c480893d39101ea7063"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060prepareSubmodulesForWorktreeRemoval\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/team/worktree.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"539fce8e02ab1c6dde5b4657d8069262e03154a192d083a5873bf85ff9cb4a0c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060restoreSubmodules\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/team/worktree.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d323172d157c2381fbd1418ce140fd23a7f73e81dc2ee0f576901785cbc712e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060replaySubmoduleRecovery\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/team/worktree.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"0558d3f55065966062def03e63879aef57e9e569496ade4485b9aaaa392f9148"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060replaySubmoduleRecovery\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/team/worktree.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"e474788c6cb513b48b558dacc47eaa213f1e6a369756c675d939c9e35da6d2bb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060replaySubmoduleRecovery\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/team/worktree.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"d206c34e404a7718031b247fb511f601f1e2a352587a332b0aedf9c0b6ba0394"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060replaySubmoduleRecovery\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/team/worktree.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcab101e4717cec93a6179ee06ee845cacd9c02cfdbb496af38cc806def5140c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060replaySubmoduleRecovery\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/team/worktree.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"707947cc9077edd96d9cfff3e33997a610d2bfff24bef707ad3c31b20b1dffcd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060recheckSubmodulePlaceholdersBeforeRemoval\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/team/worktree.ts"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"989a7f83dede8c57c7afa6fc3577dff0dd7573e8ea93e0a14facd323786b8d5f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withUltragoalMutationLock\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/ultragoal/artifacts.ts"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"97966d1407218b243814c07e0ea36dcd6d5aa2387683c1a609f34ca632b4094d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readInstalledSkillsFromDir\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/utils/paths.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c3a016d074709389ac7a4b5158c699ada2bbae137ad0fd9cedf13f1224602f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to filter\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/paths.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7563efe6c63b3a01a61cfd3b2d9d3234596d596846daa2e1a16bb59343a9bd10"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060detectLegacySkillRootOverlap\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/utils/paths.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41dc405035f07e10c1cba6e366cd39d092407feb35c3a6bc77022bb24bf95d9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060detectLegacySkillRootOverlap\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/utils/paths.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b243b029eaa337400da696c89674cd738686f2e053a23240b31b6f3d341753b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 34 sibling directories (117 clone groups): 117 duplicated blocks under src/ have copies in at least two of the sibling directories adapt, agents, auth, autopilot, autoresearch, catalog (\u002B28 more sibling(s) not listed) \u2014 73 of them are reported below, and 44 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 117 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 117 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 117 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/autoresearch/goal.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e162d57bc451dbaba3d5bc4668c50af11c12f773758745a1f9484bab6a14eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 3 sibling directories (5 clone groups): 5 duplicated blocks under the repository root have copies in at least two of the sibling directories packages, plugins, src \u2014 2 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 5 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b654e38da6bdfa434ae0855a47c1b79eeb1b0ae5ce5ac16f3220a7079fe5b55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (262 matched lines \u00D7 2 locations): src/team/state.ts:84 \u00B7 src/team/state/types.ts:6 \u2014 the two spans are one implementation copied and then locally edited \u2014 1176 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":"src/team/state.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb10b65acd97f52a39dd46bf5e827dc32a89fd44e4461783cb10413f47356a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (142 matched lines \u00D7 2 locations): src/cli/api.ts:34 \u00B7 src/cli/sparkshell.ts:34 \u2014 the two spans are one implementation copied and then locally edited \u2014 1134 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":"src/cli/api.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c22c95c927952fa05c69e33968d604c0aa6ac062d4495042a63840971771ec1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (123 matched lines \u00D7 2 locations): src/cli/autoresearch-goal.ts:39 \u00B7 src/cli/performance-goal.ts:43 \u2014 the two spans are one implementation copied and then locally edited \u2014 905 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":"src/cli/autoresearch-goal.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea80999f61883f8404d109f644892e22775e4ad933ec4ed793ae61147bceeb6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (120 matched lines \u00D7 2 locations): src/state/pinned-atomic-file-darwin-helper.ts:28 \u00B7 src/state/pinned-atomic-file-darwin-janitor.ts:29 \u2014 the two spans are one implementation copied and then locally edited \u2014 1048 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":"src/state/pinned-atomic-file-darwin-helper.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"528639d5ab74f5c578a1ff624ff77d77af39e6ba25591c104d8de8bc14a8c6f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (106 matched lines \u00D7 2 locations): src/autoresearch/goal.ts:109 \u00B7 src/performance-goal/artifacts.ts:109 \u2014 the two spans are one implementation copied and then locally edited \u2014 863 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":"src/autoresearch/goal.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fc94ed89a07b50bf673051f853fcde2afec510c449a7942d61bd04e4f54dbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (86 matched lines \u00D7 2 locations): src/scripts/notify-hook/team-worker.ts:352 \u00B7 src/scripts/notify-hook/team-worker.ts:544 \u2014 the two spans are one implementation copied and then locally edited \u2014 567 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":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dfda2e867b89a32e5719efca436df826b90d074b62bf5873cc90dd13283631"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2 locations): src/team/state/locks.ts:69 \u00B7 src/team/state/locks.ts:119 \u2014 both copies are in the same file, so extract the block into one function there 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/team/state/locks.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d340351ed5633a2022c63b454dce9e67c292d1bd092c4d45851e077072ae1267"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): plugins/oh-my-codex/hooks/codex-native-hook.mjs:41 \u00B7 src/scripts/hook-payload-guard.ts:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 417 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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe6d4bc4eb99815b74d6058ea14bf0c1423c5cc2249f5425ce1be4c263bee29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): src/notifications/tmux.ts:86 \u00B7 src/notifications/tmux.ts:246 \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":"src/notifications/tmux.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"483be3d505e7097c3c541c2182982bef51b4130d8b9177ba305ce03c5f4a6564"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2 locations): src/team/state.ts:2764 \u00B7 src/team/state/monitor.ts:33 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":2764}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a85109b0df643e36616b241c97e9b99b6701aadfd99903a262dcc83a56f94c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (41 matched lines \u00D7 2 locations): src/config/generator.ts:500 \u00B7 src/scripts/notify-dispatcher.ts:307 \u2014 the two spans are one implementation copied and then locally edited \u2014 268 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":"src/config/generator.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"eace457649cb038789afa8a65d2e6dad7be9e52f3e604ba5785db7ea553cfbc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): src/team/state.ts:436 \u00B7 src/team/state/types.ts:297 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"780dcb0950767ac36796e3768737991fee87bf8dd8e232bf8f6cc739969c5dbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2 locations): src/question/events.ts:55 \u00B7 src/question/state.ts:256 \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":"src/question/events.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde3b84dde7ed85b0298eab8c8b43ee8f895fd0253e6f3dd1610e2c2c1376137"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): src/config/generator.ts:458 \u00B7 src/scripts/notify-dispatcher.ts:269 \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":"src/config/generator.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf3ba0cb0895f13cb7e15a666454dde5ba2b820b90bb2d2997ae16097dd917a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): src/cli/doctor.ts:3679 \u00B7 src/cli/doctor.ts:3804 \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":"src/cli/doctor.ts"},"region":{"startLine":3679}}}],"partialFingerprints":{"codehealthFindingId/v1":"967674986b12d424a109c8077687ffecd60ca216a414d545706ea91990a829ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (33 matched lines \u00D7 2 locations): src/hooks/agents-overlay.ts:60 \u00B7 src/team/worker-bootstrap.ts:611 \u2014 the two spans are one implementation copied and then locally edited \u2014 218 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":"src/hooks/agents-overlay.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c56a2de4e01f39bb5f3406fde0d60fbce41daebfbfcec768c69239b34aed6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): src/cli/setup.ts:708 \u00B7 src/cli/uninstall.ts:919 \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":"src/cli/setup.ts"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"776bb32746ffc24be5134b1f9bb469eb73a81197bba2c3546dd9ba5380168933"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): src/scripts/notify-hook/team-leader-nudge.ts:302 \u00B7 src/scripts/notify-hook/team-worker.ts:119 \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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4772236f13c45d290d8cf0512b71768e4ab366bbb1b0d85f21c23e0cd3a91fa4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): src/cli/doctor.ts:496 \u00B7 src/cli/doctor.ts:561 \u2014 the two spans are one implementation copied and then locally edited \u2014 158 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":"src/cli/doctor.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a66ed3acb7ecf7affde89bd9eb9d4861b821b2d63cb3fd65822deeadaf646d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): src/scripts/hook-derived-watcher.ts:513 \u00B7 src/scripts/notify-fallback-watcher.ts:1767 \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":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b9af511e2349be1aa05dd4cacf66397330af28f090802b11ba2d0126a7e83e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): src/scripts/build-api.ts:7 \u00B7 src/scripts/build-sparkshell.ts:7 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/build-api.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1175622f36fbc6f8d1e6d055f1f4dba0ac1a86c1d523e3626f269f69abefe2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:5873 \u00B7 src/scripts/codex-native-hook.ts:7789 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5873}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0f8f6721d09ae539a3b98c7e976a34793d76c7c5d0472fd43143f9c3155c1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): src/scripts/eval/eval-cli-discoverability.ts:8 \u00B7 src/scripts/eval/eval-security-path-traversal.ts:6 \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":"src/scripts/eval/eval-cli-discoverability.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e23a7bf194e9abc641e4ea056257d79099b6e1d862a55ea968047e6bfa3468"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/catalog/schema.ts:53 \u00B7 src/catalog/schema.ts:89 \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":"src/catalog/schema.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd1574735261f4e8ea051bf5ff76675800ae877521418ba68031ce87dce273b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/cli/index.ts:9814 \u00B7 src/cli/index.ts:9884 \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":"src/cli/index.ts"},"region":{"startLine":9814}}}],"partialFingerprints":{"codehealthFindingId/v1":"4639da0887b621c1360f2bf51ca7e4432f589885218fbf84c3f7af4c797e06f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:359 \u00B7 src/cli/plugin-marketplace.ts:431 \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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3753a2e71ade1839eb642f1d654aef4fb5ef0bd0052a34c73615e1cad6f406"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/cli/session-search.ts:139 \u00B7 src/cli/session-search.ts:201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/session-search.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf1c9a4cf5f8c535add1345a4287bc66fba7ccb3390bf67e0421053afd0c1e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/cli/setup.ts:5344 \u00B7 src/cli/setup.ts:5514 \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":"src/cli/setup.ts"},"region":{"startLine":5344}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a13d62933542e8218420e7ca0507f75cdee1d41217915e48770474baf128ef2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/mcp/memory-server.ts:156 \u00B7 src/mcp/trace-server.ts:229 \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":"src/mcp/memory-server.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"605e3f2f2dc7c23cad20036fedf52e7f1670219a224ae0df96c463fb93ccb020"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/notifications/dispatch-cooldown.ts:31 \u00B7 src/notifications/idle-cooldown.ts:39 \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":"src/notifications/dispatch-cooldown.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9653983e1d432741f2719137926c6526b1e57738b0b01f0856012b2269d6a78b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:1323 \u00B7 src/scripts/codex-native-hook.ts:1388 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aafb4a0d5b9858066b60c397f5f9368a7bee3d894a7c1b6bda4ad5d8455d308"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): src/scripts/smoke-packed-install.ts:5169 \u00B7 src/scripts/smoke-packed-install.ts:5197 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/smoke-packed-install.ts"},"region":{"startLine":5169}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d14826a15ed1fea19346be7b4b6c0312940472aa7d4ff3aa0ebe216bfd49dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): src/team/mcp-comm.ts:326 \u00B7 src/team/mcp-comm.ts:427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/mcp-comm.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e65a83478fcfad364251a45925484d8813e354771a5909130579776ab4e2d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): src/team/state-root.ts:255 \u00B7 src/team/state-root.ts:388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state-root.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6448db8510e7452456fab4c6828c8952fd611383e7fe203e15dfa6b3a9e4808f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/autopilot/completion-gate.ts:20 \u00B7 src/autopilot/completion-gate.ts:51 \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":"src/autopilot/completion-gate.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad670d89d1a2aafe61eb9141adc02ce376f4b30e4e8bc02d202f18cb0a80f94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/cli/index.ts:5668 \u00B7 src/cli/index.ts:5864 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/index.ts"},"region":{"startLine":5668}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8487be96b687338249484e49e3430c22f5ff31d0e132aeb08331fc9f525ab1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/cli/index.ts:5707 \u00B7 src/cli/index.ts:5897 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/index.ts"},"region":{"startLine":5707}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5811a30a4348a1b0bc9ccc32f6d3ddc9c04e5a333e5d5f33a86a199af9fa027"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:328 \u00B7 src/cli/plugin-marketplace.ts:399 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"06892c900a475e896a2744154f0d250a5640bc8bb37ddb03acdf8aaa914bc7f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:19356 \u00B7 src/scripts/codex-native-hook.ts:19393 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19356}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef20e7cc8f933e7a27755572325dcaa7a62148719d7a0cdb3a99134b088984e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/scripts/smoke-packed-install.ts:1921 \u00B7 src/scripts/smoke-packed-install.ts:5637 \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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bfe6fd35548f42159e7012130023920926f1e7294be5c96a593884ae52b838"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/auth/hotswap.ts:99 \u00B7 src/cli/index.ts:3647 \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/auth/hotswap.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2eb089924460c0a549e0041cf2406ef6f26efdf9ae6031c764f495269f69738"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:1716 \u00B7 src/cli/plugin-marketplace.ts:1742 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/plugin-marketplace.ts"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0b786fca97b8655ec3ac16c0ec5675805e4759c382e0578f2292f097dca37f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:19769 \u00B7 src/scripts/codex-native-hook.ts:20033 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19769}}}],"partialFingerprints":{"codehealthFindingId/v1":"831ecafbcb5b117509bdcb89beb64df7b46bccab4f812d1cb3b7af98a7e940a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/scripts/notify-hook/team-dispatch.ts:590 \u00B7 src/scripts/notify-hook/team-dispatch.ts:672 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b5f2420deacaba76c23f90fea181abd1a4c8ffb4a17fbfa68431e8caaaadc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/scripts/notify-hook/team-leader-nudge.ts:199 \u00B7 src/scripts/notify-hook/team-leader-nudge.ts:224 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1393dd5ecc70240834ca8fc1fcc1de1b13a1fdecbadeb9c396f9c6daa2cd0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): src/hooks/agents-overlay.ts:489 \u00B7 src/team/worker-bootstrap.ts:409 \u2014 the two spans are one implementation copied and then locally edited \u2014 116 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":"src/hooks/agents-overlay.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedd4f9c95e073252f1268f3c94662714138256f3d59a7a8e61ef54fb6235bb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:16305 \u00B7 src/scripts/codex-native-hook.ts:19810 \u2014 the two spans are one implementation copied and then locally edited \u2014 199 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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6e4e6ce50ca6d0e63dc78282f021fc0d9a8f7a7aae71bf27031bad6a3cb915"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/scripts/notify-hook/team-leader-nudge.ts:1059 \u00B7 src/scripts/notify-hook/team-leader-nudge.ts:1115 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccba0a74a3e4ae523f32a3cce9143ea643fc7addd7c57673cb63a00dc6ba6583"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): src/sidecar/index.ts:61 \u00B7 src/utils/sleep.ts:1 \u2014 the two spans are one implementation copied and then locally edited \u2014 125 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":"src/sidecar/index.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"757c268f780f67710dc4cd81a77e60e38d19d1449e4e998d6381f94894bcbe8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/team/runtime.ts:2776 \u00B7 src/team/runtime.ts:2804 \u2014 both copies are in the same file, so extract the block into one function there 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/team/runtime.ts"},"region":{"startLine":2776}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ae88215413527dbe22d257e169cbebf91917420eb37025b4bc7fa8d149f73d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/config/generator.ts:919 \u00B7 src/config/generator.ts:3089 \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":"src/config/generator.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa103ed0c0812c61592f963d62c2208cf49ca1c627f3e03e03977c83dbe45763"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/team/state.ts:1927 \u00B7 src/team/state.ts:1981 \u2014 both copies are in the same file, so extract the block into one function there 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/team/state.ts"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b5fe17d2ab24c26ed8617ca5ffa20afeb37e44e15943e3f1ff5c7c75844e07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:1134 \u00B7 src/cli/plugin-marketplace.ts:1217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6fb803d99b9188a026f48a5965e25d49b961292070befd7ddd16639b5e7553"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/hooks/keyword-detector.ts:3621 \u00B7 src/modes/base.ts:150 \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":"src/hooks/keyword-detector.ts"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2ca615bfda8290d70d10f5104fabcd52687e0cd2448e215106a50d2d683b44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:8713 \u00B7 src/scripts/codex-native-hook.ts:8760 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8713}}}],"partialFingerprints":{"codehealthFindingId/v1":"138e584942604a0400c2bbd71a3f36ae06bd70c01ead0040ff9bb8d4c3c605ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3 locations): src/scripts/codex-native-hook.ts:8936 \u00B7 src/scripts/codex-native-hook.ts:16026 \u00B7 src/scripts/codex-native-hook.ts:19320 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8936}}}],"partialFingerprints":{"codehealthFindingId/v1":"6662cb66391dfc59424a4d107e8ad06783423628db2bdb0d60e68a1907cc2a12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3 locations): src/scripts/codex-native-pre-post.ts:529 \u00B7 src/scripts/codex-native-pre-post.ts:597 \u00B7 src/scripts/codex-native-pre-post.ts:1191 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-pre-post.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a75bbf19239dedcd48016b240bccf5712109f4044bd5322e62ae5764109df62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/scripts/hook-derived-watcher.ts:122 \u00B7 src/scripts/notify-fallback-watcher.ts:1555 \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":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"227f8aa974cf7aa3c5ad773aa4ef4fc9771707458edb776bbd65c89419b37f24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/cli/index.ts:649 \u00B7 src/cli/index.ts:725 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a39fddb31f07eb8438afd832e640ad5d28a8868cb36aab7cf0985ccc7f88130"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/cli/index.ts:674 \u00B7 src/cli/index.ts:750 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"a311ad95bef9b90cc8a4e3150920c3f59eb492647dd6978d0c474471e9bfd5c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/cli/index.ts:6300 \u00B7 src/scripts/notify-hook/managed-tmux.ts:16 \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":"src/cli/index.ts"},"region":{"startLine":6300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b221e41470f49ed578019a9c71ffa0ae76287abb76ab818051208e02ebf78370"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/config/models.ts:318 \u00B7 src/config/models.ts:376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/models.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c403aecd8bcd78d2dd6786eb4ec798e413ae01796f198c06a53d37fbb2ff5f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/mcp/memory-server.ts:299 \u00B7 src/mcp/memory-server.ts:320 \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":"src/mcp/memory-server.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d6df7d5a05ce7dd3761019cb51973f0ccd3313b5e2e4994574281b6fafe149"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3 locations): src/notifications/dispatcher.ts:138 \u00B7 src/notifications/dispatcher.ts:306 \u00B7 src/notifications/dispatcher.ts:366 \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":"src/notifications/dispatcher.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c406e6982d900c5d9b475f7a82cb0137450d6d26e16efbdf3816b1048e48f2fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:7892 \u00B7 src/scripts/codex-native-hook.ts:8442 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":7892}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02768d6cd03d068d084cfe86e1a7ca25f78d7feb515d84b648950204ce3336a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:21544 \u00B7 src/scripts/codex-native-hook.ts:21688 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":21544}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95fec890b0a970d197f1c652af167b3010c8bc4abed2df693880a5d795745fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:1024 \u00B7 src/scripts/codex-native-hook.ts:1153 \u2014 the two spans are one implementation copied and then locally edited \u2014 154 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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"840bcb518a9ba547d09f96a3f8cbf756d0bcd5e4569ba96d8ff2402c106b308e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/scripts/generate-native-release-manifest.ts:13 \u00B7 src/scripts/verify-native-release-assets.ts:12 \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":"src/scripts/generate-native-release-manifest.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f3355e6770490a09f8fda6eb49cb02491f66cd11fbbb36ea3b4532058d6070"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/scripts/notify-fallback-watcher.ts:692 \u00B7 src/scripts/notify-fallback-watcher.ts:726 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a984c554df24ebf1d29d0acac5074f7852b53b8164afb6b02e8e751ab9a2fbe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/scripts/notify-hook/team-leader-nudge.ts:272 \u00B7 src/scripts/notify-hook/team-worker.ts:88 \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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"365cdf232c911fdf77c27562cdad4ad32768d92867d68c3c486c953bd3ff0fc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/subagents/tracker.ts:1531 \u00B7 src/subagents/tracker.ts:1561 \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":"src/subagents/tracker.ts"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4aae74f358bd4b43e76f115ce2444976c97a05aa864310434c71418d441fbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/team/api-interop.ts:1026 \u00B7 src/team/api-interop.ts:1056 \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":"src/team/api-interop.ts"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4754253003618832574db6f346ac5f9731dea3cfb5ff74799b3b09331fae84e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/team/runtime.ts:3027 \u00B7 src/team/runtime.ts:3057 \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":"src/team/runtime.ts"},"region":{"startLine":3027}}}],"partialFingerprints":{"codehealthFindingId/v1":"894001e41e23105c718765a88655dfdbc405cce7c2c225d3b39c7eefb957d0bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): src/cli/index.ts:5590 \u00B7 src/cli/index.ts:5711 \u00B7 src/cli/index.ts:5899 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":5590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f7b16c9630eaa3b28be0cf2cdd456aea8498be31f63eb74ee8cf5cfc02d80a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/cli/index.ts:7825 \u00B7 src/cli/index.ts:7905 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/index.ts"},"region":{"startLine":7825}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c66e498132809c7cce4366063c1b8d625fd68551e5478851c7c5d84a311b874"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:2916 \u00B7 src/cli/plugin-marketplace.ts:2970 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/plugin-marketplace.ts"},"region":{"startLine":2916}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f513034b2fb3a61857b3a63cfd3e8961f5b41a2327abd55038bb63c6582b39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/cli/setup.ts:1485 \u00B7 src/cli/setup.ts:1504 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/setup.ts"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbdfb066fbfaba58d84191f93c1ea22dd34129375071fb8c32ab9473bd8ade3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/cli/setup.ts:5743 \u00B7 src/cli/setup.ts:5783 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/setup.ts"},"region":{"startLine":5743}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d9094c0ffafa294db3209705d670d794bdd5858ee75c08feb8a550ae115b1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/config/quality-gates.ts:172 \u00B7 src/config/quality-gates.ts:195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/quality-gates.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"94673b61de0bfec00ea18d5866fe80442e9544f15eb373ce22b114ed4ed9c854"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/hooks/keyword-detector.ts:2619 \u00B7 src/hooks/keyword-detector.ts:2649 \u2014 both copies are in the same file, so extract the block into one function there 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/hooks/keyword-detector.ts"},"region":{"startLine":2619}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc219bb481a41b53b4856a97251ed882a8f6c3ec8e4fbfd599fb30ba46d4ace7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/hooks/keyword-detector.ts:3862 \u00B7 src/scripts/codex-native-hook.ts:21927 \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/hooks/keyword-detector.ts"},"region":{"startLine":3862}}}],"partialFingerprints":{"codehealthFindingId/v1":"015ca424fe22c975a07f923580b932dc3f5124fdb1d487876c3654e2db88abdb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/notifications/formatter.ts:108 \u00B7 src/notifications/template-engine.ts:34 \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":"src/notifications/formatter.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb9e789da64f2cd6f1ba0f5b4776c4c1b742835b47d4295ae740979a066afc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:16040 \u00B7 src/scripts/codex-native-hook.ts:19334 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":16040}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf2f951b6d7d86b91ba6b8188eb976a1057ab515d6d4b12e9ba0f04cc388ae2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:19447 \u00B7 src/scripts/codex-native-hook.ts:19491 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19447}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3124dda8d885b17991667945dceb00f27c95519d3b213e564794504cffc4638"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:21927 \u00B7 src/scripts/notify-hook.ts:497 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":21927}}}],"partialFingerprints":{"codehealthFindingId/v1":"2205abf29c10798b4334d3847a298706b690c70e153dc75e61d60669d778654c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/session-history/friction.ts:186 \u00B7 src/session-history/search.ts:73 \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":"src/session-history/friction.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"676a80ef07c2213531979f1c004acf6fb3218fb5a81fdccdadee9c662050a52d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/team/runtime.ts:6542 \u00B7 src/team/runtime.ts:6622 \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":"src/team/runtime.ts"},"region":{"startLine":6542}}}],"partialFingerprints":{"codehealthFindingId/v1":"158721d054101d57c6c5185197e70088e3da1fda4f0a88f9f225824b641983a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/team/scaling.ts:804 \u00B7 src/team/scaling.ts:914 \u2014 both copies are in the same file, so extract the block into one function there 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/team/scaling.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d9fbf2af6d2a63a924ff2c451b47b57bbc2b6369eec55c7638e3e93bc4c3c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): src/autoresearch/contracts.ts:48 \u00B7 src/autoresearch/runtime.ts:160 \u00B7 src/team/worktree.ts:85 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/autoresearch/contracts.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"488e83849bb213aecf2e84eb71876ed8cdd6daa92a7a9a402925fec92c2b553f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/autoresearch/runtime.ts:160 \u00B7 src/team/worktree.ts:85 \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/autoresearch/runtime.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"006baa601e68435c17d68c1383a4cd3923ed33a84d1bd57f52f02df2dbb34ea2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/cli/cleanup.ts:117 \u00B7 src/mcp/bootstrap.ts:97 \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/cli/cleanup.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1d0bbb03c46043c74d0e7bc85a4f789751bee5f6758859b4fd460edf0beef3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/config/generator.ts:3888 \u00B7 src/config/generator.ts:3927 \u2014 both copies are in the same file, so extract the block into one function there 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/config/generator.ts"},"region":{"startLine":3888}}}],"partialFingerprints":{"codehealthFindingId/v1":"4020d5a9787f4d40683476925cbef40e5d6084df85b7254a4a52e36e961d1430"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/hooks/session.ts:3489 \u00B7 src/hooks/session.ts:3640 \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":"src/hooks/session.ts"},"region":{"startLine":3489}}}],"partialFingerprints":{"codehealthFindingId/v1":"99904a7b290ee545543a1e630be79feec79aab1be58b5a9b50c56018056e5a4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/notifications/lifecycle-dedupe.ts:305 \u00B7 src/notifications/lifecycle-dedupe.ts:336 \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":"src/notifications/lifecycle-dedupe.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa82957111009ac11b3d97df9db38407a192e3f394b7041698b0a297efefca3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): src/question/autopilot-wait.ts:101 \u00B7 src/question/events.ts:58 \u00B7 src/question/state.ts:259 \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":"src/question/autopilot-wait.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d664fe12bd9def72bea78a04ad3c870f8e19bc9109f8e0175751d090a6d497"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:10598 \u00B7 src/scripts/codex-native-hook.ts:10629 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10598}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd6936a50de60a47ba256aaf7588a1214637a8fc121dca5b3ac7fcb585c222b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/team/worker-bootstrap.ts:1054 \u00B7 src/team/worker-bootstrap.ts:1130 \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":"src/team/worker-bootstrap.ts"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0d8232496fea538a0ffce46118cb592243c76122156bb779fe4034fcb722e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/cli/setup.ts:5281 \u00B7 src/cli/setup.ts:5329 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/setup.ts"},"region":{"startLine":5281}}}],"partialFingerprints":{"codehealthFindingId/v1":"719c62a4b471da061e2410cbbe7d7722d60dd057a597818a66e3dd6a181695a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/hud/authority.ts:201 \u00B7 src/hud/reconcile.ts:351 \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":"src/hud/authority.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"483c7d02bde281213b48d4412c12a23cff1ca2f066099c5c7c30ed9adc5cc8bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/mcp/memory-server.ts:223 \u00B7 src/mcp/memory-server.ts:244 \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":"src/mcp/memory-server.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fbbf7b5b8b99f94fc6b909ca171f576b064bae2f4a5764e81ec7e67911e459"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): src/question/autopilot-wait.ts:72 \u00B7 src/question/events.ts:36 \u00B7 src/question/state.ts:237 \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":"src/question/autopilot-wait.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdfd4e3c322dc180e19ae5534061f4b51dd3600af6a5406e3042f905ed74a36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:8146 \u00B7 src/scripts/codex-native-hook.ts:8174 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8146}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fea8333732f6c9dca8936371f667873d7d91084da1410bb02838b5d0eeb784"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:8204 \u00B7 src/scripts/codex-native-hook.ts:20487 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1304cca8140d69b423146c72f8411fd34c2ecb3f225ca4daa04cb9a54b9b858a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/scripts/hook-derived-watcher.ts:544 \u00B7 src/scripts/notify-fallback-watcher.ts:1799 \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":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6176fe850046b302b81cead19b407cebcffa3b65c84f716fbde73a661c265c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/subagents/tracker.ts:1486 \u00B7 src/subagents/tracker.ts:1598 \u2014 both copies are in the same file, so extract the block into one function there 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/subagents/tracker.ts"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2752cc5a3fdc91a9cb72455d4b1e343b873771a4fd183469c4c9b1d8f95f80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/team/approved-execution.ts:264 \u00B7 src/team/ultragoal-context.ts:186 \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":"src/team/approved-execution.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62e588c46a6e88a0fbaacb2f7ae55de0ef4ad5bbc8ca5780f1adb9cc6c0b7db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/team/tmux-session.ts:2678 \u00B7 src/team/tmux-session.ts:2784 \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":"src/team/tmux-session.ts"},"region":{"startLine":2678}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baf461e80d63bf367f2a5c6bb576673a9cadd4ab17b9b5e72187ff840540e6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/wiki/storage.ts:223 \u00B7 src/wiki/storage.ts:241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/storage.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6985b4a4d65a9ea9930019bf8b475aa3495d64c8caaeb00a326265534aef9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/adapt/index.ts:136 \u00B7 src/adapt/index.ts:196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/index.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cefce5c59c6afd730696d8fe03339591161d59daf00aabc94d746bd018ade1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/cli/doctor.ts:2632 \u00B7 src/cli/doctor.ts:2662 \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":"src/cli/doctor.ts"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bab5692d9c6814ea443662ff2031c23984d546b5022814e924abe2985c40dc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/cli/index.ts:1996 \u00B7 src/cli/index.ts:2042 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/index.ts"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"37df9b8b1768d3ae3a8c6d1be8ed1bd1b78890789a0a52888fda5c1d895d54e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/cli/index.ts:9902 \u00B7 src/cli/index.ts:9935 \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":"src/cli/index.ts"},"region":{"startLine":9902}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b1964360ad7ad9b9ac229ac6102ee51e915826b25d68cf9246a1220b9508c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/hooks/session.ts:2705 \u00B7 src/hooks/session.ts:3817 \u2014 both copies are in the same file, so extract the block into one function there 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/hooks/session.ts"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0f5dacdab8cfb41944876d142107f12c41f5cf2e0c2d2fd8c383469dd8cb4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/hooks/session.ts:3841 \u00B7 src/hooks/session.ts:3881 \u2014 both copies are in the same file, so extract the block into one function there 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/hooks/session.ts"},"region":{"startLine":3841}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73419072589c6dbae5fdf71eb676b3df521826257ed501e562c99b8d772ed67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/hud/authority.ts:260 \u00B7 src/hud/reconcile.ts:455 \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":"src/hud/authority.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ddd35971476ed730f0d85c834d393247eb2cfec6e39f2a8365c137fa87ce1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/notifications/reply-listener.ts:538 \u00B7 src/notifications/reply-listener.ts:698 \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":"src/notifications/reply-listener.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dda781c2a8df5d73f2493e1fc6ea8c9ce826e58324968f7e962669f8fb52e5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:11119 \u00B7 src/scripts/codex-native-hook.ts:11141 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0288e205ee54856f7d563a02383131a9b5fe3212d6590ff9418c351793f137"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:17973 \u00B7 src/scripts/codex-native-hook.ts:18018 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":17973}}}],"partialFingerprints":{"codehealthFindingId/v1":"3304a3e24d62605a9182e323210f7e326e41fc2d818414f98e2683241e8c1967"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/scripts/hook-derived-watcher.ts:409 \u00B7 src/scripts/notify-fallback-watcher.ts:1738 \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":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"158eec77fbe37458418a50e7b054724c246c4b48fc8550889f64d375d7155dac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/scripts/notify-hook/team-leader-nudge.ts:1082 \u00B7 src/scripts/notify-hook/team-leader-nudge.ts:1143 \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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"a705fc319ff783811f1173470fa396db448f956320b9207dfc61ac75059b8a20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/session-history/export.ts:27 \u00B7 src/session-history/transcript.ts:26 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/export.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"73383b98bc50c45a6e479cd03a19cacf8b231dd1b5b330534bfb11186bdb1df9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): src/team/mcp-comm.ts:200 \u00B7 src/team/mcp-comm.ts:333 \u00B7 src/team/mcp-comm.ts:434 \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":"src/team/mcp-comm.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8015c6ce6ffe67db8542b969d64e033a60268b243247781043fabb4044d616"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/team/notice-ledger.ts:307 \u00B7 src/team/notice-ledger.ts:327 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/notice-ledger.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c709bf6d7c78634738910048cfcf4fdef521fb9d652cc9d9451429982c5f40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/utils/package.ts:13 \u00B7 src/utils/paths.ts:395 \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":"src/utils/package.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf4febf55b42cd90db2ac6c2b5a4a95493257bedcfab4bd1c3d7f65a3fb7165"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): src/adapt/index.ts:110 \u00B7 src/adapt/index.ts:168 \u00B7 src/adapt/index.ts:233 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/index.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6d355066734500e9230b8f62279dadbd63b7a8188efce85aeb17bd6af9c299"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/cli/doctor.ts:3533 \u00B7 src/cli/doctor.ts:4164 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/doctor.ts"},"region":{"startLine":3533}}}],"partialFingerprints":{"codehealthFindingId/v1":"00983dfd79dba98f3c9c941001360bdd0280a494f87d6c769a59189d31e2b30c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/cli/doctor.ts:4201 \u00B7 src/cli/doctor.ts:4245 \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":"src/cli/doctor.ts"},"region":{"startLine":4201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb079a3c1f7c69e09fb8470eb26415e35011a74fbb68328082430dbeaa3eb21"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/cli/index.ts:4545 \u00B7 src/cli/index.ts:6812 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/index.ts"},"region":{"startLine":4545}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c42bb0678a8e76009808a1e8fc94baa0b1f9e596a589f8a7efb7103e234bd8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:1007 \u00B7 src/cli/plugin-marketplace.ts:1099 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/plugin-marketplace.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd40a6b1c2e377b897e15f4a4f1962716489e9f5a6499ac625d141a1b71eb03a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/cli/setup.ts:1303 \u00B7 src/cli/setup.ts:1341 \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":"src/cli/setup.ts"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d275893e42bfc7ccf10bf437a491a67695d7f1a67f9984036ad9314753eb8081"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/cli/setup.ts:3106 \u00B7 src/cli/setup.ts:3130 \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":"src/cli/setup.ts"},"region":{"startLine":3106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6187e6167707258f95f2dcc31a8507390611a067323e06d42e793e3a2e7d5962"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/config/codex-hooks.ts:921 \u00B7 src/config/codex-hooks.ts:951 \u2014 both copies are in the same file, so extract the block into one function there 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/config/codex-hooks.ts"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff36bab55a065e6521d0f46bd94dc03283d840c99ba709418020908fa2e5dfd3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/config/models.ts:214 \u00B7 src/config/models.ts:239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/models.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf35fded3f34fa6ebce68316a25e1abf0e3aa883c4d969b68495540c4dec8fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/hooks/session.ts:3383 \u00B7 src/hooks/session.ts:3427 \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":"src/hooks/session.ts"},"region":{"startLine":3383}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c2e8f453312422f6740d75d960cafece74553f7450c267181fbf887a145d4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/hud/tmux.ts:2024 \u00B7 src/hud/tmux.ts:2061 \u2014 both copies are in the same file, so extract the block into one function there 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/hud/tmux.ts"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb53ced24454093102200c124af0424821822ddcbd8722714b6fb69b98c0060c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:9821 \u00B7 src/scripts/codex-native-hook.ts:9844 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9821}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cdf6b7f892882c7e6c4420bd7e6a7e1d0cd44d5211be2b4f9de7674959249d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/scripts/notify-hook/team-tmux-guard.ts:518 \u00B7 src/scripts/notify-hook/team-tmux-guard.ts:534 \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":"src/scripts/notify-hook/team-tmux-guard.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"833b2bde5bc6b9d9f349c2d7f29b6d72573b2a006fad5e12e138a04139b34de4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/state/skill-active.ts:996 \u00B7 src/state/skill-active.ts:1051 \u2014 both copies are in the same file, so extract the block into one function there 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/state/skill-active.ts"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0ac9d3938d43beafd2c77479b1edca3242f7833e0677ba01046ecc5e949259"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/team/state.ts:2398 \u00B7 src/team/state.ts:2414 \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":"src/team/state.ts"},"region":{"startLine":2398}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ce7d51d444229a43a196be6b0109e6dabe48210dc9c25ba14e2aef8788cf66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/team/tmux-session.ts:1728 \u00B7 src/team/tmux-session.ts:1786 \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":"src/team/tmux-session.ts"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08a50c7fb70816c1cc7710a378ec06467bf44da30783ec1738de3224242d60f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): plugins/oh-my-codex/hooks/codex-native-hook.mjs:1150 \u00B7 plugins/oh-my-codex/hooks/codex-native-hook.mjs:1355 \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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a89e0a2d47748cacee2fdfa1aba5347028b096f1b6d50e46dd16b7f9726322b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/cli/doctor.ts:3769 \u00B7 src/cli/index.ts:4461 \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":"src/cli/doctor.ts"},"region":{"startLine":3769}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6eea4d1cb8d1556b58355eeee1dd85d7a9e724af8b14fccf76cedd4e242f825"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/cli/doctor.ts:3556 \u00B7 src/cli/uninstall.ts:1741 \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":"src/cli/doctor.ts"},"region":{"startLine":3556}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2c9f23377ae54c2b8bd4efe80b39d9bbb59345721ecd06deab1a1e3b6f7398"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/cli/hooks.ts:64 \u00B7 src/cli/tmux-hook.ts:68 \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":"src/cli/hooks.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"355a19d82c41b1ba3212725525e1043e4e3dbb655ceddbac7d94c1d6fe752108"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/cli/index.ts:5557 \u00B7 src/cli/index.ts:5668 \u00B7 src/cli/index.ts:5864 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":5557}}}],"partialFingerprints":{"codehealthFindingId/v1":"2393a5f75143a8ad546544d79f9b8328e615c98fcd0472eabf2855c7787c0b0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:3634 \u00B7 src/cli/plugin-marketplace.ts:3648 \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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3634}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ea7e888463dc976a5eab56932533e9ad52ed3ace245b54e92a188b8dcc41fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:3968 \u00B7 src/cli/plugin-marketplace.ts:3985 \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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3968}}}],"partialFingerprints":{"codehealthFindingId/v1":"a710659b2b85da887bf79658b00378113e671a061f6195494b536bdf51eacaa0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/cli/session-search.ts:88 \u00B7 src/notifications/temp-contract.ts:41 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 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":"src/cli/session-search.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b03aebc3f703dea1b38465c4691d66fa46702629c731d33279373c51041c46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/cli/uninstall.ts:2048 \u00B7 src/cli/uninstall.ts:2066 \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":"src/cli/uninstall.ts"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3475a1732c1e0ec73172fe01c44a257408a654730e3a8c9f774117666ed1fa7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/cli/update.ts:271 \u00B7 src/cli/update.ts:289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b530ac2108afa409f249b2c45fa3c4e4ae3f09395f9054041a151e27d6718ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/evals/astra-defaults/collector.ts:153 \u00B7 src/evals/astra-defaults/collector.ts:198 \u00B7 src/evals/astra-defaults/collector.ts:216 \u2014 all 3 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":"src/evals/astra-defaults/collector.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c4b3707544382130a636dd0559462447df42cf187576289f9dc16e1a674302"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/notifications/lifecycle-dedupe.ts:329 \u00B7 src/notifications/lifecycle-dedupe.ts:358 \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":"src/notifications/lifecycle-dedupe.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"16899ac0ccd9fc17a0b4b7cb3ca378a2f6758855855c5783c51bc7dbbc4d55d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/notifications/reply-listener.ts:684 \u00B7 src/notifications/reply-listener.ts:851 \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":"src/notifications/reply-listener.ts"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b29e2bf727fe6855a9917ef5d8adf4c419390153c624dab24a246acfaf470b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/ralph/contract.ts:62 \u00B7 src/runtime/run-outcome.ts:200 \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":"src/ralph/contract.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85d5d29a3de9e39ff3c6c319346bcfe9b355cca56cc1ff1b0d0685f3eec5336"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/scripts/build-api.ts:20 \u00B7 src/scripts/build-sparkshell.ts:20 \u00B7 src/scripts/test-sparkshell.ts:11 \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":"src/scripts/build-api.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"984ab2dd95e21995c1834601d0d99f194a8c183c892eb3092bb4df5ee98b48b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/scripts/codex-native-hook.ts:3102 \u00B7 src/scripts/codex-native-hook.ts:21554 \u00B7 src/scripts/codex-native-hook.ts:21698 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":3102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a13356611fcf947d0ca18cc239a4da84b5753169cab0f9898d2698196faa6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6 locations): src/scripts/codex-native-hook.ts:6008 \u00B7 src/scripts/codex-native-hook.ts:8061 \u00B7 src/scripts/codex-native-hook.ts:8534 \u00B7 src/scripts/codex-native-hook.ts:8577 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6008}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dc4e2662e9ab33e70a71d5d79ce2f340874fc6e6bedf6430daac15fd98e256"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:6478 \u00B7 src/scripts/codex-native-hook.ts:6552 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6478}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5cd2d60d23f379b32cc72628aabda1a69c4a10379d3628bc098a42b5c08931"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:8545 \u00B7 src/scripts/codex-native-hook.ts:8885 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8545}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad957b250c45f6e289c89fa5700bda0868ddf165bf8aaba555cfe7cacd32c84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:19550 \u00B7 src/scripts/codex-native-hook.ts:19588 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19550}}}],"partialFingerprints":{"codehealthFindingId/v1":"c190eaa99755337166e54f75cd4f980af6545e97afe042aec915c4e49d17b2ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/scripts/notify-hook/tmux-injection.ts:338 \u00B7 src/scripts/notify-hook/tmux-injection.ts:362 \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":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca841d0e1d44c23f5efb7debebcdbb3f5ec5e0178aca9db6d856bfbf320b368"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/scripts/smoke-packed-install.ts:4636 \u00B7 src/scripts/smoke-packed-install.ts:4650 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/smoke-packed-install.ts"},"region":{"startLine":4636}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb7b26f9fabf83f398099cb8c0577db6a79261a09967172d70fa7a17bb8bb3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/session-history/friction.ts:103 \u00B7 src/session-history/search.ts:172 \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":"src/session-history/friction.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5201239bfa0d0b299f34ca558f69060469c87b754ad1424d37e2ad5e2a4ca4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/team/tmux-session.ts:4134 \u00B7 src/team/tmux-session.ts:4215 \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":"src/team/tmux-session.ts"},"region":{"startLine":4134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be2332146baa551cea552c91c15b53c94e5e4748514c95e73529bb03ac67197"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/adapt/index.ts:427 \u00B7 src/adapt/openclaw.ts:374 \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":"src/adapt/index.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c86acf8b6db076fc841213894cb9c194dc9810421f6dfce8601851224279e96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/cli/index.ts:859 \u00B7 src/cli/index.ts:4182 \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":"src/cli/index.ts"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"986aefce5539e10654c244be746bd567664268bb3735174ce893c5db87957ca7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/cli/index.ts:6735 \u00B7 src/cli/index.ts:6757 \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":"src/cli/index.ts"},"region":{"startLine":6735}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc547caff29c6d24257798e7f6c7693fc53e7cabc7e31658e2c618f06eb42f52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/cli/index.ts:8776 \u00B7 src/cli/index.ts:8792 \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":"src/cli/index.ts"},"region":{"startLine":8776}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f0eb2e24e79d8aee441a3f7d8b2fd00d9764562a4a7ed6957b9c831c3a936d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/cli/index.ts:9853 \u00B7 src/cli/index.ts:9951 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/index.ts"},"region":{"startLine":9853}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b841154019815afd56a61b05ec4ec12fc565b94347d1925be636fff47f016ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:4057 \u00B7 src/cli/plugin-marketplace.ts:4354 \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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e3f885951c230db40e6f1b853146ac44bf616a4aee4f3e2c89945d2531299c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/cli/setup.ts:3079 \u00B7 src/cli/setup.ts:3103 \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":"src/cli/setup.ts"},"region":{"startLine":3079}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ce5e03cc551153b45553d61d9336a077fb6983395f780346b4ffb21ef00a4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/cli/setup.ts:4777 \u00B7 src/cli/setup.ts:5623 \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":"src/cli/setup.ts"},"region":{"startLine":4777}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e2a411cdc70af637339c9f972fa10eda140976bd1086c4e1d81f6a81db6ed4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/cli/setup.ts:6093 \u00B7 src/cli/setup.ts:6285 \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":"src/cli/setup.ts"},"region":{"startLine":6093}}}],"partialFingerprints":{"codehealthFindingId/v1":"556320c14c8ecdf06dfd38c20a7d93dbff62e0354d2f547f0cdc35a0477f098b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/config/codex-hooks.ts:1342 \u00B7 src/config/codex-hooks.ts:1731 \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":"src/config/codex-hooks.ts"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8ae80c2b5c4d8b7fd48ef705a6b1039d65d757be2c07a0930c79bc2feac13f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/config/generator.ts:952 \u00B7 src/config/generator.ts:3140 \u2014 both copies are in the same file, so extract the block into one function there 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/config/generator.ts"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc92844bbd66b2eca9f910aee7c1549cd0a2677d212d80bd9f610221c67849d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/config/team-mode.ts:75 \u00B7 src/config/team-mode.ts:90 \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":"src/config/team-mode.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c0d77daf85c90379a68fd5273ee26729cf2b9075ce64c86dcb441f68bfa058"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/hooks/extensibility/sdk/runtime-state.ts:14 \u00B7 src/notifications/lifecycle-dedupe.ts:42 \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":"src/hooks/extensibility/sdk/runtime-state.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"075a2a0bbbc291ddd3ed4b5cffacb3c521dd513859fd4e216b9be5709cf6ae0f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/hooks/keyword-detector.ts:1530 \u00B7 src/hooks/keyword-detector.ts:1562 \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":"src/hooks/keyword-detector.ts"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c33687dc09920c72eb79c99dcae38a696bf46518bf879b1bfdc4190dde4733"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/hud/tmux.ts:957 \u00B7 src/hud/tmux.ts:1720 \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":"src/hud/tmux.ts"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d296f08ff99415c25540bf58187ef7d5078b9f0739142f47bd249ff27afc635"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/hud/tmux.ts:2077 \u00B7 src/hud/tmux.ts:2110 \u2014 both copies are in the same file, so extract the block into one function there 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/hud/tmux.ts"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec6725bc3e8b1f62b9244ccb9ad40ab87399a0f1737d0221393d27a04918818"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): src/mcp/code-intel-server.ts:449 \u00B7 src/mcp/memory-server.ts:161 \u00B7 src/mcp/trace-server.ts:234 \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":"src/mcp/code-intel-server.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d18e1da7903b6b0178589696798ce6f027a69c757c3362a25022dc73fc4f43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/modes/base.ts:335 \u00B7 src/modes/base.ts:359 \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":"src/modes/base.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"91583aac918127968160bd125f4b6ebc7c0a0d8913f357a886e275ea5cb57b2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/modes/base.ts:529 \u00B7 src/state/operations.ts:1012 \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":"src/modes/base.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"b688dfc02ae98076623bf48e146f22547b798827b697d25a28fcc254d3128b9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6 locations): src/question/autopilot-wait.ts:119 \u00B7 src/question/events.ts:78 \u00B7 src/question/state.ts:279 \u00B7 src/scripts/notify-hook/team-dispatch.ts:311 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 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":"src/question/autopilot-wait.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e488db395eeabd28a2668b5beb9a7677fddecb8e5db45cd20b84a72655e3a91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/question/renderer.ts:743 \u00B7 src/question/renderer.ts:764 \u2014 both copies are in the same file, so extract the block into one function there 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/question/renderer.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa52aff6b7b912e912d994c095ec8582bbe39b36d79ff35367665b303cfc142c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:1754 \u00B7 src/team/worker-bootstrap.ts:190 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67f832894559e08825d6301ed4b86f3ed182ddc5b7aa0364caccb6fce0ef1f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:2094 \u00B7 src/scripts/codex-native-hook.ts:21177 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":2094}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f400ca746d989c384cce3bebbd3d7af39a9bd63542f23715b1a6b9e1270975"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): src/scripts/codex-native-hook.ts:7264 \u00B7 src/scripts/codex-native-hook.ts:7888 \u00B7 src/scripts/codex-native-hook.ts:8439 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e891d54d2874488f706e2e4d76f6e0e0197445bfea069a343b9bbe7e25b2c5c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:8120 \u00B7 src/scripts/codex-native-hook.ts:8156 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8120}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d75c0e03a92c62106a1072fb3a0068634524fe253d981cfc3fbc711d24038c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:8527 \u00B7 src/scripts/codex-native-hook.ts:8570 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8527}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d58d550b2d8c43123823859cfa8e874ea8eaec3271632c7658b6c9014b02391"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:10778 \u00B7 src/scripts/codex-native-hook.ts:10803 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10778}}}],"partialFingerprints":{"codehealthFindingId/v1":"47aa4ba859c9d74db90cbc403180c6d69822fc787aa553b462feda38c5df3b26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:13320 \u00B7 src/scripts/codex-native-hook.ts:13383 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cccf72880b95ab681fdfc91414bd799d64ade316dbaf7cfe2645438d8d2490"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): src/scripts/notify-hook/team-dispatch.ts:286 \u00B7 src/team/state/dispatch-lock.ts:36 \u00B7 src/team/state/locks.ts:228 \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":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"353087b393cda367b8cd26f642c34145db55f22a7cf5390095a76bc97b764b77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/scripts/notify-hook/team-worker-stop.ts:308 \u00B7 src/scripts/notify-hook/team-worker-stop.ts:336 \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":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7540b6b8ccc57f27982072be55eaa879f3f013a3628f771d28357370d097bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/scripts/smoke-packed-install.ts:3093 \u00B7 src/scripts/smoke-packed-install.ts:4643 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/smoke-packed-install.ts"},"region":{"startLine":3093}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc5244fb5c8912de4b434e63b0299e707f2fde5b91e782bce6eccfe6ef0e0ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/team/approved-execution.ts:339 \u00B7 src/team/approved-execution.ts:359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/approved-execution.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"15135768a63f1decbca1e3ff6a94d881273019bf06fcfb4a8fbd8a757c0a1801"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/team/leader-activity.ts:113 \u00B7 src/team/progress-evidence.ts:19 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/leader-activity.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ddf3a4f8b4642a9bd81fdf2671a1a3b39a9a65d83007d3b873ec8c53733f17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/team/mcp-comm.ts:292 \u00B7 src/team/mcp-comm.ts:411 \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":"src/team/mcp-comm.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"60574a56d4d35fc9155e26eadfa550f2d746990acf85705eb16631bd9a6d3ced"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/team/model-contract.ts:340 \u00B7 src/team/model-contract.ts:353 \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":"src/team/model-contract.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bb603733d7babefb79f9807bf14c56271fa146ab212945927fdcc5698fe576"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/team/pane-status.ts:285 \u00B7 src/team/pane-status.ts:298 \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":"src/team/pane-status.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa6bd22c926eb0095d2055e814e4b868a8b3bc3c1306f93d1df0d9f888fdd27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/team/pane-status.ts:454 \u00B7 src/team/pane-status.ts:544 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/pane-status.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a197be4851ab3fff85ed040f5b95ba190631662f2cf5d2c349b8d1352b2aeef4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/team/scaling.ts:400 \u00B7 src/team/worktree.ts:279 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"43525ff8e839107c9394f61b698d09b048b95ad89de927ee884eb3b6a656b69c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/team/tmux-session.ts:1134 \u00B7 src/team/tmux-session.ts:1172 \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":"src/team/tmux-session.ts"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9af9af8a593ed911138411ce2b4648ee1402ddb96efb4728d97bdff850a88d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/team/tmux-session.ts:2056 \u00B7 src/team/tmux-session.ts:2179 \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":"src/team/tmux-session.ts"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"2689128dc0535e8add23113bea21b3cedb9e6bcbee427f9d6112013c7067a8d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/ultragoal/artifacts.ts:1406 \u00B7 src/ultragoal/artifacts.ts:1447 \u2014 both copies are in the same file, so extract the block into one function there 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/ultragoal/artifacts.ts"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d308c8b8e96adcdac715906f9fe05f90eb5b853d52ad47bcbd456784cb5f4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): src/adapt/index.ts:77 \u00B7 src/adapt/index.ts:123 \u00B7 src/adapt/index.ts:181 \u00B7 src/adapt/index.ts:246 \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":"src/adapt/index.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"553a3db8dbc9646f87b78a45ed702ec2e641fc764d7033bdc177e0f4c93da0b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/adapt/index.ts:162 \u00B7 src/adapt/index.ts:300 \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":"src/adapt/index.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe80a6d4cc1dea88c5dab8965c57dc8bab924cf077d1bdc4d4886f489c2c0a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/cli/doctor.ts:3061 \u00B7 src/cli/doctor.ts:3444 \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":"src/cli/doctor.ts"},"region":{"startLine":3061}}}],"partialFingerprints":{"codehealthFindingId/v1":"694011c2d936263302704dc5ae471dcc0cf26a9f212f33ee7bbfb4d50ef5db56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/cli/index.ts:1941 \u00B7 src/cli/index.ts:2201 \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":"src/cli/index.ts"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb7bb1ac48a4a827fe8290a5a07f5ff9ebd0de890c44d0407bae4dc51e11a05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6 locations): src/cli/index.ts:5185 \u00B7 src/cli/index.ts:5217 \u00B7 src/cli/index.ts:5229 \u00B7 src/cli/index.ts:5275 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"src/cli/index.ts"},"region":{"startLine":5185}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa03928c5a76ceb787652b8e68180bd74d7dab0f1db6f9a5831524e54c45da3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/cli/index.ts:8593 \u00B7 src/cli/index.ts:8607 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/index.ts"},"region":{"startLine":8593}}}],"partialFingerprints":{"codehealthFindingId/v1":"c652163f07fd671d01aab93cf0214a73720bc4ed5d6a4452ff679bd67c319985"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:1357 \u00B7 src/cli/plugin-marketplace.ts:1546 \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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"538d1d028dc8e333e77068d8a2267c7a9676ddf343a2a24be61f404a3f25807d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/cli/ralplan.ts:241 \u00B7 src/cli/ralplan.ts:270 \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":"src/cli/ralplan.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b046611a5cde2d9834702283f5b3bac42815e686e34e571b59ac709f6c141c98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/cli/setup.ts:5728 \u00B7 src/cli/setup.ts:5763 \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":"src/cli/setup.ts"},"region":{"startLine":5728}}}],"partialFingerprints":{"codehealthFindingId/v1":"d057111f144c7c311858d52c5a8cf23c21ba9f682ebdb0f119d9afe67d35479a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/cli/team.ts:204 \u00B7 src/team/runtime.ts:5927 \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":"src/cli/team.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"93418fb199915ff4673a3f63a79176c36e0d9d20cbdb299023a3a9e83e4b95c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/config/codex-hooks.ts:1325 \u00B7 src/config/codex-hooks.ts:1713 \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":"src/config/codex-hooks.ts"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"640814519650f15cc82862cf4615c4eab402f5f7c1e1bb9146246df4ec0827f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/hooks/keyword-detector.ts:2606 \u00B7 src/hooks/keyword-detector.ts:2635 \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":"src/hooks/keyword-detector.ts"},"region":{"startLine":2606}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e010f40c13fe91a1e88824bb248c557180e6fc393cc063fe14c3e4047cedbd8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/hooks/keyword-detector.ts:3650 \u00B7 src/hooks/keyword-detector.ts:3679 \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":"src/hooks/keyword-detector.ts"},"region":{"startLine":3650}}}],"partialFingerprints":{"codehealthFindingId/v1":"b818234d35fe6c8fbabd758d65cafe3cda8401fab64b9d6deb878e08fb5087e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/hud/reconcile.ts:121 \u00B7 src/hud/reconcile.ts:159 \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":"src/hud/reconcile.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02c5430c4990e93780b3a89e06c1b7a6b2ad5de3fd75fcf380c6a0d41526d16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/mcp/memory-server.ts:439 \u00B7 src/mcp/memory-server.ts:452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/memory-server.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb5cec59ae3495f47239072168f9addc880eff406fef5e51c70da71fa6bd9a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/modes/base.ts:572 \u00B7 src/modes/base.ts:598 \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":"src/modes/base.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b6a982c0a615a343afe3b0875ae4852afbaa939165cb2328bc24584fa7c068"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/notifications/lifecycle-dedupe.ts:91 \u00B7 src/ralph/persistence.ts:68 \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/notifications/lifecycle-dedupe.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcd35e7ff084afd4663d4ef6ed336e0baaf95198c4233fbbb9dd6cfff91455c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/notifications/session-registry.ts:67 \u00B7 src/scripts/notify-fallback-watcher.ts:84 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/session-registry.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0234c199ba3cdeca74b13c1924f08175bff9380a55ac4247eb950d92b295d4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/question/renderer.ts:538 \u00B7 src/team/team-identity.ts:86 \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":"src/question/renderer.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"0394be8d2678e5adc6cbef0f13a5e1c1679d8b9c2ae34f4e724d25724a1e5597"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/question/ui.ts:385 \u00B7 src/question/ui.ts:439 \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":"src/question/ui.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d914da655c1efd7648f24a1c50bb7ec48aadb7955ca501644055258ac8b4a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:1716 \u00B7 src/scripts/codex-native-hook.ts:1734 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d3595241d88d3e011f63dceee38963ebc2bdb6644ecc51b705021ee4299429"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:11316 \u00B7 src/scripts/codex-native-hook.ts:11333 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11316}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6264fa23eb9c5980ddebd92c3784d11f6142204c02cd6edc8ca0c49a74018e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:22644 \u00B7 src/scripts/codex-native-hook.ts:22675 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":22644}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffbbc61edaa3cc0da09b2ee988dfc87b7d14ce621d394c0d4aa64ab7d4ca0d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/scripts/hook-derived-watcher.ts:65 \u00B7 src/session-history/search.ts:185 \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":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6248fc94d87acae58c176ef33f5ce46f55866ac5cb7ad70d55a7b84f1fdb8a7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/scripts/notify-fallback-delivery.ts:195 \u00B7 src/scripts/notify-fallback-delivery.ts:213 \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":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a7ab74bb97d804d9029cc3a8e9efc1643af93a16f2bdb73fa1be0110f35ae8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/scripts/notify-hook/tmux-injection.ts:229 \u00B7 src/scripts/notify-hook/tmux-injection.ts:247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"97624986b93511b9908fdc4c1c53d6dfca4394ee840b09918e9901faae6008ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/scripts/notify-hook/visual-verdict.ts:105 \u00B7 src/scripts/notify-hook/visual-verdict.ts:156 \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":"src/scripts/notify-hook/visual-verdict.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7172b6343e2c114d1c0416c1585d2a376078763386d299808dcda07a7b0e36d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/scripts/smoke-packed-install.ts:2912 \u00B7 src/scripts/smoke-packed-install.ts:2924 \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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":2912}}}],"partialFingerprints":{"codehealthFindingId/v1":"622b3ed13023772c3af9a0d2fb9abdf0928ee4a727864e8e401f12b31a0ec02c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/state/operations.ts:887 \u00B7 src/state/operations.ts:899 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/operations.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13bec8e48d9fd7f7872c7ff236ac1b37750e6df4f84e1c5c58cd21ff27d46c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/subagents/role-routing-marker.ts:71 \u00B7 src/subagents/tracker.ts:853 \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":"src/subagents/role-routing-marker.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"63964a036c8bbdbff27a84eaac3bbba44719e5a00b1b9d0f0ecf3263e0be1870"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/team/coordination-protocol.ts:207 \u00B7 src/team/coordination-protocol.ts:227 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 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":"src/team/coordination-protocol.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddeb097a17a40dfb4a679c56efabf5889beced07c376af9ec2568a632805f8bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/team/pane-status.ts:562 \u00B7 src/team/pane-status.ts:574 \u00B7 src/team/pane-status.ts:592 \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":"src/team/pane-status.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5a69d6237b3e9d6a073497a2deab9759cd88a97f3009a9bd469d0ee80d80cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/team/tmux-session.ts:2567 \u00B7 src/team/tmux-session.ts:2682 \u00B7 src/team/tmux-session.ts:2788 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/tmux-session.ts"},"region":{"startLine":2567}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb16f955757b6344ddca3a75faf63ef6422d110de124951e01df2dfe7a9592e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/team/worktree.ts:421 \u00B7 src/team/worktree.ts:482 \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":"src/team/worktree.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"92519bf3a634966f0233249cb36efd61cf52f5f10c506ee66808e98aceeb3054"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/ultragoal/artifacts.ts:1812 \u00B7 src/ultragoal/artifacts.ts:1865 \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":"src/ultragoal/artifacts.ts"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7e25ef40dc8286798fe76075c0df476c2eeb0103607958a77d77269a63fd20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/utils/file-durability.ts:38 \u00B7 src/utils/file-durability.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":"src/utils/file-durability.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4d9ff864219251bb8a191cd958ec20c69cfbace0b82aaf4f54257a12b18dcc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/catalog/installable.ts:5 \u00B7 src/cli/setup.ts:300 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/catalog/installable.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f61ce2e8e667ac71dbd264b75c5ad81a9faf2befe888737d01551204d90f353"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/cli/autoresearch.ts:98 \u00B7 src/cli/explore.ts:83 \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":"src/cli/autoresearch.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfcc059b9e71e2059399d123aad72ce71e5fa86cf1e652fa2bab62b37cbe26e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/cli/index.ts:4432 \u00B7 src/cli/index.ts:6566 \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":"src/cli/index.ts"},"region":{"startLine":4432}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a33df54f51416a7e89cd75dbed1fb2019b8ed94bf8783d6c0ea001be5edcff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/cli/index.ts:9773 \u00B7 src/cli/index.ts:9868 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/index.ts"},"region":{"startLine":9773}}}],"partialFingerprints":{"codehealthFindingId/v1":"590f7df8cf12188aaee444d68160846190db16091d33bdce72ff1bbed0e31e59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:261 \u00B7 src/cli/plugin-marketplace.ts:290 \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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c7ec2e508321b4c2d8730099b52af1d91cda3c6871a80f1f66ddc5c8d7fcc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/cli/setup.ts:5893 \u00B7 src/cli/setup.ts:5933 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/setup.ts"},"region":{"startLine":5893}}}],"partialFingerprints":{"codehealthFindingId/v1":"147364959a3d7d5adaf63add5755ffeb9f2189290b185a16dc62096148a60d83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/cli/sparkshell.ts:110 \u00B7 src/cli/sparkshell.ts:145 \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":"src/cli/sparkshell.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e07d475e9a7bf8023dee42f5ddefc77b54f5989b1b5a11616f0b565ff3beba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/cli/star-prompt.ts:82 \u00B7 src/cli/update.ts:547 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/star-prompt.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41f584a0586dc7b87ca5e7fa25265584f346f89e6a83ffe9df6137a2ebbecbe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/cli/team.ts:568 \u00B7 src/ralph/persistence.ts:55 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ce58d11d1c318770e07d9ad04979c5ab125925944c18032037e05b761932f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/cli/uninstall.ts:738 \u00B7 src/cli/uninstall.ts:793 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24e172fd7c9461a9398b466b97d8ab370d6af1e6101a1fe72e3a09cf41df6c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/config/codex-hooks.ts:2935 \u00B7 src/config/generator.ts:2908 \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":"src/config/codex-hooks.ts"},"region":{"startLine":2935}}}],"partialFingerprints":{"codehealthFindingId/v1":"803b65494b8a662be401de0f9f5f721d794b0de858d54a3d1bfb5c2026afa33b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/config/generator.ts:4157 \u00B7 src/config/generator.ts:4224 \u2014 both copies are in the same file, so extract the block into one function there 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/config/generator.ts"},"region":{"startLine":4157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6b0b36020ed4ea8290c1b318715b727c8c72b051a09e99ec3041b09ab9298a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/hooks/agents-overlay.ts:165 \u00B7 src/hooks/agents-overlay.ts:192 \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":"src/hooks/agents-overlay.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59fe69f797696691371c59c16ab2e9d6d085d17aef86e23c7370387961100ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/hooks/session.ts:2478 \u00B7 src/hooks/session.ts:2513 \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":"src/hooks/session.ts"},"region":{"startLine":2478}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bcf3d34d0e24d0205d92d41cf64c57322f4b4df7fd0194c1e102640bb5b747"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/notifications/session-registry.ts:212 \u00B7 src/notifications/session-registry.ts:224 \u2014 both copies are in the same file, so extract the block into one function there 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/notifications/session-registry.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"6169aface237579204bfef7b0e31d80028658efb4fe357e601af06cb9d58c454"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:5462 \u00B7 src/scripts/codex-native-hook.ts:13117 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5462}}}],"partialFingerprints":{"codehealthFindingId/v1":"f247c3107945f15f67e9bd9d3acdf2e3af8ee59e3031efda81186e2adacad048"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:7106 \u00B7 src/scripts/codex-native-hook.ts:7124 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7106}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bf5811e192372080a369fb7baadd494b3ed0f8687f605da5e36eb9971dc12a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:8883 \u00B7 src/scripts/codex-native-hook.ts:19461 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8883}}}],"partialFingerprints":{"codehealthFindingId/v1":"162bc30932dbe9bc4536d0387888161b04df9934a94ef6ea87f475781e92733a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:15548 \u00B7 src/scripts/codex-native-hook.ts:15562 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15548}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5d2043935675c7276fe4895e1edec31e81e8b516ff5cacef2060f62088ca5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/scripts/notify-hook/team-leader-nudge.ts:105 \u00B7 src/scripts/notify-hook/team-worker-stop.ts:28 \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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7f3ca6f83073ce61a684bd2003c7d0d88226d47bf19db320d7f56c7bda83f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/scripts/notify-hook/team-worker-posttooluse.ts:96 \u00B7 src/team/state-root.ts:154 \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":"src/scripts/notify-hook/team-worker-posttooluse.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"63601884fb623a6350c38dc5025dcc4ef970e3f11a129f8df918b8ddb5d8b4a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/team/exact-pane.ts:74 \u00B7 src/team/exact-pane.ts:101 \u2014 the two spans are one implementation copied and then locally edited \u2014 91 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":"src/team/exact-pane.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ae250c15305e05136dd57d123f8cb343c30d87913c0abe4f2f3a96feb2ee44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/team/pane-status.ts:604 \u00B7 src/team/pane-status.ts:634 \u00B7 src/team/pane-status.ts:646 \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":"src/team/pane-status.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e866abd2ce975ed91ef9ce451d637e63329d1f23a9019f0357fd81c32d9ed9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/team/runtime.ts:1822 \u00B7 src/team/runtime.ts:1850 \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":"src/team/runtime.ts"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0630bf1159028682bdf958d1122ea48abacbcef9f1bd32781d89b973bd176b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/team/runtime.ts:2482 \u00B7 src/team/runtime.ts:2517 \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":"src/team/runtime.ts"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ab93ea88660f5e289ea3296fc0474fb94d6fcc17e46af5bc9b453ce1d8ee14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/team/runtime.ts:2810 \u00B7 src/team/runtime.ts:2860 \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":"src/team/runtime.ts"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dc7d34e241e034a061db0852cbb40d77425f19194b2aed54843f05524ebe59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/team/runtime.ts:3485 \u00B7 src/team/scaling.ts:345 \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":"src/team/runtime.ts"},"region":{"startLine":3485}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cca9f02366238316c68f1e71d85ce52a84def9332f8b7aef2d9b1b90f2e10fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/team/runtime.ts:6576 \u00B7 src/team/runtime.ts:6666 \u00B7 src/team/scaling.ts:1413 \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":"src/team/runtime.ts"},"region":{"startLine":6576}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0bbb647722cd215b0587363580caf0a41e37c57445f085aa80a34b9d3d5902"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/team/state.ts:1609 \u00B7 src/team/state.ts:1625 \u2014 both copies are in the same file, so extract the block into one function there 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/team/state.ts"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f081f1b47a367001c3f5f6b4b80683f0860dc75f7804b5d02faab29cff597a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/team/state/dispatch.ts:427 \u00B7 src/team/state/dispatch.ts:451 \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":"src/team/state/dispatch.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"500693979b5d76600154c3748c52c98ebfe4c219c0bc648a21c1405130fb1a8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/team/tmux-session.ts:3102 \u00B7 src/team/tmux-session.ts:3222 \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":"src/team/tmux-session.ts"},"region":{"startLine":3102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3808f2025588c0e07e44703850412a2b4ae72a84af9c4b76cacdb3206deaec2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/team/tmux-session.ts:3168 \u00B7 src/team/tmux-session.ts:3194 \u2014 both copies are in the same file, so extract the block into one function there 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/team/tmux-session.ts"},"region":{"startLine":3168}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4626d7fc42e8506c4c461ce06a9ecaf88c182cf22db47f342cb7ede3a554fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/team/tmux-session.ts:4026 \u00B7 src/team/tmux-session.ts:4070 \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":"src/team/tmux-session.ts"},"region":{"startLine":4026}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf47f472e8a64da2695ef699ff837a2ad2341a5df8fb57bd8c358ab36fcebe6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/utils/platform-command.ts:314 \u00B7 src/utils/platform-command.ts:342 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/platform-command.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"59914195329a7ad0e0a426d08985090124d3467a63f5d00ff75445f8fe3c9dd5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): plugins/oh-my-codex/hooks/codex-native-hook.mjs:1126 \u00B7 plugins/oh-my-codex/hooks/codex-native-hook.mjs:1338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c5e1c68488c093b16fed41d256e2c8173423478bff06f3080260383786cd7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/cli/cleanup.ts:360 \u00B7 src/cli/doctor.ts:1293 \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":"src/cli/cleanup.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efadc1f41387dd8fcd21e44781ddc127d1c3601c7c586ef0b2180f4644236c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/cli/doctor.ts:1077 \u00B7 src/cli/doctor.ts:1098 \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":"src/cli/doctor.ts"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3da24e27bee1a361f7f8635fee4e97766d0d0c03f205d6a523720e0cb5da8fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/cli/doctor.ts:1945 \u00B7 src/cli/doctor.ts:2063 \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":"src/cli/doctor.ts"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"9958a4f39ecdf56f2f8cacc9d3192ef8922174cf73f3ae7344fb701767ad0b69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/cli/index.ts:5634 \u00B7 src/cli/index.ts:5855 \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":"src/cli/index.ts"},"region":{"startLine":5634}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed39cdac9e9c14c9123cc1b4f446b02690344d68de8904f08966947201b4189"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:599 \u00B7 src/cli/plugin-marketplace.ts:610 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a41c3e74b0abdca4024810407ecff64b2d49014ef42be71abdbd67965d92d0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:802 \u00B7 src/cli/plugin-marketplace.ts:817 \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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e23b251e5c49d99c410a1230057f823b8e6211f6033e51d3bea14a45b1477a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:2460 \u00B7 src/cli/plugin-marketplace.ts:2655 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/plugin-marketplace.ts"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fcf32edd49307badc71642ad475abc5452424e666883371ac8c9a772e2bcda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:4457 \u00B7 src/config/generator.ts:3560 \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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":4457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6910b39896614f5532f99b5728f4bbe9649f00fad6322ae57fbf54cab36f6e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/cli/ralph.ts:86 \u00B7 src/scripts/smoke-packed-install.ts:1606 \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/cli/ralph.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd574f13b9eac95478f882c68283d5be445408d53fae05d50ebfdea8721eb65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/cli/session-search.ts:170 \u00B7 src/cli/session-search.ts:227 \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":"src/cli/session-search.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf6fff4f998c0a0f8406ebeeebabbb9b484d487c63dac5574380dc97d36f392"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/cli/setup.ts:3192 \u00B7 src/cli/update.ts:550 \u2014 the two spans are one implementation copied and then locally edited \u2014 85 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":"src/cli/setup.ts"},"region":{"startLine":3192}}}],"partialFingerprints":{"codehealthFindingId/v1":"576af387b530a0808a3d5b53f1e38d5fce1958ec21fb24bcefe256c4be6834dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/cli/team.ts:540 \u00B7 src/cli/team.ts:554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"65559dfc68b6ad69171b06c17a108fb04e11d0bed5c8a9ac553fe134aca38821"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/cli/tmux-hook.ts:273 \u00B7 src/cli/tmux-hook.ts:287 \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":"src/cli/tmux-hook.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"5455b87093f80e6fe4e45dc441fc89545c4e44c903988354e89241eb936c91a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/hooks/keyword-detector.ts:3049 \u00B7 src/hooks/keyword-detector.ts:3060 \u2014 both copies are in the same file, so extract the block into one function there 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/hooks/keyword-detector.ts"},"region":{"startLine":3049}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3f6c7661a16ca5bab8bbd77e11c8899fc8e596735b811847b6c9afbea3cd55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/hooks/keyword-detector.ts:3669 \u00B7 src/hooks/keyword-detector.ts:3723 \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":"src/hooks/keyword-detector.ts"},"region":{"startLine":3669}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a5f5fa7593cbf77426482ce92a3e70985f4ba676e40f2b7c2216e5163de4fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/hooks/session.ts:2370 \u00B7 src/hooks/session.ts:2395 \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":"src/hooks/session.ts"},"region":{"startLine":2370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b13fb7cbe651ae21cc7c67f191aa1e2a24a9d08cc6f206d89de36c521c4d115"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/modes/base.ts:219 \u00B7 src/modes/base.ts:280 \u2014 both copies are in the same file, so extract the block into one function there 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/modes/base.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ea4f80612aa4e5f05dd37a1fdb18604819a71a2fdda393fc126a0b7ba96cd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/notifications/formatter.ts:187 \u00B7 src/notifications/formatter.ts:221 \u00B7 src/notifications/formatter.ts:244 \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":"src/notifications/formatter.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf4b959826925bdd5927e3090d31a44abb1df627e24924f120dabbdd63e6684"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/planning/artifacts.ts:490 \u00B7 src/planning/artifacts.ts:505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/planning/artifacts.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"413f4232287ef4d8ffb1a35f500b252adfacc3587fd990081fc898aa0b7b64df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/question/ui.ts:215 \u00B7 src/question/ui.ts:352 \u2014 both copies are in the same file, so extract the block into one function there 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/question/ui.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e080a4478f5ae4c3a4ff545721a5a8a4bfb50b2a34f279ad11b731afbea8640"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/runtime/run-state.ts:147 \u00B7 src/state/operations.ts:157 \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/runtime/run-state.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b26fe521723b6772478a1f120eae2e60f7f835bb7e71c18fa0f5af3b0ed8377"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:2625 \u00B7 src/scripts/codex-native-hook.ts:2637 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b08afdf32f48320181fe796b9f1a73110d0d0702b22e287d92c6c88cbb83001"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:4408 \u00B7 src/scripts/codex-native-hook.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":4408}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c1b9982e90189055aa2b780f9490b15133b7edd8f2516e705c24ffd47e1bf5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:7066 \u00B7 src/scripts/codex-native-pre-post.ts:762 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7066}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b42013879ffbbb0d3c5e5c234308061abfe04bceb632838e6977f29165ebbcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:7979 \u00B7 src/scripts/codex-native-hook.ts:7989 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7979}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8ce37743f300b6ffeba331d5f2dda4a362de639ff1d65913817638cfafdb6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:8791 \u00B7 src/scripts/codex-native-hook.ts:8879 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8791}}}],"partialFingerprints":{"codehealthFindingId/v1":"1239256f65214c3479bae89ea56dcf39a5d398d11cb7b82ad4f6cbd875e7174f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:8820 \u00B7 src/scripts/codex-native-hook.ts:8854 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":8820}}}],"partialFingerprints":{"codehealthFindingId/v1":"049692a9d057697ccadb5adce3ee73c18b568e796d4a8e307282103a0efacc05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:9054 \u00B7 src/scripts/codex-native-hook.ts:9072 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9054}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9bae871ee1b7379379ca71c36d6eaa7caf84480206418f441aebccef3c26f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/scripts/codex-native-hook.ts:13566 \u00B7 src/scripts/codex-native-hook.ts:13580 \u00B7 src/scripts/codex-native-hook.ts:13649 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13566}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5163be6d416ca9b5b6f8e09aeaac8772b2ea8ac5d7b14ebf7b460bb53a1cb61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:14268 \u00B7 src/scripts/codex-native-hook.ts:15566 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec6daa3b64298092723cf8a2430c11e642a3f559b6d5b6cb0d6e978896df771"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:15210 \u00B7 src/scripts/codex-native-hook.ts:15220 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c19245d9e6d919bf081f1e8d94519fcd3bd7becf60c9322e4506af3a206b8fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:16022 \u00B7 src/scripts/codex-native-hook.ts:19316 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16022}}}],"partialFingerprints":{"codehealthFindingId/v1":"a168fca72b0c7f6e43f8fa4827f8b5aa6d004145fb8334da50306a61c6ffc7f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:21290 \u00B7 src/team/state.ts:3072 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":21290}}}],"partialFingerprints":{"codehealthFindingId/v1":"39975a0229cd853b472390775232e7550d2df06ccde88a4521e357d84fe89a23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/codex-native-pre-post.ts:268 \u00B7 src/scripts/codex-native-pre-post.ts:345 \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":"src/scripts/codex-native-pre-post.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10cae154fe5f7706c277d7c55fa84403c8b94b36aeb4832368bb9ea88224ff0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/hook-derived-watcher.ts:165 \u00B7 src/scripts/notify-fallback-watcher.ts:1598 \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":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"429abfd32264355f1e9a4550bc6ce62b5919ea3dd1303d807f696f582e892d09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/hook-derived-watcher.ts:203 \u00B7 src/scripts/hook-derived-watcher.ts:217 \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":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1519316143772f0198fee17eace39e089c5494d7ab70a29db237b3df8b0492f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/scripts/notify-fallback-watcher.ts:103 \u00B7 src/scripts/notify-hook/team-leader-nudge.ts:71 \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":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8d94edddde1e5a6e84ca785481dfb1d3c3983ece2b88c4c1e55190347bb026"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/notify-hook/state-io.ts:298 \u00B7 src/scripts/notify-hook/state-io.ts:309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/state-io.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a495f1500ad92ff2fd5e4565afc4cfbd2fe5873baaf7f8706e29cc91f6801e09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/scripts/notify-hook/team-leader-nudge.ts:163 \u00B7 src/scripts/notify-hook/team-worker.ts:47 \u00B7 src/scripts/notify-hook/team-worker.ts:63 \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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d378c009d6a58a97a7fef709c856f2ae942ad919aef66619c4e42c03ef3104"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/notify-hook/tmux-injection.ts:613 \u00B7 src/scripts/notify-hook/tmux-injection.ts:639 \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":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73e4ae184d8a76a0e0b0aade3abbe342c5a2518f30f65fe17d667932dd65baa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/scripts/smoke-packed-install.ts:1138 \u00B7 src/scripts/smoke-packed-install.ts:1192 \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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cbccbb4621950ac1f683328edd6539eeaef56ddbf8d51c620a7e5c8ef82a95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/subagents/tracker.ts:257 \u00B7 src/subagents/tracker.ts:1812 \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":"src/subagents/tracker.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e1bfaed40a0234a7033d0e458915d1992138d159742e12445ec7b10ea9434e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/team/api-interop.ts:961 \u00B7 src/team/api-interop.ts:1164 \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":"src/team/api-interop.ts"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"d521d6523228336ed86039f443a9c8b659b1d1ceb5da8349a07392ea7e2454b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/team/pane-status.ts:310 \u00B7 src/team/pane-status.ts:370 \u00B7 src/team/pane-status.ts:655 \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":"src/team/pane-status.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cae9f2ac9296d2a1e9f1932359e0826485b9a5ba159b25c8eb86c3a3ccd67ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/team/pane-status.ts:501 \u00B7 src/team/pane-status.ts:513 \u00B7 src/team/pane-status.ts:525 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/pane-status.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fd47e217222142786f04cac62cba8fb9658811c91c1570873aba51431ef560"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/team/runtime.ts:1428 \u00B7 src/team/runtime.ts:1477 \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":"src/team/runtime.ts"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d6957294187d248b02595839b50c215c902965b1da9ea241628e03d2ce7d3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/team/runtime.ts:4855 \u00B7 src/team/runtime.ts:4878 \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":"src/team/runtime.ts"},"region":{"startLine":4855}}}],"partialFingerprints":{"codehealthFindingId/v1":"953eaa411e6ec88821eed30cb1754fcda286834336923ff4b30b736b3100c0cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/team/runtime.ts:6784 \u00B7 src/team/runtime.ts:6851 \u00B7 src/team/runtime.ts:6874 \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":"src/team/runtime.ts"},"region":{"startLine":6784}}}],"partialFingerprints":{"codehealthFindingId/v1":"8226f4226867c376fea760eedaa5d0b8f536c986fee58e2c6e4212e85d39ca43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/team/runtime.ts:6794 \u00B7 src/team/runtime.ts:6862 \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":"src/team/runtime.ts"},"region":{"startLine":6794}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b233cfaf01e658ba85503ef365e19dc8846933853d6e275008d67b7ca0aefc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/team/state-root.ts:450 \u00B7 src/team/state-root.ts:539 \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":"src/team/state-root.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b690c09e148daff83f370b80b0add0887d546fe8a3359aa765c3e1d3b48bff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/team/state/tasks.ts:315 \u00B7 src/team/state/tasks.ts:344 \u2014 both copies are in the same file, so extract the block into one function there 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/team/state/tasks.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa547d4018c2926475095193f7cf3c74c47624110084c334a8ec4a32b4c808f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/team/worktree.ts:104 \u00B7 src/team/worktree.ts:192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worktree.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe71ca563a989ff13a40dae779f3f833a980ce9acce2f3e102ed83d1bc96c487"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/ultragoal/artifacts.ts:1979 \u00B7 src/ultragoal/artifacts.ts:2138 \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":"src/ultragoal/artifacts.ts"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9e81bd760417e22a94e71620a8c089b1b2b7ca193b47eac3989945de514003"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/utils/toml.ts:13 \u00B7 src/utils/toml.ts:47 \u2014 both copies are in the same file, so extract the block into one function there 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/utils/toml.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b383e903dbfc084c5cfdbae878e714351367c6303414ab0147ef29d45e53a40b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/wiki/lifecycle.ts:220 \u00B7 src/wiki/lifecycle.ts:231 \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":"src/wiki/lifecycle.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea892c9b38ac0d08d322abef662c57bf2f8d2dfa4a1c1cf0f530c1c9f6a6645"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/vscode-extension/src/chatStore.ts:95 \u00B7 packages/vscode-extension/src/workspaceStatus.ts:15 \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":"packages/vscode-extension/src/chatStore.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4032a6730949070854f1c76cfb1ff2063c2c4cebaa26626526141ddbf00a3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): plugins/oh-my-codex/hooks/codex-native-hook.mjs:879 \u00B7 plugins/oh-my-codex/hooks/codex-native-hook.mjs:892 \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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b67f1dc1c21f63cf0ed1c4295b2614ff9472c4881cef006eb7ce542e27cdde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/autoresearch/contracts.ts:67 \u00B7 src/cli/team.ts:571 \u00B7 src/ralph/persistence.ts:58 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/autoresearch/contracts.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ccbb3b77bcc0bdd86e66199373726049148b52b6c6f070dfecfce522b267c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): src/autoresearch/goal.ts:174 \u00B7 src/goal-workflows/artifacts.ts:159 \u00B7 src/performance-goal/artifacts.ts:204 \u00B7 src/ultragoal/artifacts.ts:995 \u2014 the 4 copies are spread across 4 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/autoresearch/goal.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"091055ca9c1018a98d34b49101311d5512ea366654d982573067db3d195d5150"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/cli/agents.ts:196 \u00B7 src/cli/star-prompt.ts:85 \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":"src/cli/agents.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb89fbabf29ca7c0c2edcbb6456b862886db1da1b8a4d68a96503aeb433add18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/cli/agents.ts:196 \u00B7 src/cli/update.ts:550 \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":"src/cli/agents.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2ea55b6b7d88f1d6b479876d2ce2194a6371d66ed23d5a05a3f611128f9cfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/cli/autopilot.ts:30 \u00B7 src/cli/performance-goal.ts:52 \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":"src/cli/autopilot.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf4f7521a543df9c9deb5da68c9c453a09fe0ac7ccc01c9bc0ac3c7915c3932"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/cli/autoresearch-intake.ts:437 \u00B7 src/cli/autoresearch-intake.ts:448 \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":"src/cli/autoresearch-intake.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"308ed32ac69b316abec08af34902d22d267b434f170e17961960a681b5d510a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/cli/index.ts:3549 \u00B7 src/cli/sparkshell.ts:53 \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":"src/cli/index.ts"},"region":{"startLine":3549}}}],"partialFingerprints":{"codehealthFindingId/v1":"153bb6624a985134399534ae758d4bca763ec4002389ab3c5f37338e73284e02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/cli/index.ts:6323 \u00B7 src/scripts/notify-hook/operational-events.ts:73 \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/cli/index.ts"},"region":{"startLine":6323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a857253208cac4a4bbc5168aebf72d9a2cc92b3111be3d144b4d16eca408e649"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/cli/mcp-parity.ts:77 \u00B7 src/cli/setup.ts:6702 \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":"src/cli/mcp-parity.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"54821d6f936c8ee9708389c332641d14183a81dc540ace1da191f52e44c18963"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/cli/native-assets.ts:87 \u00B7 src/cli/native-assets.ts:101 \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":"src/cli/native-assets.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"713fe332202cbdea2e4fe654ffec23e9145a9c80b46bdaa1ad7dd37a17eec892"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/cli/native-assets.ts:486 \u00B7 src/scripts/codex-native-hook.ts:4467 \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":"src/cli/native-assets.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae02ffd39ab9f1abc79535d7b6f1b29e83e06c024266e1b513bd1a55b79ae9e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/cli/performance-goal.ts:137 \u00B7 src/cli/performance-goal.ts:150 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/performance-goal.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f1d02a607f3e992ae2e93f96b3b576d0ed862421aebbf05c4fcaeabb596895"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:3876 \u00B7 src/cli/plugin-marketplace.ts:4345 \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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3876}}}],"partialFingerprints":{"codehealthFindingId/v1":"49414422f5d3f448dad1646fdbaff480190619c0620684af8d9957a21cfeeeec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/cli/session-export.ts:56 \u00B7 src/cli/session-timeline.ts:135 \u00B7 src/cli/session-usage.ts:78 \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":"src/cli/session-export.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"526aee91a947c6b5dafc7af78e41215c433ae06a30c57676357cf66de930a53a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8 locations): src/cli/setup.ts:1746 \u00B7 src/cli/setup.ts:1788 \u00B7 src/cli/setup.ts:1884 \u00B7 src/cli/setup.ts:1980 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"src/cli/setup.ts"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9780e559109f97f9081d58f0b2ff4f91271079b17fe90c6d63ca703d472cafb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/cli/setup.ts:3956 \u00B7 src/cli/setup.ts:4005 \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":"src/cli/setup.ts"},"region":{"startLine":3956}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b9f24382c2e34ff9b6e6ed0d2a1e5f656c49a7490f832b1f81a7ad2f21889a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/cli/setup.ts:3192 \u00B7 src/cli/star-prompt.ts:85 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":3192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7ebe0f800cb0e2d7f9797a65be0dc2c5b503ef03b052649e9acbf46e763560"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/cli/team.ts:142 \u00B7 src/cli/team.ts:1325 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/team.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"688e86afc144c23c230c62ac809aa83abae91084be8845663a78d259ccf88dcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/config/generator.ts:318 \u00B7 src/config/generator.ts:3489 \u2014 both copies are in the same file, so extract the block into one function there 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/config/generator.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f129da2ad16711cd4fcf2e7b794456f688558b6553aec9634d7054d8ff3f75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/config/generator.ts:1141 \u00B7 src/config/generator.ts:1161 \u2014 both copies are in the same file, so extract the block into one function there 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/config/generator.ts"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1276b8d3ffcdf01074a772325ef68c1e73e964aeac58b4aff0d1e2ad4aeda38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/config/generator.ts:1678 \u00B7 src/config/generator.ts:1746 \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":"src/config/generator.ts"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"495da7d37f1fac726c928b1332769d61412998bb508e08d47d460e3e5f3437c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/config/generator.ts:3163 \u00B7 src/config/generator.ts:3346 \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":"src/config/generator.ts"},"region":{"startLine":3163}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d83f753eea5fb05722a4d6c48e2523fb00441683f8e6d101cc95ee7615fe66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/config/models.ts:88 \u00B7 src/config/models.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":"src/config/models.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1c10ce2494de7f0ce21808779f2f3e9de7de5baa17fda8681e52f66e65e5fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/hooks/session.ts:1139 \u00B7 src/hooks/session.ts:1986 \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":"src/hooks/session.ts"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf629c63d9b14214d62f1df18d853aca06a689338396b625e672801896786092"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/hooks/session.ts:2751 \u00B7 src/hooks/session.ts:2952 \u2014 both copies are in the same file, so extract the block into one function there 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/hooks/session.ts"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"da37920bcecbbab517b45c2f6de4202c8523ee074b804c6be06925066a055fd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/hooks/triage-config.ts:59 \u00B7 src/hooks/triage-config.ts:69 \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":"src/hooks/triage-config.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ca627128900984bf01dda65e1395c5a1a3b55256130e1615b230a80943b4bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/hud/authority.ts:238 \u00B7 src/hud/reconcile.ts:399 \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":"src/hud/authority.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"467172a5f0d09a59b713daced4942c99642245c8fb3d9f31a7a76cfcf41804c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/hud/reconcile.ts:608 \u00B7 src/hud/reconcile.ts:624 \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":"src/hud/reconcile.ts"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe4a573f83267c4240e68dad819653fe732d5c768633f55307a07604c004cde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/hud/render.ts:121 \u00B7 src/hud/render.ts:146 \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":"src/hud/render.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0f775bd9fc284f51b321fd505f5b1ae8a6f24a9577a8b154d793dd1edac9df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/hud/render.ts:155 \u00B7 src/hud/render.ts:165 \u2014 both copies are in the same file, so extract the block into one function there 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/hud/render.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a964e44ec966782b639dabe3107d23c52da69e40ec2ef5f79977859946898e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/hud/render.ts:330 \u00B7 src/hud/render.ts:347 \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":"src/hud/render.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d9ba79aca24ade16d409355e32a868b6d057c65575a500a3a322d689462ae0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/mcp/state-paths.ts:1239 \u00B7 src/mcp/state-paths.ts:1249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/state-paths.ts"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"33211196ba1313b080ce759a518962db9369499679b2b561a9ffd0c59cc571fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/mcp/state-server.ts:158 \u00B7 src/mcp/state-server.ts:188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/state-server.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0ef42446d5b3b471eaf1ef2fe9199926c7e59e4d0ec6122bd2d53b629a9be1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/notifications/http-client.ts:134 \u00B7 src/notifications/http-client.ts:304 \u2014 both copies are in the same file, so extract the block into one function there 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/notifications/http-client.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7b1a018d6bafbf1d5d6ab740de85847ed3c9bb53bbae7f5d97b55aa7e4bdde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/planning/artifacts.ts:477 \u00B7 src/planning/artifacts.ts:493 \u00B7 src/planning/artifacts.ts:508 \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":"src/planning/artifacts.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"432d85e5a832a461aebc0f00952456fb9b26834943d232d69a65e17e91062611"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:3306 \u00B7 src/scripts/codex-native-hook.ts:3318 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":3306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1724c9513d60788edd76c8176da0466c81e44835fc569a8977788ca9893aba4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:13671 \u00B7 src/scripts/codex-native-hook.ts:13685 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13671}}}],"partialFingerprints":{"codehealthFindingId/v1":"266660e636e376040f15c1d62e421d9be9b87d092390c68e6a1632034bf12701"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/scripts/codex-native-hook.ts:14482 \u00B7 src/scripts/codex-native-hook.ts:16325 \u00B7 src/scripts/codex-native-hook.ts:19822 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14482}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cb89aa743d7585a2c15b04e2be301661aaa38e13aad5e4e2e771957a689422"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:14638 \u00B7 src/scripts/codex-native-hook.ts:15692 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14638}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2e748cffaea55acd683ec4aa41cdbc8078119065648465986637ace7515b1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:19578 \u00B7 src/scripts/codex-native-hook.ts:19615 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":19578}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a221f5dd6f345bef6a87c43ff2a75e405cf82845691afb6b5e8b64e17fd276"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/scripts/codex-native-pre-post.ts:281 \u00B7 src/scripts/codex-native-pre-post.ts:362 \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":"src/scripts/codex-native-pre-post.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1e83c19aa8b730b2f9f458cd0d559f77a734e2b79eee3afc331f0bc5f3598e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/scripts/generate-native-release-manifest.ts:42 \u00B7 src/scripts/verify-native-release-assets.ts:35 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/generate-native-release-manifest.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d20e0d9b94b0d04b237d420b4d1b9fe02ef8b9a0a1f8bf740bd98a8b6f43ed6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/scripts/generate-release-body.ts:50 \u00B7 src/utils/worktree-tool-context.ts:29 \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":"src/scripts/generate-release-body.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d149beed8ed77d14f1ea041eb47c39ec46f0a0eb06ae4d808effc64205decef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/scripts/notify-hook/tmux-injection.ts:570 \u00B7 src/scripts/notify-hook/tmux-injection.ts:716 \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":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26096a014316bfd7f597b60bc78dabfa469e460c65cf53bcbc040a7e79e027a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/scripts/smoke-packed-install.ts:1861 \u00B7 src/scripts/smoke-packed-install.ts:5347 \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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c97b5d3d4175aaf9bb99c634b6ab67f5d5bdd4fca881d47dea45b4cb9abd08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/session-history/timeline.ts:99 \u00B7 src/session-history/usage.ts:58 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/timeline.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7462678add340b010718e930711780d77403d0e4395a4f1f0ec594dd02475e7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/state/pinned-atomic-file.ts:127 \u00B7 src/state/pinned-atomic-file.ts:210 \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":"src/state/pinned-atomic-file.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0993a239091c0a5392426cdca141a644fc70a47bca00d0440c9ca68b8e672a61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/state/skill-active.ts:462 \u00B7 src/subagents/tracker.ts:559 \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/state/skill-active.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61c8e3f73bbad3e615230da4be1b3488e8aee49b96b0c66a2f603e648e27cf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): src/team/api-interop.ts:788 \u00B7 src/team/api-interop.ts:807 \u00B7 src/team/api-interop.ts:1169 \u00B7 src/team/api-interop.ts:1193 \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":"src/team/api-interop.ts"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cbfcc365f6896bf1bc98a6f2195d27278c85310ccf10c308fa34fb2708aa66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/team/model-contract.ts:471 \u00B7 src/team/tmux-session.ts:1675 \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":"src/team/model-contract.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad78e67806a653436bbeadc402a1906bbb2f582812b26b7bccbf63bec1cc8734"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6 locations): src/team/pane-status.ts:271 \u00B7 src/team/pane-status.ts:283 \u00B7 src/team/pane-status.ts:319 \u00B7 src/team/pane-status.ts:331 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/pane-status.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4017f5a599a30cb5fa3adceca5e48c0bbf7cc76b0a9e57afc667ee56d82e5b7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6 locations): src/team/pane-status.ts:391 \u00B7 src/team/pane-status.ts:403 \u00B7 src/team/pane-status.ts:415 \u00B7 src/team/pane-status.ts:433 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/pane-status.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ae784a3a50c86b72a232937111d34b001f3b302e11551e857b07c1c4fd5a06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/team/runtime.ts:1388 \u00B7 src/team/runtime.ts:1534 \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":"src/team/runtime.ts"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5f6b34805d2ced91f43cbeff4f60b791dd6bc06a9a72a6c64e9d1e4fc6ccaa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/team/runtime.ts:6813 \u00B7 src/team/runtime.ts:6885 \u2014 both copies are in the same file, so extract the block into one function there 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/team/runtime.ts"},"region":{"startLine":6813}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b7f0f0eba8d80e72ed9b373f7d3016c5446e59ba21d24404c4ed93c0219d57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/team/state.ts:1649 \u00B7 src/team/state.ts:1677 \u00B7 src/team/state.ts:1707 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"5872cc7d7d9e4a6945ee8cf0aae8bad0cf579410ad40d52ec5ecfb796bbe1086"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/team/tmux-session.ts:2629 \u00B7 src/team/tmux-session.ts:2739 \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":"src/team/tmux-session.ts"},"region":{"startLine":2629}}}],"partialFingerprints":{"codehealthFindingId/v1":"489ffe73f08c8abaf05f80dd410eb3818097d539cc8909ebbaaf9a439bcf4078"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/team/tmux-session.ts:3578 \u00B7 src/team/tmux-session.ts:3699 \u2014 both copies are in the same file, so extract the block into one function there 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/team/tmux-session.ts"},"region":{"startLine":3578}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6efa17900318c80f17531f0d6f6532208fd675fe95923b13548a61ed46676d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/team/worktree.ts:125 \u00B7 src/team/worktree.ts:138 \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":"src/team/worktree.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05262331a6fe7897b5b2b25ac0bf77dbbcbabbdaea3ef12ffb83dfae51472a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): plugins/oh-my-codex/hooks/codex-native-hook.mjs:1837 \u00B7 plugins/oh-my-codex/hooks/codex-native-hook.mjs:1850 \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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b865a446669d39f31251601260e2157560f8af343f5b2451b7c33c2de036e7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/agents/native-config.ts:494 \u00B7 src/cli/setup.ts:6215 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/native-config.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1a92ece2276ff672e39e15352bbcc307ac58ce03814e6ab60682222f2c9da3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/autoresearch/skill-validation.ts:90 \u00B7 src/scripts/codex-native-hook.ts:919 \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/autoresearch/skill-validation.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6087fde99f1fc8ce84ae4ca940becf792ba0bacab8dc1b1ada2ceedc8d37d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/cli/agents-init.ts:394 \u00B7 src/cli/list.ts:26 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/agents-init.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa08a897430dc9566d3f39875b5e1c926599d466124dac7ed20a423daf5cc2b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/cli/ask.ts:160 \u00B7 src/cli/sparkshell.ts:53 \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":"src/cli/ask.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdba0141b16181059f1299805043aa08da758865176b048b8e8944cbb954f4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/cli/index.ts:1839 \u00B7 src/cli/index.ts:1959 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51c2b230c6b8d4c1010728c3de41a99ac6ebce0bfd5d7edb1aa42c2b7b6a448"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/cli/index.ts:5964 \u00B7 src/cli/index.ts:8221 \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":"src/cli/index.ts"},"region":{"startLine":5964}}}],"partialFingerprints":{"codehealthFindingId/v1":"2376043c88c8fd38e1a8e9765dbdb933605dde7f30c4d6e484c0495f90f6f20b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/cli/index.ts:10561 \u00B7 src/cli/team.ts:540 \u00B7 src/cli/team.ts:554 \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":"src/cli/index.ts"},"region":{"startLine":10561}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d51e87b9223dcdeab31f6843d401b75e27ff6ef74552418513cd194829f7e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/cli/plugin-marketplace.ts:536 \u00B7 src/cli/plugin-marketplace.ts:548 \u00B7 src/cli/plugin-marketplace.ts:608 \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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"6473f3df5592320e8e5f795b780705ae5749e884efe294023ca3f35ec4908ee0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:834 \u00B7 src/cli/plugin-marketplace.ts:1974 \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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cb8a9753507d7faab5e315f5254539469bdf70b933877c7e6916db02afb1b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:3584 \u00B7 src/cli/plugin-marketplace.ts:3594 \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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3584}}}],"partialFingerprints":{"codehealthFindingId/v1":"58eb0f7ea2add6435782289fcc0571ef27fe7d72069dcd28175d458278d1dd57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/cli/ralplan.ts:325 \u00B7 src/cli/state.ts:91 \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":"src/cli/ralplan.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"43078c0491bdb13fbb66cc0798a15e2448b15477d55c66898277f3d0d03deb75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/cli/session-search.ts:86 \u00B7 src/cli/team.ts:481 \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":"src/cli/session-search.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6017749d5027dd78b4f0bf0889325646802319c4226827e8623dfe64ba72dda7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/cli/setup.ts:3570 \u00B7 src/cli/setup.ts:6084 \u00B7 src/cli/setup.ts:6274 \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":"src/cli/setup.ts"},"region":{"startLine":3570}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fac8cf0cda17f7b2c98c4baa8683344615d1cddad3a9dffc2be120893cca35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/cli/setup.ts:4838 \u00B7 src/cli/setup.ts:4849 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/setup.ts"},"region":{"startLine":4838}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ea7676ae65d4708951c1304eb580d7ffd20ee5d680c303410ffa82a72da421"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/cli/ultragoal.ts:467 \u00B7 src/cli/ultragoal.ts:517 \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":"src/cli/ultragoal.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3180420c2f47c6b00579b1583a0353c33356c521173acb40907ed3b94f0984"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/cli/uninstall.ts:726 \u00B7 src/cli/uninstall.ts:755 \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":"src/cli/uninstall.ts"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"be824fbe72982c09ff5c0b308008479ef3de5e14f89db80e07dad867dc9aed1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/config/codex-hooks.ts:2724 \u00B7 src/config/codex-hooks.ts:2826 \u2014 both copies are in the same file, so extract the block into one function there 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/config/codex-hooks.ts"},"region":{"startLine":2724}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0285bdc11ecfd11c8fcc98c9252d61558eec88da83581f3954648036d49ffbe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/document-refresh/enforcer.ts:295 \u00B7 src/scripts/generate-native-release-manifest.ts:24 \u00B7 src/scripts/verify-native-release-assets.ts:23 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document-refresh/enforcer.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75a8e115adad2859aa516a64155721f6002ec3d7314209e3b4771ef02635967"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/evals/astra-defaults/suite.ts:261 \u00B7 src/evals/astra-defaults/suite.ts:270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/evals/astra-defaults/suite.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59af72b4cfec6db2f789739549d1d8e9b900f28bbddc4e943fd40932925dd3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/evals/astra-defaults/usage.ts:27 \u00B7 src/session-history/usage.ts:175 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/evals/astra-defaults/usage.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"297dfd465446b9182a43fed4f2d4236e8c32dcad04e59731cbdd711c90c99447"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/exec/followup.ts:195 \u00B7 src/scripts/notify-hook/team-dispatch.ts:300 \u00B7 src/scripts/notify-hook/team-dispatch.ts:361 \u00B7 src/team/state/dispatch-lock.ts:52 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/exec/followup.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec2eb00474992c26f4edd32dc77963d9627fdbcecfce2256c32bb700298c9ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/goal-workflows/artifacts.ts:82 \u00B7 src/ultragoal/artifacts.ts:864 \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":"src/goal-workflows/artifacts.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"73feb5c6458bcf01353c9a083ad68959353e5331d19b65ecf82d95a955e4fb61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/hooks/agents-overlay.ts:235 \u00B7 src/scripts/codex-native-hook.ts:2445 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/agents-overlay.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdb40ec2e3e8513a97ffc7c0147385ee15a39321d9d7db07588ba9cb52a5780"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/hooks/codebase-map.ts:84 \u00B7 src/hud/authority.ts:179 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 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":"src/hooks/codebase-map.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6bb06352b78a8992efc26763b0f66dac26040843270901eea8585ee3e51d22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/hooks/extensibility/sdk/plugin-state.ts:7 \u00B7 src/hooks/extensibility/sdk/tmux.ts:40 \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":"src/hooks/extensibility/sdk/plugin-state.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f828fed3f8df83472215f5df9c91ba04150c1bbfd627f24f22af9ffdec5fda01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/hooks/keyword-detector.ts:1507 \u00B7 src/hooks/keyword-detector.ts:1536 \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":"src/hooks/keyword-detector.ts"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6d1d0b734bc4214be398c76af4c9701264b1092acdc52f39e9e1e8afe46a81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/hooks/keyword-detector.ts:1780 \u00B7 src/hooks/keyword-detector.ts:2055 \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":"src/hooks/keyword-detector.ts"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"2551d6f338123b9299e685fcc099cc1abad76f13ac0049f400136d9b4a662b0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/hooks/native/pre-tool-use-advisory.ts:13 \u00B7 src/team/worker-provenance.ts:17 \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/hooks/native/pre-tool-use-advisory.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"199e14fec11a88e5daf064d1b5f3c21cb6fe674ede8b710824c452e3f8e66ad4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/hooks/session.ts:290 \u00B7 src/mcp/state-paths.ts:110 \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":"src/hooks/session.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26df339de550a53d42ee40450825ad7daa5a727d4109e66c6bd867f2277548a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/hooks/session.ts:2724 \u00B7 src/hooks/session.ts:3845 \u00B7 src/hooks/session.ts:3885 \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":"src/hooks/session.ts"},"region":{"startLine":2724}}}],"partialFingerprints":{"codehealthFindingId/v1":"001a614265496c919647f8efdf4d18cb5d068a1e711fa98810fe69b0bfdbef90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/hooks/session.ts:2797 \u00B7 src/hooks/session.ts:2954 \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":"src/hooks/session.ts"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c6cf89712f4720e0ca573772c90cdf3d767a4c6e89e050c9b2b47dcae404c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/hud/authority.ts:110 \u00B7 src/hud/reconcile.ts:324 \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":"src/hud/authority.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"088c58ee876cef76271a512c39c8ebd680385d65a23078d3c04ca1dad93cba5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/hud/tmux.ts:618 \u00B7 src/hud/tmux.ts:662 \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":"src/hud/tmux.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"706eab003afd9da97d4968407da3b79725f97dae201b4f8259b58027ded52770"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/mcp/hermes-bridge.ts:342 \u00B7 src/mcp/hermes-bridge.ts:639 \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":"src/mcp/hermes-bridge.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba82444d5b6df71b2162eab823c5e7faa5f33180fdbebff3d27a2ca1ac8b6f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/mcp/hermes-bridge.ts:364 \u00B7 src/mcp/hermes-bridge.ts:376 \u00B7 src/mcp/hermes-bridge.ts:580 \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":"src/mcp/hermes-bridge.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"34892039292030302c3b515057e0792f253d23e01078a3dc78eed7d99cd41630"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/question/renderer.ts:388 \u00B7 src/question/renderer.ts:470 \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":"src/question/renderer.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef243baaf5e77e108f0fa8b34311d3fffd820bffe8417f8f01cceb3ffdf986f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:919 \u00B7 src/team/worker-provenance.ts:27 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebef0d11bca7e7d1b9108addfd1b0abc8b03e4623c10c93d09c6778a07a106c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:5051 \u00B7 src/scripts/codex-native-hook.ts:8930 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5051}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c9889bd1f3fa5e48941d48c29f23721dfb13bf36570679ee7b9915fbf1f02d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:5849 \u00B7 src/scripts/codex-native-hook.ts:5955 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5849}}}],"partialFingerprints":{"codehealthFindingId/v1":"814f1947f4d6e724cf16be8ba62e648afd5b3012f52fba761a88088c38b4aaaa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:6288 \u00B7 src/scripts/codex-native-hook.ts:12260 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6288}}}],"partialFingerprints":{"codehealthFindingId/v1":"983fce9b61207d882062ad33d29f3bcd330c0468b7bdeb21a9ad05b3ca562964"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:6983 \u00B7 src/scripts/codex-native-hook.ts:18720 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6983}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0e507dc4bcef5122e8e5ca7f5f50c503181f6497a403e0f24c63cd45b76d1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): src/scripts/codex-native-hook.ts:7429 \u00B7 src/scripts/codex-native-hook.ts:7440 \u00B7 src/scripts/codex-native-hook.ts:7566 \u00B7 src/scripts/codex-native-hook.ts:7582 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":7429}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b5134dbc387cdb550a40be62d6860d9bde59e6c404195f6c0e751930f85d17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:7850 \u00B7 src/scripts/codex-native-hook.ts:7858 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":7850}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f5d5d842cee4fd762260130b35c28a22002bf7d9f47ffb5e1aa0c17490924a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9 locations): src/scripts/codex-native-hook.ts:8059 \u00B7 src/scripts/codex-native-hook.ts:8817 \u00B7 src/scripts/codex-native-hook.ts:8851 \u00B7 src/scripts/codex-native-hook.ts:9090 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8059}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e09f91f3043ace98a5647249521fae8525383f99bae13aa2f9bdc037de63ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:8750 \u00B7 src/scripts/codex-native-hook.ts:8869 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8750}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d4a3220c1083c29e067b61575e251b384581e44c19e14ed8474203292a2c4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:10152 \u00B7 src/scripts/codex-native-hook.ts:10161 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afaa0f52b2cd10cc123a3a790a068948a1e0880f0739e32c8bf5fa4bbdf2597"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:12260 \u00B7 src/scripts/codex-native-hook.ts:19799 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12260}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad66747eb37f468663881b8d1a2b95bed2043b7b8a7f30416cb847885950260"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/scripts/codex-native-hook.ts:13501 \u00B7 src/scripts/codex-native-hook.ts:13567 \u00B7 src/scripts/codex-native-hook.ts:13581 \u00B7 src/scripts/codex-native-hook.ts:13650 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13501}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a57e9ae4e5c0c3a4fb03f15abd5b3df8c29319a46fb9d194b17ca4ca1d07701"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:14520 \u00B7 src/scripts/codex-native-hook.ts:14820 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14520}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab61d64ff142aeaf31d2db397b6080db6610c68c01a3afb87f5ac440c3e2fcc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:18206 \u00B7 src/scripts/codex-native-hook.ts:18472 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":18206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73bd44481bbf3612b2ec1132d2ca527f974f76c5ba387f38ba11e88bbcaa745"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/eval/eval-parity-smoke.ts:3 \u00B7 src/scripts/eval/eval-parity-sweep.ts:3 \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":"src/scripts/eval/eval-parity-smoke.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9e01519e59f6668ba3e82bef99957c52580483f2f8437b0c3778a08036a299"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/scripts/generate-release-body.ts:196 \u00B7 src/scripts/generate-release-body.ts:208 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"src/scripts/generate-release-body.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad6c45e9f524a2604345d6405ec560c4baaef020533f47a574224771d52285c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/notify-fallback-delivery.ts:159 \u00B7 src/scripts/notify-fallback-delivery.ts:224 \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":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0abc109b66a978aed52e80b6bf51b5b8a173b1fcc0781a7c0f9d56575fa52c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/notify-hook/active-team.ts:24 \u00B7 src/team/state.ts:3069 \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/scripts/notify-hook/active-team.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0de95935415c1dcbda74b265091a91d04085db1f99b361c9315ee3cf7a07aa3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/notify-hook/team-dispatch.ts:223 \u00B7 src/scripts/notify-hook/team-dispatch.ts:232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcdd53fc15fb41aa25a18b9d140af616183f7c0d43c658c6276fa76f9d35b57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/notify-hook/team-dispatch.ts:444 \u00B7 src/scripts/notify-hook/team-dispatch.ts:459 \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":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfdaf9138a822042250ee1d0c65aa33d249425973880e9820fccb8f59bef799"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/scripts/notify-hook/team-leader-nudge.ts:394 \u00B7 src/scripts/notify-hook/team-leader-nudge.ts:555 \u00B7 src/scripts/notify-hook/team-worker.ts:242 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"396f3aca1ccac5df92f288b922fe818246a0e6db87959b885ad96c09b3c32fe7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/notify-hook/team-leader-nudge.ts:470 \u00B7 src/scripts/notify-hook/team-leader-nudge.ts:479 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d88c5dead3518ed9aac79f60911abcb60c3176068fadb59a604976c10a0874"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/scripts/notify-hook/team-leader-nudge.ts:607 \u00B7 src/scripts/notify-hook/team-leader-nudge.ts:627 \u00B7 src/scripts/notify-hook/team-worker.ts:500 \u00B7 src/scripts/notify-hook/team-worker.ts:726 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee087d638b0391a53dcb7ca21dc6fa7e3688621ee18713b06206b1a85856548"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/notify-hook/team-tmux-guard.ts:410 \u00B7 src/scripts/notify-hook/team-tmux-guard.ts:607 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-tmux-guard.ts"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a27827afc998bd0e2a2a816b6974bce49ad391f5bfdce070c0b9abb97a7962"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/notify-hook/team-worker-stop.ts:189 \u00B7 src/scripts/notify-hook/team-worker-stop.ts:407 \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":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"854b0cd4041ce906055ba5ff6fa5b74cf4fbca530d10e47706b7758b8e8ce61e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/scripts/notify-hook/team-worker-stop.ts:388 \u00B7 src/scripts/notify-hook/team-worker.ts:482 \u00B7 src/scripts/notify-hook/team-worker.ts:704 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"86186318f7b9f9855f1fe5d11d08769c31fd0a3b880d270670eae747806cf147"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/notify-hook/tmux-injection.ts:69 \u00B7 src/scripts/notify-hook/tmux-injection.ts:87 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"270c26eb549ce9b3391344d0d857fae8bbf6f84ac3977a1d5ab10d31f0e7bb15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/notify-hook/tmux-injection.ts:89 \u00B7 src/scripts/notify-hook/tmux-injection.ts:100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"988f2e18d0938b02a66a9005178b41109940919900efd44d7e29883014d0e6ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/scripts/smoke-packed-install.ts:4119 \u00B7 src/scripts/smoke-packed-install.ts:4130 \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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":4119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe9288b71a427e0455ee4c0df6270a2298d5660d454588520bbfde22d304e8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/session-history/friction.ts:224 \u00B7 src/session-history/search.ts:147 \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":"src/session-history/friction.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5b05a719030376ace37a5ebee003d90941fff691c1422b79d31a59f3dc3374"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/sidecar/collector.ts:87 \u00B7 src/sidecar/collector.ts:128 \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":"src/sidecar/collector.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cef74ef29cc56a054f9f1dc29196f8f34a4c695f30d7b53a1a70659aac7a4da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/state/operations.ts:516 \u00B7 src/team/progress-evidence.ts:16 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"src/state/operations.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8760c3d932a1102243fc614a8041d319c5f9bd39339c8e8bde0db4f22b093d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/state/pinned-atomic-file.ts:405 \u00B7 src/state/pinned-atomic-file.ts:454 \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":"src/state/pinned-atomic-file.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"846fca1d459dc7cff16d6b7fbd8b16127c643901bc85ed6d2612ab72d8036195"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/state/skill-active.ts:624 \u00B7 src/state/skill-active.ts:975 \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":"src/state/skill-active.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff9542b6a5e8a3eb16043e69200adb75059fbe465e0d9eb47a0740aacf825e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): src/team/api-interop.ts:799 \u00B7 src/team/api-interop.ts:1014 \u00B7 src/team/api-interop.ts:1040 \u00B7 src/team/api-interop.ts:1070 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"src/team/api-interop.ts"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd4bac9c5a350a3465288a94302a8ef333c5e6c4e579bee43325599175eb29f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/team/api-interop.ts:919 \u00B7 src/team/api-interop.ts:1142 \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":"src/team/api-interop.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac7d49058713da25e39377f5a32702a14f26c3a1e06a31153d3c8b98d2d2ea0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/team/approved-execution.ts:222 \u00B7 src/team/approved-execution.ts:241 \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":"src/team/approved-execution.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a240ed583d426c9f1ac2de7b333d2ac845ed81cfb6cc866af8defa54c361769"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/team/runtime.ts:5281 \u00B7 src/team/runtime.ts:5291 \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":"src/team/runtime.ts"},"region":{"startLine":5281}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b26251b6d111ebc24e8eb67453f21dfbc2883b913185b39c4d25821f3650c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/team/state-root.ts:578 \u00B7 src/team/state-root.ts:587 \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":"src/team/state-root.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"71601300863cc9d48d01f55814d019d9fd906ed8c513561bd21f6a3cedc5303c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/team/state.ts:2297 \u00B7 src/team/state.ts:2327 \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":"src/team/state.ts"},"region":{"startLine":2297}}}],"partialFingerprints":{"codehealthFindingId/v1":"1036161587d9f9d3ab31691de24a758d85674e4541344f515ac0b410597e21aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/team/tmux-session.ts:3604 \u00B7 src/team/tmux-session.ts:3725 \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":"src/team/tmux-session.ts"},"region":{"startLine":3604}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd598075a198f022ffe667c04722569f4262baef32b06eb425c2c3d5e4901390"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/team/worker-bootstrap.ts:726 \u00B7 src/team/worker-bootstrap.ts:775 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-bootstrap.ts"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ff3415306f1a970bc298d3e61bad86491362169047c8739a722798e1e31290"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/wiki/lifecycle.ts:39 \u00B7 src/wiki/lifecycle.ts:147 \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":"src/wiki/lifecycle.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e0e333af9004cb4d7a91714ac4790899a07d1eed0df2cd85337f33373be380"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): plugins/oh-my-codex/hooks/codex-native-hook.mjs:913 \u00B7 plugins/oh-my-codex/hooks/codex-native-hook.mjs:996 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62d04183101978b032f33ec672780d03f48097f0cc4b91322c5a33312111beb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/autopilot/fsm.ts:21 \u00B7 src/question/autopilot-wait.ts:32 \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":"src/autopilot/fsm.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf393b4deae3a81db8db4f2c8323596b753ae39ba0e7d19d7325fa2bb179d32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:478 \u00B7 src/cli/plugin-marketplace.ts:497 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af4594f74cb6223e52a61c5d78b19be49e6e09e56398b0cbd208631e983bae6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/cli/ralplan.ts:324 \u00B7 src/imagegen/continuation.ts:154 \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/cli/ralplan.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e0613aab2f3b37fd7db3cf2b199b29e791496ed4fe5e769d31a8f264257535"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/cli/session-search.ts:403 \u00B7 src/cli/url.ts:75 \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":"src/cli/session-search.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d2c821c301347730683ebb2d2eceb0c362769a8dad13730184704f4dbcfa55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/cli/session-search.ts:413 \u00B7 src/cli/session-search.ts:423 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/session-search.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9810a6cb4e6726f6fa4e7e3a984e33e6b8b867b3df8b49639470d07eb5eb433e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/cli/setup.ts:892 \u00B7 src/cli/setup.ts:913 \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":"src/cli/setup.ts"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"1177643cee8d02696ab11e782dde2284eef336e40a77f4c61b1079e4709fc3d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/cli/update.ts:659 \u00B7 src/cli/update.ts:672 \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":"src/cli/update.ts"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59c8c9c6dbfc5b295eace16107eacfd57c99fc4411af0ecc7f7e2fb03d1a9c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/config/codex-hooks.ts:1725 \u00B7 src/config/codex-hooks.ts:1746 \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":"src/config/codex-hooks.ts"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d95bc870e4ddb02e59d481cbbe94a3927cd9fe34d703957257bce7914de7ccd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/config/generator.ts:719 \u00B7 src/config/generator.ts:727 \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":"src/config/generator.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"74252c02a28362836ead18817d727ae970a56bcddf707363ffa200a379476caa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/hooks/keyword-detector.ts:1197 \u00B7 src/hooks/keyword-detector.ts:1921 \u2014 both copies are in the same file, so extract the block into one function there 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/hooks/keyword-detector.ts"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58c6ca86d267679160f04266e74085ba84af7bdea75b51cd9844441f4a347a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/hooks/session.ts:1191 \u00B7 src/hooks/session.ts:1918 \u2014 both copies are in the same file, so extract the block into one function there 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/hooks/session.ts"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fbd8caf1b29b5fe1112de9ec502c50c4413cabd813148f4d3de3fe9d320797"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/hooks/session.ts:1453 \u00B7 src/hooks/session.ts:1463 \u2014 both copies are in the same file, so extract the block into one function there 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/hooks/session.ts"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"20828ee6674c15ced166650268f6005053ddbcadf9b86f604541254bf438ed1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/hooks/session.ts:3056 \u00B7 src/hooks/session.ts:3070 \u2014 both copies are in the same file, so extract the block into one function there 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/hooks/session.ts"},"region":{"startLine":3056}}}],"partialFingerprints":{"codehealthFindingId/v1":"44196fcdc60146dd563a0a304b74f53d7da598caffa13ee25c32cea05f85b7c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): src/hud/tmux.ts:790 \u00B7 src/hud/tmux.ts:798 \u00B7 src/hud/tmux.ts:806 \u00B7 src/team/tmux-session.ts:1451 \u00B7 \u002B1 more site(s) not listed \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/hud/tmux.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2005fbac769cdd06d6193fac3f6ee85fba2c26ea6f7462f187ed0f8afe196ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/hud/tmux.ts:806 \u00B7 src/team/tmux-session.ts:1451 \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/hud/tmux.ts"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ac87773fd9f8e188f8d7a58bf3247e063c120acf0403dea7d9a0dbd744c241"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/leader/contract.ts:266 \u00B7 src/leader/contract.ts:277 \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":"src/leader/contract.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f39bca54d75dd40f86f681f070961ce899effa1a9c364844af49641f0b576d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/mcp/code-intel-server.ts:472 \u00B7 src/mcp/code-intel-server.ts:523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/code-intel-server.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab8f9c8aa82dfad1c684e6ac48a4c91693d5603647e771616e152500010e714"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/mcp/code-intel-server.ts:538 \u00B7 src/mcp/code-intel-server.ts:566 \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":"src/mcp/code-intel-server.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b63b260b2da4893e6a9137ef392cd05586a8f1095f2c135a967363b57d2dd8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/mcp/hermes-bridge.ts:492 \u00B7 src/mcp/hermes-bridge.ts:670 \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":"src/mcp/hermes-bridge.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"d056e4a0391afe2c777047f3cb228d5f02d17e46e8e2f1ae08e47b2bec023fcd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/mcp/hermes-server.ts:165 \u00B7 src/mcp/state-server.ts:123 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/hermes-server.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89b52c948ccadaf80c761b6a5218ce5dfe50df22695afbbb321d10f78ff5db0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/mcp/state-paths.ts:172 \u00B7 src/mcp/state-paths.ts:182 \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":"src/mcp/state-paths.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"261c8c3db9494c068e5a90603768d7a422e0c8a5f522add487cc8164500194d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/mcp/state-paths.ts:273 \u00B7 src/ralph/completion-audit.ts:21 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/state-paths.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"76732b97be50bea54f26b07ebb390cdfd5cd2e10b45973b789e4486ca512abfe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/notifications/dispatch-cooldown.ts:87 \u00B7 src/notifications/idle-cooldown.ts:146 \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":"src/notifications/dispatch-cooldown.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c4bc2ddf04239eaf50a054fab386a125a31e80c4b2c6739e18c7393a19a6c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/notifications/template-engine.ts:101 \u00B7 src/notifications/template-engine.ts:109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/template-engine.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddeb461b4987036af48138ccce52955eefbdaef857994a04e01742abaca3b5be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/ralplan/advisory-activation-verifier.ts:20 \u00B7 src/ralplan/advisory-activation.ts:59 \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":"src/ralplan/advisory-activation-verifier.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecf89f347ab046bd54881f7e79792bc035bcb77684e9ecd5f435b7a19bd85c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/runtime/process-tree.ts:33 \u00B7 src/runtime/process-tree.ts:59 \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":"src/runtime/process-tree.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6201cc98b90a86d95f15f0edcd5597c83106309ab5fa1ae487af3138db1a7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): src/scripts/build-api.ts:3 \u00B7 src/scripts/build-explore-harness.ts:4 \u00B7 src/scripts/build-sparkshell.ts:3 \u00B7 src/scripts/test-sparkshell.ts:2 \u2014 the 4 copies are spread across 4 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/build-api.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b830e120b62d2768f5c42d169845c956a3ce2ced6590edcf655f09b41c20b4ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:3730 \u00B7 src/scripts/codex-native-hook.ts:3740 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":3730}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bddd6821c96adc71877d4ac14a4c9bdc41541d71b83e3ff5958d322d60736f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:6083 \u00B7 src/scripts/codex-native-hook.ts:14282 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6083}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e71fd7c8d125d7ef8e282e48492e402f9e1214b6872ae453bf2d760d4850ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:8003 \u00B7 src/scripts/codex-native-hook.ts:8141 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8003}}}],"partialFingerprints":{"codehealthFindingId/v1":"87afdc1f6a8dc692912f0fb5e1608dbef611cf63e50ec2185f5cc866ab828b9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/scripts/codex-native-hook.ts:8138 \u00B7 src/scripts/codex-native-hook.ts:8146 \u00B7 src/scripts/codex-native-hook.ts:8174 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8138}}}],"partialFingerprints":{"codehealthFindingId/v1":"201b54943ff716c2d34ecaae94399ad9a5b23a1b549c6648f66db356c6dff51f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:8846 \u00B7 src/scripts/codex-native-hook.ts:9477 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":8846}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d58db7c71230a2701b3bf7737e02468f2232663c7cc74bd0ac7c179e96e1821"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:9258 \u00B7 src/scripts/codex-native-hook.ts:20119 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":9258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f684d5b61ead60257e8b158a5286185e7f0c21990d5dd33fa00707a82a78f897"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:9561 \u00B7 src/scripts/codex-native-hook.ts:9624 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":9561}}}],"partialFingerprints":{"codehealthFindingId/v1":"53142312b14ddda02fbf8e60e92702f15329e4388d3f10c3be9c83ad5cb94e2b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/scripts/codex-native-hook.ts:10043 \u00B7 src/scripts/codex-native-hook.ts:10060 \u00B7 src/scripts/codex-native-hook.ts:10099 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":10043}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d86a6345e8f2556565d292549d1e72ac5e80e75ecb440a344f3756224dca10a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:10454 \u00B7 src/scripts/codex-native-hook.ts:10511 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":10454}}}],"partialFingerprints":{"codehealthFindingId/v1":"3178f260a3541ee691c93ecd0541e99340396af4c66a3e6eddb35c4f056ac78f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:13221 \u00B7 src/scripts/codex-native-hook.ts:13265 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7e036ce44519cdddd2c8511b7b0017a9fe18c9ddb64c80c550ae3099b8110c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:16114 \u00B7 src/scripts/codex-native-hook.ts:16150 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8664ff5aa82c4fcfca55f7dc2f3f7b312d8ba42497fcccefd2742f3531229d2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:16850 \u00B7 src/scripts/codex-native-hook.ts:19232 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16850}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37e3752fd455a4d435fe74427fb1ead726620137371b328a09e74cbc0edc44d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:22798 \u00B7 src/scripts/codex-native-hook.ts:22884 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":22798}}}],"partialFingerprints":{"codehealthFindingId/v1":"033489e62bccc91318266e87febd7b032f89db5014d60802b9d554cf3f128cd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/scripts/generate-release-body.ts:320 \u00B7 src/scripts/smoke-packed-install.ts:5793 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/generate-release-body.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62956d34a29c9a839bb24efd68bbc84e65a916fabbebf670cf982c490396533"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/hook-derived-watcher.ts:29 \u00B7 src/scripts/notify-fallback-watcher.ts:150 \u2014 the 2 copies are spread across 2 files, 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":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"90705a09927e4536b703ab6f375de848c24aad335bd9323b3729fbbdaae5167b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/notify-fallback-watcher.ts:597 \u00B7 src/scripts/notify-fallback-watcher.ts:663 \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":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec9e6074d343adc391ec82ff953feb13af90ceb3cebb4bf13b3b711a43422d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/notify-hook/team-dispatch.ts:194 \u00B7 src/scripts/notify-hook/team-dispatch.ts:202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9060763568f18c935d3e100954f98cd29330be3b20715a6b455729d0cfddd950"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/notify-hook/team-leader-nudge.ts:179 \u00B7 src/scripts/notify-hook/team-worker.ts:70 \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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0789493cdaadb03e036dad6d4767343d0e11caf06d957e11fd6f247ea21e39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/notify-hook/team-leader-nudge.ts:829 \u00B7 src/scripts/notify-hook/team-leader-nudge.ts:842 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f4aa3278846dee9413116615e3d2ef5a1d43956ed9ecda5a27402fff4edb73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/notify-hook/team-leader-nudge.ts:1296 \u00B7 src/scripts/notify-hook/team-worker-stop.ts:439 \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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6fd1c828c6c0f0193888c95d6352c7de14ab710baf4d3a6e6ebcea70edc936"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/notify-hook/team-worker.ts:148 \u00B7 src/scripts/notify-hook/team-worker.ts:174 \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":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f0b5530d55a416b93da8f0249feeb7935a0de55c2f84ba93b1a1204ef9f381"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/scripts/notify-hook/tmux-injection.ts:595 \u00B7 src/scripts/notify-hook/tmux-injection.ts:620 \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":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b6f610904a5399f9f2db0f42c671d2d6ce18cd60f7ddd6fd52f35af305cf9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/session-history/friction.ts:206 \u00B7 src/session-history/search.ts:93 \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":"src/session-history/friction.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4b0ff2fc79578050ae82eb8bf0b3c09c42902991dcdf118ac9ec059c19e334"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): src/state/mode-binding-lease-helper.ts:42 \u00B7 src/state/pinned-atomic-file-darwin-helper.ts:48 \u00B7 src/state/pinned-atomic-file-darwin-janitor.ts:52 \u00B7 src/state/pinned-atomic-file.ts:36 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/mode-binding-lease-helper.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86f64fa273373b907b59e27acd44f6b3539daaada8e85dc7da37a3b0fe4a10b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/state/mode-binding-lease.ts:198 \u00B7 src/state/mode-binding-lease.ts:230 \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":"src/state/mode-binding-lease.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c1edba17e824b5a8ad7eb450bb011e5e57a5c6357e39ee45d6c6b3af67fd73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/subagents/tracker.ts:1866 \u00B7 src/subagents/tracker.ts:1925 \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":"src/subagents/tracker.ts"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f8036de112a878778bf88c998b8dfac861d90089b564e6ea3eb091286cee9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/team/api-interop.ts:935 \u00B7 src/team/api-interop.ts:942 \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":"src/team/api-interop.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb0ab73e767a4f18006e9cc6fdb71315420d8ad62c80894df3f921ccee8fb74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/team/api-interop.ts:944 \u00B7 src/team/api-interop.ts:966 \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":"src/team/api-interop.ts"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dd84535692c93b35acfa49c2d8c82555ba72db7fbd74ef86d809c7dfd265a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/team/api-interop.ts:995 \u00B7 src/team/api-interop.ts:1210 \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":"src/team/api-interop.ts"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ffb174269cbff9aeb021500e9e05e5037615e8cd2e17e6a136c0d8eaa1f6af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/team/mcp-comm.ts:186 \u00B7 src/team/mcp-comm.ts:293 \u00B7 src/team/mcp-comm.ts:412 \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":"src/team/mcp-comm.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6112b9c2a9d4e37053192a3d23bcd2da9cce34f088f4568f2d0b2772d6fce650"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/team/pane-status.ts:467 \u00B7 src/team/pane-status.ts:538 \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":"src/team/pane-status.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a38d1ea182eb77a7cd8f115be1858973452dc3d00fcc30784ecf902ad3a0c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/team/pane-status.ts:586 \u00B7 src/team/pane-status.ts:616 \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":"src/team/pane-status.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fbee42674a223c7e01a207e5d93e71c8b727276f1cdb1e7f743992e0028acd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/team/phase-controller.ts:82 \u00B7 src/team/phase-controller.ts:91 \u2014 both copies are in the same file, so extract the block into one function there 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/team/phase-controller.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a646aecd23ca1ee65fa5b7b5ccafce4b5cd835a3be0c3d0abfe413f3656e2fdb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/team/runtime.ts:4025 \u00B7 src/team/runtime.ts:5452 \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":"src/team/runtime.ts"},"region":{"startLine":4025}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb3be32833a6447d657310c9baa78038aa297601692e1179312ea6ac194b348"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/team/state.ts:1534 \u00B7 src/team/state.ts:1606 \u00B7 src/team/state.ts:1623 \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":"src/team/state.ts"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7f81f34d9b92f39a654f3641ff1fd3b02733e7b0133cd1684af6914e08d1f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/team/state/dispatch.ts:364 \u00B7 src/team/state/dispatch.ts:431 \u00B7 src/team/state/dispatch.ts:455 \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":"src/team/state/dispatch.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe6fbd83a52a63016cc9c9a654c77e30ac24b2fc0541bc13721710ee45aa0ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/team/state/monitor.ts:134 \u00B7 src/team/state/monitor.ts:246 \u00B7 src/team/state/monitor.ts:295 \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":"src/team/state/monitor.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1843ba66b3fcbaee078037406455204aa3cb62ecfc3fe8c3abaf5b7adedbed4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/team/tmux-session.ts:1126 \u00B7 src/team/tmux-session.ts:1163 \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":"src/team/tmux-session.ts"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"48134622c3e3324215911ce86fb0d4f20e098e64cd2b3094528777467b1019b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/team/tmux-session.ts:2668 \u00B7 src/team/tmux-session.ts:2775 \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":"src/team/tmux-session.ts"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a73a1d5527194002c33bccdf3a03fbb2c230d262afa827d9ca30843ff9e99c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/team/worktree.ts:327 \u00B7 src/team/worktree.ts:335 \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":"src/team/worktree.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b90aa270b7126748723ffcf8e0aed73ddefeb660a1b17e90f4e55daed573f3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/wiki/storage.ts:259 \u00B7 src/wiki/storage.ts:273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/storage.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b750cecbe6ce890e2bde85d395540b4dcec303daa0e567dd847b885ea6dc1e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): plugins/oh-my-codex/hooks/codex-native-hook.mjs:1246 \u00B7 src/cli/plugin-marketplace.ts:799 \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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab521cd8d61bb5b87995844c4b21062df70551db888ef6b28beb0f880cfd188b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/auth/hotswap.ts:70 \u00B7 src/auth/hotswap.ts:80 \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":"src/auth/hotswap.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c015d786e811f2addd6f58af750f122004d39def414865801cd1017df51403"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/auth/paths.ts:85 \u00B7 src/auth/paths.ts:97 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/paths.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f89eabada0f543969d3a230bd3675a2901b1351dbe1c3c41ba8d816162beca5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/cli/autoresearch-intake.ts:367 \u00B7 src/cli/autoresearch-intake.ts:376 \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":"src/cli/autoresearch-intake.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7229fc96905c235dc88450389c3b7c3370efba984677d5903a8fe63ce2e8ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/cli/index.ts:697 \u00B7 src/cli/index.ts:2300 \u00B7 src/cli/sparkshell.ts:334 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc42be0f18db1133603c97b8a0e6793c3aa566d961cdf137807083a53005d7fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/cli/index.ts:6129 \u00B7 src/scripts/notify-hook/operational-events.ts:119 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":6129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2c17463009ae5778443a96d81f32e62bb7fa0864d53072fbb7a83afbdc1d86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/cli/index.ts:10430 \u00B7 src/cli/index.ts:10438 \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":"src/cli/index.ts"},"region":{"startLine":10430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e574dbfdd1137680c30d5740ba402665a9dec67b6a9dcc810632c2c0a76af9e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/cli/mission.ts:388 \u00B7 src/cli/mission.ts:427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mission.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"94be593dbcfd7f873f15aafe05e8b1643b8dfe8c7f62d5eec8adab60648a07e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/cli/mission.ts:421 \u00B7 src/cli/mission.ts:476 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mission.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aad278dfc6fd914a1fd2e8edc472bd4794e5b7817e1351cc2dcdb71aa58180"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:247 \u00B7 src/cli/plugin-marketplace.ts:273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0792d7fbc7e3b6463d10a38282e957f75e1b380f21e25220fd6f5d6360b3a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:924 \u00B7 src/cli/plugin-marketplace.ts:942 \u2014 both copies are in the same file, so extract the block into one function there 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/cli/plugin-marketplace.ts"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bebc59b23ade5558aa62200445b5ac59e107cbaa9b87d3c837cb8a67a02903"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/cli/project-runtime-codex-homes.ts:30 \u00B7 src/scripts/notify-hook/active-team.ts:24 \u00B7 src/team/state.ts:3069 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/project-runtime-codex-homes.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"93579f46db37e021b6e06fdb053caeecb538a3565bbed1cb6ae9a55701bc739a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/cli/ralph.ts:175 \u00B7 src/cli/team.ts:1600 \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":"src/cli/ralph.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e795b130c8160df9ed91bf76ce02265dadb1a9c9423e2b001e759ca3b65cc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/cli/ralplan.ts:311 \u00B7 src/scripts/codex-execution-surface.ts:25 \u00B7 src/scripts/codex-native-pre-post.ts:58 \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":"src/cli/ralplan.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca8e56ea9a65c1e64c1cc091cd71b9cbb878dfd8752950eefbf1e81ddf93e72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/cli/team.ts:1405 \u00B7 src/cli/team.ts:1607 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea065c7b8562ec6a757b407f59ab0b1e5bc60205f5f709b48124465d8ed5a01e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/cli/tmux-hook.ts:214 \u00B7 src/cli/update.ts:374 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tmux-hook.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee0b8e417b1b2691acb0629388f1c0c4680e52a1babd4a378560b9efdab8f9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/cli/update-worker.ts:23 \u00B7 src/cli/update.ts:179 \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":"src/cli/update-worker.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b422ac0c330fa79dcf9db57b1178cfbefadfc37c2fb7de5be3c0169dc7b25e3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/hooks/session.ts:3117 \u00B7 src/hooks/session.ts:3127 \u2014 both copies are in the same file, so extract the block into one function there 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/hooks/session.ts"},"region":{"startLine":3117}}}],"partialFingerprints":{"codehealthFindingId/v1":"261a9523a8a6313e209e77a69cbf59095b3109d734bf7362cdde69dbf46b365f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/hud/authority.ts:230 \u00B7 src/hud/reconcile.ts:379 \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":"src/hud/authority.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"605d844089bef4b7347f34902405e85b01e68132ca979bbdc00ed9a2bcf89278"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/leader/contract.ts:133 \u00B7 src/scripts/codex-execution-surface.ts:28 \u00B7 src/scripts/codex-native-pre-post.ts:61 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/leader/contract.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6d18a8b5ffb96bb341a90d6f464db1f9d4debcf158df48a38e8d2d5c5802a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/bootstrap.ts:734 \u00B7 src/mcp/bootstrap.ts:747 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/bootstrap.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d36cefe268b109c14014ba8d60281532956a25827e7b0a6c229e1e596a85d45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/hermes-bridge.ts:408 \u00B7 src/mcp/hermes-bridge.ts:647 \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":"src/mcp/hermes-bridge.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce0204274df33ca8e5d0850dd3a41ad60de4a1c1f64900512dbaf9836d49584"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/state-paths.ts:789 \u00B7 src/mcp/state-paths.ts:795 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/state-paths.ts"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"136bdf3d658ae2ef23caa8c9681eaefc51c4074afbee85c985ef43119d7b1c39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/native-assets/archive.ts:205 \u00B7 src/native-assets/archive.ts:215 \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":"src/native-assets/archive.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e307cb504bd0dfc5de7a35e71050a09f54f88654e3c0a1cd07689b0944ea16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/question/autopilot-wait.ts:44 \u00B7 src/team/state/dispatch-lock.ts:13 \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":"src/question/autopilot-wait.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a83a17399a893b92b83104fe2399e39f80d0c843f4ace77f7afa77c192208b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/question/types.ts:137 \u00B7 src/question/types.ts:183 \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":"src/question/types.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a43fa06b7b0afa7bda15624250817aa883cead62635b0ca0d9c0d278f237d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/question/ui.ts:378 \u00B7 src/question/ui.ts:430 \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":"src/question/ui.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"34490b37a0d776f08ab0a627d9a68862948894f6863d01a0fa5449d430efacd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/ralplan/advisory-activation-verifier.ts:33 \u00B7 src/state/operations.ts:130 \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":"src/ralplan/advisory-activation-verifier.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"062283f6b1ba48df09406fdbe0e43f456d53498aee1fdf918196317e5e03aeba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:2064 \u00B7 src/scripts/codex-native-hook.ts:21154 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"942a6b131bb90deade670f95b0c6ef9ec46e0d103186786ba88dd5a728586b67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:3345 \u00B7 src/scripts/codex-native-hook.ts:3407 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":3345}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ce23f0b78d019209be40510fb8f81c89745d19bf34fa67a5e281391538aeca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/scripts/codex-native-hook.ts:5428 \u00B7 src/scripts/codex-native-hook.ts:8304 \u00B7 src/scripts/codex-native-hook.ts:14071 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5428}}}],"partialFingerprints":{"codehealthFindingId/v1":"57100335c1a779bf74da9f48120effccfd7ad4ee4b4ecc9d2c3038b5761b9817"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/scripts/codex-native-hook.ts:5437 \u00B7 src/scripts/codex-native-hook.ts:6986 \u00B7 src/scripts/codex-native-hook.ts:7021 \u00B7 src/scripts/codex-native-hook.ts:7421 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5437}}}],"partialFingerprints":{"codehealthFindingId/v1":"168f0b084ce00d5843074f8a15d5ea47758573b703dea6e98bbfd2c47b6f65f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:5482 \u00B7 src/scripts/codex-native-hook.ts:12464 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5482}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cddb35f0152247e8423cf3dc13f5f784dc8bda374c57314d56fa0dbcf0690c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:6112 \u00B7 src/scripts/codex-native-hook.ts:16250 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08d69a11bc7e7ef1ea3ceffe398fe725341e8f46368fec84c54929c34bfee66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:6143 \u00B7 src/scripts/codex-native-hook.ts:11597 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6143}}}],"partialFingerprints":{"codehealthFindingId/v1":"327582c3007c36e0edf44bdd6296052352a206cc496b5723d7903e00cfbce780"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:6735 \u00B7 src/scripts/codex-native-hook.ts:6964 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":6735}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2216df2dfd7cf29d342d0af26c6cb7e7b04b3c3a2560b1e051069f1d3b55e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:8960 \u00B7 src/scripts/codex-native-hook.ts:19510 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":8960}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2ecb6f62386beaa6fcb5e5151a81863282bfeca84140d19424c8601946b5e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:10134 \u00B7 src/scripts/codex-native-hook.ts:16600 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":10134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2004756c7e93f6e270094e2a96afb775cdf792c6878fc1e303c1726f82734826"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:12202 \u00B7 src/scripts/codex-native-hook.ts:12574 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f095ecd6d0c5b529e46dcea02def4c834dbf7c086d1560aa70e7c0daed3a4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:12365 \u00B7 src/scripts/codex-native-hook.ts:16518 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12365}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d6b1bfe63230068d6d8cef795217f15981d3c1196c35515b0e19deb9a0f24c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:12478 \u00B7 src/scripts/codex-native-hook.ts:12502 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12478}}}],"partialFingerprints":{"codehealthFindingId/v1":"f130203d51b1bda5c99bef7006928d7e2cf8191e7d78fd98f9ee32da680c84a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/scripts/codex-native-hook.ts:12634 \u00B7 src/scripts/codex-native-hook.ts:13231 \u00B7 src/scripts/codex-native-hook.ts:13280 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":12634}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ce4594d2f2d6c41d8dc223e59e7c46dae07d2008e66de9cd492daa842d44fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:13592 \u00B7 src/scripts/codex-native-hook.ts:13598 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13592}}}],"partialFingerprints":{"codehealthFindingId/v1":"448cda86b7284058a3560143986736ac9c7bc757393b29d03b8ade27658431fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:13945 \u00B7 src/scripts/codex-native-hook.ts:13955 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":13945}}}],"partialFingerprints":{"codehealthFindingId/v1":"253f602e6eeccc226f2c7a7a160de38ac9f0619689477de445a36d2ca62fd6bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:14409 \u00B7 src/scripts/codex-native-hook.ts:15691 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":14409}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35295a6bb3766d95dad3132f901ecd2302118944f05b2041080422b50781ce2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:16131 \u00B7 src/scripts/codex-native-hook.ts:16144 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16131}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd688a8e81f3f124b9263b6aa9758818f901981bc337170545cdd5129c5e8014"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:16254 \u00B7 src/scripts/codex-native-hook.ts:18086 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":16254}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a3739f36a2b72a51c57318d5687c3ee88e21b0336ae3935632b3ade22cf155"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/scripts/eval/eval-candidate-handoff.ts:2 \u00B7 src/scripts/eval/eval-fresh-run-tagging.ts:2 \u00B7 src/scripts/eval/eval-resume-dirty-guard.ts:2 \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":"src/scripts/eval/eval-candidate-handoff.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60c8bf3c691277f698cf158448c2909a7748b6c65f815bbfa968feb7078ac22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/notify-fallback-watcher.ts:505 \u00B7 src/scripts/notify-fallback-watcher.ts:557 \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":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"71491e14f45987d7cdf5b279b6a1f027ada9fec3b858fa9e78aa7f03995d7e3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/notify-fallback-watcher.ts:613 \u00B7 src/scripts/notify-fallback-watcher.ts:674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efe66d16cda930efa9fe7f1f64b2cacbc5950d4dae8d6160d74eb555a4793a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/notify-hook.ts:783 \u00B7 src/scripts/notify-hook/auto-nudge.ts:607 \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":"src/scripts/notify-hook.ts"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"694e68b77fb4f86d316b4ac15c51443f50142e4bf4894b31f4043f75217cda18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/notify-hook/log.ts:16 \u00B7 src/scripts/notify-hook/log.ts:24 \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":"src/scripts/notify-hook/log.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0d571aeb5ddc1f99f6659b51b14ed7b62c18918ae7736b3ef06cd1d90b8b28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/scripts/notify-hook/team-dispatch.ts:481 \u00B7 src/scripts/notify-hook/team-worker.ts:311 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"9128f3f41e5b9da476a22e51851df20dd5a74f37883de824ca07c634f8b00d5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/scripts/notify-hook/team-dispatch.ts:43 \u00B7 src/team/state/dispatch.ts:185 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddeacbe79b7ac01845a5592ea49159a2e88a2b2d8c79bd77bc08ecfb29e071b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/scripts/run-test-files.ts:304 \u00B7 src/vscode/index.ts:268 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"src/scripts/run-test-files.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2d75c55918a0bcff85f3d2850b2019c294ad406f7865af353ba2a52f1bcb2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/smoke-packed-install.ts:2489 \u00B7 src/scripts/smoke-packed-install.ts:2503 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/smoke-packed-install.ts"},"region":{"startLine":2489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18d167879f03a06eda8c4e9d7ebe713f64976cf90ecef3d723811b425378f8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/smoke-packed-install.ts:5068 \u00B7 src/scripts/smoke-packed-install.ts:5121 \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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":5068}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd380a48f3cea714ec406b34bf9025622043825562e8469f880fce8823c5de5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripts/tmux-hook-engine.ts:289 \u00B7 src/team/tmux-session.ts:3277 \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":"src/scripts/tmux-hook-engine.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"1987bc47f77ccaaffc3e978d00ac16d33dbdc20774f1a9a50ac43777b52ea89e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/state/mode-binding-lease-helper.ts:208 \u00B7 src/state/pinned-atomic-file.ts:127 \u00B7 src/state/pinned-atomic-file.ts:210 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/mode-binding-lease-helper.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8b67baae31db2f4b15bdd29cea3dda35aa3e5fb3243f0330b43e44b91c4962"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 11 locations): src/team/api-interop.ts:705 \u00B7 src/team/api-interop.ts:726 \u00B7 src/team/api-interop.ts:760 \u00B7 src/team/api-interop.ts:770 \u00B7 \u002B7 more site(s) not listed \u2014 all 11 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":"src/team/api-interop.ts"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"8561032f27fd5ba1819b09adfce513e8f8e9fc190cb44c575013edde12b8a38e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/team/api-interop.ts:807 \u00B7 src/team/api-interop.ts:937 \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":"src/team/api-interop.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ff135919effa5ac5062f55ed54a27b6b6c0e3edc632c64c985ba736849a056"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/team/notice-ledger.ts:245 \u00B7 src/team/notice-ledger.ts:257 \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":"src/team/notice-ledger.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3d2531f603728e1c6ea69e4f6e2aa4e38e98fe1b968ca208f7b4a0ace41b2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/team/pane-status.ts:480 \u00B7 src/team/pane-status.ts:487 \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":"src/team/pane-status.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"263abda7fec5a8a593acf988373a084fd7a46fc2d05bdf7252cfc02a5a0e5d69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/team/runtime.ts:216 \u00B7 src/team/scaling.ts:284 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c8f5258f1cd4b51e374e0427e272733785f8c77caf4c96fa8bb8502b7ea90e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/team/runtime.ts:507 \u00B7 src/team/runtime.ts:515 \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":"src/team/runtime.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2baac9d243233e67728b59bc83e3fff4f04739845131dfed6a21571fc629438"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/team/runtime.ts:7448 \u00B7 src/team/runtime.ts:7486 \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":"src/team/runtime.ts"},"region":{"startLine":7448}}}],"partialFingerprints":{"codehealthFindingId/v1":"572dbc4898e0e1cb88f68ce4eb8d189661adcd8f59f01603869429f1041c4b77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): src/team/state.ts:702 \u00B7 src/team/state.ts:713 \u00B7 src/team/state.ts:720 \u00B7 src/team/state.ts:736 \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":"src/team/state.ts"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c40d6bbe2c997629f06467115f847a14c9afcc1fd30baf797739dc455294c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/team/state.ts:1488 \u00B7 src/team/state.ts:1536 \u00B7 src/team/state.ts:1608 \u00B7 src/team/state.ts:1624 \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":"src/team/state.ts"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b1818798baf8724a084d84cfbf31a81c12eb14cb4d58a745d9e88e9371b5c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/team/state/tasks.ts:212 \u00B7 src/team/state/tasks.ts:310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/tasks.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d73dba0e319ad6b91ded943ae0b004723ec4e0dd0524f2177ce447e6b43a316"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/team/tmux-session.ts:1484 \u00B7 src/team/tmux-session.ts:1529 \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":"src/team/tmux-session.ts"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca59e3016ea93bc19503afe302fc20871b86b00f38d41001746c4b6489083dcc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/team/tmux-session.ts:2120 \u00B7 src/team/tmux-session.ts:2159 \u2014 both copies are in the same file, so extract the block into one function there 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/team/tmux-session.ts"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafa3deabb495e7f86cdca1f877fc4e1350ece1d1320915ac2d7b387437ca1df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/auth/sessions.ts:14 \u00B7 src/config/codex-hooks.ts:3039 \u00B7 src/session-history/friction.ts:230 \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":"src/auth/sessions.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"faef08abca2befa447cded7d6ab18b924188dbd94fa2b9516341ba44b355c50a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/cli/capabilities.ts:117 \u00B7 src/cli/mission.ts:132 \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":"src/cli/capabilities.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ef9483d75fae5b79a11796a8dcf9c5f99f4eb8501914bf73137f5956b9804a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/cli/index.ts:1059 \u00B7 src/cli/index.ts:1107 \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":"src/cli/index.ts"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"111de86bc8635788c001cd71878bcfb7148c42fc83ac4b899c0bba27185ba184"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/cli/index.ts:6481 \u00B7 src/scripts/notify-hook/managed-tmux.ts:228 \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/cli/index.ts"},"region":{"startLine":6481}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b161672e685f575b243a801eb31e78c74996d8934e4d56de733f407416b4df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/cli/mission.ts:100 \u00B7 src/scripts/codex-native-hook.ts:9052 \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":"src/cli/mission.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"dced31628d9460c2934d91e935e8071d818f9e0cfe71c56b7d258d8a1ed83873"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:211 \u00B7 src/cli/plugin-marketplace.ts:589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c008e14e86540babe35c5d523c4ac2e0c5c40b7cff3eb81c0e677078395a7a4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:255 \u00B7 src/cli/plugin-marketplace.ts:283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7be759c5f7c20e217539f94f2681d1d3f344bf0f2c8bd0011343fa2d4a8dfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/cli/plugin-marketplace.ts:1941 \u00B7 src/cli/plugin-marketplace.ts:2009 \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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b64f470fad132daede695c2d2c402c04f40a652b3ebc5dd084b4f02a81ec01f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/cli/ralplan.ts:152 \u00B7 src/cli/ralplan.ts:168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/ralplan.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fddca5f7eb38ffed46a1d7fd123a9eb756addd9da958ae468fc6268702486f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/cli/session-timeline.ts:43 \u00B7 src/cli/session-usage.ts:28 \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":"src/cli/session-timeline.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a039dfab8fb3934d90b4ef930376062455c6032bc59176d807490b962f40636c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/cli/update.ts:105 \u00B7 src/config/codex-feature-flags.ts:40 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e147b78192c1580153b66e29427322859fc68fbcbac8b1f1d04f0ceb9268461c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/config/codex-hooks.ts:2798 \u00B7 src/config/codex-hooks.ts:2853 \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":"src/config/codex-hooks.ts"},"region":{"startLine":2798}}}],"partialFingerprints":{"codehealthFindingId/v1":"639c4f007f17632def61269dbbaca9c87cac098427df35a7628443fb66e6518d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/goal-workflows/codex-goal-snapshot.ts:33 \u00B7 src/hooks/native/pre-tool-use-advisory.ts:15 \u00B7 src/state/operations.ts:261 \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":"src/goal-workflows/codex-goal-snapshot.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cc25f5651df1f6d93f8d060374515c0bf5812bd071282e7a358690af6b2c4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/hooks/extensibility/logging.ts:6 \u00B7 src/hooks/extensibility/sdk/paths.ts:21 \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/hooks/extensibility/logging.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1014a609a5080364be85a026453f67bce168128b2a1051ea9228bfb49d0f7d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/hooks/extensibility/sdk/tmux.ts:62 \u00B7 src/team/tmux-session.ts:271 \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":"src/hooks/extensibility/sdk/tmux.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d12c72c276c7c4a80297424cd3c918f48aac4d1658359cf8fbc4170c7bbffd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/hooks/session.ts:4013 \u00B7 src/hooks/session.ts:4043 \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":"src/hooks/session.ts"},"region":{"startLine":4013}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90c720dc92248154766bfa6538baeb649b5e72a9d3bef9eb0a1f99970972153"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/hud/tmux.ts:555 \u00B7 src/hud/tmux.ts:561 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"169a44a7f56c0f592f10bf5655ee23d61ab458ff2d64f921abcbf867eced4e44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/mcp/hermes-server.ts:165 \u00B7 src/mcp/wiki-server.ts:166 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/hermes-server.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f580e2417a7ce4777a50f7591b754d27ecda3d07b80afcf68c9b2379071a934"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/question/renderer.ts:202 \u00B7 src/question/renderer.ts:210 \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":"src/question/renderer.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f37bdcd28a77ff2d9903ebbb8a490edfae3659af4ac7690d4de37fbf02749cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/ralplan/advisory-contract.ts:86 \u00B7 src/ralplan/advisory-contract.ts:100 \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":"src/ralplan/advisory-contract.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3401b39654c0642bd3bb4cff3e8cc6e6ef389eb5057a2d17ff30dbb1b4da1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/ralplan/advisory-storage.ts:38 \u00B7 src/state/pinned-atomic-file-darwin-janitor.ts:58 \u00B7 src/state/pinned-atomic-file.ts:42 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory-storage.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ffe226cff2e3818289e11b972400c207e5be9ebb34c476b6f00ed724a40e48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/ralplan/documented-leader-preflight.ts:175 \u00B7 src/ralplan/documented-leader-preflight.ts:190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/documented-leader-preflight.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebc86bb691df5a8e7680559749e8bd2811680bd2b1a9f012a5d9d1e3ca3a204"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:3949 \u00B7 src/scripts/codex-native-hook.ts:3961 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":3949}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d6d7678104ab90ef55fc07e484413bda0b0a52cb13018c1fa074c266726771"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:5161 \u00B7 src/scripts/codex-native-hook.ts:15588 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":5161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a740c489fab97b98affc20a55d3d33ba7182e84e7c43686cab66624db565a0ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:5268 \u00B7 src/scripts/codex-native-hook.ts:14244 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":5268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a98fd3611ac0c491989131979d3b02a0842a57e4ceb57ba9aa5632c74943a35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:9351 \u00B7 src/scripts/codex-native-hook.ts:16421 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37805b046ee2c312692cc2bb6587c62f5c2024585b09e368cc7cf457de7e076"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:11600 \u00B7 src/scripts/codex-native-hook.ts:14287 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":11600}}}],"partialFingerprints":{"codehealthFindingId/v1":"7617a7905376d2fb1b69c4b83d0e973c2c4eef1aaef8286859eb3f11f55d4ad4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:13664 \u00B7 src/scripts/codex-native-hook.ts:13683 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":13664}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1c01fc574ddfe67c54a8152c32cec4a1372e6ee7d595521308e783b5b4eeda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:15128 \u00B7 src/scripts/codex-native-hook.ts:19896 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15128}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a24275ac47bcae130f1f8f2c24a7a30500e59d5daa008d21425db5f8f8c3f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:15977 \u00B7 src/scripts/codex-native-hook.ts:15987 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":15977}}}],"partialFingerprints":{"codehealthFindingId/v1":"05df0cf75fb2fff12367ee641239bd3b00df612f4bf27a6ac0a37efde2e090f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:16177 \u00B7 src/scripts/codex-native-hook.ts:16188 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/codex-native-hook.ts"},"region":{"startLine":16177}}}],"partialFingerprints":{"codehealthFindingId/v1":"510628d8b7c8809da15fb66fb0fb1ad30c177c9b94244ee7a1719088458e2493"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:16292 \u00B7 src/scripts/codex-native-hook.ts:19806 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16292}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e267e1253b3ac0ade925f1b71438a7051d5def8ebd937cab3b65c119adeca0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:16993 \u00B7 src/scripts/codex-native-hook.ts:17011 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":16993}}}],"partialFingerprints":{"codehealthFindingId/v1":"77310fed1a3423fea0b44b9e2de34dbd402254edd03dc092a10e675305125df6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:17119 \u00B7 src/scripts/codex-native-hook.ts:17126 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17119}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffc5ff3290ea578da2924fcc7bbee4f228b7b7e2bbb25832c4e9aff3d70da2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-hook.ts:23141 \u00B7 src/scripts/notify-hook.ts:1215 \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":"src/scripts/codex-native-hook.ts"},"region":{"startLine":23141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1636dc93a39e3c6900059219ba12442db3236273343618ae50c0a6f1a6bc04af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-pre-post.ts:482 \u00B7 src/scripts/codex-native-pre-post.ts:491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-pre-post.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdeee87a73fee33f3a41d7415923beb0b1520354928c4019ff05210e1d011274"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-pre-post.ts:1266 \u00B7 src/scripts/codex-native-pre-post.ts:1277 \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":"src/scripts/codex-native-pre-post.ts"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bc0ccadb582a3662bad537556ede91e680c75cfc1ae40ea1b2a6518b4dc712"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/codex-native-pre-post.ts:1275 \u00B7 src/scripts/codex-native-pre-post.ts:1286 \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":"src/scripts/codex-native-pre-post.ts"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"8489b4e500660648fc41fcb73fd6cb541bfddaa8ae4a60efb40e6ac3772a2b23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/scripts/eval/eval-in-action-cat-shellout-demo.ts:13 \u00B7 src/scripts/eval/eval-parity-smoke.ts:3 \u00B7 src/scripts/eval/eval-parity-sweep.ts:3 \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":"src/scripts/eval/eval-in-action-cat-shellout-demo.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02ef714dbc40f92683b12acc26878bafaf6a5ba84460e24f522d1cb6cb9d43d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/scripts/generate-release-body.ts:319 \u00B7 src/scripts/postinstall.ts:200 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/generate-release-body.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da343cc9e9204fc416908834fa240cd68e2012adc5567ab5d635ed9e5b8688d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/hook-derived-watcher.ts:15 \u00B7 src/scripts/notify-fallback-watcher.ts:43 \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":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b706ef11852a9f8c5745327ece841a61224e09d36397c2380c4608cc9e78a78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/notify-hook/managed-tmux.ts:649 \u00B7 src/scripts/notify-hook/managed-tmux.ts:678 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/managed-tmux.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"e714211c26bf4d87f9b89fb6a180a63f14c7ed51bb8278139916c56f3365da4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/scripts/notify-hook/orchestration-intent.ts:36 \u00B7 src/scripts/notify-hook/team-leader-nudge.ts:203 \u00B7 src/scripts/notify-hook/team-leader-nudge.ts:228 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/orchestration-intent.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f281d0aa62b9bfcb3fb9f6d9df0f3eb88f35b3a907ca3e72f0260ffa44a8a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/scripts/notify-hook/team-worker.ts:221 \u00B7 src/team/api-interop.ts:870 \u00B7 src/team/api-interop.ts:1205 \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/scripts/notify-hook/team-worker.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"61790f53695f203ac67ad6806448d7853c5d740cba37f0d822245c129b740c02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/scripts/smoke-packed-install.ts:4011 \u00B7 src/scripts/smoke-packed-install.ts:4074 \u2014 both copies are in the same file, so extract the block into one function there 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/scripts/smoke-packed-install.ts"},"region":{"startLine":4011}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b98c2f5af60e769af0ce6fb702a641ac8257e12d537ac42caabfaf2a3a778e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/state/pinned-atomic-file-darwin-helper.ts:38 \u00B7 src/state/pinned-atomic-file-darwin-janitor.ts:42 \u00B7 src/state/pinned-atomic-file.ts:54 \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":"src/state/pinned-atomic-file-darwin-helper.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"733d3f762b21e7859adbfd4f36e1f9e7625f6579234f2cc6fb41587d47d25e6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/state/process-identity.ts:18 \u00B7 src/state/process-identity.ts:25 \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":"src/state/process-identity.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34595143793de953a11540dabc1e57959fabc899c6093e98d9c9f3f0fe5a59f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/subagents/tracker.ts:403 \u00B7 src/subagents/tracker.ts:412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa45aba9511e8daa1802369d467bcc881f9495c624089fd8955475f22f6baf9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): src/team/api-interop.ts:627 \u00B7 src/team/api-interop.ts:869 \u00B7 src/team/api-interop.ts:905 \u00B7 src/team/api-interop.ts:1204 \u2014 all 4 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":"src/team/api-interop.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a7dd9a07495db089d12762fb3fff9feeb75f0b0e57203f46d6363bec0f87b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/team/api-interop.ts:775 \u00B7 src/team/api-interop.ts:994 \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":"src/team/api-interop.ts"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c084ff3e8417287835bdf1e76c2a74229b3bd652041d24159e8a9b563b1e647"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/team/runtime.ts:1328 \u00B7 src/team/runtime.ts:1561 \u00B7 src/team/runtime.ts:1983 \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":"src/team/runtime.ts"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e287f99dcbfa5609c3b8ba3ed22da2ded355526366761f365b713a865480ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/team/runtime.ts:2276 \u00B7 src/team/runtime.ts:2282 \u2014 both copies are in the same file, so extract the block into one function there 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/team/runtime.ts"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"9850f248472aec5b8f6044456c0a836b4a40cdc5bd71b7c37a72b9d4406f0bb1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/team/state.ts:2058 \u00B7 src/team/state.ts:2606 \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":"src/team/state.ts"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaf50ecfc18c5db4329bc49eb1f1c6af0d0d20374c1687e33ec22071cbd3fd5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/team/state/dispatch.ts:113 \u00B7 src/team/state/dispatch.ts:236 \u00B7 src/team/state/monitor.ts:109 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/dispatch.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"59135229a29c5ed31a0a3a3df7ca9a1a219c437c3aa4f7d96de65526f59163e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/team/state/mailbox.ts:391 \u00B7 src/team/state/mailbox.ts:430 \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":"src/team/state/mailbox.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"745d8fb2e4d3a25ed57489650893e12108aed336fd8a585487d0e834caabf930"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/team/state/tasks.ts:109 \u00B7 src/team/state/tasks.ts:321 \u00B7 src/team/state/tasks.ts:350 \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":"src/team/state/tasks.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a13f5b0adff592b61743fbffec953da754d6f31733b3e5e52e778cdf455c38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/team/tmux-session.ts:638 \u00B7 src/team/tmux-session.ts:4149 \u2014 both copies are in the same file, so extract the block into one function there 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/team/tmux-session.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e58217d22dbca9bd92ba6d52ca78d2c22f477a35733ed4479ecff134d62bba1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/team/tmux-session.ts:845 \u00B7 src/team/tmux-session.ts:875 \u2014 both copies are in the same file, so extract the block into one function there 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/team/tmux-session.ts"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5426d541dae08cce357778decf99d65fb987ca642e421a615ca7ea487bb5f3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/team/tmux-session.ts:1717 \u00B7 src/team/tmux-session.ts:1781 \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":"src/team/tmux-session.ts"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9f1bb5109c8586c3e845413c12280bf5523269cdcc6bf5142947ef359ccca1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/ultragoal/artifacts.ts:1796 \u00B7 src/ultragoal/artifacts.ts:2096 \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":"src/ultragoal/artifacts.ts"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"4710ec0dc230b1ff3f0f6a8410621e1e5990a4b788da4030139aa24bc7a0938c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchCodexNativeHook (cyclomatic 326, cognitive 520): dispatchCodexNativeHook has cyclomatic complexity 326 and cognitive complexity 520; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/scripts/codex-native-hook.ts"},"region":{"startLine":21948}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd90180174db01fbf3529917ee0f795f82b6a4bfcb1e02c8a619edc9476740e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeTeamApiOperation (cyclomatic 284, cognitive 321): executeTeamApiOperation has cyclomatic complexity 284 and cognitive complexity 321; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/team/api-interop.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"2109b253752d976a7b3fc8407e7dedd4f2dc1539c68e8e2735599fced1b0f21c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectConductorDownloaderOutputTargets (cyclomatic 263, cognitive 492): collectConductorDownloaderOutputTargets has cyclomatic complexity 263 and cognitive complexity 492; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/scripts/codex-native-hook.ts"},"region":{"startLine":14853}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1071aee0ffd9bf19a5114418200b7bbe46d2a8f2df83bed0f3e3582df64e469"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setup (cyclomatic 239, cognitive 415): setup has cyclomatic complexity 239 and cognitive complexity 415; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/cli/setup.ts"},"region":{"startLine":4449}}}],"partialFingerprints":{"codehealthFindingId/v1":"439dcbf69e399ea500f42fbb370c6e54ddecb22452506a330430a9f4c1a7b289"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 205, cognitive 324): main has cyclomatic complexity 205 and cognitive complexity 324; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/scripts/notify-hook.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93e923cae11ea8a94f2d17289fa5b68d3d4b38f220613d30b848c993d39e5fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanConductorShellSegment (cyclomatic 190, cognitive 310): scanConductorShellSegment has cyclomatic complexity 190 and cognitive complexity 310; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/scripts/codex-native-hook.ts"},"region":{"startLine":18826}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab2ba36b8e487823845005be4372a88a26dba1f7dad3ea559bd50b64cfbd00a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectConductorRuntimeExecutions (cyclomatic 176, cognitive 343): inspectConductorRuntimeExecutions has cyclomatic complexity 176 and cognitive complexity 343; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/scripts/codex-native-hook.ts"},"region":{"startLine":13056}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3092d6f9f1fc2de4fd6def90b4cab86723729c2f50933284c929b8c9f8fb3f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shutdownTeam (cyclomatic 167, cognitive 290): shutdownTeam has cyclomatic complexity 167 and cognitive complexity 290; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/team/runtime.ts"},"region":{"startLine":5068}}}],"partialFingerprints":{"codehealthFindingId/v1":"81860fb9608ef0c32ef5e0d67c601c00c333b0f6709052d6cfe1dbd486d37d0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maybeNudgeTeamLeader (cyclomatic 164, cognitive 279): maybeNudgeTeamLeader has cyclomatic complexity 164 and cognitive complexity 279; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c7262574b9246e47f84045291fa4bcd3a94d2e2eb0312fed699f8e9fa3444b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function smokeInstalledNativeHookDist (cyclomatic 160, cognitive 217): smokeInstalledNativeHookDist has cyclomatic complexity 160 and cognitive complexity 217; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/scripts/smoke-packed-install.ts"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"db84cd4e8c9bcc9961b2224bda74bf52c343f2dedd0f07e7b76a89b604b254f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startTeam (cyclomatic 155, cognitive 308): startTeam has cyclomatic complexity 155 and cognitive complexity 308; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/team/runtime.ts"},"region":{"startLine":3562}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dab4cdf405e18478d4e1c889a79d27ecb3381517cde47628989c27f829ca62c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordSkillActivation (cyclomatic 149, cognitive 214): recordSkillActivation has cyclomatic complexity 149 and cognitive complexity 214; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/hooks/keyword-detector.ts"},"region":{"startLine":3883}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd00386d0063fc271675fb0d8801fdb355826af50e7581001123a178082552b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyShellPosixStateEffect (cyclomatic 133, cognitive 240): applyShellPosixStateEffect has cyclomatic complexity 133 and cognitive complexity 240; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/scripts/codex-native-hook.ts"},"region":{"startLine":18083}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1852b36a1b5ceb1bff688eea94324702334b338ba5e8e7c9ac7a149a3119d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 122, cognitive 225): (anonymous) has cyclomatic complexity 122 and cognitive complexity 225; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/team/scaling.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab9c25875f83ec6a658d43530ffacad86118191b50659cdd384da71882a5837"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createTeamSession (cyclomatic 116, cognitive 220): createTeamSession has cyclomatic complexity 116 and cognitive complexity 220; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/team/tmux-session.ts"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5f7880cce1a85d81f1b57933b189deb962ff24691bfd7769cecea9c3dc917b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractNodeFsSemanticMutations (cyclomatic 101, cognitive 174): extractNodeFsSemanticMutations has cyclomatic complexity 101 and cognitive complexity 174; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/scripts/codex-native-hook.ts"},"region":{"startLine":13472}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3c0c9b84a2622df3ce1c67b7d76f6d0286ac29d23c9fa0c73ce42b112f753c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderTick (cyclomatic 99, cognitive 101): renderTick has cyclomatic complexity 99 and cognitive complexity 101; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/hud/index.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d89a95e4f179542c1f99e471cacae38f6aa935bed98ad99f155719025353ee8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectConductorMutationCommandTargets (cyclomatic 94, cognitive 154): collectConductorMutationCommandTargets has cyclomatic complexity 94 and cognitive complexity 154; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/scripts/codex-native-hook.ts"},"region":{"startLine":15724}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baac9ff240ee63ad847edb930f06680443139ee207cb8265f76dd84434ebb3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function materializePackagedOmxPluginCacheImpl (cyclomatic 93, cognitive 184): materializePackagedOmxPluginCacheImpl has cyclomatic complexity 93 and cognitive complexity 184; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/cli/plugin-marketplace.ts"},"region":{"startLine":3876}}}],"partialFingerprints":{"codehealthFindingId/v1":"6404bd43ab734ef48289a58caeb8180cb9f780441fcefad1f85b271a9d9d09c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSessionTimeline (cyclomatic 91, cognitive 224): buildSessionTimeline has cyclomatic complexity 91 and cognitive complexity 224; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/session-history/timeline.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"800e49bcfa2438b1702d193aee9c2c4eceb55c463c6ce2830e3d6ff8f20a3a5e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/index.ts: 10352 lines of code: src/cli/index.ts has 10352 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":"src/cli/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f9c737cdd28c9e43241bf2d6d33562ff757740c569ce2f841de087d60af1e5"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/runtime.ts: 7007 lines of code: src/team/runtime.ts has 7007 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":"src/team/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff70891f31497cc4582ffcb2b6c442a988b6668454bc0d40bc8d08360e6b859"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/setup.ts: 6498 lines of code: src/cli/setup.ts has 6498 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":"src/cli/setup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e6dab142f706319814b92e7aef902b99d85c455efbae37d79d139785f42f2f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/smoke-packed-install.ts: 5536 lines of code: src/scripts/smoke-packed-install.ts has 5536 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":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b63f0fb3b2d53348e2b82637cb063a5384dcf265299400df9ec35e6821736fd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/plugin-marketplace.ts: 4472 lines of code: src/cli/plugin-marketplace.ts has 4472 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":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06dffd9d90ef06b2127343b37d1302915c8d3b7e97be6594b1e2f312c50c6796"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/tmux-session.ts: 4400 lines of code: src/team/tmux-session.ts has 4400 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":"src/team/tmux-session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8389d627732e0c64b63eb679136c828bb45e5f754606df86b27f9a33bd21234e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/doctor.ts: 4140 lines of code: src/cli/doctor.ts has 4140 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":"src/cli/doctor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4afd778f4f8b0350e3a5953c4118309464282ea642ba5f55a5a43fdb650e90a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/config/generator.ts: 4086 lines of code: src/config/generator.ts has 4086 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":"src/config/generator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ecf6806e01ea680731ae18f2ede810bb29425f6a004247e57b706465c06220"}},{"ruleId":"R3","level":"warning","message":{"text":"src/hooks/keyword-detector.ts: 4066 lines of code: src/hooks/keyword-detector.ts has 4066 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":"src/hooks/keyword-detector.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da883e7d540fbdd692e0b8053d464a4dcdef67944ff7ba52b1a27677cefc04c7"}},{"ruleId":"R3","level":"warning","message":{"text":"src/hooks/session.ts: 3800 lines of code: src/hooks/session.ts has 3800 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":"src/hooks/session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5519b925236f50f6b6704019c64db2475a1fb1206d6764e7c0521c2010da38"}},{"ruleId":"R3","level":"warning","message":{"text":"src/config/codex-hooks.ts: 2881 lines of code: src/config/codex-hooks.ts has 2881 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":"src/config/codex-hooks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2924728093bc7394bb93e7c998f3d0e6221b98ce5e0b145af1955c4f3fca454b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/state.ts: 2880 lines of code: src/team/state.ts has 2880 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":"src/team/state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a75382c21354d622445f654abecc5bdc8ed1c4e1964b68ff07e480de70f32e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/scaling.ts: 2195 lines of code: src/team/scaling.ts has 2195 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":"src/team/scaling.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17059b646f18065487203df737a9db0c608ddce093eb0f634f8c5fccff8df9a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ultragoal/artifacts.ts: 2133 lines of code: src/ultragoal/artifacts.ts has 2133 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":"src/ultragoal/artifacts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"965c7040e2d808f9727b54f26e19b0f21f848c4bfeaa27d170dcba27b2f520a1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/hud/tmux.ts: 2117 lines of code: src/hud/tmux.ts has 2117 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":"src/hud/tmux.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd37f45826af03e45410289d0aa05597103d48bba39fd3c2ec793f01f784c009"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/uninstall.ts: 1949 lines of code: src/cli/uninstall.ts has 1949 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":"src/cli/uninstall.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c47a799a033c1cba47f388832a55704e6b3083abeaa4ad4869ba539dc332b57"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/notify-fallback-watcher.ts: 1925 lines of code: src/scripts/notify-fallback-watcher.ts has 1925 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":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e29f56d39dbd828f75a8f2dbee2d0efa3c575e50aa790196dac20120709a0a4"}},{"ruleId":"R3","level":"warning","message":{"text":"plugins/oh-my-codex/hooks/codex-native-hook.mjs: 1799 lines of code: plugins/oh-my-codex/hooks/codex-native-hook.mjs has 1799 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":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27daa03958bbf6c56d807a23cbb41fb3f7f0b4490bb36f6de26ddf2b05cb84df"}},{"ruleId":"R3","level":"warning","message":{"text":"src/subagents/tracker.ts: 1785 lines of code: src/subagents/tracker.ts has 1785 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":"src/subagents/tracker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4c43bda365367b363c535c80bef4ed5c235e8fff103c2e66cbb5797aa4d084"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/team.ts: 1679 lines of code: src/cli/team.ts has 1679 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":"src/cli/team.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9fe9134a3e08d915e3924492205263bad535475d7938144fe86da37bc662c7"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/codex-native-pre-post.ts: 1349 lines of code: src/scripts/codex-native-pre-post.ts has 1349 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":"src/scripts/codex-native-pre-post.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c55fd0fe7c432b16ee59e7a7b3774510c2fed6054585f216953e7ffc0fc2b9a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/notify-hook/team-dispatch.ts: 1272 lines of code: src/scripts/notify-hook/team-dispatch.ts has 1272 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":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f5edb8343b3e402e41f5205e07443603e20e6f1682829b387a0329ac695e9f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/notify-hook/team-leader-nudge.ts: 1240 lines of code: src/scripts/notify-hook/team-leader-nudge.ts has 1240 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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d670fb621c29e9de155c31eb4110d2f459802448609190e23619c7a1473024"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/state-paths.ts: 1231 lines of code: src/mcp/state-paths.ts has 1231 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":"src/mcp/state-paths.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea56ad2c9a055ee141073a63a3182099114ddfc33dfa7d809a11f58263d5a82"}},{"ruleId":"R3","level":"warning","message":{"text":"src/autoresearch/runtime.ts: 1223 lines of code: src/autoresearch/runtime.ts has 1223 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":"src/autoresearch/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb72d530a91f10512ae8546afff0131ed57b4e02f2509fc78e15b5a88346ee37"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/api-interop.ts: 1188 lines of code: src/team/api-interop.ts has 1188 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":"src/team/api-interop.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d591ab439e8ba16e389ad31063431cf323f2316858bcf38cd70b02aca3656635"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/notify-hook.ts: 1142 lines of code: src/scripts/notify-hook.ts has 1142 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":"src/scripts/notify-hook.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b4becc4777436e519ee40e10d6ec2976d09d52d86d11017d420dde88e2a82a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/state/operations.ts: 1068 lines of code: src/state/operations.ts has 1068 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":"src/state/operations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e846f01fb89c409ff33ae7b53a294811649d11707f02ec20976bd006c3e3efb"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/worker-bootstrap.ts: 1030 lines of code: src/team/worker-bootstrap.ts has 1030 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":"src/team/worker-bootstrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62348b475ac97b98a50cc473307a4b6e27afa56a6af196f203748f3f645cd82"}},{"ruleId":"R3","level":"warning","message":{"text":"src/state/skill-active.ts: 1025 lines of code: src/state/skill-active.ts has 1025 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":"src/state/skill-active.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ef5eee029ab32ae8d184ea7ecb39740f19d38d624fe4e3ae9c4ecca4acb9a6"}},{"ruleId":"R3","level":"warning","message":{"text":"src/question/renderer.ts: 974 lines of code: src/question/renderer.ts has 974 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/renderer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de127a7b439114bcf28ed0c4e837c890da659ed40dc8cedf69e37bc8375e69d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/notifications/reply-listener.ts: 973 lines of code: src/notifications/reply-listener.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":"src/notifications/reply-listener.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd94d1fd1cef912fcffcf0905ab57fa2e7877c3dcfcac45dc9f95fe68595e37"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ralplan/advisory.ts: 970 lines of code: src/ralplan/advisory.ts has 970 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":"src/ralplan/advisory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09683e9dbef95f2e392488b9d0dab64a1b8f19dd1cd7b7ab8596301e37bc2827"}},{"ruleId":"R3","level":"warning","message":{"text":"src/hud/state.ts: 937 lines of code: src/hud/state.ts has 937 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":"src/hud/state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeff207a5819be4cdbb44863e84cc861b3104826cb33209c473373fb5b375a4"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/update.ts: 916 lines of code: src/cli/update.ts has 916 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":"src/cli/update.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a6b85de35e4411a318f8c4d2d4510546be83fbe799ac46984b5a3f5ee0b93b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/pane-status.ts: 840 lines of code: src/team/pane-status.ts has 840 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":"src/team/pane-status.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb0210d8499652f83bed5a14b95d191183672d5ef6489b98e3b81d4190a90e8"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ralplan/runtime.ts: 798 lines of code: src/ralplan/runtime.ts has 798 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":"src/ralplan/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"382a9fefef21d835d1a77ca133a95f85dd6810f4bb3e9b09dcc366e0fb9991c9"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/notify-hook/auto-nudge.ts: 776 lines of code: src/scripts/notify-hook/auto-nudge.ts has 776 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":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7fc76dd30a00f3786546ea8213bbca6a3708fb8155fd521905130b5cc3f45c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/notifications/config.ts: 753 lines of code: src/notifications/config.ts has 753 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":"src/notifications/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b57cd1ec76d227a365c9c3e0bed715b78bdc67056aea03194a1fef2cd9f835"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/native-assets.ts: 733 lines of code: src/cli/native-assets.ts has 733 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":"src/cli/native-assets.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedbf395d0ea8701d904097895faf208faf1937a161a3bf6949d417b36885b6d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/notify-hook/tmux-injection.ts: 733 lines of code: src/scripts/notify-hook/tmux-injection.ts has 733 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":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"116cba7a7b0797223de2309f96791d6132df50bbcf0f91ddecac8fe945f16fe3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/hud/reconcile.ts: 731 lines of code: src/hud/reconcile.ts has 731 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":"src/hud/reconcile.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c764a19eadea26545884c3c6148691a48c4847aab4841838d427294a7d264667"}},{"ruleId":"R3","level":"warning","message":{"text":"src/hud/index.ts: 729 lines of code: src/hud/index.ts has 729 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":"src/hud/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37b033039c5ab1d2a16d39368a8da29add48d657a59b168e53ff6e05f7cebf2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/planning/artifacts.ts: 728 lines of code: src/planning/artifacts.ts has 728 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":"src/planning/artifacts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf445a7c9ce27703ff9e827516e26a001e50761436c9e943366089f59d18b0f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/notify-hook/team-worker.ts: 708 lines of code: src/scripts/notify-hook/team-worker.ts has 708 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d994b16b6b6d6b98c384a26c2bc72f290d0b34cc7024b554067c80457eaf8f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/worktree.ts: 699 lines of code: src/team/worktree.ts has 699 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":"src/team/worktree.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c15df4d608fff020243280b2a6df13b8580e3b0fad654d9eb941948d60dc58"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/bootstrap.ts: 677 lines of code: src/mcp/bootstrap.ts has 677 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":"src/mcp/bootstrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f162cde3b123dd0eecfcb71f2393436022cc6fab3752e68b8d7324ba7de5d78b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/notify-hook/managed-tmux.ts: 645 lines of code: src/scripts/notify-hook/managed-tmux.ts has 645 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":"src/scripts/notify-hook/managed-tmux.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"084409824b40f89bf1e26602714f397c565bc84c19298d961384cc94acebb332"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/notify-hook/team-tmux-guard.ts: 631 lines of code: src/scripts/notify-hook/team-tmux-guard.ts has 631 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":"src/scripts/notify-hook/team-tmux-guard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"909742d3b5c6bdf25462217775143728f10ca95a573ad79e016c3fc9a88b6116"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/code-intel-server.ts: 630 lines of code: src/mcp/code-intel-server.ts has 630 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":"src/mcp/code-intel-server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f6366e54aa94e39038e8557207c0752ab1cf637798d9ab9f1925733ad77af6"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/hermes-bridge.ts: 624 lines of code: src/mcp/hermes-bridge.ts has 624 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":"src/mcp/hermes-bridge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51daf7008111d27006f770650bfbcc0153503f2c5ac20c08ac24ff1bdf77865e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/model-contract.ts: 617 lines of code: src/team/model-contract.ts 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":"src/team/model-contract.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2c892f9a101a5f5b9f48e8e1fa04d27e61b9c7358ac43b16d67d11adce1224"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/hook-derived-watcher.ts: 592 lines of code: src/scripts/hook-derived-watcher.ts has 592 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":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12eef1d5e87da45d469d87d689fb77d0a8c9fe1b49a10b0f20d4ad04c7505976"}},{"ruleId":"R3","level":"warning","message":{"text":"src/modes/base.ts: 577 lines of code: src/modes/base.ts has 577 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/modes/base.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b876cd28d04e11e29aea5ab2d7a0f65e84f8921903205f1fcd2c917c1ea831d1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/url-reader/index.ts: 557 lines of code: src/url-reader/index.ts has 557 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":"src/url-reader/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54e136e73833d8eb8eed821f065281e77d139a21667bef0bb78d33f0562903b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/hooks/agents-overlay.ts: 555 lines of code: src/hooks/agents-overlay.ts has 555 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":"src/hooks/agents-overlay.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1b10a69782dbde1eb810d195184bfde88b91fb0f8c01264ba0f4bb9227e442"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/state-root.ts: 537 lines of code: src/team/state-root.ts has 537 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state-root.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8885c5b8809008fd9f3e0ef278e3950faa89fba92b0b165f7878599c65f53557"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/cleanup.ts: 524 lines of code: src/cli/cleanup.ts has 524 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":"src/cli/cleanup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bcfa345cee2680300d50b94c5a5c8d7faf4fbb5dde466b85a13f24b3549e8e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/leader/contract.ts: 521 lines of code: src/leader/contract.ts has 521 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":"src/leader/contract.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea820265920481d4e96b901b4c88b0da741fc297f69927831c0a6de7e7674cb"}},{"ruleId":"R3","level":"warning","message":{"text":"src/state/pinned-atomic-file.ts: 520 lines of code: src/state/pinned-atomic-file.ts has 520 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":"src/state/pinned-atomic-file.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d0ee24a0bdcabb21814bd312546413ea497b5ca1f0b0ce16a5612bf1d4fc15"}},{"ruleId":"R3","level":"warning","message":{"text":"src/hud/render.ts: 518 lines of code: src/hud/render.ts has 518 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":"src/hud/render.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d939d318a9cf57d73724efa1d0c2d3ef6bf6de86e8256d5793aafabacc84e06f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/ultragoal.ts: 506 lines of code: src/cli/ultragoal.ts has 506 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":"src/cli/ultragoal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8730b9ec5b8cc3a8717a4fcace68e2408d1db1a964d89fbdfa797d910ce738b4"}},{"ruleId":"R3","level":"warning","message":{"text":"src/hooks/extensibility/dispatcher.ts: 506 lines of code: src/hooks/extensibility/dispatcher.ts has 506 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":"src/hooks/extensibility/dispatcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5304c69268d72ee4da1ac42bc1fc15b7dd743a72cc58f2f27c36de3a11180575"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/sync-plugin-mirror.ts: 502 lines of code: src/scripts/sync-plugin-mirror.ts 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":"src/scripts/sync-plugin-mirror.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03495d4c4418b9e7d047a9d57c979277dd8601efbdb1d70ac8545b92e6f98f2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/question/state.ts: 492 lines of code: src/question/state.ts has 492 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":"src/question/state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e46c48fc1c47a59a9eb73d6c8fa5286f438441702a17b385fbbe60a87626251"}},{"ruleId":"R3","level":"warning","message":{"text":"src/openclaw/config.ts: 488 lines of code: src/openclaw/config.ts has 488 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":"src/openclaw/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fece98397d09072452bbbbfe8c9f24aa8fdfa150a9bb98f1f22efc4a0b7722"}},{"ruleId":"R3","level":"warning","message":{"text":"src/state/mode-binding-lease-helper.ts: 485 lines of code: src/state/mode-binding-lease-helper.ts has 485 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/mode-binding-lease-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14fe1068e442339acfe15cb0995222ad035e0477a77643789dabc3ec166da32"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/notify-hook/team-worker-posttooluse.ts: 481 lines of code: src/scripts/notify-hook/team-worker-posttooluse.ts has 481 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":"src/scripts/notify-hook/team-worker-posttooluse.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5344e2775bbf585501d9f3d21220a1b20a9232a2fcf45b4406a91b9598f37f4"}},{"ruleId":"R3","level":"warning","message":{"text":"src/adapt/index.ts: 474 lines of code: src/adapt/index.ts has 474 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":"src/adapt/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb5c10b3699073c6401e84eda95c0eacc9319ab838b5bd62cb1b886aea52944"}},{"ruleId":"R3","level":"warning","message":{"text":"src/agents/native-config.ts: 472 lines of code: src/agents/native-config.ts has 472 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":"src/agents/native-config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1957a4c852b75ba41113d5091b86f461a4c8083bd0d72c59a6723872396f77"}},{"ruleId":"R3","level":"warning","message":{"text":"src/adapt/hermes.ts: 471 lines of code: src/adapt/hermes.ts has 471 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":"src/adapt/hermes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faddd6327e551850acb6f36b592243bed66f06bc55a3bc180b6a53756e09a396"}},{"ruleId":"R3","level":"warning","message":{"text":"src/question/ui.ts: 470 lines of code: src/question/ui.ts has 470 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":"src/question/ui.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1f4a0f0a6801f346ec2f53d9852df73ca6d24cdb76ebb436bccbe6844e6e58"}},{"ruleId":"R3","level":"warning","message":{"text":"src/hud/authority.ts: 462 lines of code: src/hud/authority.ts has 462 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/authority.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d101063809d5d88a6f3feae74373a6018218587b6f3625fe434486b632dc7b0"}},{"ruleId":"R3","level":"warning","message":{"text":"src/autopilot/completion-gate.ts: 461 lines of code: src/autopilot/completion-gate.ts 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":"src/autopilot/completion-gate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36123861c53c5cf2a42b824fd42445d9eda1284f66f8a0af069c887bf7573f15"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/runtime-cli.ts: 461 lines of code: src/team/runtime-cli.ts 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":"src/team/runtime-cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af042c2ec275786b0978e950a54f5dff13be197d7bbe07c8acabfbec34ce3e0"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ralplan/runtime-advisory-lifecycle.ts: 458 lines of code: src/ralplan/runtime-advisory-lifecycle.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":"src/ralplan/runtime-advisory-lifecycle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f499bf074d1b12d95c4bf875e1da7d281aee8d2611a05de4cd37f9605ec04adf"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ralplan/advisory-evidence.ts: 457 lines of code: src/ralplan/advisory-evidence.ts has 457 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":"src/ralplan/advisory-evidence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1425e1d0ed838541d9763dcbe3ff008019e1808c77a823004416ff93e76861d9"}},{"ruleId":"R3","level":"warning","message":{"text":"src/runtime/bridge.ts: 455 lines of code: src/runtime/bridge.ts has 455 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime/bridge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c2f19338a4aac8b25f5044ef6276a990ada3298c18ab251a6138daf0d7a670"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/mission.ts: 452 lines of code: src/cli/mission.ts has 452 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":"src/cli/mission.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f807351ca8d28c0041ddb0e326c7328f655529e7c63870bbec1c2b52c7f23b6c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/question.ts: 449 lines of code: src/cli/question.ts has 449 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/question.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e814102b33642195aaf4707a00def4af32f69e675b48e8ecbd822ac8b94d65"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/mcp-comm.ts: 448 lines of code: src/team/mcp-comm.ts has 448 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":"src/team/mcp-comm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc30c0b89e4566e8d901cc8ffc3c6f070ad8198b47103dccbcb732ea3476550"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/state/dispatch.ts: 446 lines of code: src/team/state/dispatch.ts has 446 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/dispatch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc700632af506c042cc255e3029d6f4d2de6091c2e327f1b7cc517358243bbd8"}},{"ruleId":"R3","level":"warning","message":{"text":"src/notifications/dispatcher.ts: 443 lines of code: src/notifications/dispatcher.ts has 443 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":"src/notifications/dispatcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91c850050cd0f778b8e6c5bfe70cd5a065988458b9fb2bdffc879212be32ad2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/memory-server.ts: 440 lines of code: src/mcp/memory-server.ts has 440 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":"src/mcp/memory-server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a75ea0792721fa5fd4e258aa854f1650c7222d9571277667220a4587869ccb"}},{"ruleId":"R3","level":"warning","message":{"text":"src/session-history/search.ts: 435 lines of code: src/session-history/search.ts has 435 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/search.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b31df26d7a7cdec7057571096b588e79fbf2f6f370ce1694ea1315561c7925"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/tmux-hook.ts: 434 lines of code: src/cli/tmux-hook.ts has 434 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":"src/cli/tmux-hook.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"678d7d25d5ea90469d67b4b782d1540c161fd8a912a7202362f33a053cbdb4a0"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/notify-hook/team-worker-stop.ts: 433 lines of code: src/scripts/notify-hook/team-worker-stop.ts has 433 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":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa771dc8d847330629ef8d696739e83028a7b1bae7188249de3df2ba824aabb"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/state/mailbox.ts: 427 lines of code: src/team/state/mailbox.ts has 427 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":"src/team/state/mailbox.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ba78b865d1460b670c7af7a060cdef6351af75e72d4a4fc58688c5f7ddb270"}},{"ruleId":"R3","level":"warning","message":{"text":"src/team/commit-hygiene.ts: 426 lines of code: src/team/commit-hygiene.ts has 426 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/commit-hygiene.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e52e80257a74c143fc58be1ff6a7d82341c03006796c741cacd4a5e9978ce2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/config/models.ts: 421 lines of code: src/config/models.ts has 421 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":"src/config/models.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a46f7da8f2ba96105ab37c39c43dd42a8564ef2076db1206b546e00774daf8b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/capabilities/lockfile.ts: 414 lines of code: src/capabilities/lockfile.ts has 414 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":"src/capabilities/lockfile.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a3d53eb5b2c222f4fa4879af562c66f8e7032575d93128ed279895eda4d04b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/autoresearch-intake.ts: 409 lines of code: src/cli/autoresearch-intake.ts has 409 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/autoresearch-intake.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96216a325bc9c3f58716b7795d98118ccf1c181a840d2dd6e21fdd5aa7fb3bd3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/sparkshell.ts: 409 lines of code: src/cli/sparkshell.ts has 409 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/sparkshell.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43b4166a2e0151fbfc7b506b4d9aaf410d93919fe846a87ffb9f4db57f8144c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/session-history/friction.ts: 407 lines of code: src/session-history/friction.ts has 407 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":"src/session-history/friction.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c88041e551372b93fa0122094e9f4963e6fb82a0d1f12dff20dcd15ea48dfd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripts/notify-fallback-delivery.ts: 403 lines of code: src/scripts/notify-fallback-delivery.ts has 403 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":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28652841d2a9f6969d34bfe64558df490b33d2d88648466bee47fc108561881b"}},{"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/scripts/notify-dispatcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"071c261f28f7036e57a41b8f93b32073272d864572457a6074434c08e5f81c9a"}},{"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/team/state/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7002ef42c195707266a63799d6d745bf589c75cd51d450fcaa1bb94dedf80e82"}},{"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":"packages/vscode-extension/src/chatView.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"728e8599b2cf6c653e307ecae9ccb20280e0c9a06ece55a3c352b9e802804e80"}},{"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/state/pinned-atomic-file-darwin-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61c20a258785939408bb355f13dc92142f49998b99eeeba841f1de150510c69"}},{"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/state/pinned-atomic-file-darwin-janitor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db5b0ef91c71d2119b373a4a91b1eb8ebead572f59030532741d3d90ed14268"}},{"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/scripts/run-provider-advisor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"851a3cd75943570737dc742f502091b85aac5958c9355c0a7fe4a309bd1f7976"}},{"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/scripts/eval/collect-astra-defaults.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b5f13ed0ffae967b7b13270799d273b729401bed6a08ccf6b848f13f39ab31"}},{"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/scripts/generate-native-release-manifest.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"813326d52037aca59121649b7f1c437e588e9394e0bbfb1c8ea649798ab81768"}},{"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":"packages/vscode-extension/src/sessionManager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"072ced6bebfd4384a2865cfdb4292971ee1a62372ec36d9ab24af9394c4e0439"}},{"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/cli/update-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abe35b25d029e26a79192c1a535d4509829e9a347824c821c8bbc1ccdeb6ffc"}},{"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/hooks/extensibility/plugin-runner.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e300276f91593b27a8867a6ac630ae3914b4d8e4d1b130307f3bac911f3e25c"}},{"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":"packages/vscode-extension/src/core.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5bc0bd61477060e3c682f562338742be1f488ae06334f6dfab1e4daef12d5f"}},{"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/scripts/check-runtime-syntax.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eeaad706ce52297b1c4271535c8d0ed2edde2b255f8405d31f0b32b0a34b984"}},{"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":"packages/vscode-extension/src/extension.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14cfa805802df3c8f830efd9fa4254a33984d6917b67f541eff303b2f20f5ec"}},{"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/scripts/check-version-sync.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4aa6f4ee07350fccda2ec7a89655793fd4bde6561e3ce2560360eef42154e7"}},{"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/scripts/eval/eval-cli-discoverability.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7081fb7bcf3ac46757ad34fa826d5836a74f4f897f9f713dab3f4dccd0d904a9"}},{"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/scripts/eval/eval-security-path-traversal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4f2cd6becd3a14c7c18d6aa99573f9eb785d8a9136743caa9b13bfd8c567ed"}},{"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/scripts/eval/eval-in-action-cat-shellout-demo.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5e28aafcd3f01a619e75cd685a0901ccd08e00b8a25f58ce81addbf1061609"}},{"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/scripts/eval/eval-parity-sweep.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfffa40b1a9a5afd4e1b80023f03aa073977c766bd9696ac818c0adc873ec56"}},{"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/scripts/eval/eval-parity-smoke.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"948379f8f7d6a47a6251f9408a7b6da36d721a326ffedab5f641110edbdf6412"}},{"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/scripts/eval/eval-help-consistency.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c917a7ddebf92b6ad85f2b6711787bb62f58b95a5d2adaa7ae316bb7a8aaf28"}},{"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/scripts/eval/eval-candidate-handoff.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd40e29c88ed556df197e0792b10d095dd2bf6e59d6f867d0065d1f06d59c58"}},{"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/scripts/eval/eval-fresh-run-tagging.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bfb4c670009ad42837ed5c17dba9c3ae5160c965ba7c9b346286286f78bdf4"}},{"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/scripts/eval/eval-resume-dirty-guard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"130d975f154c70f856079b3981bebc052e82b5aaa09821ede1edf08d4cddccf5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~258 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/state/pinned-atomic-file-darwin-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd31492a2b3474728f5e22944cb71073905cd154109033ecd5ea3c774db64b48"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~252 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/state/pinned-atomic-file-darwin-janitor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1374f1a61c925569b031c238eb400ca604d68638c53432eee99d063fbbbf361c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~171 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/scripts/eval/collect-astra-defaults.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9399cf9f95141af7fb1afc7ff68da386e48da3321f5a7764ab2ee11f98a570b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~88 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/hooks/extensibility/plugin-runner.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2f808532b0a94030dd89ac1aa59b0e4d8c88df95025654650370cb246afd1c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/scripts/eval/eval-in-action-cat-shellout-demo.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04775932994c3399c9491e27676241945511ced981eaa1c86495da3466be3a78"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/scripts/eval/eval-parity-sweep.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e69d59e8a0fba006454e726b544f9668d0a9a41ed088a61152c12bb9cb7703"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/team/state/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14aae3ed04d6ee91505b7a6ad1240c3f8516fcac9d58a369b1837477b3b3ab6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~17 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/hooks/native/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"889b269aceb70ae819e8fb20eeff86def2a1bd9e4c60cacdbee32af072ad95b5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/scripts/eval/eval-help-consistency.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f5b2d8d4266c6bb063bb3fd5fbd90b4ea883e1ad44acdc340477454aee8edf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (292 application, 27 tooling, 493 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/team/state/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c636b0d27c88b013b5148498ce49fe703336820cbc92726caaa4a89f6afde9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/scripts/eval/eval-candidate-handoff.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06cb7d60e61ec4804d54e6ad9b7cb353eae3af6dc72d355dd8874128b1dc097"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/scripts/eval/eval-fresh-run-tagging.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c79dca831137062202ca669fac981f0d5197500fe58c51c66cf4b3f7b7b5990"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/scripts/eval/eval-resume-dirty-guard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55711fbc0e509a28b1ebd89bedebdec939864b6edeb493c9f88f4e499bc40c98"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (292 application, 27 tooling, 493 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/team/state/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/workers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"871c09d795fd6de89da3bdf69af0af28f1041ee84fc9423e6f28038848bd4c28"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/auth/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"966467ad6ebf40b5d8c35cc85a9dc78b3d20f5e4921ad55bab4c0eb0ff42366e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/hooks/extensibility/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbef0225417010c2df5f2a505a2431bd6e67749fb23893cf225e140ad04de23"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (292 application, 27 tooling, 493 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/team/state/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/io.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c918c80518d6287061fcf57230113e70f01e031cefdf916ac6f2dbbf6897340"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (292 application, 27 tooling, 493 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/team/state/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/shutdown.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e174398776395d7169fd7900022bdcb00cc1c63087f026f57338d93644069ab7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (292 application, 27 tooling, 493 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":"src/evals/astra-defaults/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e998d7ea8b8b043f15418e0a313b2b8de06738dfd2af84271d81bd441a5ff37e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (292 application, 27 tooling, 493 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/team/state/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/summary.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"715e85ddc5a7b99c175cebc0f28ae87e7d6842c6bcb23b140ecb85cec276ea5f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027clearCoreCache\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/vscode-extension/src/core.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"14724deae6e96848562fcfc9f39fee8dcc3455b5ef874d31a2a47c20f802de85"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createHerdrBridge\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/adapt/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/adapt/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/herdr/bridge.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc77a4c9c2464e94804772c5daf2fc7682ee83082e610878f484849de0fcaaf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_TOKEN_VALUE_LEN\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/herdr/sanitize.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1585825f875b7ea249e57f503576b6db42f360ca05babf75ca5268fa92459b56"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isCodexHookFeatureFlagName\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/codex-feature-flags.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"94956f6069a60777913fb1e95f2e2bfbb7b744c3d2efa480419a6aef35c497e8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isModelConfiguredAtRoot\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/models.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"763b63327a77734aae76d3535c92fc6610d3ba05edc04730f31e0fbcc8c19eff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isModelConfigured\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/models.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e83c0ee30bc6cc601dc0dc8ca04cd497949a01a24a60eec7e196f4b7a59a91"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027goalWorkflowLedgerPath\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/goal-workflows/artifacts.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e84a46b3d8b3da80effbd3110487ecb558413ff9cfd10c6e2b01406418f99ac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027HookDispatchSummary\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/hooks/extensibility/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/hooks/extensibility/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/extensibility/types.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2944cf11251e0399ba2cf3d4cfdfc627204e8651c595cf7080298322614f663f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027HookValidateOptions\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/hooks/extensibility/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/hooks/extensibility/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/extensibility/types.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4117aa10ad79c6f4d4c65e13bcd3f5c378a6e0efa57a421ca162be51f6ab078"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027readUltraworkState\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/state.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d251670ac5eeff204784d8a7c92c56cb258649ba5e47ec0bd5bac738d863b41"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027readAutopilotState\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/state.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5b92813b87c7dd2a225b803ac89a721d6762970467d4e5a8b919749d3323ed"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027LEADER_CONDUCTOR_PHILOSOPHY\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/leader/contract.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8c0e2ed7516662d2467949470237fdbcf9c657ca63dc0c108f59aca4e95340"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027NATIVE_HYDRATABLE_PRODUCTS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native-assets/policy.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7415cc552ddf73e2c22bf35742fabba29047c4f4870e7525f9e6de07073f937"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ReplyListenerDiscordPollDeps\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/reply-listener.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"414452b477403de4a1517d119ab3c7dfaee00f334a6ccc0bd4f4facf803bd9b4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ReplyListenerTelegramPollDeps\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/reply-listener.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03ac4e99bdcea723b965da20952f52f6c82f18aea84d8df2361bd601c50b8fb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027startReplyListener\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/notifications/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/notifications/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/reply-listener.ts"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01f4c2e3897715110ef5055b45c83563787fcef8135b69292f3a00ff29bf4d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027stopReplyListener\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/notifications/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/notifications/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/reply-listener.ts"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d8e0ea5a739d286e1cafd9eba962e06f3ad80c28b1e6b51408c6baa69c28ff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getReplyListenerStatus\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/notifications/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/notifications/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/reply-listener.ts"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f0c1f3d50ef5315b8278d96516449d11d7021a7ca3eeb34d54196b3e53da17"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DISCORD_STATUS_STALE_AFTER_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/session-status.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c67f93e44bfa9cb9a6be37e2c85a8a4ad970254393e6a53ff2cb874eba204b0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getSubmitPresses\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/tmux-detector.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f6d5b2f3045485a3206f7a09e840734e2fd065458abc342953028cbcb369ee"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RALPLAN_ADVISORY_SCHEMA_VERSION\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/ralplan/advisory.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/ralplan/advisory.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/advisory-contract.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed67d70c13df2ad8e0c7c0dce4ca030b3a5b23801da73dbe29dc2dc588db802"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027UNSUPPORTED_DOCUMENTED_LEADER_PROOF\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/documented-leader-preflight.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47f9ff79cb5f19286e4561e95fea2439ddb5d8006192993fd632d1a18029749"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isTerminalLifecycleOutcome\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime/run-outcome.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"93974806f48f9240e3fbb1d6177c3d4ee1295ac68ba88d9975fbd0016ea6fa38"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isNonTerminalRunState\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime/run-outcome.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5f15ecd2725f612c76292fc26f49cf8b0b7ba9c97be12546e95ac18d1afb97"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isTerminalRunState\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime/run-outcome.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b458c81c6cb3235e2fa8fbaaf97a23556138304e934cc5ebac2f9cc6681ecdce"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027TEAM_ORCHESTRATION_INTENTS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/orchestration-intent.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78b2d20c632e97aa50d924dfcb55633336775404c1ccc9968218b4ae90233ae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027appendOrchestrationIntentTag\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/orchestration-intent.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"68231a28820bf6b2367fd2376c41112d91366e9d15edee3c9f71367f2c6fcd7d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027readPersistedApprovedTeamExecutionBindingSync\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/approved-execution.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f393d077543c35da58be65980262cfa965620416c01569b89261464b9198889"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027readApprovedTeamExecutionHintFromBinding\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/approved-execution.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f9df72e831ae093b0076b2ea2db566069bcd44c119fdd0ae9e0999116b0b7d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027taskNeedsCoordinationProtocol\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/coordination-protocol.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e45a06fc7d42b786324b7b492be52aa76dde6fff90e65ef2c95c8f94344a7c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isTeamNoticeLedgerPrompt\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/notice-ledger.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2732f73619a1228c3ab4f878f9a901bb0cb16d6b66c9d3ec2df99a132d1bc2f1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getPhaseAgents\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/orchestrator.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e9750b79660f7eb87422495e2008fecf4f93eb2b93a431562ac7c916c8b5ac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getPhaseInstructions\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/orchestrator.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"46422ad52b4023306446ae9082d25b3e739d2d1b9cab25738f768eed45a0349d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027resolveLeaderNudgeIntent\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/reminder-intents.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4166bb15022aeb218a8342ef48ec182be0d6c02358725a89ddc32557a7b302"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DEFAULT_MAX_WORKERS\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/team/state/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/team/state/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/types.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc750a36d2c0aca21acb95664d7c4f827dac1db11bb45599d0eb30541ad6ebe6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ABSOLUTE_MAX_WORKERS\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/team/state/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/team/state/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/types.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15bc48eb5088f01bdba377eecbcb543b4a52bad9c1fbb76bce02d0e2258b01c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027validateSteeringProposal\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ultragoal/artifacts.ts"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c85e48197dd7e0c63a7f559330dc8a5dc67359cf3f86fe9b75539fca9cb8ea"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027VerificationResult\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verification/verifier.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"088538f9e4e81cffbc0f240bbd8f309b8360eb21d98dcc02bd3e98589db2a184"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027onPostCompact\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/wiki/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/wiki/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lifecycle.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f4826e1d4c625d3eb6a7be5ab5b6bd9cce41f2d34489d81d94e94dbbfa9ef6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027hasReadableWiki\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/wiki/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/wiki/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/storage.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"db608061bd22e6c4dddfac3cff590f03e4a4d41cdb1986180850ec5b77c0d8d0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027OMX_PLUGIN_HOOK_LAUNCHER_CONTRACT_MARKER\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcdc6dbd101890a4dfde07f93f96b6655637bddb55c18eff3ce007d9056c05f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027normalizeDarwinTmpPath\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/__tests__/index.test.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e1d237984a06af7bd7823cd1736dc3d3a318b1d8bf4c05292eb78cbb37850a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027expectedPackagedSkillNames\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/__tests__/plugin-cache-symlink-provenance-3552.test.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"629e82e800a7be6797a7c74a2c4a79be397da76c1692d51b6ce3894223332787"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027writeJson\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/__tests__/ralplan-bootstrap-3181.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"325d61f6bebfeed202975ed26ebd740fa3a93d463a929971822ce5d50d3848fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027waitForFileText\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/__tests__/team.test.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5db74cb1ae676304e4308c68ffed2c29dfcdabbd00ee9610cfc5764d2db306"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027HANDOFF_MARKER\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/__tests__/issue-3293-autopilot-handoff.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d43b3bb9200c3b26019ed5c0f0e63fba22e3ed2d0faaea3f83dc39ccc41f8b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_assertNoPluginStateAlias\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/extensibility/__tests__/sdk-public-surface.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"89817b24a95bc2a2813628061e2d5cf60c34df0174c3be3bc1dd8b889d04d949"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027withAmbientTmuxEnv\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/__tests__/state-server.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e68c20549294651b2731c66e93cdf27b2777f9226a3dfa3272b5c76487af067"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createFakeTmuxBin\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/__tests__/state-server.test.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5934f95480116763ae5e435f365ef55e607a7b33d39d3a50e6dc1f2cb03adbe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027writeSessionPointer\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/modes/__tests__/base-session-scope.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3579a4d12765e4e332d5e96a76f93228329d9dfcf371ccc702fb136199ce09d2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027buildContextPackOutcome\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/planning/__tests__/artifacts.test.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"021427fd345aaea2f4c95319af4d5d7e20f85d567448cfdac08176ec3c4212c6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027writeContextPack\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/planning/__tests__/artifacts.test.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa68418e395e87935c63e42c75d4f04da9e423dbc25158b4954f68b332a74896"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027writeContextPackWithEntries\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/planning/__tests__/artifacts.test.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"769a1e3463d15dc5899bd8d573a1ca67ea057e07f2d485654c70d5b430a021c8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027writeAdaptedSubagentTracking\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/__tests__/runtime.test.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"547b6e6fbf1c69a2c11bf7d4a372bf0d1899bca2426da0d0e4c8e957ccc88e59"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ARGUMENT_PRODUCING_RUNTIME_DENIAL_COMMANDS\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/codex-native-hook.test.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e78cbc96afd8f06b57ef8aa2f9c4c8d9d53b643f66182345ac0badf1c22e13"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027WGET_REVIEW_MUTATION_COMMANDS\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/codex-native-hook.test.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2852f75dd6898fbe86c983aa34b8ff24af10546611d82f875cd49e03d1607b9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NATIVE_CHILD_MIXED_REFERENCE_STATE_WRITE\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/codex-native-hook.test.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6af443183f0d76f3a6a30499b6674dc4f1758afb62b13697718af1c4831225d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NATIVE_CHILD_REFERENCE_UNKNOWN_COMMAND\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/codex-native-hook.test.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"efca44f8c09d232758dd8ea8b82145032431e6cce4fd3e66db19d2a8d404e328"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NATIVE_CHILD_RSYNC_AUTHORITY_TARGET\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/codex-native-hook.test.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"52627c35565e4b7cd603337c0322530e2172502bcdcbed4d43c3b6691df93024"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027WGET_READ_ONLY_CONTROL_COMMANDS\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/codex-native-hook.test.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51546ff3ad6190a7cf474045ab528bf5ce20c65fa132aa0ce640b94c4b13c56"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027WGET_MAIN_METADATA_MUTATION_COMMANDS\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/codex-native-hook.test.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3893b53b543396fd8338cd327d4550a4cfefb729fda0f500e61894dd0f227b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027WGET_INHERITED_POSIX_COMMANDS\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/codex-native-hook.test.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2ebaf9a7bb59ff8ada4dd4c9011bc8333dfd2d4b4ffa7ec8e518d00d0aaa52"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027readLinuxStartTicks\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/codex-native-hook.test.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef8d080ecbcba0c554d8313b63e0aa7f44518a44e9a572e2e5e897898ec94d8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027readLinuxCmdline\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/codex-native-hook.test.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"363d439c1ee4843ea5a72e2729f04044bef584aef72826a6db09fc40b9f8e601"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027writeIssue3239ActiveAutopilotDeepInterviewState\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/codex-native-hook.test.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c218948731add9f9cbabcadcb045f50ec380ec946bbd4b1beefdb8a829a08b3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027denialFixture\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/issue-3293-hook-owned-cancel.test.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa5ff2980ea1a9480d688a50cfc43d00e84fad0e72c81897a976bd01e4387b1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027writeJson\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/issue-3369-autopilot-ralplan-state-machine.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90175e6b7de5cca82173fe4fa5303bcfb830de24711a84175a9a002b89b079a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027runOmx\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/issue-3369-autopilot-ralplan-state-machine.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0efcad1d2445c024b24321819a3e0e2b1a647d0c97b950a623b50633b6d1ef4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027withEnv\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/__tests__/issue-3369-autopilot-ralplan-state-machine.test.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4c72575e349024bb0224c2c33300fec3921924379f07044a550ab37e8f7665"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027mapDispatchFailureToCanonicalEvent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0902ae308bf9278b3dac66e110748250f650ba9409b5dff8d152f557510758fc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027hasTrackableActiveWorkerTurns\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"164411ac7cf65ee1f5aa4e31293000105ddc94bfd2daed397fea9caff3065b84"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027formatDurationMs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e4afcfc19db9f57c1efbb18774c1900345d8b5c6aaf0a6f33bf54da8ef5505"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027parseJsonLines\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/__tests__/delivery-e2e-smoke.test.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24d2585acfd2454eb72d388a6a9df5b52e2064e704e5000e0f4bafb8e2fee61"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): src/cli/index.ts \u2192 src/cli/uninstall.ts \u2192 src/cli/index.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4685365955bd23f291273a06835b626c20cca640e3d2fad840adf34992b66b66"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): src/hooks/session.ts \u2192 src/mcp/state-paths.ts \u2192 src/hooks/session.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"579aabd84d64768c26393fb2543517214926a915f90c2e5c454b4044badbf4cf"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (4 files): src/question/autopilot-wait.ts \u2192 src/state/operations.ts \u2192 src/state/terminal-normalization.ts \u2192 src/question/deep-interview.ts \u2192 src/question/autopilot-wait.ts (one verified cycle inside a mutually-dependent group of 5 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/autopilot-wait.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"16756f09ab36f4a5dd3642986759fa3a3a1b3679f60f1c871edcf6aee516bd5e"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (3 files): src/question/renderer.ts \u2192 src/question/ui.ts \u2192 src/question/state.ts \u2192 src/question/renderer.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/renderer.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d96dad88bbbb16bb8d77afe3eab2fd5da6cfac79eea4e43ea58b493ea0cf309"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(seconds) || seconds \u003C= 0\u0060 appears character-identically in 2 files \u2014 src/hooks/extensibility/sdk/tmux.ts, src/team/tmux-session.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":"src/hooks/extensibility/sdk/tmux.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5bbcb217bd2cb048b9f2149103fa22f5bb8084e91d274c9dade5e194ae6029"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(readinessPanePid) || readinessPanePid \u003C= 0\u0060 appears character-identically in 2 files \u2014 src/scripts/notify-hook/auto-nudge.ts, src/scripts/notify-hook/tmux-injection.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":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"19830a7d3fde17f72fb4cd2835b31e4549462aaf6be4fae35cb5098791feba4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(parsedPid) || parsedPid \u003C= 0\u0060 appears character-identically in 2 files \u2014 src/cli/index.ts, src/team/tmux-session.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":"src/cli/index.ts"},"region":{"startLine":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8cbcbdb932a605a8f2ac5bc5d2ff2e81928eeaa967243c42994e0615f5e00a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(request.id) || request.id \u003C= 0\u0060 appears character-identically in 2 files \u2014 src/state/pinned-atomic-file-darwin-helper.ts, src/state/pinned-atomic-file-darwin-janitor.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":"src/state/pinned-atomic-file-darwin-helper.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ae4cb3bc0828828d98e382c542614c27eb4508b86b0bf7e7515f53b2420d7a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!before.isFile() || before.isSymbolicLink()\u0060 appears character-identically in 2 files \u2014 src/cli/index.ts, src/cli/plugin-marketplace.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":"src/cli/index.ts"},"region":{"startLine":10190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd880b038acd43ec9da39f938ea6045ed2fc56f7acf58ea0d1a17bbdba80f89"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!before.isFile() || before.nlink !== 1 || !visible.isFile() || visible.isSymbolicLink() || visible.nlink !== 1 || before.dev !== visible.dev\u2026\u0060 appears character-identically in 3 files \u2014 src/state/pinned-atomic-file-darwin-helper.ts, src/state/pinned-atomic-file-darwin-janitor.ts, src/state/pinned-atomic-file.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":"src/state/pinned-atomic-file-darwin-helper.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"538f39978a359214282e30ccbaafe1cbd07d0755507b464ccb3d70ebfcd34e77"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!candidate || typeof candidate !== \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 src/runtime/run-loop.ts, src/team/state/monitor.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":"src/runtime/run-loop.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c63d665010ab1a61ae01e23cdf1d5618eec7c857c41214628561cbe074f5da9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!created.isDirectory() || created.isSymbolicLink()\u0060 appears character-identically in 2 files \u2014 src/cli/native-assets.ts, src/state/mode-binding-lease-helper.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":"src/cli/native-assets.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff47f12c1fee2efa40b395119c27d592458005223d3869146c37ce6625fdfc56"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!entry || typeof entry !== \u0027object\u0027 || Array.isArray(entry)\u0060 appears character-identically in 2 files \u2014 src/hooks/prompt-session-provenance.ts, src/question/events.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":"src/hooks/prompt-session-provenance.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3b19316032e8bce053078a2c740b626237d892aa7f1d8d34c0ca42f5f2bb38"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!entry.isFile() || !entry.name.endsWith(\u0027.json\u0027)\u0060 appears character-identically in 2 files \u2014 src/question/renderer.ts, src/question/state.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":"src/question/renderer.ts"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a6ddc796a0b97d46a9a825dfd74bb89483b96bc011dbee92646450e1a9cd99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!entry.isFile() || !entry.name.endsWith(\u0027.toml\u0027)\u0060 appears character-identically in 2 files \u2014 src/cli/agents.ts, src/subagents/tracker.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":"src/cli/agents.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5414540fa975491d6fd65da3d7606c17062d28eae6edc72d81d4170508702a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!entry.isFile() || entry.isSymbolicLink()\u0060 appears character-identically in 2 files \u2014 plugins/oh-my-codex/hooks/codex-native-hook.mjs, src/cli/plugin-marketplace.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39fa9092dc191f8b0bf9705ef0651c6f35fa58dfcc1951bb41435463af307b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!name || basename(name) !== name || !expectedParentDev || !expectedParentIno || !transactionNonce\u0060 appears character-identically in 2 files \u2014 src/state/pinned-atomic-file-darwin-helper.ts, src/state/pinned-atomic-file-darwin-janitor.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":"src/state/pinned-atomic-file-darwin-helper.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7922efe18462ea99e52b138ef4de77a14e67f21e0dd210a90740746367493dec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!name.startsWith(\u0027rollout-\u0027) || !name.endsWith(\u0027.jsonl\u0027)\u0060 appears character-identically in 2 files \u2014 src/scripts/hook-derived-watcher.ts, src/scripts/notify-fallback-watcher.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":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"458bec5c0b3edf2559ef45ec5d3803a9987ae2a51b317a590ae325613369802d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!noticeRegistration?.queued || !noticeRegistration.prompt\u0060 appears character-identically in 3 files \u2014 src/scripts/notify-hook/team-leader-nudge.ts, src/scripts/notify-hook/team-worker-stop.ts, src/scripts/notify-hook/team-worker.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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f9d363815ac0ef209821149afed9b295cec2ac8b2c64a757fb1a1ccc784fea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!nudgeState || typeof nudgeState !== \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 src/scripts/notify-hook/auto-nudge.ts, src/scripts/notify-hook/team-leader-nudge.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":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ca5669c7c30c1f4534b7cf2571da898c26758cb617839bde6ca87022b6b75e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed || parsed.type !== \u0027event_msg\u0027 || !parsed.payload\u0060 appears character-identically in 2 files \u2014 src/scripts/hook-derived-watcher.ts, src/scripts/notify-fallback-watcher.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":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79e168aed993d0753f704c87c04af51c84d5c3c0f04f06ace17d971adca4635"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed || parsed.type !== \u0027session_meta\u0027\u0060 appears character-identically in 2 files \u2014 src/session-history/friction.ts, src/session-history/search.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":"src/session-history/friction.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef09ed4096ad7bddcb9217720afb4be7f8179fdd86914cef45c58177bf47b94a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed || parsed.type !== \u0027session_meta\u0027 || !parsed.payload\u0060 appears character-identically in 2 files \u2014 src/scripts/hook-derived-watcher.ts, src/scripts/notify-fallback-watcher.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":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb8124adb028514c29af5ee69a1582c72189095a02dff925fc7b972c51a307e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed || safeString(parsed.team_name).trim() !== teamName\u0060 appears character-identically in 2 files \u2014 src/scripts/notify-hook/team-leader-nudge.ts, src/scripts/notify-hook/team-worker.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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca298d09bba764234c2b1fdc299a88e5846d5968031c626c255598af426cd86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed || typeof parsed !== \u0022object\u0022 || Array.isArray(parsed)\u0060 appears character-identically in 3 files \u2014 src/cli/index.ts, src/cli/mcp-parity.ts, src/cli/uninstall.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":"src/cli/index.ts"},"region":{"startLine":10564}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4df0f97dfc7f1cb4eb2de40a9d0a453ce340ad3430bd360265bb019987be51a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed || typeof parsed !== \u0027object\u0027 || Array.isArray(parsed)\u0060 appears character-identically in 9 files \u2014 plugins/oh-my-codex/hooks/codex-native-hook.mjs, src/autoresearch/contracts.ts, src/autoresearch/runtime.ts, src/cli/autopilot.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93b550f64c561019a25f62d06d6f10e709d425ab01ff94643f417137d9dbd73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!phaseSnapshot || !phaseSnapshot.terminal\u0060 appears character-identically in 2 files \u2014 src/scripts/notify-hook/team-leader-nudge.ts, src/scripts/notify-hook/team-worker.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":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1de454456842e989171a239f03352ab3d26e7f24c3ba49e3f12f35218a16fc1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!projection || projection.corruption || !projection.fence || !projection.journal\u0060 appears character-identically in 2 files \u2014 src/ralplan/advisory-contract.ts, src/ralplan/advisory.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":"src/ralplan/advisory-contract.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60225c3c746260a70070fd060dc716dfade04fcfb4337e7d3759f9b8b817c88"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!raw || typeof raw !== \u0027object\u0027 || Array.isArray(raw)\u0060 appears character-identically in 2 files \u2014 src/config/models.ts, src/question/types.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/models.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b812ac51517abb00dfec3e5bd1221fa626318ea0b5bebcb03fe68aaa0925bfae"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060createLifecycleBroadcastFingerprint\u0060 is exported, takes a document from its caller (line 181) and hands it to \u0060stableSerialize\u0060, which calls itself at line 95 (\u0060stableSerialize\u0060) with a piece of \u0060value\u0060 (and at line 101) \u2014 and nowhere in \u0060stableSerialize\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 \u0060stableSerialize\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/lifecycle-dedupe.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c4ffe619a474d9c834a1e9c7d224da373d44a04f6fbc0088d85ba4a8c0789a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060parseCodexGoalSnapshot\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 161 (\u0060parseCodexGoalSnapshot\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060parseCodexGoalSnapshot\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 \u0060parseCodexGoalSnapshot\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/goal-workflows/codex-goal-snapshot.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ab03884d83c1fca94e88fe2a15f79867b8982882f765dcbd232c34ecc0311f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonicalStringify\u0060 is exported, takes a document from its caller (line 133) and hands it to \u0060sortJson\u0060, which calls itself at line 142 (\u0060sortJson\u0060) with a piece of \u0060value\u0060 (and at line 147) \u2014 and nowhere in \u0060sortJson\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 \u0060sortJson\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/capabilities/lockfile.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3009218c83116426f20433966b1dc298e05b98314922820cb2d3b471067dca2"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 3/4 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: downloadFile: \u0060downloadFile\u0060 holds an AbortSignal but calls \u0060pipeline(\u2026)\u0060 without it, so its caller\u0027s cancellation never reaches that call and it runs to its end after whatever wanted it has given up. Hand the signal on: \u0060pipeline(\u2026, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/native-assets.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be2de8205b4117c50de1bade8c5bf5ff51a0897de7853b55a19ed2d0b27b94e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lifecycle.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c7185d23d83cd93cfc393d736dda80b771ffccf9bedba02cef3e885814a334"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lifecycle.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad34afe00cd9788b067c00b8c7ce213e3d0f566ba1d9117250298ea76635f58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lifecycle.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be1b2f42f49a34a197667516537e33046e2f3e8e3283511de17ae9bc81bf447"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/file-durability.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f365654f0e27c1eedc2badbd40ba5d4e9fcf899544c6342a58a8f9c866ad5d84"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/git-layout.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ce59988aae0dc354665866338f8f7ad3dc0099541a270075d3ec0a902ff1d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/package.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a6916f3da556265e7ce203a805f994e0163c6a63ac91596dbff404a8f8536f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/paths.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecde7c157ebd94c33e94b98c508a38e80383f0f974f0f86a5a27e46c390279a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/paths.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e8689aa31529b54d979886b6ff72967eec101bcc9e395e578ae6de0ddff857"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/approved-execution.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f82534031f3ff8842375b1fd75ebdf07e33197a5b53a67c3245d6582c260173"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/delivery-log.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc48fcdedb9399877536f6da61bbdb7cba12e2149c394492fcaf9df9ff1b38f2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/delivery-log.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"25604f1e3dda2d36407f05256fa39e55939b842f5c2898d1ab49673c6f3df10d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/leader-activity.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"811a89995dc5819765ef2c75862efd28b25af395212b580816fb755d6166ffb5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/mcp-comm.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8d96b624dece689dd8a5cac67b4a56e5607f54f0f894cb65151443bd6e6fba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/notice-ledger.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d585b2077b80283d0ec83b87821baffe15155fb7239353693c9fbee6ad19fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d23e30d312a51dcc15a637b2dcaf44b0068f08116f915e6a72411a64b987c6f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"39789abe2fdb3dedca0a6b107bf1d1a7827f48657469ad542f9a34f471b6bfb5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c432b90439af6415d7353b80a9130b49152a4d97ff678fc4bd97961563e00101"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b00a1a807a25bb276b0ded8ba877e9412cfaea011059e1de1ceca1931f6b23"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"12524f6c55cfbd47fef0b9738048f11ff13a42f5a67556f25367bb56062a9c57"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"400ae280472a4aeee21e13357f96970d57f1756399101284bdf5151a27976a3b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7187ad64f52faaf16d4e0ac46c8a899fb31f755edd8174e255a27c5cad0af81e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":2505}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabbbb97b385a9cf6e6a25fd0aa8b938977b3709830bebb1b408271b4f075fe9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a5b067a5ce82d5b1277f2de9923ec52727cacb7de6bf2db7ca275921cb6a97"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":2539}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41eab19771b0a0fb221c08867454f7d94e8838d26e973fa0ff9147f52667a91"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"d739c75b9387e5934ebd1ca10ee6d4b7cd286e8bb9b4056a6318da9e4b633186"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":3311}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff2c1980d5bab17deeff9406ba7ed896a80de9ed734470a8e4355b468cd2c3c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":3320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ae3a908d235f0502355e24e24297628c68558944eb2d50ca6751f677d0b370"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":4306}}}],"partialFingerprints":{"codehealthFindingId/v1":"2beceabc45239abe6e16ed1dfefd8cc5dfd679e89d7a17ea548e1cbf39a3f76d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":4402}}}],"partialFingerprints":{"codehealthFindingId/v1":"732ce79eede155331c60c184de9fd07e7cd29d742e16c7c84929fc444ce8b3a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":4427}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ae0a22e97afafebd78f7d9a80439e901ae8621320878626fbf71402d216d64"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":5056}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19d3db764201358ebb3c0d18e33df4dd21d644e8565a4a85adcc48cec1be0e7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":5201}}}],"partialFingerprints":{"codehealthFindingId/v1":"74171ac3a8211cec25dc738c7a3773eb25ebb7792e4205e84a4be36d5c5cdeb0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":5963}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d0a1a8b827e9d64091356eae638c415d3e1561f9fbe5b9212f084ac3ad026a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6269}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9eb994b1430acf6867898b2b3ce2a5aa98a9a14d13de66f356ce2eaa35bbdd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6568}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbb6c416e3c4245ceebf1c48a9a67870bc38e290d533379f1acf2329b259ebe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6585}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d37b00e56f1b560acfdad3337027f91396a0b8f2c13aca12c5f48c9c2422273"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6601}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8df440b9a1c7e441b3ceda42cfff5166caef2950b33230e2f3bda310100f2f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6650}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cffa1841b796023dc1c78824610321c134659ffed260f2149ac62c72e89d86d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6675}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f866d440ed77e7b5b1ba9477b5a41daa3846eb39ec1118988cc3186499f8084"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6697}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad210ae7e7b002c87b7f78075aba314ae27555cf06e1a98a0f989e70814119c0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6812}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1bcfdbd699b0fe54dd87a3b71869dae90e77df7e7b03199ec949275c6f4a91"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6860}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dadff66e0be395e52e796654fef15be110d18e834ce057baf0df91bd8534d5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":6883}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45a2f56ae7b2aeaf4bb91042098e520f42467d0431db61ade4fa80120e617bf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6556ff6979b7f1d6bb02ab668b038754e24bc6989b41946944b09756921b8d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"8563b7aa8c36946089cfdd5fffecac5ec7a2b745a415a743e96675be0658e893"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"1031bf485039cd68076c5346915105ba961862b213322179ac3e8f545998bf25"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe7e29ce5bb11df1c6cd6e096f310c168a9d7ad2b9c4f7a824209eb5a9c582f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/scaling.ts"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cddf3017a2af8554f6925a3c29c4c7cb7c6108ece94cf07bacb9fd5b8de800"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65213e13ec346dee3b7c811e480d397de9aebb6c90818eb2908a9c9a181adaa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"0776612e1742c97d41347cf50e6a9d434fe69a2c4f3ba3c035d21ca6e4615107"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c04f340b3071bf3db95a712bb16d3f3dd71ef24969ed05d6cc2ae32c9653c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"965ed721e579805d0139992d288bfbd9a4de45d1175a5c50df8be215167ad48a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state.ts"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"69151cdd6f54b9fe08f92b96e9efa697d42eabf8baea06d3314b44862856c800"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/tmux-session.ts"},"region":{"startLine":4502}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf17956f79ba183cebfe1fc1419ec8f0c0a83d9285044a67405ba393796a38b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/ultragoal-context.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bafc3bd32eae143951685ab488894207800f0dd64d097cc5ac3069dc7ae968a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-bootstrap.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcecf52255f111d78ffaefab97b8128ffcd8cdbf22790e2570f3ae33cfd61459"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-bootstrap.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcad5f7538f8f02627cf022ca90c919b0896eef4a3ad4f42677961d3a2591f38"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-bootstrap.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bc52ca3cd44c61783264b992608eb14f5438ebb5e3da80f03ffef19b422672"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-bootstrap.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ad6bd8a5be2171a728077c2163d32a89bce35d08967245ef121bdcba68815a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-bootstrap.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4560b6d72520ca638cc82a85017b0c9f13e7342579cfe4c11dcee3c2b0f2854"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-bootstrap.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dc11f428774cb0813e3ae5bba9a60aeee0d1d519c06aec94a6214bfa8ce342"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-bootstrap.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfde7caf41bdf5b1eb2a553c9d5b2bf6b8ff93ca601586a3488370a90ab98308"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-bootstrap.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4b1ba5c094fc9d639c454533dce3146267170339fead92a3c7bb4d1d057d7e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-bootstrap.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"654ff56d073f40dede3a23e2ea8296ee0355ff14816809e63df35c19a7920b4b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-bootstrap.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2d81818e2d2bf8aac40d10d4f5904cbedf6da349d24de28cda7682cd2d53ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-bootstrap.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"a884cf5eb2010518612b0fbbab0181c289219f7aaba64b1d3203953a03421c73"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worker-provenance.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef59560d7a0b09b7f2bd960495e1b9e8479c13f7a6c7ef6188268146407a403a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worktree.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb90e038a168ffc5ce575ec6807c76031cb55ca596f60cbf56f01b0136a6f7a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worktree.ts"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cff0e751484b3e66afe2d409b1de8bdba32a2fbef1027998bb10c92bfe5f3a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/worktree.ts"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"f083e3dc5f5354969c3279d47b9454d06aa7dac4b5c34ad4ea80fdb9b0df3573"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/dispatch-lock.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6272cbbb7dbfa7bcbe6282b40f8c33a25b47dd974df7e5cafd07c8d22c49f32"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/dispatch-lock.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"537561beb42252b0899cb63abb150750f5d9e231e04c530c507a0c9bf04d4dc8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/dispatch-recovery.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"24112332a079a7af9920a2cdef986df314649bc821f949d974ad542b38bede7f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/events.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e3602b0fc1e3a796cd200b20c8705c31a687a623dee94bafcf8727e9246686"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/locks.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a56a719c9b1c7aca18730033d067fa0ff190cac9948d12c8f534449ba7ba49"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/locks.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9674218e1cbcf4beb19e1b1d3e45bfd1daf56aedba17f02f93d1d8b34f7f1d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/locks.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec84dc2113ac1157ed197d7024dd113de227b1da427dc1609c796052b25e9a6a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/locks.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"5680d0c64e41e39bc1133523b708c0932f98bd8f30728e4c52cc42694d4b6c17"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/locks.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d59688f755f390f4c03ab1405b2cddbe7fade0460c485289e23d84b734c36c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/state/mailbox.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f410f9a01d59877cf008f643926b43b030479685ea0f9678b5e376216304ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"989a9c5d6a99a07f0adbddf4646fe54f80c57d97c01dc02e6d36bca2c67613bc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subagents/tracker.ts"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7761616eb0a35c97f0413da7d09291681e48f5296a51bb2fac739da385555f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/operations.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1c835d07fd07466097697c5a01785ea269e7d41ff34d273e57de11a68ee81d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/operations.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50bb3c03ea9030152c2b665c97b0f7078d1e6786ec2296ea1bc8ec6b57c0746"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/skill-active.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb112fcb01bdd8a26f533d0489858fcda72ea2d689bbd60d370d32a84d8d6df2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/skill-active.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f5325e6fe54159dba32b20c3a027ec5684682eb5db6a37a4709bf804fe9cc9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/skill-active.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64e86df0f0b055ef70cef4640f7ad15a8ed9ea37b37f08b42fd63c091f96197"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/skill-active.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"394de9a659c203148ea6f19a395fd6ab85de61d6f1baac2a4ba0cc3dfb55414a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/session-history/usage.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87f3b5c1c94e347c062a69642c9fa70ec492826e2199f7f57110760a698bc1b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f4683f7ecdb34ccb12dbbd065d28b1a3130ed3e1afcabe169df555cad2eeb6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"2700c651888248e9f8e1c9e0722f70c2b97e3c88521395dbdbb83467416ec63a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1995}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee305bf34760fe51f7ebba65d4cdfa9ae3c7f0443ee049c1bab9d4d023e0cfa1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabbae83fe1e60c1fccc2d1e8b9c4920a8c61eced6c984f9f9a505194c14d62c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"c003c3a171361f8891e0c36eeacdd31445868406ae4416a60572d73c060f111b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"80152f83c04cd523d3c8e428c114380e3f016b611ba4c7281ccab101cd248f54"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce72a063fdae9ec35d9a7629b3e510086e138c00deaee2cc65c80c1c23879bb5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"781fc28339e1cb440c568d5fe6b1de0abf4d59c2d9b649da7a613fb11b37c5b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2463}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b64fe261c828117de50525b3c38fe65230b71160d82411360fe4bf57f5a2acc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":2619}}}],"partialFingerprints":{"codehealthFindingId/v1":"5050797641157bfbe5c8b9eddce05ff9864f4d3a8e4db5409b3f42a411e202ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":4054}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaf41eef545ae8b5a9b0d3f6cd344627748c5eb5a9f4682b69e7b3788281ff3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":4084}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b47ff15e7af3c6c41fbf7cde3877a4937d869fc2b7dd3e8f7572328a75baaa7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":4158}}}],"partialFingerprints":{"codehealthFindingId/v1":"79de36d8f04e59d6fcfbdc5a42c7f2fc21304821e75590e8ecb76b945c0b3bc4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":4563}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10bfee9494aac2037825021910c5158268b1fc054996a4a3d875d1cf1799528"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":9234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec9763607ee73ec07cb235187bc0e7013a3ced7bb32f53c7732b4d1d9504656"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":21509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d4ae2039ec038e8e00645eb92a1e202d74689a880db2f7bc55d1a000ffd2a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":21522}}}],"partialFingerprints":{"codehealthFindingId/v1":"26126b9a831f312072ed8cc78db64f718af6f720c8f3dd5fb9277a9b0dd61156"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":22114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5257f4025f77ad785f2d20365f20e85856c20559e2d8a5ec86d43ce31a60495d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":22246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07bf29a1f301aec02f266b319b04b6a8d287f8fe6bc029e63d0782b69c7d519"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":22489}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5480d8dbab7987f91740503a572bc21a9360a8831f0b41af304917118f833e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":22610}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef081c7c8c43d3290114838b276b114d08808dc173c0a9b6b58550202de1137"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":22712}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8ad27f721741243608c9301827bbab7555287e8fddd1e28427f6d0b40b7c21"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":22806}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3d9db3bc844c55d08728f930c9a8db60a0b8f95b48be527ea89e6a6a93b116"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":22863}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde27e3ee9dfacd6929cb87a6d15210a807154364cedf52bf3a69848904a788c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":22864}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89daa62246ac5ed5443d81aa89a8fb0de6a8d0d6a47bdc7c852b5cd94327122"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":22894}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9db7f3185427d2c034dcb96832984a3f0ce9d295280d8b0d6e5629346c140f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":23141}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f95beca4f4c452640f431971c84ce55270a4e8562ee32d2aa0fbf26b1c3cbd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":23155}}}],"partialFingerprints":{"codehealthFindingId/v1":"660789d392b00ae54c6248fbc7aeb98ea60dedb9d8173257582bc30e645e4c40"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24047851f076fbc817303fe3493ea76c66824cd27275109ce9ed0eb354e4f77"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"484d34909e6c1dae3711efbdd926d9e00a96c285a05492d73fcdb147acbb5c9a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca68847c5cbc70ac559df3dafba9d909fee5c652a42c4d9088a7125a0ed3f9ad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b20828c561a5166cce2dff7f00b75581af12ca5cc2d9546e36fbaa9bf6409b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73568cf635f7934ac15ef7ad62884eaaaf6d3bbdfa54d45bb13e15c9a23d441"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f144b3768ef45a1c9bd02208e1c81a82de06e193832dc04c7aa4481b6aa257"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/hook-derived-watcher.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24069a8b675e3a38eb3262e104015d78d3dfa823d6445599db01ba268abf1b1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-dispatcher.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee3d8dd609550d17acb64df1fbe74b2b890c1322f1ff359e253de9d6f34bbc8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-dispatcher.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f49816c7959605ed51670c769481f3b50f6781a5fe3ecd99972c8063792d126"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-dispatcher.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba45b7d55643e91f2cd6dfe9668a51bb62544630d76c1bc56f811dca40638bb9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-dispatcher.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"7163abf0999713641fadb3de3ced59a476f3af674ee989c2fcfc184bdbf6bfbd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-dispatcher.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3a08f32d7f116f49bafa3a1759942229f934962d9c3b628a4dbacf8eb10368"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"95af3c853803b8b380979b42b95276898b186255e9e1f4bb5acf04288fd12976"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55bf616c49b2697f400eec4a184d66513385723f8455599356095c7e7872b0e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bea1dbe654a4039e2f2ab1d9dcb825d0020d6d422c6296d6775409e448eb07"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0d12afaada90ec1ff7ed32fe2009a0aec67957efd3c024c6ae9bff93a396c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7e3bdc877ecc90f46b15847a15228d3c3459aa5dab1ed840f56cd88c690ef5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fadc6bc5fedf4d6743c4a4bf7245921c98f4d5868f7fead6130ad3f92cb9e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-delivery.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"deac8303770d2590afa496128c1ea3db5f4d6769790013c4b2bef869d2e09fd4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefdda3c3530fef48c9accf20029ab96b75b0436545ae7a0d28df89f524e2eec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d891a6b14c5bc4d4a01aea3d5b65460c6064c29ca872f95ac18fd7f4566b2ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed017158c0a933409d2cfa1a5f15717ac0a9384ca99235f87c533dc8909b786"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"c719827e3bac38e1fc23649de0b742cc3b0f6d87ee3ca28d8695b680f4be2cfc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0cd7a15ddbef3459a3035dd3a7c601bb475ffb3bc49e96fe0864add9a60027"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f376cd2475bf91139b2b156c3f353221f7140bb1b21d28c22292ba13e0afc8d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ecdc3abad32d94ac7d43a9f0848d2af92c5e410f1f6661a047632096f2690a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"3babf79c87c8a076fc538dad2359523f4ae0a5f3af7d80c312b603996ee8be82"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"853b5b4848c0e558f3d78e191c2f0365ebc301d8a9896031f90776b4b658928d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90d614cd3a0be7d0646560f093b7a9d78f96b9f4f6484449537b545d46d91ad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"81839b8a888d9e80249fdd1dd60ef4f35676f61f76ca34022e9ad375d43cfbee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"d622d3fcbd2e66c9f758a0250a0ac9425fcde3a30c9175881093b41b1fdd49ac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"55848a228c8b057d499e87baffefa39311e716da200486dc022369548ec9b59b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"290b8cacb518d3d7fcc5c1401e8b23526a520cc71b80df4b5f11d48e63848c54"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"17535a8ee7ff1b3fd106e0f230978ca4da7936626ac929aa7413b67d9185843f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b0cf26a1774fa01bc1d693f70a01a2082cb90f1cdd612402ca3e85e2327557"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a107d5fd65c9bfbe2f0c63b093671fca644cae5ce11f3f87b9040d9e5e7a45"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c291018dd956feea4d9f4782d1f487e5847ea23b522808eca09e152bcbbfeb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d6850dd0c2f58eea3b7c0651edc3e44becf16dcf93e8d3e8c787f70fb12428"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7c34492557f9d61098681b9ebdc1b5dfd876a2cf7859e2c3d8af06237cdc2a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7825f3e835406b813c770e6db9de1116bbf5a15f518ec30a9a36bfa73da39d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29c4ea33c6ac452098c5f358846adc20133ccd64f7897bd3b0242472a7ab014"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29d3605417d039045e7550a89bd01a9998796981ca0fe404e8b16f69f46829b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ed98ab4af37813e8a07557124e6264bd1778aef062526d69a866e5ca580291"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"995658a20c897058555d7fc4157728910f539318f16991629430a276a4af0471"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d79c011745980c7498ecfb25e7ddf0c9e21a31b63f7571224c81fa16272d55"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef237238d17badf2dc0715b5e98d7d041654abf938a0f88b7a5e743700ffa767"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48f908b24d88d8f7a499c4cb3c05a3200ad2ad39dba43ac198ce6ee6807f48e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b0014d25e3f16b7e01c09d95dd73df4259010c373566ebef54870d04881755"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"207b47aac1daa595b08be0ff8807591261e8ff9308a2bbeeef9ebea466fc630e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ff51192cac36e5d64872b00e47a0042191a77c5d1bc7b082ced84237a2cad5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27fed79e7f5a34e8bca652b5f1e5e167db4544f048fcfa88d35435dfb2d1cf1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc34bbea7fc4cb02b82724f14042fc167abd74d258ac5c3dd170b14a8303b04"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4404d4fc76580e34a4ba0f29f4cc97f78a65669ab19ca1012240c1c4ca1b75e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8df059df5cb69064c5551036d0aafb21ca556396136d19e40d74e706fab683"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba5ab3660f72b0e6ce6d89c55d05d963033aaeb78520afa31b7962e4d6e3330"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"1804df4d848fb8be22dab04d12d0e71246debbe0b3af346079b5c0e36ae8e0e1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fba5d3594fcc518ddccc5fe19292181126a54f981c9a6964774f3ade92bee3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cceaaef1ceb3ab405577ce3acb844c8969a97a424c014d0f77930374e876eac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"50355eabe2e8d4965bc11cfad6ed2129accf6b3f073f7faccb0b08defe00ce6d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1f23a9fba2502c732047a3d02d2e70fdd49efc8d03f37c2dceccd395dcdb0e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"692eba327d9d885cb3f511a6ab73ab7b0d64621196ac0243f863f77736d2ea6f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"de309cd580721676100279dddb1bf86b5c69ca7688777b373b2c1081982c65a5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ab5e7085b5182f15293e4041a3278262f4bf56c597ead44199fbe0ef0abe3f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa3d756f6a7333d2a7d7dda7bc5d8c1b7a47c18c3a72cdeb6d061b291283afa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3434b4d51ef07e41160668bc324b2f84cff3625618b790b57c55bad9870c1a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f2f42319f16db90e1ae90060abc93100bd29d72169d4c30b56cc373caaa101"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e0033927518f8e5da62cd03ba760ec9312e84fdaeaa92bbdfe4041b8990852"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d402e01d0f7ea6711f6611d6df85df368b82a7b2b5535721880ac63b589dd4f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a369f0acfdf7f8bd5d1f32f024d937e083e45acc9995ce7e1d3d76b91b9abb7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2f099d6a33e26a6e79581047212a8893cbd3a6ef8eb8d749bb661398aca39a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb580346e03b74ec830ab43d84bcabe2f6b4b9d83be40a386a6b51727c6f73b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fb5074c07699a818e61d02cad3f3bc157c5c02d3bdbb3ea505c2f62b45c619"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a2fc491cbe726457df6c14f88837bafdbc6f221d0cc48d5970a1e8fe689ae7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38e9b8bd0da6461f14b24cd4add8919a835a33d9b42e8b8470eef144b7cd657"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"21621c00136d887b47ed83602daa175e8332fb4484aa4c189e188669bf3640f7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed669f75797f15e49268809e849f1c348c18dba2e0a7ab3d0bae2d8052420e44"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/smoke-packed-install.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"5189e54eb8a0327418d5ed08065a981803e904cc14f803abcfcf45ad0a534464"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/tmux-hook-engine.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb65ee43c0fd4d5a6c8de644597624dbce2757ba4b564ed040795bcc27e0802"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/tmux-hook-engine.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff982066493f961ef08cb536611bf58b235a398be1e57bcd22a368564bdbc1e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc3d5bf6e7ff756bc44d1dbe005036a22def0c2708b51ed3192cd378a13b005"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f541b44f538a2151aef30be3d3e086ec9285309761542427c45b4697bc813e9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df32d3373927e74c1485b317686de14b50c10181593ac9a127584b16f84650d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"9002aeaa20720746f9a7a8f92c0d2cb778c8fb973c65ba8201d01cc0bb4de61a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"075379218347060d5cbe6d63ef02e50282e2198859a7c6c2ad38e929c05ab783"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a69c50dbdce4c551106d3c4df6917f67c501aeb147beed61ef470944a3d70f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d26b96797ca32db31c471b68ba6c752101ed663a12efba41bb3b0d729546f2a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbe3a6b26c7cefccaca5e83ffb176716b78e6feccd83c904dc6f3178f6c731e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cda31cdba8a56a4f1c5b8a677e00a88137d4b801457cdd792c18583b9858a5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"22109151e44382fbd23b1a110b942beb4c01f43760b77647e8f5823c7af04c1f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"504b4f084b5c87ab7fba8200f3280c408cddcc0e519cc3071a190768a2f10244"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54c5afd39083a6823e5080f641d313da2e83d32e820c31166351e93a8b2e5ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4b7871663a55306995ade75090b0703a2882bee6ffefa7e59d91d67e094e9c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b75f9232a253e4df14471169ae7ba2150acaccf02a2759c4c4edeab8e4e31c0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"3352ced27947e6579a0ff59f2a0f1ef97e7a2c285f73baaf0682dc2f90f37dd0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a72b9e6bad788ecd7073f08238588fa51b1b35cd96453418ca7e9a9db469d15"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/log.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0e0c7b7948ce435c03d56b0e44b8d2769e6d6d654b3f9ab80c9a2e76290c16"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/managed-tmux.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78b349436a95040715901761b9985d37738f9d7a4963c06edba9a9a90bb69a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/managed-tmux.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78246647ddc88fd9cca6d28277d3c0bf814bc4408060dc55bda6ac299ef2917"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/managed-tmux.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d811c8e83444e65a5c9f9c840d3b686e25aba06d04885d9882bf7d4d291072"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/managed-tmux.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"118cf1a71d2c5b1b56464cc36d73c3524008c56c7a84720b078d1aa10a541d61"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/managed-tmux.ts"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"55769b36b41dec6bd55311412ba1b7c8ac936a3eec68b086d522332349927045"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/operational-events.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0fe06329622214513fa28ff8bdab0d0e3274e316cdadceb0164458e55164bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/operational-events.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"154dfd38e0581974d9290cca1c27be7a52ba0ff2911ed896b2ca0cbfe22f0b75"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/state-io.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"978400d61d923c8f173409bc25149b64c8b2d8e2f0be74576e7c1eeb8e1e7d1a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"91906fb37fe68588f960298c6a741602be10b16988a98bae5fe34cc9e02215bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6136a47d6bdee05b292d73d7e8bfe871ce32711d361df531f8fb6bbd0a6e55a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1674cf4c2842ea1bfe874623b9b827580cebf1ff1155094ebb4371fb4ca80622"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eef7fa938afc89f01cf64f7f1c6d93da25c759db371d94b7c29ea9f39b55e8e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a4bd643e62c1973768a4de44b3f665d03e737d94c600d107d09794faaf27e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21286b38822a6e3dd66f8542aefbd3db0a1c4b64050a45b7bb9da87967cc74d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a984fbad6b182867434ce622f26ae7f992ed1b991d181238d0dae568792d9e00"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d492636213eb1505d1143f3ba23a08808706a14213d2931b7f8d2841acde809"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca4f8a56bcca42c589136d479a7020f8586649e6afe561282d331a3276d6d28"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fb4c9078c023a20db692f217a6f69c20e9498c0c4e9a1ff9feaf478b54a97f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"5064988a688896caaf5f7c7978a19e5bdb7ab2d63079cc4d4a057acb1019c88b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae1c3ead029fe1a10052fcce92660755b1ba0c00d4c01120f1169c7e07a2cf6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"92788b755ef59a217623bf3304a7aea81a4181a221fa1ee3a2e65d24f29d5025"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01ed365da69b877ff7289f99e51ab4cbf5e2ad1f630f5ef71b9b51a0e1b87ec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"903e93ce5cf7b60c538d0e88cdc9514c73ea43bfaedf963e8c596ccfb33b434f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"40de67fd6b0fafa3da9e45df6069c60588f3805cf909c9fbdd0102e32ff8c661"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a8ac04ed0b514520370281d51c2b83800a8401ab38065e734200fc5596c00b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"704b42dfcc0a04adb07877ecc71a3e396958711e1b3db1b4275d380c3edb4edb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-dispatch.ts"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58fa925c9495505148ec0c4717f47c7b782747007ca5d34359ba8d86d6cd2f8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc30e06cd387f250954784a4e0ae23983db7d77da7bae25aefca4e00b1fb32e7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b5b9413cbba6c90f5c589a4bd00c92f81759575909e2caf826c9bc97ce8aca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e0f31cfaf22f668d1cba6ade03ba40aa77fcca97a06025af8de7d8e3a8de5a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"8336d9dac199e91ce20fed285ff196ecde57bb1ccbed623c97bfa14ef10d77d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fc9a59991f941835289bec3fe058824e1e0840c459d61a4ffaf3b30617b8a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ed482993528d1f6d540630d9168663fad17ad173334d07aef0b41a638b4962"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbc541242ece915471cb21a9069e10865038115673eaf0325b9dca77e5b35d1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d46132df61eac8423e6f11394b16e33dd7637be3032aa7f8884d319346a7e3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df28f0561767ae2cff31fcfa4e77cc62b96f186654d183501de0e02baa56c83"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"e173a085dc72367b2e21985bc5edbd12a52480712c86e0b622c3d623b2f14022"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb53f831227cd9a3cf42aa452aa5cb33b9ec7d10144096049f7c0cadc098a5c0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"06076c3ec8580fda796c729b2cbf74a9eccbccd5f8f8af6c168bfee8f5e54fac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca535cd09d4cb4d87658777144456d731eba4fee19f7ea4b16c864b564d0e852"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8756040ae75156b2f9924cde70b49f44bcccdaf83a86218a77c49ae8954171e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"770a2a6c2eb10634378bddd65bd30ad6a14b8ffabbd8c4a6f03bce2e8700684d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0033f311458ec1647138b2dfff0d06ef664a5021b407831275aecd9b88bd383e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aac1ab5c23055a699d1cb1d7e6edbec5eb1688f9266d77e5103c4583f04a41e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c77799f949cc8484944d0566796302b7d11ac1352a17c3116086ee54a84711"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2d0d268aec9830054777a523f16a00dd70d65d135286ce05c6f71ada9170cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cbbbeec8216a4fa8f3162cf68c03dc81323969a74aeea130216b8f65ebe93f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d5f624095cd808bfe242d0c10b7d821ec8ad960b741641cbea09cf4a73f609"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95802243fcfe089c297efe474b00a8e1190267b1283bf1aeee14f66fcc57b25"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c815fe6b684b9a5c4c4a04fee050853b3e25d7f7ad39fd62e917d1fede1afdd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f76caeb727e5875829d9cbf60a07b3218f4257f82d2f08de083b9174aee3fe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-tmux-guard.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b74b0eb3c953e365ad8660721bdf7e49f25b82325317793cada9abf882a3bd8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"26566916d9c157bcb1fe8d3f3bbf28dba34f8106d5e5774aa97cd47e3c7763b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"033b8c23f9cbf3b6848c90846a1504c159d34d2dbfa5abde43f380b84980d678"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6ba0ac1148e133d72868011ea09721124092664382da29f9eb7cdb382c6d38"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d178aa7d78598e050198443cdc1c52d984467cb6389e3b2a1beb28f717bbbcf2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53aa5574442c0d776792f8614999ffb33fe970bf92cc2b58304af2ce57ad0f6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cb2c430ffaf23c4efabdb0c0ef8ac03e6ca0a335f927284838a115e2685b2b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb734a81aed827c9f3e29ed4eafda14268f12c12df99b27f3ae13a9a139f1184"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"0415b747fc886a71a28c9570124bd82716ddf72e887149f7e7fbc1508d0577ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe008f9539f289fe3c02c14816a9807e171ceb20effa402157c0d3ac81c329b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abe1217523e39b9d3b5fdd95c5603b4114f69d260525143a6a97023868beb2c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9277bb0aabe99912db95c98c16f2e60a40646d67c33dd13e89e6f19da7a0cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"2599489c1c945bb2744dbfdb78a64a1bc56f7aafe8eabd5fef92826f2c04c6df"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker-stop.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d8a27de7590a5e6858bede798379546e917599bad6590b3cd5903daf15b727"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"123e397cee5d39a81778ac67dde8361e5aa3a228ae86cac0694f0899d4034524"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e673a08ec4d5c4ec9ef018cf0d51492ffcc77bb8913be658870d05141fc6c83"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d58ab815431aaa4a4d7179b2e0591b934d8c70c98ee07d19009d234cd1ab33"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c0ac79bf0db9f1ce09fab7f3acc1433606b3beb8a4566f8f16421631ff2e13"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"f939800eb18eeb0547111c4935539eda24f81835d08b3bd425a8794a45d85b1b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7534821a0654269f0d94115838915049cf706793b2909e0270ec535254e8cb83"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c5f2dcfc6b8df22e85acfff08fdd1d178b759d6b9647e7cfbd155484c38cef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe7103f05a1a31df07128cd85ca64d9e11e9d84c5a552e684c0f68dc46457ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a6fce7bc5e001672bff4e3a31774d87e2a11932e7df2a6a2a1abc5744de87f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff9f674d12f340b055301ecc24825dffe2cbc08455eafdeac96357e61e632bf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce0e65f30aef3322c45afacd0a4afd4a2522d30910eceb8ae3c66db478f96b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b1d6b095835c2524a31e38ac6c3dde0ec8f4355627d3df0b14aef524d1ec28"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a83f8a53a8e95ec7b833940021961e46533ff33d120ab10fc56ad43e2353d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"f253444f0f609f48b7b7e3b8674170b0860761278d9693c574c511f866ef50f2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d60a658ca043098f8ba064225c6bc74ce88e88e7050a93f6409b6b5f547cdd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3caa9f5945caaa5a26666475d05b79490147f6684a2e0f53daa436be730dd6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"9349ce1e6364a9dc642d9e81d7b03becd8d95cd1e327513edd78e6de0f8c7a04"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2aba9622a414d783476163d4c0c0166455761fce92f5ac8c6e905c739e072c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf4d6098f184ec422fa27b12949ee37b7ffe28f0c25f45cf20110fdce91ecd5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b3cf88cafebbaf5733c2f7d1be7b5ab81ce6d41ed8d00402651ad9f16fa064"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f6d5b45cb8a9aabc297270b9c8b9c38bf693ee5bdbc1fc24c6e174d44fa427"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"445d4efb4d6cef8ff5ad5fbf2329448f959e9b45b6313d6d59506b083dd63619"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba19b1d7705575b8ea085af9814aa5a493fdd9cfeba3bea2b479aaee9be17f3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"735e03e9f9e01ac4b2b38763dde627fb27757e598855402ca618f6a5196d7fec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6088be60a75ecfdd1c4dd1db53bb2f765d8f24571e503d5b8087e312a959c58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dac5158611f2e6ef46d6b0010a11c5e9335726f2e700e5782b53d01d8f2dc8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"146bc0a7d25212175548d70bed21b3f54be70e7f6d480618d40a6423c2461692"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad03bda62edb2b28597c233bfa9c136d7aeec5e687daa51e74a338710d991f19"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"edba05d8c3437fe893e0403067957e3ba9c3cc0d98c79641498f7f3c8b47e138"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d442aafb143cf116ac71758242bc9b52da32eb431e14ca1adf0434d2866389"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1374300dc9e96b03a36580ef76cd67b3be8f7dbc21af27e558ee703e9016d64"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"14294fe6741751c23d2c292906f65343fe35404f1c5a3bce59a9ae923d69dad7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"284c05af978c814a863d17c7aaa83085e72fc29ecdfa19c7e191cc2b97ada61a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"7137d611ad012654e9b9a73b9e344adea69e7a20fb82831ff6e4470a494986d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f42d1a296365933219acd939114c389e8cef3a3a794eb9eb5d2ec92a37839c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"895b8d8da0734522906a71a827069a3ed3cdceb9e51427d87cbc153d0404b6dd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"19be29cd132baf2780637fe6f96f29c236ec82043490676e733580e41b680c54"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecb71b1b240f4c7c4d88b5833f704df38d93f51a9ce2b70ce66a067996be994"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/tmux-injection.ts"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"f222a4ed199d6e224978ca75a921e527c82054f74bfa270eb178c03d8c33621a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/visual-verdict.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f995c88d83a3eb3a865cd1222c802d6aa9f59b1234ff9738c6c541c274a9ce98"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime/bridge.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"867f150a3d69e9c4a151acbe6c2f7c29ba47d055d7dba5ee00d5d25985b1154c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime/bridge.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa2f5735c3d750a0cedb435f8136bebad55894f06789b257d0f6a97330d4360"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime/process-tree.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bdd65f8480d195ea538a4618af9c29da79596c761d30ec51196513b7e4a4da"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime/run-state.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d37ef92dd3ca3ca9f753a69492915cef781e7106825f8c1c5e63ac9dbf15b91"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/documented-leader-preflight.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7958a441e2f0f22036c70414111f07d504056fc22c6b44f22fe17781b0d3d80e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ralplan/runtime.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c5c49a5393e6e6645c514ebc466c2ac254922ccef533279137aa977e975fad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/autopilot-wait.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f44927dc4f7a981f4c0a8a758b61f44d9aa7c50000176b95ec87e0c4b95c6c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/autopilot-wait.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"496990c1dd5fe45da65d0e12e14d05b27d3bac1c283af0a48ab9528066dcd94d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/events.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"56580577b0834a6b6885bf4727b82b4f46ef8730b7190fceb54d2651fb4db5a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/events.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e933fb23d51b13e0e8db89c2c235c4a8b4aa9660dbfb32715e520f9450978414"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/renderer.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0c9767d29faf19a76474d4c21a2a704f4558930cc490a648eeabcba37936b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/renderer.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84bb77948a8d2d48682c06896d0f933b80a78c13064a34b46f17464520b93cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/renderer.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"4807af825c536abd673075e3e71fceb334b7df6e1c91d91e70b0b3ca84076b0a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/renderer.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a2f9c91ddc8b4e415cab171c87e0389f8b6c30da425f63ce4736b65001baaa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/renderer.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac01fb45173cb4fd3638a3f683c44dc7375f357e5a760dd5a727de9290be2ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/renderer.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfccd130a5c95853d29df97bb4d791c7d7a063e21e9e1d5453650e3487378b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/state.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44dcef0c400e00b8f42cb076b5daf76cbbe98f000c83c0e65ea72547f1f024f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/state.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ace62305a1b7f015b88876f6648800dab1ac315f661b4f93cfb31902695ebe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/planning/artifacts.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ad3a4340b52cdd9b9be3c0c50382a9bb6737fbe7b702db525c0deaf87bd278"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/dispatch-cooldown.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54e36c11f77024bd991333b269dd1702ef46e4b6cf76288b1003a71b9e676bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/dispatch-cooldown.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8bd387a208a969cc4a2515b978733b88a0ac2ec20c96912a47ae8bc60f5c48"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/dispatch-cooldown.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"319a734dbbae30180e72cf260351ffde6c38b4e6cd98672b79597f9bd9165c97"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/dispatcher.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"57753e95d96f64a2ac6198921037b57d5f566dc0436096dfd100795ee7984927"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/dispatcher.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"962c3f00b7bf5987c4ecb8987ea8d54bab13cb4843efcb7cbe13821b3b3e9736"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/idle-cooldown.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e64dac9a22bbb9c4dfa31db1e40a5478121f8834645408112802709f8b4e62"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/idle-cooldown.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10018d27c23ddc6b61c08f27ce191216ad1f6d94bd6b668838ac8262ef99414"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/index.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d51cdb3e41e78410c496f4c37af01f1f130173cd1b100647585381324fc6434"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/index.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff82bad029757428dda1b332c926b0463f8fdc5f1b6c3375718c52b7f1652a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/lifecycle-dedupe.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee22efe8d601583629a2c89da69a56e302a58ddd062a00dbd372defd60434db0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/lifecycle-dedupe.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"304fc9d71629d03fdc723413502b41d8bf133db14ac9e0e1316d12bda2efdb1f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/lifecycle-dedupe.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"7925df7113a78e59f18c50f92406aca9c539704ba076892ac8e3ac6564a8e5f1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/notifier.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0e95ca8d707087910f7129baa5e55c0831ac2ad62acedfbf55e2558a55c2f0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/notifier.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e388b412062d745f72b60dfe0fbe95f20b0050f10b4f700a9b040be9de381a7d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/notifier.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28c6401b1dac02a72c450a61252640ac036f9312d008455bab3d14596c184c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/reply-listener.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea53f9cdf73817be94692ed08642bbc43755fc53add3ef8b936f85552781e41f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/reply-listener.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"03702f6f5facbc8f7222950c9a295b1fa13ae4f7e83c10723483058ea3c06552"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/reply-listener.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82b2c170848e97637454bc5304916d8801bd6617b614f3ddfbe99eaac8adeca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/session-registry.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f2462f66748fc9a9831f19f45cfadb711903e8f4d750a3ceeda3d7514aa27f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/session-registry.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c239159da30146f8620111a1351af80f6a8a55a866ba3a4e9d34a57c2c5cbc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/session-status.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c717623baeeff8f4067086ab5cf49766e6e83b9579335dd45f2c720fc2ea2849"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/tmux.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"be89a3af4ee72c857d6715a7e1f08c1b5b9496e72d85dc12ebfdbaf3207f08e9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/tmux.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87a91723ad20a6da7ece4a206447de20e7ea8dc3dab67dbaa7ebe564535d779"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/tmux.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85a099eaa2b8d6d079d7a58e68ed113761b0070871e9b4f143fa9b8ec5e0cc1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/tmux.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de460c4ca5c2b326756b2a589e3645d406b1403984409a567331ba82ba20046"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/hermes-bridge.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6dc33cf1e65136151e463d5284fbdce362444b0e76cc6cbdf44106e178a111"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/lifecycle-telemetry.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ca726adcaa049ee88ed05247b17e82ae4a540466262eb667ad3ce0d08df322"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/lifecycle-telemetry.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7852bc484bf1a5ee8ee940a2584c5d3dea75d30c0e8b021026d72cc17692692"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/lifecycle-telemetry.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6641f844ce2db59a480757069275d1fcdd5a71cac0ff0c3fdb445f5f02e7b451"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/state-paths.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"617f3106e7fc5e7a6d534e2391d68aa885301fc0a5a8307d5ffb89bb76725c2a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/state-paths.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f11eca9a660e2cfa2e42b2bebbe4fd7f70e55238ea421b2be1bdef9ded2a732"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/authority.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a369f6ae8a18c7898b8fd3175a8340c6f8c925964c071ea22d6b4712cdf2343b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/authority.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bca067a1b7af2793bab6995e2a5596dd57457549aacb4f4b10d2bc51602db9f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/authority.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e306c8dc81ec7222e9801625103e8d8f131801a67c69118b2828b753255618fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/authority.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50bccea0c14bd995ce482fc924e97d4ba02d2ec56e7971f7bb245d7ec318af0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/authority.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb617d139e1a4a9412f9f0a969a7baa7c6f2b461a40ad2b265a3d021fba3a698"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/authority.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb3363c3801957a437aa96a538dd09585ae4c50a1efba7e64c55a80a9942e30"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/authority.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc06270febc630c485d287bea85941b2edce36cc4c30992b77ba27f5bc9071d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/authority.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de64974fb9797e8ebd6c5d47de091060a4d9a292833263998f6419921a6a509"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/index.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eebbbfb8a676834fa5617625f5afd82cd6843a24db36a6f2dbb2f4b50cbf784"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/reconcile.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f166acd4ed38b27e9ebe1f8a94b6c81c0bfd35c8420dd2be3f17641dde215a82"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/reconcile.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8557ff4ac5681b27ed5f133d780aaebd58858d444ebd720d1e939e7626cf4b20"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/reconcile.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ed439d478838ec0f47ad0605fa1f9995b3a230f0186661d326dda7a8074a91"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/reconcile.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf768f35f6d4dd6c665f79b27c88e544bfa4818bed5f9b379bc58288868e4ec4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/reconcile.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3b291ec99f0063160fc42a640e8955cf7e536bdbb7190957a39231db636731"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/reconcile.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"002e6418a12c5746e884a9db7ea40887a46cc7aaa4483fc0e3f9cd8ed910a32b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/reconcile.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"61eaacec4e26b652a949c393abd67e53fa6f7c116e5ba79caba5cdca94b09268"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/state.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"490e7ea58426d1b793385b322b7494145452b5891df554b05623e194bf6b731b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/state.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb5a72d8ad003501d5f151de5fa5e3730d6e8d715f3174ec49989d5b57a714a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/state.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4103ad861857affff901b8978202a710642176079f6d3b1e89ed66c958d34a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/state.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddc884dab96d0820da405e4925cb8c27a9bf3fc7a1cb1dc07b55b2312c1aa91"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"26840d7480dadb850c1a24c103803afa7d381f67a5b278e392b1eb8b10e13c91"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/watch-owner.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a46b70d76f4eee305aa52653a7f11f37e502bc368f80336c1bb11fc3cba82e6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/agents-overlay.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d00377aff8593d8400ff5c5febf95d47ac5f3218ac2e7d19d545d8a1e36b08"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/codebase-map.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a372ad15b10a0fe4da850e042f52d136bfb16dc5d309c06dbcd822549064b65"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/keyword-detector.ts"},"region":{"startLine":3959}}}],"partialFingerprints":{"codehealthFindingId/v1":"766b04246fa70eed3103074ab61fc6efc4f481d00c3305bcd37c053110f81840"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8deed6fef53d99f59c02988e5a87014be83c10c9d68b25ac4de6d1b583bf8a5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b08dc40a075b1612ef3499822a0f279f2c548dd2485788d3cb047114381c1b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4f1e44555c60888123e1b53456e6f1b0f8bfd14f5b6e9c0e1f7d7f4c527047"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ccd26043f1ecfaccb5790c93e63e0d054b34d03e2fb085cafe07c9ecd56077"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1bae07fb0c7ee41653f03b255602f4f6c4c3bc8d629ab8c3aa1bcdf8601c21"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e8ce51ca63fe530f4cfdd77a14cf40d8cb648f0e1339676aeba9dcc58f5527"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f868c25125fd42393241dc82b755612238ef986af51d526b4228d8dd2c6b02c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"26313d988f106e80397595ed29d5f44948c5fa05edddfadb7809251972ed0bda"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"282d74a2e45aa261c14edd402a446004b238ce55f994543be81ebbfcd6c55d06"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":2996}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9477a0a0529cffda41c489d17c8d5247f9e94d20b72c1a64f5a5d3be77357c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":3774}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45596e9567d6fc041050d4fab17bfa263f8aad0b265e5f9416596f6822b07ac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":3798}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4c9400a5a1f6d57e756d30dfbf9c92ef910b58227438daa574d328ee4142c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session.ts"},"region":{"startLine":3958}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce5c1d7a83033f8772c2bcc996ec0f2a62177b0ec86a9632ca4e80f722a6919"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/triage-state.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4400e034e3fdf932797fe6a88d107dfe5827894dc6e3b63b60e52d8ef5f8fa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/extensibility/dispatcher.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cee476e8251ec86aa984a7d06e34e94534b32806a0c2d43796fecc6eb46f4f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/extensibility/dispatcher.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d28f4385a1104d3a76cf73b0c907930b6c62b9cd27425389b023445f6fc6264"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/extensibility/dispatcher.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80c865fc14c79f33840e6677d4dfd9a5a8d5f6e0d45dae992960dbc3a37c079"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/extensibility/sdk/logging.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf05b7b8351cfcde7ecd4af0e5b6c95c08ebfdf085a059bc7f259365fa3b884"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/extensibility/sdk/plugin-state.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae196dcb4267c069a666e182ad99fdd03ceffb869e8e4b8e2bf86b05623849aa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/extensibility/sdk/plugin-state.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e26777bbb5d3a9966e7a78cd3159d8abaedcbe50bd0525dc7b1a8a43cea51d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/extensibility/sdk/tmux.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93f1e742b97edc1a210664c1f3e3a9d506a1e6bf19acc069b950a697ba20629"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/code-simplifier/index.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba927b03ef164050e83e74d5c798c3d2e713effb1bc510fd6e2f82f29675cab4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/code-simplifier/index.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c426088eb6d1881a200eba93a46669da7a12d955e4390185e44ca91481f513"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/evals/astra-defaults/collector.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"053bfc920d8bb2e3e1924dbdae7d1b219c0eee7e911a826b7eef70343d4670fe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document-refresh/enforcer.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5484c6deb7d1cf804fe12c578c655e32a1c1d5d787fa84a5895c2f16300f55"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document-refresh/enforcer.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eeb04f0a38cf15e94a8eb9b4c88dba3e567a67830db292d05a0a56a12bb0fe6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/generator.ts"},"region":{"startLine":3969}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcab7fc6100079d2797425bdab5b20b637a6da8f78aced3d714b876029248f92"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/quality-gates.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a55c453385ec89069cf9e3baac57b86d2f9352c8bae2f6ec980fdb2b27b2b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/quality-gates.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03caba1fedf180386f4faef06163b2169f29f2c23dbebfa911e114e32cc7a04"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/agents.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ed36c2dcc86787ada98cb5e287f8ec3426213b7bbb323203362c1ef01b7feb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/ask.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4855186cc7b6edd00febe76e4ae71ba498ed856f87e7c9314b1bb6d35018468"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec4476ffe7ce6fa442f07517e928efa1f0969f8361b0bf8def3c47d45511e42"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c546dcea55244a1452c458cc5eb8ffdec276b7ee835f684ef7fc0cba3e5482"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"6689eca2fbeea00237114cbf84edb870f390f534d3998cef4b591534a0fa957f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"216c08fe547942e6586b28a263336aeedf15a0485842b981700c6d73fb9b97c7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db58d31b675c50c3142a5e28817a0785cde00f967fb2bf0e6f3ca10c6744394"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"415a65ad7bf8196453cb369453876044c9997f0ace9ee7b443248fbaca10bb33"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"19de98cf013973823f8ee3d031bca5f52bc7fd3d706c362e43ac876a1835cbb9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc50de484b5316e48d3e9e3c49168c57ca9faafe1de1a39aca1d25bb485873c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1dc444c341e1b10e23958c12a36145135b68b629699b138c51000d407d5a3f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"500bcd4115ea333c10530487383a33c2c8b41fa7e4a103f10a205bd8f5e9d460"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"828787ec2d83d897bf7b2d7b8788dbb93ef333348393f2f7a4743c0d14d091ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2927e998eb51ff1fa0aa6e6458e03823d95c983a8322b819cf772e5d6ce7172"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"a203449aeb0d3c1b0ea1c32e941508e46f8b4bbd1f0003b9ba750a4a5405c94e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cefa3a2956c66217d1cf76a5c2478e983d26e27712787e94e28306b473c2d3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":4567}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d28d5b3514af6ff70125a4be0eff7231d9a7f492c78e9a42fedea974dd3a49"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":5438}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc925a16cf830edee6e8df755c8dbb661e1810e2de6e4acb500d1e46eb2d979"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":5610}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa47a22bd1251054bb3e5ead28a8fcf39c15eed1e5105ca1217af4e0a9f55b09"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":5740}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54eaea6d246f4c53666da59c5603852900b976de674f81616ebe74342ace092"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":5923}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b659844b9921b9a7866cc3f15bfd1d55c3cd023a833ac5fa5a7f0cc14920f0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":6155}}}],"partialFingerprints":{"codehealthFindingId/v1":"58180b64d4f6047f9f60e61178fccac10cf35190769585f882f335ac2802d396"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":6203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3a95c70d23a7b276c888af82b287e3b51025725157ad5c8c2b30235c212bb4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":6585}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da407bb1454ce50cd7e2a83c15c7f05cdee8a1b423a8ed87b4644e00df75d3e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":6829}}}],"partialFingerprints":{"codehealthFindingId/v1":"158d6d72199b77d2fc36f2cc8b7106a78e72078dd6added44e60bd0efa8606b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":8358}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5762958dc62d3c97cf26b38464ec060595206cacf0b775d2930e4010573e578"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":8966}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac243e76bab125377add1683fc0ec042d08a94f4aa6dc6ccfd6d6859459400e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":8976}}}],"partialFingerprints":{"codehealthFindingId/v1":"584997dcc9dc90c96d784341df20d4ad0a38039611f28534d5c01ee6525e3048"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":9142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70ec3b986d086377469ce745420efe0774771ded66dd9931341dcdfe730bf16"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":9231}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fc144956ea4f958d8e0a3e48197f8b119e9f771559436fecc0ed1b634da4ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":9667}}}],"partialFingerprints":{"codehealthFindingId/v1":"818d0d0049369a3842a1e6c8b745721daa3dc583e2e3e7038f55a401220b8c39"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":10065}}}],"partialFingerprints":{"codehealthFindingId/v1":"940c066df3148f747e1c0fa0e9c015a3d2191ae15ee9c78cacbe23b87cada540"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":10077}}}],"partialFingerprints":{"codehealthFindingId/v1":"07df5df804d7258646b76d3bf14d8f7034c9bc236448d7e0b13983f629168035"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":10081}}}],"partialFingerprints":{"codehealthFindingId/v1":"622692c05af8a40c31647dad875c39fbe69a30c0300ec8c60f5488ba035539a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":10090}}}],"partialFingerprints":{"codehealthFindingId/v1":"8239eae32107bc87b9bec969ce27c664e2ecf61123bdd5eada4002c4a498cb09"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":10094}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0059508915e46af26957b176179e4406c80cd1f1fe02ed357491a9490cae805"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":10106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bfe7191c8541f2f38b313c2f07c66afaae418bd3de1790b4627381a554729a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":10361}}}],"partialFingerprints":{"codehealthFindingId/v1":"230a977d2260cce734f2dcb315fcd43fa1daf690e35d6aeb9d9185e4fcc4cad6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/launch-credential-provenance.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4bec326bb91364c0995c7899e95472c36f5fee14046807af34645b8ade34e6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/native-assets.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"160f443fec94204ec3b70f37121d0a4baafab5c7b938f19586aafe95325eed23"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/package-manager-ownership.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12cc44d845ff6aa334267c58c714aa00fafc0e2272bfbd8d218b863b27bb5a9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/package-manager-ownership.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8325b0990d6bf22385bbd42aadb9defbac0b8f61252b7a7a1f970bd42c63283b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/package-manager-ownership.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"6290a3f0f95e35365d99f32f4a965ee742ebb57dc3111741aac11d1a2f39f824"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f804372c1aec06908683a97ad6929eb29e91b3a28a13ff418ac0065012fde36"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"58130dfc6ccf85ad5eb4e0b76e3b0b11a6876d39c88cb4ead5c9ed5a97353e28"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebee2c6f0220c3aef885247bc8a298a43fde07f46e5c690f18c515153a373b9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"6629ecdac9acbca42c29909b3852c2852fdccba2180ff9168b8a5f02629c1891"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dab0228505d172546dd15315324a5ec4c6c7b8089009ac383696c219fbc4e3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"635444e7d7cfe87a35024e6d16e0a9119cabfd2b356f8be650e594881d38818b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7ff9daf18b72325fc17d08e729df38ae1f43526b115292da4ab358f0273646"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca74488cc8212c29fae33985397a92b592531a16addbd3bc5d7feb7017296b0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4702defabc1ac81d79e9d7ec731aef6ff7f6555b82e6b861c064c9a0db7785af"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cce4143c84b5c4d5a1376afeea072c1eec94b3c96c48f65be4e59035d8085f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2666}}}],"partialFingerprints":{"codehealthFindingId/v1":"086f8073ad403b4c7e6aef202bcc5cb91093029a3cb18f01a5eeca5115c29b52"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2681}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaf71b1d5804e0d6bbe686a836719b217ee6cdcacd1b5081f544e4c44525ef4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2710}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8ecc669a63e512138ef32df566ad68700c5f98456b2183b09a0cc121b11ad5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2711}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bc2c3a4ab44bb6c797c834b8cd3ef05ab59181081e0f528a4151704dd8e96a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2713}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4dff3e44af5cf52e1fdad8066034b42d0467f55bafe0bfc8334c2099bf088e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2722}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28902af866ca60d4a7c256461a304991a91c0d24d39284136c2db87bd920841"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":2728}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2f3b0a8f5a664e2b6ac18713a5e962748d6d9461f6f7c9e2f039caee1d7a65"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3122}}}],"partialFingerprints":{"codehealthFindingId/v1":"77786a66345c6352ff261140f6f773c0f8f8d52b4b715f35fede72ce4602e220"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2da9d5801f67236e030bc94a3ab174126f09c383f8345b6bc28c09ec68c4a37"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3282}}}],"partialFingerprints":{"codehealthFindingId/v1":"27efd784d3c2b8f031b07e31d1af6b6564eda5f51a1aaeda5d87221771485c85"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3708}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4371212388587fc5b20d0fa5176a27a2856e2c201dee6d48ed6f543e76a4dd4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":4053}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbaed8695da25e781d59cccaa7e25c9b0d0009c2f134fd8ec4f24cbee1427db"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/project-runtime-codex-homes.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1895e4b07f42459933a505e811bbd88a70bb3f4e1634e36fd3d476086ba31030"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/project-runtime-codex-homes.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"370b7232e4d5d56ac706a3367cc934ec4f8075f441a1ac936ce01a1d25c78ef2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup-preferences.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dac5317ec99d36b10f9e91cde5463d9f083b72044730afc3c0e3196e41fc46b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab84746af08c90e4651ad2f43ad3c26e970309e9e18889693d96f7e01b4f449b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65160ff5b1b4617f564b385afaeeae6975ca95eabe75c171899769df57b72b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":2309}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfcfdb43adda11665f134ce3b8290a7611732fcb530d249460857eb69256892"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28ceab0315676a6ac13b22cd48cc59008b780306bc8b3ac9ec6b1635daef97e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"007525e4318cf9bbbbcd450b6f06d473741c4b0e131a7f8c8b701f6ed5b30336"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d358416ead845b026b2d75e6d61b41fcdb244a784dbe783280aa164ecab1cd2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":2706}}}],"partialFingerprints":{"codehealthFindingId/v1":"2748ee1cd04b7afc57f6571a93aab7807fbc6ac564942453187b35ddb9738815"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":2716}}}],"partialFingerprints":{"codehealthFindingId/v1":"969e167fbe51a86abbbb504b5359dce9b07795e98791ff4b72f6fffbb929192b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":3551}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce24e2789ec04710424d9a8452d5e5232c40940b6e36e0f086e6a695020d1dc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":5700}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4aa5c629bbfcef99464af05b9dfa7586f5da21f1943de04c339cc6a980ec04"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":6145}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a48fbccfd8a5136f533279ccb52156ac9a8ac7639f99399de1064a1c0ebd13"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/setup.ts"},"region":{"startLine":6326}}}],"partialFingerprints":{"codehealthFindingId/v1":"2142c87af9a8c8d427f232a452a4fb8934b52aab8362a1ada3b1aefb5e15ccfd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2585cd16ae687f114c2c03c15d58f0ae000029a84604c3a05ac07c5528509b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/team.ts"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"c329b43a3328d823905a4d65bc17549b0aa2e2821764aed402a303592a440764"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tmux-hook.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"262cdb4a92f356ac32900cfedd865da060a56c9c00cf6057d0edeb6e25aca8df"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.ts"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68ea157516b64c9c7c270fd901002dac5f4e92ec4cf814456ea81fd618c5a0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dfd2523c1e02276cfb7b95f7f2fb17a0a0b62de72fa65ec049e36da751e618"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef371346c19ce240a318287c65c821f93dff1122c6a396a048d5ebaeda2b603b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fa53e1a145261049336787e1420dc5c74316c19f9247a497761896a50aace1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"88248dab41133d8d6ad3c317abaf9bcee5dab4dfddfeccb331efad4e0f9e19a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c3499d9a3f5269c6bc3ee9133895dedc8c917accb0dbbdeb6170c73c8ea362"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/update.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee27907d597e6a46d82cbd0df881801e6505b30c3c4d6ffd2400c637db11875b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/capabilities/lockfile.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e1f56d0984515cc4c0678983fdd9b699bde0f331189c4578b1c9b2abfbd126"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/capabilities/lockfile.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"12953f5bc133bf65f0837221afed4705e9b6312ccc448fbbc160319f5ceaf171"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/autoresearch/runtime.ts"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1285b4cc4be0baa09deba2e45daab1bbb60892ef44fbd6116be7a6093f90ec7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/autoresearch/skill-validation.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2316a7d495d9b87cbe53375b12826921f95004c8c17ba53ddccc611d7519fe6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/config.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afcbfc9d4af170088b6b0d6993e3dbcfa58ce179756d8a08d949bdd4c4c4813"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/auth/sessions.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a152edac7b0eb737261ef4df937263a5a19c0ac70b3211b5fa41b5cd7560fa94"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/herdr/authority.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4039c9fe1b0c3168e575f2020c28565f528b537375f8439f950573ed88f99c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/herdr/bridge.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc49ce085244a16f143beb6c355db6418201ae7f8d4e1242e1c3b5996b342c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/herdr/bridge.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"380d1b717a1f30ad09ee31b53ebfa7cebbc06a1933a48a9e2ab6a1a1f3a936f6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/herdr/seq-store.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"520baacd77640b38e24629709900c8400145c0c649342cd7ccfdd263534a3d8d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/herdr/seq-store.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dab856e2eea43d8a2bbe7b4ca7eb49f0ab7320ec9ffb291c1d14f78bd3b2473"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/herdr/seq-store.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceacb042640d5202dd099fd6e47fe1710b27fe1448ceb5864831597877b018ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f363518d3d638739975c5c12b838ee8bd452f1f30d51640abcd62312ead6db"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffd429b829ea37428149486b861f11c7e5258f3f7dc7bd153d0d3fe9662cd1a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfc671fa27a58f29bc8010e5b35a69eea9ce11968d416616ab9e2498d71b174"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e44277bc07ce54c05b7e65c3e0bb95e0f94896bb8ed67e441474aa72a421bdd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8beaa2c605d4cd3e93024dad176c544e5887c9ad004870e0359adaf3630622"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47d9fdc75466dca7ed887db38b6df37c557f675a1d6bb359399bb7ee2f53f11"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8663b741591856bc87ee99bcb5e769e4dca50cb71feffd0a4b516127afb721"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"463b8d83c266322e273ee97a2cb1d918682efa06eb6a32ed482201e6935ebe9f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"14222482a88af2e742f62579cddf3b51e7e2bf084aee570ca7bc9ecd63dcc58b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"5715eab67b61d1811a7b5fd17dce0f8b396c38701f725045c2be76f94b36e8ad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"6698ae2693b9a70f3704e3707439c84082257d5110d71c888d0d09abfda5764b"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) reduce the strict null checking score: ~2.1 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 452 assertion(s) across the 210290 source line(s) of the 424 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: src/cli/index.ts (44), src/team/runtime.ts (40), src/hud/tmux.ts (33). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"edb251d0f8dd1deb75ff6fa12d145c3d5c948a70b0aaf8da052107c857335979"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseHookPayload\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/oh-my-codex/hooks/codex-native-hook.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f3229ff920a21e325363d50e7e613531b116419f21a161eeb12e8ec1ca87a8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readCounter\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adapt/herdr/seq-store.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8e02911db6b196543283504de4abc62eff12248595a91fbee169b5e076512f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readMatchingPaths\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/planning/artifacts.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e81f1f177d4811e76e48821dae4a79598513ed356178efc39a5d4a79534234"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060gitFileStamp\u0060 swallows every exception into \u0060return \u0027missing\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/state.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c28d39f568467fcce162e2284600ec8e4ef7398b733bc32c4d6bf3a2478471"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseQuestionEventLines\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/question/events.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cdce3ee0ed9194cd0ba641dd794c4ef3929989ea988b6904bc3c3c375c0d8a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listCurrentWindowPanes\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hud/tmux.ts"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dca1be4da8e41f13c8fb7acbbb9c5c34b3c35f745528ec71cf2b339b86fa75"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060capturePaneContent\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/tmux-detector.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3369024617cd1886d28ceea793bf0d274b959d19918cc25660baf7e183eb74fd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readAllMappingsUnsafe\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/session-registry.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"99605abf0ab0432efb5654a794bbbd700b4f3ab29c11d54a10324e4d093f1e44"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060pruneStale\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/session-registry.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f2c5fad641cb56aceaa0598b6dbdd6ee93b877c4bc554e5a00ca54efe852cd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getTeamTmuxSessions\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/notifications/tmux.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"65620b546c99f12c736c81e3121f1e6cc678f9a9871d8bccde07641701a013bd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listAvailableRoles\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/role-router.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb983081e82f62c6acc7b6bf7116efdea033be2a430b7799ce3baf0ca0605120"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readApprovedHintSourceText\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/approved-execution.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a397e4c20c27c69029bdefc249ecfe80fdfa097fdcf9a9e5ea44c995bedc198a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readStartupEvidenceWorkerStatus\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime.ts"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4058d472f6551866e51cbbbae1412aa6417f3fd590a6220d069f89937b333a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readLegacyMailboxMessages\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/api-interop.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bfb371f4283072f8cfec33a90ad31dc096a51082e8accd96a28ee17292c473"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060onSessionStart\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lifecycle.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21a21864508e7c804e16fcf3ecbfe01a784dfb4bb1b5d614b073d8ddedcb969"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060onPreCompact\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lifecycle.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"78411f8600cacc92eec19dfdd7e3095944bd9eeb2d3d5963b01aa6c8ae6962ea"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060onPostCompact\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lifecycle.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"967ec71a0ceab6332e86e35761d8dc63fbbf461400707ce4ff3afde47d7817e1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060discoverOmxPluginCacheDirs\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugin-marketplace.ts"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaf3afe0ed296e2105f8cf88a2cb2e8cf251271cd31c11c907fb257936146eb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readExistingTextFile\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor.ts"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"866e9473d52dc15cffff6235108812e56e2309d702397a45d42cb37108376f18"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readTasks\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sidecar/collector.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cd9233ef464d2cae106ccd61c011bb905107425ec6140bc331bd9279096ba8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readSteeringLedgerEntries\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ultragoal/artifacts.ts"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a8ae1a50fc8e860d975fd882be438d2cb1fbd332e08597e66374b7e25ef9da"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060redactHydrationDiagnosticUrls\u0060 swallows every exception into \u0060return \u0022[URL redacted]\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/postinstall.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5f2e73be85f31e0cf8d6039aedb82212cef15cf7cd78159ced28c7aab28573"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getTrackedSourceFiles\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/codebase-map.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb000ffaf08f9299ae142272e0588b26be01f03dd576573bfd6a0f577089f72f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readNotepadPriority\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/agents-overlay.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c4fa2aad451ffcb177e50f50da28348d746b5b80ff1303fc900ca51aedf1c8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readProjectMemorySummary\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/agents-overlay.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a811d36a8c7a77240e7a0f185d229daf44a9d54595aeec0ff2d69b12ce0678df"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readTeamOrchestratorOverlay\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/agents-overlay.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df79f27f414c7aaf9302bb3c8129a83caa53af27aa82f5df0300e060725d6d2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readCurrentTmuxSessionName\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/managed-tmux.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4264656ecea7146b69ec4c4f9715ed0c627b5fa48fd595f5f98c4b72d28d8b56"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readSessionMetadataFromBaseStateDir\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/state-io.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"415fc8f69c56119bfdce7b882a842f0e98ee817df7cac4f19f7c8dd68fb2389d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060capturePane\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/auto-nudge.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4931b609a57016d43acbff9cfef7cba2533e705d2bdbf0aa16d246138a89196"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readWorkerStatusState\u0060 swallows every exception into \u0060return \u0027unknown\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-worker.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c8cb0f03b7b24c8aba3df268b24fa78e0d9a6a5321955156bdcb0f2e2f76b9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readProcessCommand\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba63931c8f1d05e4c05afe4d5e617e7edf9e00b159005a15e7baaac62ad4df62"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060gitOutput\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"6210b364bafb7aebfe2aef87b19678aec2ac7ed255d6afc9bc90fcd689ba3079"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060conductorWorkspaceNpmBinPathMayResolveRepositoryExecutable\u0060 swallows every exception into \u0060return true\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/codex-native-hook.ts"},"region":{"startLine":17536}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad574d80596bb5fd80e237d8a67ffdf8116e5e70e000406c56d69bf9caafb6b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getModifiedFiles\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/code-simplifier/index.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2e505bb4dbc1e81b5b16671a593d3564a0e0e9ec547b27796d327f88b385f4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060gitValue\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/operational-events.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a3a482630ee9d6d6d2ffcd3dabeee683362e5b6343b0835f573371346dde3a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060normalizeValidSessionId\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook/team-leader-nudge.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b9a8655c3f9048014bce2ee439dab426d1c7ed88a33262fd3a17321e6cf7c0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060normalizeValidSessionId\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-fallback-watcher.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e407f3c332b144e15c6923dfb0b2c7345b6082702c969d1f18c20b8386ba7ca"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060boundedNotifySkillActivationError\u0060 swallows every exception into \u0060return \u0027unknown_error\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripts/notify-hook.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c180c0f55df7fcb9ac5f7241db2367bf71c56cb8ba08840e5a8ad12921496da"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060collectTaskResults\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/team/runtime-cli.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1aa13afc0a571139ae6a20ca55f152959fd6ba68f47cf1b11024908e8203d25"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022test failed\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022test failed\u0022)\u0060 also satisfies \u0060text.contains(\u0022failed\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/omx-sparkshell/src/main.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"42975cf10b7e1114a2f7f2e3641ba10269c2919b0b779cec8012508808d2fbb4"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-117","guid":"1cfadbc2-a979-485e-b768-c70fc922201e","name":"Improper Output Neutralization for Logs","shortDescription":{"text":"Improper Output Neutralization for Logs"},"helpUri":"https://cwe.mitre.org/data/definitions/117.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"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-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":113,"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."]}]}